COLT 2006 - PDF Preprint Papers

COLT 2006 Annual Workshop on Computational Learning Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COLT-2006 Paper

click to vote

COLT
2006
Springer

235views Machine Learning» more COLT 2006»

Learning Bounds for Support Vector Machines with Learned Kernels

13 years 8 months ago

Download www.cs.nyu.edu

Nathan Srebro, Shai Ben-David

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	235	Learning Bounds for Support Vector Machines with Learned Kernels	claim
2	179	Logarithmic Regret Algorithms for Online Convex Optimization	claim
3	168	Uniform Convergence of Adaptive Graph-Based Regularization	claim
4	166	The Rademacher Complexity of Linear Transformation Classes	claim
5	163	Discriminative Learning Can Succeed Where Generative Learning Fails	claim
6	158	Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints	claim
7	157	Mercer's Theorem, Feature Maps, and Smoothing	claim
8	140	Online Learning Meets Optimization in the Dual	claim
9	138	Efficient Learning Algorithms Yield Circuit Lower Bounds	claim
10	136	Maximum Entropy Distribution Estimation with Generalized Regularization	claim
11	132	Online Learning with Variable Stage Duration	claim
12	132	Ranking with a P-Norm Push	claim
13	125	DNF Are Teachable in the Average Case	claim
14	124	Improving Random Projections Using Marginal Information	claim
15	122	Efficient Algorithms for General Active Learning	claim
16	122	Online Variance Minimization	claim
17	121	Learning Rational Stochastic Languages	claim
18	113	Online Multitask Learning	claim
19	108	Active Sampling for Multiple Output Identification	claim
20	108	Competing with Wild Prediction Rules	claim
21	105	Continuous Experts and the Binning Algorithm	claim
22	104	A Sober Look at Clustering Stability	claim
23	104	On Optimal Learning Algorithms for Multiplicity Automata	claim
24	104	Aggregation and Sparsity Via l1 Penalized Least Squares	claim
25	103	The Shortest Path Problem Under Partial Monitoring	claim
26	100	Unifying Divergence Minimization and Statistical Inference Via Convex Duality	claim
27	98	Predictions as Statements and Decisions	claim
28	97	Tracking the Best Hyperplane with a Simple Budget Perceptron	claim
29	96	Online Tracking of Linear Subspaces	claim
30	95	Memory-Limited U-Shaped Learning	claim
31	92	Stable Transductive Learning	claim
32	92	Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition	claim
33	88	Teaching Randomized Learners	claim
34	85	A Randomized Online Learning Algorithm for Better Variance Control	claim
35	63	Online Learning with Constraints	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers