Conferences in DBLP

Computational Learning Theory (COLT) (colt)
2008 (conf/colt/2008)

1. 
   The Catch-Up Phenomenon in Bayesian Inference. [Citation Graph (, )][DBLP]
   
   
2. 
   Combinatorial Prediction Markets. [Citation Graph (, )][DBLP]
   
   
3. 
   Unsupervised Learning for Natural Language Processing. [Citation Graph (, )][DBLP]
   
   
4. 
   Concentration Inequalities. [Citation Graph (, )][DBLP]
   
   
5. 
   Learning Mixtures of Product Distributions Using Correlations and Independence. [Citation Graph (, )][DBLP]
   
   
6. 
   Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. [Citation Graph (, )][DBLP]
   
   
7. 
   Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning. [Citation Graph (, )][DBLP]
   
   
8. 
   The True Sample Complexity of Active Learning. [Citation Graph (, )][DBLP]
   
   
9. 
   Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. [Citation Graph (, )][DBLP]
   
   
10. 
    Online Learning of Maximum p-Norm Margin Classifiers with Bias. [Citation Graph (, )][DBLP]
    
    
11. 
    Minimizing Wide Range Regret with Time Selection Functions. [Citation Graph (, )][DBLP]
    
    
12. 
    An Efficient Reduction of Ranking to Classification. [Citation Graph (, )][DBLP]
    
    
13. 
    Learning from Collective Behavior. [Citation Graph (, )][DBLP]
    
    
14. 
    Injective Hilbert Space Embeddings of Probability Measures. [Citation Graph (, )][DBLP]
    
    
15. 
    Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions. [Citation Graph (, )][DBLP]
    
    
16. 
    Teaching Dimensions based on Cooperative Learning. [Citation Graph (, )][DBLP]
    
    
17. 
    On the Power of Membership Queries in Agnostic Learning. [Citation Graph (, )][DBLP]
    
    
18. 
    Dimension and Margin Bounds for Reflection-invariant Kernels. [Citation Graph (, )][DBLP]
    
    
19. 
    Learning Acyclic Probabilistic Circuits Using Test Paths. [Citation Graph (, )][DBLP]
    
    
20. 
    Learning Random Monotone DNF Under the Uniform Distribution. [Citation Graph (, )][DBLP]
    
    
21. 
    Polynomial Regression under Arbitrary Product Distributions. [Citation Graph (, )][DBLP]
    
    
22. 
    How Local Should a Learning Method Be?. [Citation Graph (, )][DBLP]
    
    
23. 
    Learning Coordinate Gradients with Multi-Task Kernels. [Citation Graph (, )][DBLP]
    
    
24. 
    Sparse Recovery in Large Ensembles of Kernel Machines On-Line Learning and Bandits. [Citation Graph (, )][DBLP]
    
    
25. 
    More Efficient Internal-Regret-Minimizing Algorithms. [Citation Graph (, )][DBLP]
    
    
26. 
    Linear Algorithms for Online Multitask Classification. [Citation Graph (, )][DBLP]
    
    
27. 
    Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. [Citation Graph (, )][DBLP]
    
    
28. 
    Combining Expert Advice Efficiently. [Citation Graph (, )][DBLP]
    
    
29. 
    Improved Guarantees for Learning via Similarity Functions. [Citation Graph (, )][DBLP]
    
    
30. 
    Geometric & Topological Representations of Maximum Classes with Applications to Sample Compression. [Citation Graph (, )][DBLP]
    
    
31. 
    On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms. [Citation Graph (, )][DBLP]
    
    
32. 
    Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains. [Citation Graph (, )][DBLP]
    
    
33. 
    High-Probability Regret Bounds for Bandit Online Linear Optimization. [Citation Graph (, )][DBLP]
    
    
34. 
    Adapting to a Changing Environment: the Brownian Restless Bandits. [Citation Graph (, )][DBLP]
    
    
35. 
    Stochastic Linear Optimization under Bandit Feedback. [Citation Graph (, )][DBLP]
    
    
36. 
    Model Selection and Stability in k-means Clustering. [Citation Graph (, )][DBLP]
    
    
37. 
    Relating Clustering Stability to Properties of Cluster Boundaries. [Citation Graph (, )][DBLP]
    
    
38. 
    Finding Metric Structure in Information Theoretic Clustering. [Citation Graph (, )][DBLP]
    
    
39. 
    An Information Theoretic Framework for Multi-view Learning. [Citation Graph (, )][DBLP]
    
    
40. 
    Optimal Stragies and Minimax Lower Bounds for Online Convex Games. [Citation Graph (, )][DBLP]
    
    
41. 
    Regret Bounds for Sleeping Experts and Bandits. [Citation Graph (, )][DBLP]
    
    
42. 
    When Random Play is Optimal Against an Adversary. [Citation Graph (, )][DBLP]
    
    
43. 
    On-line Sequential Bin Packing. [Citation Graph (, )][DBLP]
    
    
44. 
    Time Varying Undirected Graphs. [Citation Graph (, )][DBLP]
    
    
45. 
    Learning in the Limit with Adversarial Disturbances. [Citation Graph (, )][DBLP]
    
    
46. 
    On the Margin Explanation of Boosting Algorithms. [Citation Graph (, )][DBLP]
    
    
47. 
    Adaptive Hausdorff Estimation of Density Level Sets. [Citation Graph (, )][DBLP]
    
    
48. 
    Density Estimation in Linear Time. [Citation Graph (, )][DBLP]
    
    
49. 
    The Learning Power of Evolution. [Citation Graph (, )][DBLP]
    
    
50. 
    A Query Algorithm for Agnostically Learning DNF?. [Citation Graph (, )][DBLP]
    
    
51. 
    Learning Rotations. [Citation Graph (, )][DBLP]