Algorithms for optimized maximum entropy and diagnostic tools for analytic continuation
Dominic Bergeron, A.-M.S. Tremblay

TL;DR
This paper introduces an optimized maximum-entropy algorithm for analytic continuation, providing a robust, efficient, and user-friendly software tool with new numerical methods, adaptive parameter selection, and reliability diagnostics, applicable to quantum physics data.
Contribution
The paper presents novel numerical approximations, an adaptive entropy weight selection method, and reliability diagnostics, enhancing the accuracy and efficiency of maximum-entropy analytic continuation.
Findings
Almost temperature-independent computational complexity
Effective entropy weight selection method
Reliable diagnostics for result assessment
Abstract
Analytic continuation of numerical data obtained in imaginary time or frequency has become an essential part of many branches of quantum computational physics. It is, however, an ill-conditioned procedure and thus a hard numerical problem. The maximum-entropy approach, based on bayesian inference, is the most widely used method to tackle that problem. Although the approach is well established and among the most reliable and efficient ones, useful developments of the method and of its implementation are still possible. In addition, while a few free software implementations are available, a well-documented, optimized, general purpose and user-friendly software dedicated to that specific task is still lacking. Here we analyze all aspects of the implementation that are critical for accuracy and speed, and present a highly optimized approach to maximum-entropy. Original algorithmic and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
