Skip to content

Commit 3f9e51c

Browse files
Generate Pelican site
1 parent 3d37ef8 commit 3f9e51c

5 files changed

Lines changed: 34 additions & 14 deletions

File tree

feeds/all-en.atom.xml

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ Formally, this can be expressed as</p>
2020
<p>where the error norm is defined as</p>
2121
<div class="arithmatex">\[
2222
|u_\theta - u|_p
23-
\coloneqq \left( \int_\mathcal{Y} |u(y) - u_\theta(y)|^p , dy \right)^{1/p}.
23+
\coloneqq \left( \int_\mathcal{Y} |u(y) - u_\theta(y)|^p \; dy \right)^{1/p}.
2424
\]</div>
2525
<p>Since the true solution <span class="arithmatex">\(u\)</span> is generally unknown, we cannot compute this loss directly.
2626
However, we typically know that <span class="arithmatex">\(u\)</span> satisfies a PDE of the form</p>
@@ -38,7 +38,7 @@ This allows us to define the <strong>PDE residual</strong></p>
3838
<p>To ensure that <span class="arithmatex">\(u_\theta\)</span> satisfies the PDE, we minimize the expected residual:</p>
3939
<div class="arithmatex">\[
4040
\mathcal{L}_{\text{PDE}}(\theta)
41-
\coloneqq \int_\mathcal{Y} |\mathcal{R}_\theta(y)|^p , dy.
41+
\coloneqq \int_\mathcal{Y} |\mathcal{R}_\theta(y)|^p \; dy.
4242
\]</div>
4343
<p>In practice, this integral is approximated by a numerical quadrature over <span class="arithmatex">\(N \in \mathbb{N}\)</span> collocation points <span class="arithmatex">\(\{y_i\}_{i=1}^N\)</span>, yielding</p>
4444
<div class="arithmatex">\[
@@ -107,7 +107,11 @@ we can include a <strong>data loss</strong></p>
107107
<div class="arithmatex">\[
108108
\hat{\theta} = \arg\min_{\theta \in \Theta} \mathcal{L}(\theta),
109109
\]</div>
110-
&lt;p&gt;where &lt;span class="arithmatex"&gt;\(\hat{\theta}\)&lt;/span&gt; denotes the parameters obtained by numerical optimization (e.g., using Adam).&lt;/p&gt;</content><category term="Machine Learning"></category><category term="neural-networks"></category><category term="physics"></category><category term="pdes"></category></entry><entry><title>Anytime-Valid Neural Uncertainty Quantification for SPECT Imaging</title><link href="https://www.matteogaetzner.com/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html" rel="alternate"></link><published>2025-10-11T00:00:00+02:00</published><updated>2025-10-11T00:00:00+02:00</updated><author><name>Matteo Gätzner</name></author><id>tag:www.matteogaetzner.com,2025-10-11:/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html</id><summary type="html">&lt;p&gt;A short overview of my MSc thesis, which adapts and applies &lt;strong&gt;Sequential and Prior Likelihood Mixing&lt;/strong&gt; (Kirschner et al., 2025) to &lt;strong&gt;anytime-valid uncertainty quantification&lt;/strong&gt; in tomographic imaging. The work explores how to obtain statistically valid uncertainty for &lt;strong&gt;SPECT reconstructions&lt;/strong&gt; using both classical estimators and modern neural predictors such as U-Net ensembles and diffusion models.&lt;/p&gt;</summary><content type="html">&lt;p&gt;&lt;a href="files/thesis.pdf" target="_blank"&gt;Download the thesis (PDF)&lt;/a&gt;&lt;/p&gt;
110+
&lt;p&gt;where &lt;span class="arithmatex"&gt;\(\hat{\theta}\)&lt;/span&gt; denotes the parameters obtained by numerical optimization (e.g., using Adam).&lt;/p&gt;
111+
&lt;hr /&gt;
112+
&lt;h2 id="acknowledgment"&gt;Acknowledgment&lt;/h2&gt;
113+
&lt;p&gt;This post is based on material covered in the &lt;strong&gt;AI in the Sciences and Engineering (HS 2025)&lt;/strong&gt; lecture by &lt;strong&gt;Prof. Dr. Siddhartha Mishra&lt;/strong&gt;,
114+
&lt;em&gt;Computational and Applied Mathematics Laboratory (CamLab), Seminar for Applied Mathematics (SAM), D-MATH, ETH AI Center, and Swiss National AI Institute (SNAI), ETH Zürich, Switzerland.&lt;/em&gt;&lt;/p&gt;</content><category term="Machine Learning"></category><category term="neural-networks"></category><category term="physics"></category><category term="pdes"></category></entry><entry><title>Anytime-Valid Neural Uncertainty Quantification for SPECT Imaging</title><link href="https://www.matteogaetzner.com/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html" rel="alternate"></link><published>2025-10-11T00:00:00+02:00</published><updated>2025-10-11T00:00:00+02:00</updated><author><name>Matteo Gätzner</name></author><id>tag:www.matteogaetzner.com,2025-10-11:/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html</id><summary type="html">&lt;p&gt;A short overview of my MSc thesis, which adapts and applies &lt;strong&gt;Sequential and Prior Likelihood Mixing&lt;/strong&gt; (Kirschner et al., 2025) to &lt;strong&gt;anytime-valid uncertainty quantification&lt;/strong&gt; in tomographic imaging. The work explores how to obtain statistically valid uncertainty for &lt;strong&gt;SPECT reconstructions&lt;/strong&gt; using both classical estimators and modern neural predictors such as U-Net ensembles and diffusion models.&lt;/p&gt;</summary><content type="html">&lt;p&gt;&lt;a href="files/thesis.pdf" target="_blank"&gt;Download the thesis (PDF)&lt;/a&gt;&lt;/p&gt;
111115
&lt;hr /&gt;
112116
&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
113117
&lt;p&gt;We develop anytime-valid methods for uncertainty quantification in tomographic imaging, with a focus on single-photon emission tomography (SPECT). In SPECT, sequentially acquired data is used to reconstruct images representing the radioactivity distribution inside the object. In addition to producing image reconstructions, our approach constructs &lt;em&gt;confidence sequences&lt;/em&gt;: collections of confidence sets that contain the true but unknown image with high probability simultaneously across all acquisition steps. We investigate two variants: &lt;em&gt;prior likelihood mixing&lt;/em&gt; and &lt;em&gt;sequential likelihood mixing&lt;/em&gt;. Both employ likelihood-based constructions, but differ in how they use user-defined distributions. We parameterize these distributions using classical statistical estimators (MLE, MAP) as well as neural methods, namely U-Net ensembles and diffusion models. In numerical experiments, we simulate SPECT data and compare the tightness and empirical coverage rate of different confidence sequences. Empirically, sequential likelihood mixing proves to be a particularly effective method for constructing confidence sequences. The performance of this method depends on the image predictor used: U-Net ensembles often yield tight and reliable confidence sets, while in some settings classical estimators (MLE, MAP) perform best. We also present strategies for generating uncertainty visualizations. Our results suggest that combining statistical theory with neural predictors enables principled, real-time uncertainty quantification, which may support clinical decision-making in SPECT and related modalities.&lt;/p&gt;

feeds/all.atom.xml

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ Formally, this can be expressed as&lt;/p&gt;
2020
&lt;p&gt;where the error norm is defined as&lt;/p&gt;
2121
&lt;div class="arithmatex"&gt;\[
2222
|u_\theta - u|_p
23-
\coloneqq \left( \int_\mathcal{Y} |u(y) - u_\theta(y)|^p , dy \right)^{1/p}.
23+
\coloneqq \left( \int_\mathcal{Y} |u(y) - u_\theta(y)|^p \; dy \right)^{1/p}.
2424
\]&lt;/div&gt;
2525
&lt;p&gt;Since the true solution &lt;span class="arithmatex"&gt;\(u\)&lt;/span&gt; is generally unknown, we cannot compute this loss directly.
2626
However, we typically know that &lt;span class="arithmatex"&gt;\(u\)&lt;/span&gt; satisfies a PDE of the form&lt;/p&gt;
@@ -38,7 +38,7 @@ This allows us to define the &lt;strong&gt;PDE residual&lt;/strong&gt;&lt;/p&gt;
3838
&lt;p&gt;To ensure that &lt;span class="arithmatex"&gt;\(u_\theta\)&lt;/span&gt; satisfies the PDE, we minimize the expected residual:&lt;/p&gt;
3939
&lt;div class="arithmatex"&gt;\[
4040
\mathcal{L}_{\text{PDE}}(\theta)
41-
\coloneqq \int_\mathcal{Y} |\mathcal{R}_\theta(y)|^p , dy.
41+
\coloneqq \int_\mathcal{Y} |\mathcal{R}_\theta(y)|^p \; dy.
4242
\]&lt;/div&gt;
4343
&lt;p&gt;In practice, this integral is approximated by a numerical quadrature over &lt;span class="arithmatex"&gt;\(N \in \mathbb{N}\)&lt;/span&gt; collocation points &lt;span class="arithmatex"&gt;\(\{y_i\}_{i=1}^N\)&lt;/span&gt;, yielding&lt;/p&gt;
4444
&lt;div class="arithmatex"&gt;\[
@@ -107,7 +107,11 @@ we can include a &lt;strong&gt;data loss&lt;/strong&gt;&lt;/p&gt;
107107
&lt;div class="arithmatex"&gt;\[
108108
\hat{\theta} = \arg\min_{\theta \in \Theta} \mathcal{L}(\theta),
109109
\]&lt;/div&gt;
110-
&lt;p&gt;where &lt;span class="arithmatex"&gt;\(\hat{\theta}\)&lt;/span&gt; denotes the parameters obtained by numerical optimization (e.g., using Adam).&lt;/p&gt;</content><category term="Machine Learning"></category><category term="neural-networks"></category><category term="physics"></category><category term="pdes"></category></entry><entry><title>Anytime-Valid Neural Uncertainty Quantification for SPECT Imaging</title><link href="https://www.matteogaetzner.com/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html" rel="alternate"></link><published>2025-10-11T00:00:00+02:00</published><updated>2025-10-11T00:00:00+02:00</updated><author><name>Matteo Gätzner</name></author><id>tag:www.matteogaetzner.com,2025-10-11:/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html</id><summary type="html">&lt;p&gt;A short overview of my MSc thesis, which adapts and applies &lt;strong&gt;Sequential and Prior Likelihood Mixing&lt;/strong&gt; (Kirschner et al., 2025) to &lt;strong&gt;anytime-valid uncertainty quantification&lt;/strong&gt; in tomographic imaging. The work explores how to obtain statistically valid uncertainty for &lt;strong&gt;SPECT reconstructions&lt;/strong&gt; using both classical estimators and modern neural predictors such as U-Net ensembles and diffusion models.&lt;/p&gt;</summary><content type="html">&lt;p&gt;&lt;a href="files/thesis.pdf" target="_blank"&gt;Download the thesis (PDF)&lt;/a&gt;&lt;/p&gt;
110+
&lt;p&gt;where &lt;span class="arithmatex"&gt;\(\hat{\theta}\)&lt;/span&gt; denotes the parameters obtained by numerical optimization (e.g., using Adam).&lt;/p&gt;
111+
&lt;hr /&gt;
112+
&lt;h2 id="acknowledgment"&gt;Acknowledgment&lt;/h2&gt;
113+
&lt;p&gt;This post is based on material covered in the &lt;strong&gt;AI in the Sciences and Engineering (HS 2025)&lt;/strong&gt; lecture by &lt;strong&gt;Prof. Dr. Siddhartha Mishra&lt;/strong&gt;,
114+
&lt;em&gt;Computational and Applied Mathematics Laboratory (CamLab), Seminar for Applied Mathematics (SAM), D-MATH, ETH AI Center, and Swiss National AI Institute (SNAI), ETH Zürich, Switzerland.&lt;/em&gt;&lt;/p&gt;</content><category term="Machine Learning"></category><category term="neural-networks"></category><category term="physics"></category><category term="pdes"></category></entry><entry><title>Anytime-Valid Neural Uncertainty Quantification for SPECT Imaging</title><link href="https://www.matteogaetzner.com/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html" rel="alternate"></link><published>2025-10-11T00:00:00+02:00</published><updated>2025-10-11T00:00:00+02:00</updated><author><name>Matteo Gätzner</name></author><id>tag:www.matteogaetzner.com,2025-10-11:/anytime-valid-neural-uncertainty-quantification-for-spect-imaging.html</id><summary type="html">&lt;p&gt;A short overview of my MSc thesis, which adapts and applies &lt;strong&gt;Sequential and Prior Likelihood Mixing&lt;/strong&gt; (Kirschner et al., 2025) to &lt;strong&gt;anytime-valid uncertainty quantification&lt;/strong&gt; in tomographic imaging. The work explores how to obtain statistically valid uncertainty for &lt;strong&gt;SPECT reconstructions&lt;/strong&gt; using both classical estimators and modern neural predictors such as U-Net ensembles and diffusion models.&lt;/p&gt;</summary><content type="html">&lt;p&gt;&lt;a href="files/thesis.pdf" target="_blank"&gt;Download the thesis (PDF)&lt;/a&gt;&lt;/p&gt;
111115
&lt;hr /&gt;
112116
&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
113117
&lt;p&gt;We develop anytime-valid methods for uncertainty quantification in tomographic imaging, with a focus on single-photon emission tomography (SPECT). In SPECT, sequentially acquired data is used to reconstruct images representing the radioactivity distribution inside the object. In addition to producing image reconstructions, our approach constructs &lt;em&gt;confidence sequences&lt;/em&gt;: collections of confidence sets that contain the true but unknown image with high probability simultaneously across all acquisition steps. We investigate two variants: &lt;em&gt;prior likelihood mixing&lt;/em&gt; and &lt;em&gt;sequential likelihood mixing&lt;/em&gt;. Both employ likelihood-based constructions, but differ in how they use user-defined distributions. We parameterize these distributions using classical statistical estimators (MLE, MAP) as well as neural methods, namely U-Net ensembles and diffusion models. In numerical experiments, we simulate SPECT data and compare the tightness and empirical coverage rate of different confidence sequences. Empirically, sequential likelihood mixing proves to be a particularly effective method for constructing confidence sequences. The performance of this method depends on the image predictor used: U-Net ensembles often yield tight and reliable confidence sets, while in some settings classical estimators (MLE, MAP) perform best. We also present strategies for generating uncertainty visualizations. Our results suggest that combining statistical theory with neural predictors enables principled, real-time uncertainty quantification, which may support clinical decision-making in SPECT and related modalities.&lt;/p&gt;

feeds/machine-learning.atom.xml

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ Formally, this can be expressed as&lt;/p&gt;
2020
&lt;p&gt;where the error norm is defined as&lt;/p&gt;
2121
&lt;div class="arithmatex"&gt;\[
2222
|u_\theta - u|_p
23-
\coloneqq \left( \int_\mathcal{Y} |u(y) - u_\theta(y)|^p , dy \right)^{1/p}.
23+
\coloneqq \left( \int_\mathcal{Y} |u(y) - u_\theta(y)|^p \; dy \right)^{1/p}.
2424
\]&lt;/div&gt;
2525
&lt;p&gt;Since the true solution &lt;span class="arithmatex"&gt;\(u\)&lt;/span&gt; is generally unknown, we cannot compute this loss directly.
2626
However, we typically know that &lt;span class="arithmatex"&gt;\(u\)&lt;/span&gt; satisfies a PDE of the form&lt;/p&gt;
@@ -38,7 +38,7 @@ This allows us to define the &lt;strong&gt;PDE residual&lt;/strong&gt;&lt;/p&gt;
3838
&lt;p&gt;To ensure that &lt;span class="arithmatex"&gt;\(u_\theta\)&lt;/span&gt; satisfies the PDE, we minimize the expected residual:&lt;/p&gt;
3939
&lt;div class="arithmatex"&gt;\[
4040
\mathcal{L}_{\text{PDE}}(\theta)
41-
\coloneqq \int_\mathcal{Y} |\mathcal{R}_\theta(y)|^p , dy.
41+
\coloneqq \int_\mathcal{Y} |\mathcal{R}_\theta(y)|^p \; dy.
4242
\]&lt;/div&gt;
4343
&lt;p&gt;In practice, this integral is approximated by a numerical quadrature over &lt;span class="arithmatex"&gt;\(N \in \mathbb{N}\)&lt;/span&gt; collocation points &lt;span class="arithmatex"&gt;\(\{y_i\}_{i=1}^N\)&lt;/span&gt;, yielding&lt;/p&gt;
4444
&lt;div class="arithmatex"&gt;\[
@@ -107,4 +107,8 @@ we can include a &lt;strong&gt;data loss&lt;/strong&gt;&lt;/p&gt;
107107
&lt;div class="arithmatex"&gt;\[
108108
\hat{\theta} = \arg\min_{\theta \in \Theta} \mathcal{L}(\theta),
109109
\]&lt;/div&gt;
110-
&lt;p&gt;where &lt;span class="arithmatex"&gt;\(\hat{\theta}\)&lt;/span&gt; denotes the parameters obtained by numerical optimization (e.g., using Adam).&lt;/p&gt;</content><category term="Machine Learning"></category><category term="neural-networks"></category><category term="physics"></category><category term="pdes"></category></entry></feed>
110+
&lt;p&gt;where &lt;span class="arithmatex"&gt;\(\hat{\theta}\)&lt;/span&gt; denotes the parameters obtained by numerical optimization (e.g., using Adam).&lt;/p&gt;
111+
&lt;hr /&gt;
112+
&lt;h2 id="acknowledgment"&gt;Acknowledgment&lt;/h2&gt;
113+
&lt;p&gt;This post is based on material covered in the &lt;strong&gt;AI in the Sciences and Engineering (HS 2025)&lt;/strong&gt; lecture by &lt;strong&gt;Prof. Dr. Siddhartha Mishra&lt;/strong&gt;,
114+
&lt;em&gt;Computational and Applied Mathematics Laboratory (CamLab), Seminar for Applied Mathematics (SAM), D-MATH, ETH AI Center, and Swiss National AI Institute (SNAI), ETH Zürich, Switzerland.&lt;/em&gt;&lt;/p&gt;</content><category term="Machine Learning"></category><category term="neural-networks"></category><category term="physics"></category><category term="pdes"></category></entry></feed>

0 commit comments

Comments
 (0)