Regularization, sparse recovery, and median-of-means tournaments
نویسندگان
چکیده
منابع مشابه
Sparse Recovery via Partial Regularization: Models, Theory and Algorithms
In the context of sparse recovery, it is known that most of existing regularizers such as `1 suffer from some bias incurred by some leading entries (in magnitude) of the associated vector. To neutralize this bias, we propose a class of models with partial regularizers for recovering a sparse solution of a linear system. We show that every local minimizer of these models is sufficiently sparse o...
متن کاملRegularization and the Small - Ball Method I : Sparse Recovery
when Ψ is a norm and F is convex. Our approach gives a common framework that may be used in the analysis of learning problems and regularization problems alike. In particular, it sheds some light on the role various notions of sparsity have in regularization and on their connection with the size of subdifferentials of Ψ in a neighbourhood of the true minimizer. As ‘proof of concept’ we extend t...
متن کامل2 A ug 2 01 6 Risk minimization by median - of - means tournaments ∗
We consider the classical statistical learning/regression problem, when the value of a real random variable Y is to be predicted based on the observation of another random variableX . Given a class of functions F and a sample of independent copies of (X,Y ), one needs to choose a function f̂ from F such that f̂(X) approximates Y as well as possible, in the mean-squared sense. We introduce a new p...
متن کاملNon-convex Sparse Regularization
We study the regularising properties of Tikhonov regularisation on the sequence space l with weighted, non-quadratic penalty term acting separately on the coefficients of a given sequence. We derive sufficient conditions for the penalty term that guarantee the well-posedness of the method, and investigate to which extent the same conditions are also necessary. A particular interest of this pape...
متن کاملSparse Trace Norm Regularization
We study the problem of estimating multiple predictive functions from a dictionary of basis functions in the nonparametric regression setting. Our estimation scheme assumes that each predictive function can be estimated in the form of a linear combination of the basis functions. By assuming that the coefficient matrix admits a sparse low-rank structure, we formulate the function estimation prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2019
ISSN: 1350-7265
DOI: 10.3150/18-bej1046