Sciweavers

31 search results - page 6 / 7
» Learning Rates of Least-Square Regularized Regression
Sort
View
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 4 months ago
Smoothing Proximal Gradient Method for General Structured Sparse Learning
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 8 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
KDD
2009
ACM
215views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale sparse logistic regression
Logistic Regression is a well-known classification method that has been used widely in many applications of data mining, machine learning, computer vision, and bioinformatics. Spa...
Jun Liu, Jianhui Chen, Jieping Ye
ICML
2008
IEEE
14 years 9 months ago
Bolasso: model consistent Lasso estimation through the bootstrap
We consider the least-square linear regression problem with regularization by the 1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptot...
Francis R. Bach
AAAI
2010
13 years 10 months ago
Bayesian Matrix Factorization with Side Information and Dirichlet Process Mixtures
Matrix factorization is a fundamental technique in machine learning that is applicable to collaborative filtering, information retrieval and many other areas. In collaborative fil...
Ian Porteous, Arthur Asuncion, Max Welling