Talagrand Meets Talagrand: Upper and Lower Bounds on Expected Soft Maxima of Gaussian Processes with Finite Index Sets
Yifeng Chu, Maxim Raginsky

TL;DR
This paper derives bounds on the expected soft maxima of Gaussian processes with finite index sets, connecting statistical physics and probability theory, and illustrates the approach with the Random Energy Model.
Contribution
It introduces a novel combination of physics and probability techniques to bound expected soft maxima of Gaussian processes, extending classical inequalities.
Findings
Bounds unify zero-temperature and finite-temperature regimes.
Application to the Random Energy Model demonstrates practical relevance.
Provides a new perspective on extremal behavior of Gaussian processes.
Abstract
Analysis of extremal behavior of stochastic processes is a key ingredient in a wide variety of applications, including probability, statistical physics, theoretical computer science, and learning theory. In this paper, we consider centered Gaussian processes on finite index sets and investigate expected values of their smoothed, or ``soft,'' maxima. We obtain upper and lower bounds for these expected values using a combination of ideas from statistical physics (the Gibbs variational principle for the equilibrium free energy and replica-symmetric representations of Gibbs averages) and from probability theory (Sudakov minoration). These bounds are parametrized by an inverse temperature and reduce to the usual Gaussian maximal inequalities in the zero-temperature limit . We provide an illustration of our methods in the context of the Random Energy Model, one…
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.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Mathematical Biology Tumor Growth · Gene Regulatory Network Analysis
