Conferences in DBLP

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

1. Michael L. Littman
   Tutorial: Learning Topics in Game-Theoretic Decision Making. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:1- [Conf]
   
2. Amy R. Greenwald, Amir Jafari
   A General Class of No-Regret Learning Algorithms and Game-Theoretic Equilibria. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:2-12 [Conf]
   
3. Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich
   Preference Elicitation and Query Learning. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:13-25 [Conf]
   
4. Adam Kalai, Santosh Vempala
   Efficient Algorithms for Online Decision Problems. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:26-40 [Conf]
   
5. Corinna Cortes, Patrick Haffner, Mehryar Mohri
   Positive Definite Rational Kernels. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:41-56 [Conf]
   
6. Tony Jebara, Risi Imre Kondor
   Bhattacharyya Expected Likelihood Kernels. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:57-71 [Conf]
   
7. Matthias Hein, Olivier Bousquet
   Maximal Margin Classification for Metric Spaces. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:72-86 [Conf]
   
8. Roni Khardon, Rocco A. Servedio
   Maximum Margin Algorithms with Boolean Kernels. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:87-101 [Conf]
   
9. Glenn Fung, Olvi L. Mangasarian, Jude W. Shavlik
   Knowledge-Based Nonlinear Kernel Classifiers. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:102-113 [Conf]
   
10. Christina S. Leslie, Rui Kuang
    Fast Kernels for Inexact String Matching. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:114-128 [Conf]
    
11. Thomas Gärtner, Peter A. Flach, Stefan Wrobel
    On Graph Kernels: Hardness Results and Efficient Alternatives. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:129-143 [Conf]
    
12. Alex J. Smola, Risi Imre Kondor
    Kernels and Regularization on Graphs. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:144-158 [Conf]
    
13. Ilya Desyatnikov, Ron Meir
    Data-Dependent Bounds for Multi-category Classification Based on Convex Losses. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:159-172 [Conf]
    
14. Marina Meila
    Comparing Clusterings by the Variation of Information. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:173-187 [Conf]
    
15. Fei Sha, Lawrence K. Saul, Daniel D. Lee
    Multiplicative Updates for Large Margin Classifiers. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:188-202 [Conf]
    
16. David A. McAllester
    Simplified PAC-Bayesian Margin Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:203-215 [Conf]
    
17. Michinari Momma, Kristin P. Bennett
    Sparse Kernel Partial Least Squares Regression. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:216-230 [Conf]
    
18. Shantanu Chakrabartty, Gert Cauwenberghs, Jayadeva
    Sparse Probability Regression by Label Partitioning. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:231-242 [Conf]
    
19. Jinbo Bi, Vladimir Vapnik
    Learning with Rigorous Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:243-257 [Conf]
    
20. Balázs Kégl
    Robust Regression by Boosting the Median. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:258-272 [Conf]
    
21. Sanjoy Dasgupta, Philip M. Long
    Boosting with Diverse Base Classifiers. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:273-287 [Conf]
    
22. Jaz S. Kandola, Thore Graepel, John Shawe-Taylor
    Reducing Kernel Matrix Diagonal Dominance Using Semi-definite Programming. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:288-302 [Conf]
    
23. Alexandre B. Tsybakov
    Optimal Rates of Aggregation. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:303-313 [Conf]
    
24. Ulrike von Luxburg, Olivier Bousquet
    Distance-Based Classification with Lipschitz Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:314-328 [Conf]
    
25. Shahar Mendelson, Petra Philips
    Random Subclass Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:329-343 [Conf]
    
26. Avrim Blum, John Langford
    PAC-MDL Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:344-357 [Conf]
    
27. Vladimir Vovk
    Universal Well-Calibrated Algorithm for On-Line Classification. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:358-372 [Conf]
    
28. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:373-387 [Conf]
    
29. Koby Crammer, Yoram Singer
    Learning Algorithm for Enclosing Points in Bregmanian Spheres. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:388-402 [Conf]
    
30. Gilles Stoltz, Gábor Lugosi
    Internal Regret in On-Line Portfolio Selection. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:403-417 [Conf]
    
31. Shie Mannor, John N. Tsitsiklis
    Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:418-432 [Conf]
    
32. Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
    Smooth e-Intensive Regression by Loss Symmetrization. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:433-447 [Conf]
    
33. Nina Mishra, Dana Ron, Ram Swaminathan
    On Finding Large Conjunctive Clusters. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:448-462 [Conf]
    
34. Adam Klivans, Amir Shpilka
    Learning Arithmetic Circuits via Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:463-476 [Conf]
    
35. Malik Magdon-Ismail, Joseph Sill
    Using a Linear Fit to Determine Monotonicity Directions. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:477-491 [Conf]
    
36. Vladimir Koltchinskii, Dmitry Panchenko, Savina Andonova
    Generalization Bounds for Voting Classifiers Based on Sparsity and Clustering. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:492-505 [Conf]
    
37. Marcus Hutter
    Sequence Prediction Based on Monotone Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:506-521 [Conf]
    
38. Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
    How Many Strings Are Easy to Predict? [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:522-536 [Conf]
    
39. Marta Arias, Roni Khardon, Rocco A. Servedio
    Polynomial Certificates for Propositional Classes. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:537-551 [Conf]
    
40. Shie Mannor, Nahum Shimkin
    On-Line Learning with Imperfect Monitoring. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:552-566 [Conf]
    
41. Shai Ben-David, Reba Schuller
    Exploiting Task Relatedness for Mulitple Task Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:567-580 [Conf]
    
42. Eyal Even-Dar, Yishay Mansour
    Approximate Equivalence of Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:581-594 [Conf]
    
43. Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
    An Information Theoretic Tradeoff between Complexity and Accuracy. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:595-609 [Conf]
    
44. Jeffrey C. Jackson, Rocco A. Servedio
    Learning Random Log-Depth Decision Trees under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:610-624 [Conf]
    
45. Robert H. Sloan, Balázs Szörényi, György Turán
    Projective DNF Formulae and Their Revision. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:625-639 [Conf]
    
46. Aharon Bar-Hillel, Daphna Weinshall
    Learning with Equivalence Constraints and the Relation to Multiclass Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:640-654 [Conf]
    
47. Michael Collins
    Tutorial: Machine Learning Methods in Natural Language Processing. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:655- [Conf]
    
48. Mehryar Mohri
    Learning from Uncertain Data. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:656-670 [Conf]
    
49. Mark Johnson
    Learning and Parsing Stochastic Unification-Based Grammars. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:671-683 [Conf]
    
50. John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer
    Generality's Price: Inescapable Deficiencies in Machine-Learned Programs. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:684-698 [Conf]
    
51. John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
    On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:699-713 [Conf]
    
52. Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
    Learning All Subfunctions of a Function. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:714-728 [Conf]
    
53. Amiran Ambroladze, John Shawe-Taylor
    When Is Small Beautiful? [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:729-730 [Conf]
    
54. Avrim Blum
    Learning a Function of r Relevant Variables. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:731-733 [Conf]
    
55. Sanjoy Dasgupta
    Subspace Detection: A Robust Statistics Formulation. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:734- [Conf]
    
56. Sanjoy Dasgupta
    How Fast Is k-Means? [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:735- [Conf]
    
57. Yoav Freund, Alon Orlitsky, Prasad Santhanam, Junan Zhang
    Universal Coding of Zipf Distributions. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:736-737 [Conf]
    
58. Marcus Hutter
    An Open Problem Regarding the Convergence of Universal A Priori Probability. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:738-740 [Conf]
    
59. Vladimir Koltchinskii
    Entropy Bounds for Restricted Convex Hulls. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:741-742 [Conf]
    
60. Manfred K. Warmuth
    Compressing to VC Dimension Many Points. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:743-744 [Conf]