User-friendly introduction to PAC-Bayes bounds

P Alquier - Foundations and Trends® in Machine Learning, 2024 - nowpublishers.com
Aggregated predictors are obtained by making a set of basic predictors vote according to
some weights, that is, to some probability distribution. Randomized predictors are obtained …

Quasi-oracle estimation of heterogeneous treatment effects

X Nie, S Wager - Biometrika, 2021 - academic.oup.com
Flexible estimation of heterogeneous treatment effects lies at the heart of many statistical
applications, such as personalized medicine and optimal resource allocation. In this article …

Policy learning with observational data

S Athey, S Wager - Econometrica, 2021 - Wiley Online Library
In many areas, practitioners seek to use observational data to learn a treatment assignment
policy that satisfies application‐specific constraints, such as budget, fairness, simplicity, or …

Efficient policy learning

S Athey, S Wager - 2017 - ideas.repec.org
There has been considerable interest across several fields in methods that reduce the
problem of learning good treatment assignment policies to the problem of accurate policy …

Concentration inequalities

S Boucheron, G Lugosi, O Bousquet - Summer school on machine learning, 2003 - Springer
Concentration inequalities deal with deviations of functions of independent random
variables from their expectation. In the last decade new tools have been introduced making …

The tradeoffs of large scale learning

L Bottou, O Bousquet - Advances in neural information …, 2007 - proceedings.neurips.cc
This contribution develops a theoretical framework that takes into account the effect of
approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for …

Convexity, classification, and risk bounds

PL Bartlett, MI Jordan, JD McAuliffe - Journal of the American …, 2006 - Taylor & Francis
Many of the classification algorithms developed in the machine learning literature, including
the support vector machine and boosting, can be viewed as minimum contrast methods that …

Minimal penalties and the slope heuristics: a survey

S Arlot - Journal de la société française de statistique, 2019 - numdam.org
Birgé and Massart proposed in 2001 the slope heuristics as a way to choose optimally from
data an unknown multiplicative constant in front of a penalty. It is built upon the notion of …

[图书][B] Oracle inequalities in empirical risk minimization and sparse recovery problems: École D'Été de Probabilités de Saint-Flour XXXVIII-2008

V Koltchinskii - 2011 - books.google.com
The purpose of these lecture notes is to provide an introduction to the general theory of
empirical risk minimization with an emphasis on excess risk bounds and oracle inequalities …

Local rademacher complexities

PL Bartlett, O Bousquet, S Mendelson - 2005 - projecteuclid.org
We propose new bounds on the error of learning algorithms in terms of a data-dependent
notion of complexity. The estimates we establish give optimal rates and are based on a local …