<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Probabilistic Machine Learning | Bohan Chen's Personal Webpage</title><link>https://chenbh.com/tags/probabilistic-machine-learning/</link><atom:link href="https://chenbh.com/tags/probabilistic-machine-learning/index.xml" rel="self" type="application/rss+xml"/><description>Probabilistic Machine Learning</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 25 Jun 2026 00:00:00 +0000</lastBuildDate><image><url>https://chenbh.com/media/icon_hu5000416120042106492.png</url><title>Probabilistic Machine Learning</title><link>https://chenbh.com/tags/probabilistic-machine-learning/</link></image><item><title>Learning Probabilistic Filters with Strictly Proper Scoring Rules</title><link>https://chenbh.com/publication/bach-probabilistic-2026/</link><pubDate>Thu, 25 Jun 2026 00:00:00 +0000</pubDate><guid>https://chenbh.com/publication/bach-probabilistic-2026/</guid><description>&lt;p>The &lt;strong>proper scoring ensemble filter (PSEF)&lt;/strong> learns an ensemble analysis operator that
targets the complete Bayesian filtering distribution rather than only its conditional mean.
The operator takes a forecast ensemble and a new observation as input and returns an
analysis ensemble. A permutation-invariant transformer ensures that the result respects the
exchangeability of ensemble members and can be evaluated at different ensemble sizes.&lt;/p>
&lt;p>The key training device is a &lt;strong>strictly proper scoring rule&lt;/strong>, implemented with the energy
score. Its expected value is uniquely minimized by the true filtering distribution, yet its
empirical form requires only simulated state–observation trajectories—not direct access to
the generally intractable filtering distribution. Under a realizability assumption, the
population objective recovers the Bayesian filter, and a mean-field time-averaging argument
connects the practical single-trajectory objective to this population target.&lt;/p>
&lt;p>Experiments cover a linear–Gaussian diagnostic, the strongly non-Gaussian doubling-angle
model, Lorenz-63, and Lorenz-96. Energy-score training captures multimodal distributions
missed by Gaussian filters and mean-based learning objectives. The results also reveal a
useful architectural distinction: an EnKF correction provides an effective inductive bias in
close-to-Gaussian problems, while a flexible end-to-end update is better suited to strongly
non-Gaussian posterior geometry.&lt;/p>
&lt;p>The manuscript has been submitted to the &lt;strong>Journal of Machine Learning Research&lt;/strong>.&lt;/p></description></item><item><title>Learning the Whole Filtering Distribution with Proper Scoring Rules</title><link>https://chenbh.com/post/proper-scoring-ensemble-filter-2026/</link><pubDate>Thu, 25 Jun 2026 00:00:00 +0000</pubDate><guid>https://chenbh.com/post/proper-scoring-ensemble-filter-2026/</guid><description>
&lt;details class="print:hidden xl:hidden" open>
&lt;summary>Table of Contents&lt;/summary>
&lt;div class="text-sm">
&lt;nav id="TableOfContents">
&lt;ul>
&lt;li>&lt;a href="#learning-a-distribution-without-seeing-it">Learning a Distribution Without Seeing It&lt;/a>&lt;/li>
&lt;li>&lt;a href="#the-proper-scoring-ensemble-filter">The Proper Scoring Ensemble Filter&lt;/a>&lt;/li>
&lt;li>&lt;a href="#why-the-loss-function-matters">Why the Loss Function Matters&lt;/a>&lt;/li>
&lt;li>&lt;a href="#non-gaussian-filtering-in-lorenz-systems">Non-Gaussian Filtering in Lorenz Systems&lt;/a>&lt;/li>
&lt;li>&lt;a href="#collaboration-and-reproducibility">Collaboration and Reproducibility&lt;/a>&lt;/li>
&lt;/ul>
&lt;/nav>
&lt;/div>
&lt;/details>
&lt;p>Our new paper, &lt;strong>“Learning Probabilistic Filters with Strictly Proper Scoring Rules,”&lt;/strong>
is now available on arXiv and has been &lt;strong>submitted to the Journal of Machine Learning
Research (JMLR)&lt;/strong>.&lt;/p>
&lt;ul>
&lt;li>&lt;strong>Paper:&lt;/strong>
·
&lt;/li>
&lt;li>&lt;strong>Code:&lt;/strong>
&lt;/li>
&lt;li>&lt;strong>Publication page and BibTeX:&lt;/strong>
&lt;/li>
&lt;li>&lt;strong>Original announcement:&lt;/strong>
&lt;/li>
&lt;/ul>
&lt;h2 id="learning-a-distribution-without-seeing-it">Learning a Distribution Without Seeing It&lt;/h2>
&lt;p>Bayesian filtering aims to infer the evolving distribution of a hidden state from partial
and noisy observations. That full distribution—not only its mean—is what represents
uncertainty, multimodality, and the range of plausible system states.&lt;/p>
&lt;p>This creates a basic learning problem: the true filtering distribution is generally
intractable, so it is not available as a supervised target. A simulator can readily produce
state trajectories and their corresponding noisy observations, but it does not hand us the
conditional distribution we would like a filter to learn.&lt;/p>
&lt;p>Our solution is to change the training objective. A &lt;strong>strictly proper scoring rule&lt;/strong> evaluates
a predictive distribution against a realized state, and its expected score is uniquely
optimized by the true data-generating distribution. We use the &lt;strong>energy score&lt;/strong>, which lets
us train from simulated state–observation trajectories while still targeting the entire
Bayesian filtering distribution.&lt;/p>
&lt;h2 id="the-proper-scoring-ensemble-filter">The Proper Scoring Ensemble Filter&lt;/h2>
&lt;p>We introduce the &lt;strong>proper scoring ensemble filter (PSEF)&lt;/strong>. Its learned analysis map takes
a forecast ensemble and the latest observation, then outputs an updated analysis ensemble.
The map is implemented with a permutation-invariant transformer, respecting the fact that
an ensemble represents an unordered empirical distribution. The same parameterization can
also operate across different ensemble sizes, with lightweight fine-tuning where needed.&lt;/p>
&lt;p>The paper studies two ways to parameterize the update:&lt;/p>
&lt;ul>
&lt;li>&lt;strong>Correction terms:&lt;/strong> retain the EnKF update as an inductive bias and learn how to
correct it.&lt;/li>
&lt;li>&lt;strong>End to end:&lt;/strong> learn a more flexible analysis map without constraining it to an
EnKF-style correction.&lt;/li>
&lt;/ul>
&lt;p>The distinction matters. In close-to-Gaussian settings, the EnKF structure is useful and the
correction-based approach performs best. When the observation creates a strongly
non-Gaussian or multimodal posterior, the end-to-end map has the flexibility needed to
represent its geometry.&lt;/p>
&lt;h2 id="why-the-loss-function-matters">Why the Loss Function Matters&lt;/h2>
&lt;p>The header figure gives a controlled example on the doubling-angle model. The true
posterior is bimodal. Training the same learning architecture with the energy score captures
both modes across ensemble sizes, including ensembles much smaller than those used by the
classical baselines. A normalized mean-squared objective and Kalman-type filters instead
miss the distributional structure, because matching a conditional mean is not enough to
learn uncertainty.&lt;/p>
&lt;p>The theory mirrors this empirical difference. Under a realizability assumption, the
population proper-scoring objective is minimized by the true Bayesian filtering
distribution. We also connect the finite-ensemble, single-trajectory loss used in training to
the population objective through a mean-field consistency and time-averaging argument.&lt;/p>
&lt;h2 id="non-gaussian-filtering-in-lorenz-systems">Non-Gaussian Filtering in Lorenz Systems&lt;/h2>
&lt;figure style="margin: 1.5rem 0; text-align: center;">
&lt;img src="lorenz63-distributions.jpg" alt="Projected Lorenz-63 filtering distributions produced by PSEF and comparison methods" style="width: 100%; height: auto;">
&lt;figcaption style="margin-top: 0.6rem;">Lorenz-63 with a partial square observation. The end-to-end, energy-score-trained PSEF most closely follows the particle-filter reference, including its cross-shaped and bimodal structures.&lt;/figcaption>
&lt;/figure>
&lt;p>We evaluate PSEF on a linear–Gaussian diagnostic, the doubling-angle model, Lorenz-63,
and Lorenz-96. In Lorenz-63, squaring the observed coordinate introduces sign ambiguity
and produces complex non-Gaussian filtering distributions. The end-to-end PSEF trained
with the energy score reproduces these structures more faithfully than mean-based learned
filters and classical Gaussian ensemble filters.&lt;/p>
&lt;figure style="margin: 1.5rem 0; text-align: center;">
&lt;img src="lorenz96-benchmarks.jpg" alt="Energy score and calibration comparisons for Lorenz-96 filtering" style="width: 100%; height: auto;">
&lt;figcaption style="margin-top: 0.6rem;">Lorenz-96 results across identity, square, and arctangent observations. Proper-score-trained filters remain among the strongest methods, while the best architecture depends on the posterior geometry.&lt;/figcaption>
&lt;/figure>
&lt;p>The Lorenz-96 results reinforce that there is no single architectural bias that is optimal
for every problem. Correction terms are effective when the filtering distribution remains
approximately unimodal, whereas the end-to-end energy-score model is strongest when the
observation induces multimodality. Across both cases, probabilistic training is what allows
the learned ensemble to target distributional accuracy rather than only state-estimation
error.&lt;/p>
&lt;h2 id="collaboration-and-reproducibility">Collaboration and Reproducibility&lt;/h2>
&lt;p>I led this project, including the implementation and numerical experiments, in collaboration
with &lt;strong>Eviatar Bach&lt;/strong>, &lt;strong>Ricardo Baptista&lt;/strong>, &lt;strong>Jochen Bröcker&lt;/strong>, and &lt;strong>Andrew Stuart&lt;/strong>.
The
contains the code and experiment scripts.&lt;/p>
&lt;p>&lt;em>Figures on this page were extracted from the paper, which is available under a CC BY 4.0 license.&lt;/em>&lt;/p></description></item></channel></rss>