High-dimensional maximum-entropy phase space tomography

Inferring 4D or 6D phase space distributions from 1D or 2D measurements is a challenging inverse problem encountered in particle accelerators. Entropy maximization (ME) is an established method to incorporate prior information in under-constrained problems but is typically infeasible in high-dimensional spaces. In this talk, I discuss two approaches to high-dimensional ME. The first approach extends the Generative Phase Space Reconstruction (GPSR) algorithm, utilizing a class of generative models called normalizing flows which provide stochastic differentiable entropy estimates. The second approach modifies the classic MENT algorithm, using the method of Lagrange multipliers and Markov Chain Monte Carlo (MCMC) sampling to solve the constrained optimization. After reviewing the theory behind these approaches, I describe numerical tests of their convergence and accuracy, followed by applications to experimental data. I conclude by mentioning possible routes to uncertainty quantification within the ME framework.

Authors

Publication Details

Journal
JACOW
Published
2026-01-29
DOI
https://doi.org/10.18429/jacow-napac2025-tuzn01
Primary Topic
Laser-Plasma Interactions and Diagnostics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

High-dimensional maximum-entropy phase space tomography

Austin Hoover
JACOW
Laser-Plasma Interactions and Diagnostics
article

High-dimensional maximum-entropy phase space tomography

Austin Hoover
article en

Abstract

Inferring 4D or 6D phase space distributions from 1D or 2D measurements is a challenging inverse problem encountered in particle accelerators. Entropy maximization (ME) is an established method to incorporate prior information in under-constrained problems but is typically infeasible in high-dimensional spaces. In this talk, I discuss two approaches to high-dimensional ME. The first approach extends the Generative Phase Space Reconstruction (GPSR) algorithm, utilizing a class of generative models called normalizing flows which provide stochastic differentiable entropy estimates. The second approach modifies the classic MENT algorithm, using the method of Lagrange multipliers and Markov Chain Monte Carlo (MCMC) sampling to solve the constrained optimization. After reviewing the theory behind these approaches, I describe numerical tests of their convergence and accuracy, followed by applications to experimental data. I conclude by mentioning possible routes to uncertainty quantification within the ME framework.

JACOW
Openalex Percentile: Top 70%
Laser-Plasma Interactions and Diagnostics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.