.png){kind=icon}
Return
OPTIMAL LEARNING WITH Q-AGGREGATION
.png){kind=icon}
OA
AI
DOI：10.1214/13-AOS1190.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a general supervised learning problem with strongly convex and Lipschitz loss and study the problem of model selection aggregation. In particular, given a finite dictionary functions (learners) together with the prior, we generalize the results obtained by Dai, Rigollet and Zhang [Ann. Statist. 40 (2012) 1878-1905] for Gaussian regression with squared loss and fixed design to this learning setup. Specifically, we prove that the Q-aggregation procedure outputs an estimator that satisfies optimal oracle inequalities both in expectation and with high probability. Our proof techniques somewhat depart from traditional proofs by making most of the standard arguments on the Laplace transform of the empirical process to be controlled.
Keywords:
Learning theory
empirical risk minimization
aggregation
empirical processes theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
Cited Papers
ShareSaveShareSaveKULLBACK-LEIBLER AGGREGATION AND MISSPECIFIED GENERALIZED LINEAR MODELS.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAIShareSaveShareSaveShareSaveShareSaveAggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsityMACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAIShareSave
View more