paper-with-me

홈 › Papers

Sudakov-Fernique post-AMP, and a new proof of the local convexity of the TAP free energy

2022-08-19 · Michael Celentano

In many problems in modern statistics and machine learning, it is often of interest to establish that a first order method on a non-convex risk function eventually enters a region of parameter space in which the risk is locally convex. We derive an asymptotic comparison inequality, which we call the Sudakov-Fernique post-AMP inequality, which, in a certain class of problems involving a GOE matrix, is able to probe properties of an optimization landscape locally around the iterates of an approximate message passing (AMP) algorithm. As an example of its use, we provide a new, and arguably simpler, proof of some of the results of Celentano et al. (2021), which establishes that the so-called TAP free energy in the $\mathbb{Z}_2$-synchronization problem is locally convex in the region to which AMP converges. We further prove a conjecture of El Alaoui et al. (2022) involving the local convexity of a related but distinct TAP free energy, which, as a consequence, confirms that their algorithm efficiently samples from the Sherrington-Kirkpatrick Gibbs measure throughout the "easy" regime.

📄 PDF Abstract BibTeX arXiv:2208.09550

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

AMP Based on the understanding that the flat local minima of the empirical risk cause the model to generalize better. Adversarial Model Perturbation (AMP) improves generalization via…

Similar Papers 제목 키워드 기반

Local convexity of the TAP free energy and AMP convergence for Z2-synchronization

2021-06-21 · Michael Celentano, Zhou Fan, Song Mei

We study mean-field variational Bayesian inference using the TAP approach, for Z2-synchronization as a prototypical example of a high-dimensional Bayesian model. We show that for any signal strength $\lambda > 1$ (the we…

Bayesian InferenceVariational Inference

Universal coding, intrinsic volumes, and metric complexity

2023-03-13 · Jaouad Mourtada

We study sequential probability assignment in the Gaussian setting, where the goal is to predict, or equivalently compress, a sequence of real-valued observations almost as well as the best Gaussian distribution with mea…

First Proof Second Batch

2026-06-16 · Mohammed Abouzaid, Nikhil Srivastava, Rachel Ward, Lauren Williams arxiv

To assess the ability of current AI systems to correctly solve research-level mathematics problems, we tested several AI systems on a set of ten problems in a broad range of mathematical fields; these problems arose natu…

Convexity-Driven Projection for Point Cloud Dimensionality Reduction

2025-09-26 · Suman Sanyal arxiv

We propose Convexity-Driven Projection (CDP), a boundary-free linear method for dimensionality reduction of point clouds that targets preserving detour-induced local non-convexity. CDP builds a $k$-NN graph, identifies a…

Dimensionality ReductionPoint Clouds

Risk sharing under heterogeneous beliefs without convexity

2021-08-12 · Felix-Benedikt Liebrich

We consider the problem of finding Pareto-optimal allocations of risk among finitely many agents. The associated individual risk measures are law invariant, but with respect to agent-dependent and potentially heterogeneo…