A Novel Gaussian Min-Max Theorem and its Applications
원문 초록
A celebrated result by Gordon allows one to compare the min-max behavior of two Gaussian processes if certain inequality conditions are met. The consequences of this result include the Gaussian min-max (GMT) and convex Gaussian min-max (CGMT) theorems which have had far-reaching implications in high-dimensional statistics, machine learning, non-smooth optimization, and signal processing. Both theorems rely on a pair of Gaussian processes, first identified by Slepian, that satisfy Gordon's comparison inequalities. In this paper, we identify such a new pair. The resulting theorems extend the classical GMT and CGMT Theorems from the case where the underlying Gaussian matrix in the primary process has iid rows to where it has independent but non-identically-distributed ones. The new CGMT is applied to the problems of multi-source Gaussian regression, as well as to binary classification of general Gaussian mixture models.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Statistical Machine Learning for Astronomy -- A Textbook
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
MathOptAI.jl: Embed trained machine learning predictors into JuMP models
Inverse Scene Text Removal
EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements
Tailored Architectures for Time Series Forecasting: Evaluating Deep Learning Models on Gaussian Process-Generated Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.