# Majorizing Measures for the Optimizer

@inproceedings{Borst2021MajorizingMF,
title={Majorizing Measures for the Optimizer},
author={Sander Borst and Daniel Dadush and Neil Olver and Makrand Sinha},
booktitle={ITCS},
year={2021}
}
• Published in ITCS 24 December 2020
• Computer Science, Mathematics
The theory of majorizing measures, extensively developed by Fernique, Talagrand and many others, provides one of the most general frameworks for controlling the behavior of stochastic processes. In particular, it can be applied to derive quantitative bounds on the expected suprema and the degree of continuity of sample paths for many processes. One of the crowning achievements of the theory is Talagrand’s tight alternative characterization of the suprema of Gaussian processes in terms of…
1 Citations
Generalization Properties of Stochastic Optimizers via Trajectory Analysis
• Computer Science
ArXiv
• 2021
An encompassing theoretical framework for investigating the generalization properties of stochastic optimizers, which is based on their dynamics, and it is shown that both the Fernique–Talagrand functional and the local power-law exponent are predictive of generalization performance.

## References

SHOWING 1-10 OF 28 REFERENCES
Supremum of a Process in Terms of Trees
• Mathematics
• 2003
In this paper we study the quantity $$\mathbb{E} \sup_{{t \in T}}X_{t},$$ where X t is some random process. In the case of the Gaussian process, there is a natural sub-metric d defined on T. We find
The majorizing measure approach to the sample boundedness
In this paper we describe the alternative approach to the sample boundedness and continuity of stochastic processes. We show that the regularity of paths can be understood in terms of a distribution
An improved cutting plane method for convex optimization, convex-concave games, and its applications
• Computer Science
STOC
• 2020
A novel multi-layered data structure for leverage score maintenance is achieved by a sophisticated combination of diverse techniques such as random projection, batched low-rank update, inverse maintenance, polynomial interpolation, and fast rectangular matrix multiplication.
A theorem on majorizing measures
Let (T,d) be a metric space and φ:R + → 1R an increasing, convex function with φ(0) = 0. We prove that if m is a probability measure m on r which is majorizing with respect to d, φ, that is, &:=
Sample Boundedness of Stochastic Processes Under Increment Conditions
Let (T, d) be a compact metric space of diameter D, and ∥• be an Orlicz norm. When is it true that all (separable) processes (X t ) t∈T that satisfy the increment condition ∥X t −X s ∥≤d(t, s) for
The Sizes of Compact Subsets of Hilbert Space and Continuity of Gaussian Processes
The first two sections of this paper are introductory and correspond to the two halves of the title. As is well known, there is no complete analog of Lebesue or Haar measure in an
A polynomial time approximation scheme for computing the supremum of Gaussian processes
A polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process and an explicit oblivious estimator for semi-norms in Gaussian space with optimal query complexity is given.
Theory of Principal Partitions Revisited
• S. Fujishige
• Mathematics
Bonn Workshop of Combinatorial Optimization
• 2008
It has been realized that the principal partitions are closely related to resource allocation problems with submodular structures, which are kind of dual problems.
Probability in Banach Spaces: Isoperimetry and Processes
• Mathematics
• 1991
Notation.- 0. Isoperimetric Background and Generalities.- 1. Isoperimetric Inequalities and the Concentration of Measure Phenomenon.- 2. Generalities on Banach Space Valued Random Variables and