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 …

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration

J Altschuler, J Niles-Weed… - Advances in neural …, 2017 - proceedings.neurips.cc
Computing optimal transport distances such as the earth mover's distance is a fundamental
problem in machine learning, statistics, and computer vision. Despite the recent introduction …

Stochastic first-and zeroth-order methods for nonconvex stochastic programming

S Ghadimi, G Lan - SIAM journal on optimization, 2013 - SIAM
In this paper, we introduce a new stochastic approximation type algorithm, namely, the
randomized stochastic gradient (RSG) method, for solving an important class of nonlinear …

Inconsistency of Bayesian inference for misspecified linear models, and a proposal for repairing it

P Grünwald, T Van Ommen - 2017 - projecteuclid.org
Supplementary material of “Inconsistency of Bayesian Inference for Misspecified Linear
Models, and a Proposal for Repairing It”. In this paper, we described a problem for Bayesian …

[图书][B] Sparse image and signal processing: wavelets, curvelets, morphological diversity

JL Starck, F Murtagh, JM Fadili - 2010 - books.google.com
This book presents the state of the art in sparse and multiscale image and signal processing,
covering linear multiscale transforms, such as wavelet, ridgelet, or curvelet transforms, and …

An optimal method for stochastic composite optimization

G Lan - Mathematical Programming, 2012 - Springer
This paper considers an important class of convex programming (CP) problems, namely, the
stochastic composite optimization (SCO), whose objective function is given by the …

Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework

S Ghadimi, G Lan - SIAM Journal on Optimization, 2012 - SIAM
In this paper we present a generic algorithmic framework, namely, the accelerated stochastic
approximation (AC-SA) algorithm, for solving strongly convex stochastic composite …

Stochastic quasi-Newton methods for nonconvex stochastic optimization

X Wang, S Ma, D Goldfarb, W Liu - SIAM Journal on Optimization, 2017 - SIAM
In this paper we study stochastic quasi-Newton methods for nonconvex stochastic
optimization, where we assume that noisy information about the gradients of the objective …

Aggregation for Gaussian regression

F Bunea, AB Tsybakov, MH Wegkamp - 2007 - projecteuclid.org
This paper studies statistical aggregation procedures in the regression setting. A motivating
factor is the existence of many different methods of estimation, leading to possibly competing …

Regularization in statistics

PJ Bickel, B Li, AB Tsybakov, SA van de Geer, B Yu… - Test, 2006 - Springer
This paper is a selective review of the regularization methods scattered in statistics literature.
We introduce a general conceptual approach to regularization and fit most existing methods …