Sciweavers

234 search results - page 1 / 47
» Rademacher Margin Complexity
Sort
View
COLT
2007
Springer
14 years 5 months ago
Rademacher Margin Complexity
Liwei Wang, Jufu Feng
ESANN
2006
14 years 4 days ago
Synthesis of maximum margin and multiview learning using unlabeled data
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
Sándor Szedmák, John Shawe-Taylor
NIPS
2008
14 years 5 days ago
Rademacher Complexity Bounds for Non-I.I.D. Processes
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
Mehryar Mohri, Afshin Rostamizadeh
NIPS
2008
14 years 5 days ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
JMLR
2010
121views more  JMLR 2010»
13 years 5 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor