Sciweavers

683 search results - page 42 / 137
» Generalization Bounds for Learning Kernels
Sort
View
144
Voted
ICML
2010
IEEE
15 years 4 months ago
Robust Formulations for Handling Uncertainty in Kernel Matrices
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...
Sahely Bhadra, Sourangshu Bhattacharya, Chiranjib ...
110
Voted
COLT
2007
Springer
15 years 10 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
123
Voted
COLT
1999
Springer
15 years 8 months ago
Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
Robert E. Schapire
131
Voted
ICASSP
2007
IEEE
15 years 10 months ago
Kernel Resolution Synthesis for Superresolution
Abstract— This work considers a combination classificationregression based framework with the proposal of using learned kernels in modified support vector regression to provide...
Karl S. Ni, Truong Nguyen
141
Voted
COLT
2005
Springer
15 years 9 months ago
Localized Upper and Lower Bounds for Some Estimation Problems
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
Tong Zhang