Michael C Abbott

Dr. Michael C Abbott


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 February 2018 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
HMHenry H. Mattingly
Henry H. Mattingly
MTMark K. Transtrum
Mark K. Transtrum
MAMichael C Abbott
Michael C Abbott
BMBenjamin B Machta
Benjamin B Machta
Significance: Most physical theories are effective theories, descriptions at the scale visible to our experiments which ignore microscopic details. Seeking general ways to motivate such theories, we find an information theory perspective: If we select the model which can learn as much information as possible from the data, then we are naturally led to a simpler model, by a path independent of concerns about overfitting. This is encoded as a Bayesian prior which is nonzero only on a subspace of the original parameter space. We differ from earlier prior selection work by not considering an infinite quantity of data. Having finite data is always a limit on the resolution of an experiment, and in our framework this selects how complicated a theory is appropriate.

28 December 2022 in Reports on Progress in Physics
Verified
Journal Article
Closed access
KQKatherine N Quinn
Katherine N Quinn
MAMichael C Abbott
Michael C Abbott
MTMark K Transtrum
Mark K Transtrum
BMBenjamin B Machta
Benjamin B Machta
JSJames P Sethna
James P Sethna
Complex models in physics, biology, economics, and engineering are often sloppy, meaning that the model parameters are not well determined by the model predictions for collective behavior. Many parameter combinations can vary over decades without significant changes in the predictions. This review uses information geometry to explore sloppiness and its deep relation to emergent theories. We introduce the model manifold of predictions, whose coordinates are the model parameters. Its hyperribbon structure explains why only a few parameter combinations matter for the behavior. We review recent rigorous results that connect the hierarchy of hyperribbon widths to approximation theory, and to the smoothness of model predictions under changes of the control variables. We discuss recent geodesic methods to find simpler models on nearby boundaries of the model manifold—emergent theories with fewer parameters that explain the behavior equally well. We discuss a Bayesian prior which optimizes the mutual information between model parameters and experimental data, naturally favoring points on the emergent boundary theories and thus simpler models. We introduce a ‘projected maximum likelihood’ prior that efficiently approximates this optimal prior, and contrast both to the poor behavior of the traditional Jeffreys prior. We discuss the way the renormalization group coarse-graining in statistical mechanics introduces a flow of the model manifold, and connect stiff and sloppy directions along the model manifold with relevant and irrelevant eigendirections of the renormalization group. Finally, we discuss recently developed ‘intensive’ embedding methods, allowing one to visualize the predictions of arbitrary probabilistic models as low-dimensional projections of an isometric embedding, and illustrate our method by generating the model manifold of the Ising model.

27 May 2021 in Journal of High Energy Physics
Verified
Journal Article
Open access
PDF file
MAMichael C Abbott
Michael C Abbott
ZBZoltán Bajnok
Zoltán Bajnok
JBJanos Balog
Janos Balog
ÁHÁrpád Hegedűs
Árpád Hegedűs
SSSaeedeh Sadeghian
Saeedeh Sadeghian
We analyze the free energy of the integrable two dimensional O(4) sigma model in a magnetic field. We use Volin’s method to extract high number (2000) of perturbative coefficients with very high precision. The factorial growth of these coefficients are regulated by switching to the Borel transform, where we perform several asymptotic analysis. High precision data allowed to identify Stokes constants and alien derivatives with exact expressions. These reveal a nice resurgence structure which enables to formulate the first few terms of the ambiguity free trans-series. We check these results against the direct numerical solution of the exact integral equation and find complete agreement.

23 April 2021 in Physical Review D
Verified
Journal Article
Open access
PDF file
MAMichael C Abbott
Michael C Abbott
IAInês Aniceto
Inês Aniceto
We present the first known integrable relativistic field theories with interacting massive and massless sectors, and we demonstrate that knowledge of the massless sector is essential for understanding of the spectrum of the massive sector. Terms in this spectrum polynomial in the spatial volume (the accuracy for which the Bethe ansatz would suffice in a massive theory) require not just Lüscher-like corrections (usually exponentially small) but the full Thermodynamic Bethe Ansatz (TBA) integral equations. We are motivated by the implications of these ideas for AdS/CFT, but present here only field-theory results.

1 April 2015 in Physics Letters B
Verified
Journal Article
Open access
MAMichael C Abbott
Michael C Abbott
IAInês Aniceto
Inês Aniceto
We propose a number of modifications to the classical term in the dressing phase for integrable strings in AdS3×S3×S3×S1, and check these against existing perturbative calculations, crossing symmetry, and the semiclassical limit of the Bethe equations. The principal change is that the phase for different masses should start with a term Q1Q2, like the one-loop AdS3 dressing phase, rather than Q2Q3 as for the original AdS5 AFS phase

30 April 2019 in Journal of Statistical Physics
Verified
Journal Article
Open access
PDF file
MAMichael C Abbott
Michael C Abbott
BMBenjamin B Machta
Benjamin B Machta
An analog communication channel typically achieves its full capacity when the distribution of inputs is discrete, composed of just K symbols, such as voltage levels or wavelengths. As the effective noise level goes to zero, for example by sending the same message multiple times, it is known that optimal codes become continuous. Here we derive a scaling law for the optimal number of symbols in this limit, finding a novel rational scaling exponent. The number of symbols in the optimal code grows as \(\log K\sim I^{4/3}\), where the channel capacity I increases with decreasing noise. The same scaling applies to other problems equivalent to maximizing channel capacity over a continuous distribution.