2 January 2023 in IEEE Signal Processing Magazine
Phase retrieval consists in the recovery of a complex-valued signal from intensity-only measurements. As it pervades a broad variety of applications, many researchers have striven to develop phase-retrieval algorithms. Classical approaches involve techniques as varied as generic gradient descent routines or specialized spectral methods, to name a few. However, the phase-recovery problem remains a challenge to this day. Recently, however, advances in machine learning have revitalized the study of phase retrieval in two ways: 1) significant theoretical advances have emerged from the analogy between phase retrieval and single-layer neural networks, and 2) practical breakthroughs have been obtained thanks to deep learning regularization. In this tutorial, we review phase retrieval under a unifying framework that encompasses classical and machine learning methods. We focus on three key elements: applications, an overview of recent reconstruction algorithms, and the latest theoretical results.
1 October 2015 in Physical Review D
We study the stability of anti–de Sitter (AdS) spacetime to spherically symmetric perturbations of a real scalar field in general relativity. Further, we work within the context of the “two time framework” (TTF) approximation, which describes the leading nonlinear effects for small amplitude perturbations, and is therefore suitable for studying the weakly turbulent instability of AdS—including both collapsing and noncollapsing solutions. We have previously identified a class of quasiperiodic (QP) solutions to the TTF equations, and in this paper we analyze their stability. We show that there exist several families of QP solutions that are stable to linear order, and we argue that these solutions represent islands of stability in TTF. We extract the eigenmodes of small oscillations about QP solutions, and we use them to predict approximate recurrence times for generic noncollapsing initial data in the full (non-TTF) system. Alternatively, when sufficient energy is driven to high-frequency modes, as occurs for initial data far from a QP solution, the TTF description breaks down as an approximation to the full system. Depending on the higher order dynamics of the full system, this often signals an imminent collapse to a black hole.
1 November 2019 in Journal of Statistical Mechanics: Theory and Experiment
ACAlejandro Lage Castellanos
Alejandro Lage Castellanos
Improved mean-field techniques are a central theme of statistical physics methods applied to inference and learning. We revisit here some of these methods using high-temperature expansions for disordered systems initiated by Plefka, Georges and Yedidia. We derive the Gibbs free entropy and the subsequent self-consistent equations for a generic class of statistical models with correlated matrices and show in particular that many classical approximation schemes, such as adaptive TAP, expectation-consistency, or the approximations behind the vector approximate message passing algorithm all rely on the same assumptions, that are also at the heart of high-temperature expansions. We focus on the case of rotationally invariant random coupling matrices in the ‘high-dimensional’ limit in which the number of samples and the dimension are both large, but with a fixed ratio. This encapsulates many widely studied models, such as restricted Boltzmann machines or generalized linear models with correlated data matrices. In this general setting, we show that all the approximation schemes described before are equivalent, and we conjecture that they are exact in the thermodynamic limit in the replica symmetric phases. We achieve this conclusion by resummation of the infinite perturbation series, which generalises a seminal result of Parisi and Potters. A rigorous derivation of this conjecture is an interesting mathematical challenge. On the way to these conclusions, we uncover several diagrammatical results in connection with free probability and random matrix theory, that are interesting independently of the rest of our work.
1 December 2019 in Journal of Statistical Mechanics: Theory and Experiment
Heuristic tools from statistical physics have been used in the past to locate the phase transitions and compute the optimal learning and generalization errors in the teacher-student scenario in multi-layer neural networks. In this paper, we provide a rigorous justification of these approaches for a two-layers neural network model called the committee machine, under a technical assumption. We also introduce a version of the approximate message passing (AMP) algorithm for the committee machine that allows optimal learning in polynomial time for a large set of parameters. We find that there are regimes in which a low generalization error is information-theoretically achievable while the AMP algorithm fails to deliver it; strongly suggesting that no efficient algorithm exists for those cases, unveiling a large computational gap.
12 September 2019 in Physical Review B
We present a quantum Monte Carlo algorithm for computing the perturbative expansion in power of the coupling constant of the out-of-equilibrium Green's functions of interacting Hamiltonians of fermions. The algorithm extends the one presented in Profumo et al. [ Phys. Rev. B 91, 245154 (2015)], and inherits its main property: it can reach the infinite time (steady state) limit since the computational cost to compute order is uniform versus time; the computing time increases as . The algorithm is based on the Schwinger-Keldysh formalism and can be used for both equilibrium and out-of-equilibrium calculations. It is stable at both small and long real times including in the stationary regime, because of its automatic cancellation of the disconnected Feynman diagrams. We apply this technique to the Anderson quantum impurity model in the quantum dot geometry to obtain the Green's function and self-energy expansion up to order at very low temperature. We benchmark our results at weak and intermediate coupling with high precision numerical renormalization-group computations as well as analytical results.