paper-with-me

Papers

Estimation with Norm Regularization

2015-05-09 · NeurIPS 2014 12 · Arindam Banerjee, Sheng Chen, Farideh Fazayeli, Vidyashankar Sivakumar

Analysis of non-asymptotic estimation error and structured statistical recovery based on norm regularized regression, such as Lasso, needs to consider four aspects: the norm, the loss function, the design matrix, and the noise model. This paper presents generalizations of such estimation error analysis on all four aspects compared to the existing literature. We characterize the restricted error set where the estimation error vector lies, establish relations between error sets for the constrained and regularized problems, and present an estimation error bound applicable to any norm. Precise characterizations of the bound is presented for isotropic as well as anisotropic subGaussian design matrices, subGaussian noise models, and convex loss functions, including least squares and generalized linear models. Generic chaining and associated results play an important role in the analysis. A key result from the analysis is that the sample complexity of all such estimators depends on the Gaussian width of a spherical cap corresponding to the restricted error set. Further, once the number of samples $n$ crosses the required sample complexity, the estimation error decreases as $\frac{c}{\sqrt{n}}$, where $c$ depends on the Gaussian width of the unit norm ball.

📄 PDF Abstract BibTeX arXiv:1505.02294

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

DC Algorithm for Estimation of Sparse Gaussian Graphical Models

2024-08-08 · Tomokaze Shiratori, Yuichi Takano

Sparse estimation for Gaussian graphical models is a crucial technique for making the relationships among numerous observed variables more interpretable and quantifiable. Various methods have been proposed, including gra…

Trace norm regularization for multi-task learning with scarce data

2022-02-14 · Etienne Boursier, Mikhail Konobeev, Nicolas Flammarion

Multi-task learning leverages structural similarities between multiple tasks to learn despite very few samples. Motivated by the recent success of neural networks applied to data-scarce tasks, we consider a linear low-di…

Meta-LearningMulti-Task Learning

Regularization-free estimation in trace regression with symmetric positive semidefinite matrices

2015-04-23 · NeurIPS 2015 12 · Martin Slawski, Ping Li, Matthias Hein

Over the past few years, trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing. Estimation of the underlying matrix from regula…

compressed sensingMatrix CompletionQuantum State Tomographyregression

Sparse Regularization in Marketing and Economics

2017-09-01 · Guanhao Feng, Nicholas Polson, Yuexi Wang, Jianeng Xu

Sparse alpha-norm regularization has many data-rich applications in Marketing and Economics. Alpha-norm, in contrast to lasso and ridge regularization, jumps to a sparse solution. This feature is attractive for ultra hig…

Demand ForecastingMarketing

Sparse Estimation with Strongly Correlated Variables using Ordered Weighted L1 Regularization

2014-09-14 · Mario A. T. Figueiredo, Robert D. Nowak

This paper studies ordered weighted L1 (OWL) norm regularization for sparse estimation problems with strongly correlated variables. We prove sufficient conditions for clustering based on the correlation/colinearity of va…

Clustering