COLT 2005 - PDF Preprint Papers

COLT 2005 Annual Workshop on Computational Learning Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COLT-2005 Paper

click to vote

COLT
2005
Springer

159views Machine Learning» more COLT 2005»

Optimum Follow the Leader Algorithm

14 years 5 months ago

Download users.soe.ucsc.edu

Dima Kuzmin, Manfred K. Warmuth

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	159	Optimum Follow the Leader Algorithm	claim
2	131	Margin-Based Ranking Meets Boosting in the Middle	claim
3	131	A New Perspective on an Old Perceptron Algorithm	claim
4	128	Analysis of Perceptron-Based Active Learning	claim
5	128	From External to Internal Regret	claim
6	127	Towards a Theoretical Foundation for Laplacian-Based Manifold Methods	claim
7	126	Learning a Hidden Hypergraph	claim
8	126	Learning Convex Combinations of Continuously Parameterized Basic Kernels	claim
9	122	A PAC-Style Model for Learning from Labeled and Unlabeled Data	claim
10	122	Rank, Trace-Norm and Max-Norm	claim
11	115	Learnability of Bipartite Ranking Functions	claim
12	115	Approximating a Gram Matrix for Improved Kernel-Based Learning	claim
13	113	Unlabeled Compression Schemes for Maximum Classes,	claim
14	113	Ranking and Scoring Using Empirical Risk Minimization	claim
15	109	Permutation Tests for Classification	claim
16	109	Data Dependent Concentration Bounds for Sequential Prediction Algorithms	claim
17	108	From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians	claim
18	106	Competitive Collaborative Learning	claim
19	106	General Polynomial Time Decomposition Algorithms	claim
20	106	Martingale Boosting	claim
21	103	Trading in Markovian Price Models	claim
22	100	Stability and Generalization of Bipartite Ranking Algorithms	claim
23	100	Generalization Error Bounds Using Unlabeled Data	claim
24	99	Improved Second-Order Bounds for Prediction with Expert Advice	claim
25	94	Separating Models of Learning from Correlated and Uncorrelated Data	claim
26	93	Localized Upper and Lower Bounds for Some Estimation Problems	claim
27	93	Loss Bounds for Online Category Ranking	claim
28	91	On Spectral Learning of Mixtures of Distributions	claim
29	91	Leaving the Span	claim
30	90	Tracking the Best of Many Experts	claim
31	75	Variations on U-Shaped Learning	claim
32	74	The Value of Agreement, a New Boosting Algorithm	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers