COLT 2004 - PDF Preprint Papers

COLT 2004 Annual Workshop on Computational Learning Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COLT-2004 Paper

click to vote

COLT
2004
Springer

164views Machine Learning» more COLT 2004»

Model Selection by Bootstrap Penalization for Classification

13 years 8 months ago

Download www.cmla.ens-cachan.fr

We consider the binary classification problem. Given an i.i.d. sample drawn from the distribution of an X

Magalie Fromont

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	164	Model Selection by Bootstrap Penalization for Classification	claim
2	161	Oracle Bounds and Exact Algorithm for Dyadic Classification Trees	claim
3	149	Convergence of Discrete MDL for Sequential Prediction	claim
4	147	The Budgeted Multi-armed Bandit Problem	claim
5	132	On the Convergence of Spectral Clustering on Random Samples: The Normalized Case	claim
6	132	Boosting Based on a Smooth Margin	claim
7	130	Performance Guarantees for Regularized Maximum Entropy Density Estimation	claim
8	114	Minimizing Regret with Label Efficient Prediction	claim
9	112	Data Dependent Risk Bounds for Hierarchical Mixture of Experts Classifiers	claim
10	112	Regret Bounds for Hierarchical Classification with Linear-Threshold Functions	claim
11	109	Concentration Bounds for Unigrams Language Model	claim
12	108	Statistical Properties of Kernel Principal Component Analysis	claim
13	102	Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results	claim
14	102	Regularization and Semi-supervised Learning on Large Graphs	claim
15	99	Learning Classes of Probabilistic Automata	claim
16	99	Deterministic Calibration and Nash Equilibrium	claim
17	99	Reinforcement Learning for Average Reward Zero-Sum Games	claim
18	98	The Optimal PAC Algorithm	claim
19	96	Learning a Hidden Graph Using O(log n) Queries Per Edge	claim
20	96	Graphical Economics	claim
21	94	Toward Attribute Efficient Learning of Decision Lists and Parities	claim
22	93	A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra	claim
23	91	Inferring Mixtures of Markov Chains	claim
24	91	A New PAC Bound for Intersection-Closed Concept Classes	claim
25	89	A Function Representation for Learning in Banach Spaces	claim
26	87	Replacing Limit Learners with Equally Powerful One-Shot Query Learners	claim
27	82	Learning Monotonic Linear Functions	claim
28	81	Suboptimal Behavior of Bayes and MDL in Classification Under Misspecification	claim
29	78	Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary	claim
30	77	An Inequality for Nearly Log-Concave Distributions with Applications to Learning	claim
31	76	Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability	claim
32	72	Local Complexities for Empirical Risk Minimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers