English
Related papers

Related papers: Classification with Minimax Fast Rates for Classes…

200 papers

Score-based diffusion models, while achieving minimax optimality for sampling, are often hampered by slow sampling speeds due to the high computational burden of score function evaluations. Despite the recent remarkable empirical advances…

Machine Learning · Computer Science 2025-02-27 Gen Li , Changxiao Cai

Datasets are rarely a realistic approximation of the target population. Say, prevalence is misrepresented, image quality is above clinical standards, etc. This mismatch is known as sampling bias. Sampling biases are a major hindrance for…

For statistical modeling wherein the data regime is unfavorable in terms of dimensionality relative to the sample size, finding hidden sparsity in the ground truth can be critical in formulating an accurate statistical model. The so-called…

Optimization and Control · Mathematics 2025-08-04 Matteo Bergamaschi , Andrea Cristofari , Vyacheslav Kungurtsev , Francesco Rinaldi

The ranking problem is to order a collection of units by some unobserved parameter, based on observations from the associated distribution. This problem arises naturally in a number of contexts, such as business, where we may want to rank…

Statistics Theory · Mathematics 2019-09-04 Toby Kenney

We develop minimax optimal risk bounds for the general learning task consisting in predicting as well as the best function in a reference set $\mathcal{G}$ up to the smallest possible additive term, called the convergence rate. When the…

Statistics Theory · Mathematics 2009-09-09 Jean-Yves Audibert

We consider high-dimensional multiclass classification by sparse multinomial logistic regression. Unlike binary classification, in the multiclass setup one can think about an entire spectrum of possible notions of sparsity associated with…

Statistics Theory · Mathematics 2023-01-18 Tomer Levy , Felix Abramovich

Sparse feature selection is necessary when we fit statistical models, we have access to a large group of features, don't know which are relevant, but assume that most are not. Alternatively, when the number of features is larger than the…

Applications · Statistics 2017-04-04 Emiliano Diaz

Sparse Bayesian factor models are routinely implemented for parsimonious dependence modeling and dimensionality reduction in high-dimensional applications. We provide theoretical understanding of such Bayesian procedures in terms of…

Statistics Theory · Mathematics 2014-06-03 Debdeep Pati , Anirban Bhattacharya , Natesh S. Pillai , David Dunson

Learning governing equations allows for deeper understanding of the structure and dynamics of data. We present a random sampling method for learning structured dynamical systems from under-sampled and possibly noisy state-space…

Information Theory · Computer Science 2018-05-14 Hayden Schaeffer , Giang Tran , Rachel Ward , Linan Zhang

This paper investigates the high-dimensional linear regression with highly correlated covariates. In this setup, the traditional sparsity assumption on the regression coefficients often fails to hold, and consequently many model selection…

Methodology · Statistics 2019-03-26 Jianqing Fan , Bai Jiang , Qiang Sun

The sample mean is often used to aggregate different unbiased estimates of a parameter, producing a final estimate that is unbiased but possibly high-variance. This paper introduces the Bayesian median of means, an aggregation rule that…

Statistics Theory · Mathematics 2019-06-05 Paulo Orenstein

We consider the problem of predicting as well as the best linear combination of d given functions in least squares regression under L^\infty constraints on the linear combination. When the input distribution is known, there already exists…

Statistics Theory · Mathematics 2011-09-14 Jean-Yves Audibert , Olivier Catoni

Sparse linear regression is a central problem in high-dimensional statistics. We study the correlated random design setting, where the covariates are drawn from a multivariate Gaussian $N(0,\Sigma)$, and we seek an estimator with small…

Data Structures and Algorithms · Computer Science 2023-05-29 Jonathan Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

We derive optimal rates of convergence in the supremum norm for estimating the H\"older-smooth mean function of a stochastic process which is repeatedly and discretely observed with additional errors at fixed, multivariate, synchronous…

Statistics Theory · Mathematics 2024-05-09 Max Berger , Philipp Hermann , Hajo Holzmann

In this article we investigate consistency of selection in regression models via the popular Lasso method. Here we depart from the traditional linear regression assumption and consider approximations of the regression function $f$ with…

Statistics Theory · Mathematics 2008-12-18 Florentina Bunea

This work considers methods for imposing sparsity in Bayesian regression with applications in nonlinear system identification. We first review automatic relevance determination (ARD) and analytically demonstrate the need to additional…

Machine Learning · Statistics 2021-02-24 Samuel H. Rudy , Themistoklis P. Sapsis

For the Gaussian sequence model, we obtain non-asymptotic minimax rates of estimation of the linear, quadratic and the L2-norm functionals on classes of sparse vectors and construct optimal estimators that attain these rates. The main…

Statistics Theory · Mathematics 2015-02-04 Olivier Collier , Laëtitia Comminges , Alexandre B. Tsybakov

This paper offers a qualitative insight into the convergence of Bayesian parameter inference in a setup which mimics the modeling of the spread of a disease with associated disease measurements. Specifically, we are interested in the…

Statistics Theory · Mathematics 2022-12-08 Samuel Bronstein , Stefan Engblom , Robin Marin

We develop a Bayesian approach for selecting the model which is the most supported by the data within a class of marginal models for categorical variables formulated through equality and/or inequality constraints on generalised logits…

Statistics Theory · Mathematics 2012-02-21 Francesco Bartolucci , Luisa Scaccia , Alessio Farcomeni

We design a new distribution over $\poly(r \eps^{-1}) \times n$ matrices $S$ so that for any fixed $n \times d$ matrix $A$ of rank $r$, with probability at least 9/10, $\norm{SAx}_2 = (1 \pm \eps)\norm{Ax}_2$ simultaneously for all $x \in…

Data Structures and Algorithms · Computer Science 2013-04-08 Kenneth L. Clarkson , David P. Woodruff
‹ Prev 1 4 5 6 7 8 10 Next ›