Sciweavers

420 search results - page 1 / 84
» Metric-Based Methods for Adaptive Model Selection and Regula...
Sort
View
ML
2002
ACM
178views Machine Learning» more  ML 2002»
13 years 4 months ago
Metric-Based Methods for Adaptive Model Selection and Regularization
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
Dale Schuurmans, Finnegan Southey
IDA
2003
Springer
13 years 9 months ago
Regularization Methods for Additive Models
This paper tackles the problem of model complexity in the context of additive models. Several methods have been proposed to estimate smoothing parameters, as well as to perform var...
Marta Avalos, Yves Grandvalet, Christophe Ambroise
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 3 days ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
PAMI
2010
132views more  PAMI 2010»
13 years 3 months ago
Maximum Likelihood Model Selection for 1-Norm Soft Margin SVMs with Multiple Parameters
—Adapting the hyperparameters of support vector machines (SVMs) is a challenging model selection problem, especially when flexible kernels are to be adapted and data are scarce....
Tobias Glasmachers, Christian Igel
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
12 years 11 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...