Sciweavers

240 search results - page 33 / 48
» Laplacian Spectrum Learning
Sort
View
NIPS
2001
13 years 10 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 3 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
JMLR
2010
165views more  JMLR 2010»
13 years 3 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
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...
MCAM
2007
Springer
129views Multimedia» more  MCAM 2007»
14 years 2 months ago
Learning Concepts by Modeling Relationships
Supporting multimedia search has emerged as an important research topic. There are three paradigms on the research spectrum that ranges from the least automatic to the most automat...
Yong Rui, Guo-Jun Qi