English
Related papers

Related papers: Variable selection with Hamming loss

200 papers

We apply FDR thresholding to a non-Gaussian vector whose coordinates X_i, i=1,..., n, are independent exponential with individual means $\mu_i$. The vector $\mu =(\mu_i)$ is thought to be sparse, with most coordinates 1 but a small fraction…

Statistics Theory · Mathematics 2009-09-29 David Donoho , Jiashun Jin

In this work we are interested in the problems of supervised learning and variable selection when the input-output dependence is described by a nonlinear function depending on a few variables. Our goal is to consider a sparse nonparametric…

Machine Learning · Statistics 2012-08-14 Lorenzo Rosasco , Silvia Villa , Sofia Mosci , Matteo Santoro , Alessandro verri

For Gaussian sampling matrices, we provide bounds on the minimal number of measurements $m$ required to achieve robust weighted sparse recovery guarantees in terms of how well a given prior model for the sparsity support aligns with the…

Numerical Analysis · Mathematics 2016-05-04 Bubacarr Bah , Rachel Ward

Variable selection for recovering sparsity in nonadditive nonparametric models has been challenging. This problem becomes even more difficult due to complications in modeling unknown interaction terms among high dimensional variables. There…

Methodology · Statistics 2012-06-14 Zaili Fang , Inyoung Kim , Patrick Schaumont

We investigate the frequentist guarantees of the variational sparse Gaussian process regression model. In the theoretical analysis, we focus on the variational approach with spectral features as inducing variables. We derive guarantees and…

Statistics Theory · Mathematics 2023-09-29 Dennis Nieman , Botond Szabo , Harry van Zanten

In the context of linear regression, we construct a data-driven convex loss function with respect to which empirical risk minimisation yields optimal asymptotic variance in the downstream estimation of the regression coefficients. At the…

Statistics Theory · Mathematics 2025-05-29 Oliver Y. Feng , Yu-Chun Kao , Min Xu , Richard J. Samworth

We are concerned with minimax signal detection. In this setting, we discuss non-asymptotic and asymptotic approaches through a unified treatment. In particular, we consider a Gaussian sequence model that contains classical models as special…

Statistics Theory · Mathematics 2016-01-27 Clement Marteau , Theofanis Sapatinas

Consider a Bernoulli-Gaussian complex $n$-vector whose components are $V_i = X_i B_i$, with $X_i \sim \Cc\Nc(0,\Pc_x)$ and binary $B_i$ mutually independent and iid across $i$. This random $q$-sparse vector is multiplied by a square random…

Information Theory · Computer Science 2015-03-20 Antonia Tulino , Giuseppe Caire , Sergio Verdu' , Shlomo Shamai

A standard approach to computing expectations with respect to a given target measure is to introduce an overdamped Langevin equation which is reversible with respect to the target distribution, and to approximate the expectation by a…

Numerical Analysis · Mathematics 2016-04-20 A. B. Duncan , T. Lelievre , G. A. Pavliotis

We consider $n$ independent $p$-dimensional Gaussian vectors with covariance matrix having Toeplitz structure. We test that these vectors have independent components against a stationary distribution with sparse Toeplitz covariance matrix,…

Statistics Theory · Mathematics 2021-02-16 Nayel Bettache , Cristina Butucea , Marianne Sorba

The objective of the present paper is to develop a minimax theory for the varying coefficient model in a non-asymptotic setting. We consider a high-dimensional sparse varying coefficient model where only few of the covariates are present…

Statistics Theory · Mathematics 2014-05-16 Olga Klopp , Marianna Pensky

In this paper we continue to develop the following general approach. We study asymptotic behavior of the errors of sampling recovery not for an individual smoothness class, how it is usually done, but for the collection of classes, which…

Numerical Analysis · Mathematics 2026-01-14 V. Temlyakov

Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as $\ell_1$-minimization find the sparsest solution to certain systems of equations. Random…

Information Theory · Computer Science 2011-08-17 Ulaş Ayaz , Holger Rauhut

The standard margin-based structured prediction commonly uses a maximum loss over all possible structured outputs. The large-margin formulation including latent variables not only results in a non-convex formulation but also increases the…

Machine Learning · Computer Science 2019-06-25 Kevin Bello , Jean Honorio

Let $K_n$ be the convex hull of i.i.d. random variables distributed according to the standard normal distribution on $\R^d$. We establish variance asymptotics as $n \to \infty$ for the re-scaled intrinsic volumes and $k$-face functionals of…

Probability · Mathematics 2014-09-30 Pierre Calka , J. E. Yukich

Estimation and prediction problems for dense signals are often framed in terms of minimax problems over highly symmetric parameter spaces. In this paper, we study minimax problems over l2-balls for high-dimensional linear models with…

Statistics Theory · Mathematics 2012-03-22 Lee Dicker

The field of discrete event simulation and optimization techniques motivates researchers to adjust classic ranking and selection (R&S) procedures to the settings where the number of populations is large. We use insights from extreme value…

Statistics Theory · Mathematics 2017-11-27 Royi Jacobovic , Or Zuk

Given a heterogeneous Gaussian sequence model with unknown mean $\theta \in \mathbb R^d$ and known covariance matrix $\Sigma = \operatorname{diag}(\sigma_1^2,\dots, \sigma_d^2)$, we study the signal detection problem against sparse…

Statistics Theory · Mathematics 2023-08-03 Julien Chhor , Rajarshi Mukherjee , Subhabrata Sen

Contemporary focus on selective inference has renewed interest in the theory of selection models. In this paper, we analyze the asymptotic properties of selection models built on independent and identically distributed observations. We show…

Statistics Theory · Mathematics 2026-03-16 Daniel G. Rasines , G. Alastair Young

This paper investigates the asymptotic behavior of the soft-margin and hard-margin support vector machine (SVM) classifiers for simultaneously high-dimensional and numerous data (large $n$ and large $p$ with $n/p\to\delta$) drawn from a…

Information Theory · Computer Science 2020-03-31 Abla Kammoun , Mohamed-Slim Alouini