The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Stéphan Clémençon, Gábor Lugosi, Nicolas Vayatis
    Ranking and Scoring Using Empirical Risk Minimization. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:1-15 [Conf]
  2. Shivani Agarwal, Dan Roth
    Learnability of Bipartite Ranking Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:16-31 [Conf]
  3. Shivani Agarwal, Partha Niyogi
    Stability and Generalization of Bipartite Ranking Algorithms. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:32-47 [Conf]
  4. Koby Crammer, Yoram Singer
    Loss Bounds for Online Category Ranking. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:48-62 [Conf]
  5. Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robert E. Schapire
    Margin-Based Ranking Meets Boosting in the Middle. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:63-78 [Conf]
  6. Philip M. Long, Rocco A. Servedio
    Martingale Boosting. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:79-94 [Conf]
  7. Boaz Leskes
    The Value of Agreement, a New Boosting Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:95-110 [Conf]
  8. Maria-Florina Balcan, Avrim Blum
    A PAC-Style Model for Learning from Labeled and Unlabeled Data. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:111-126 [Conf]
  9. Matti Kääriäinen
    Generalization Error Bounds Using Unlabeled Data. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:127-142 [Conf]
  10. Ambuj Tewari, Peter L. Bartlett
    On the Consistency of Multiclass Classification Methods. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:143-157 [Conf]
  11. John Langford, Alina Beygelzimer
    Sensitive Error Correcting Output Codes. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:158-172 [Conf]
  12. Tong Zhang
    Data Dependent Concentration Bounds for Sequential Prediction Algorithms. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:173-187 [Conf]
  13. Yuri Kalnishkan, Michael V. Vyugin
    The Weak Aggregating Algorithm and Weak Mixability. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:188-203 [Conf]
  14. András György, Tamás Linder, Gábor Lugosi
    Tracking the Best of Many Experts. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:204-216 [Conf]
  15. Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz
    Improved Second-Order Bounds for Prediction with Expert Advice. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:217-232 [Conf]
  16. Baruch Awerbuch, Robert D. Kleinberg
    Competitive Collaborative Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:233-248 [Conf]
  17. Sanjoy Dasgupta, Adam Tauman Kalai, Claire Monteleoni
    Analysis of Perceptron-Based Active Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:249-263 [Conf]
  18. Shai Shalev-Shwartz, Yoram Singer
    A New Perspective on an Old Perceptron Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:264-278 [Conf]
  19. Ingo Steinwart, Clint Scovel
    Fast Rates for Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:279-294 [Conf]
  20. Vladimir Koltchinskii, Olexandra Beznosova
    Exponential Convergence Rates in Classification. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:295-307 [Conf]
  21. Nikolas List, Hans-Ulrich Simon
    General Polynomial Time Decomposition Algorithms. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:308-322 [Conf]
  22. Petros Drineas, Michael W. Mahoney
    Approximating a Gram Matrix for Improved Kernel-Based Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:323-337 [Conf]
  23. Andreas Argyriou, Charles A. Micchelli, Massimiliano Pontil
    Learning Convex Combinations of Continuously Parameterized Basic Kernels. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:338-352 [Conf]
  24. Shahar Mendelson
    On the Limitations of Embedding Methods. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:353-365 [Conf]
  25. Manfred K. Warmuth, S. V. N. Vishwanathan
    Leaving the Span. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:366-381 [Conf]
  26. Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan
    Variations on U-Shaped Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:382-397 [Conf]
  27. Wei Luo, Oliver Schulte
    Mind Change Efficient Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:398-412 [Conf]
  28. Eric Martin, Arun Sharma
    On a Syntactic Characterization of Classification with a Mind Change Bound. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:413-428 [Conf]
  29. Shahar Mendelson, A. Pajor
    Ellipsoid Approximation Using Random Vectors. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:429-443 [Conf]
  30. Ravindran Kannan, Hadi Salmasian, Santosh Vempala
    The Spectral Method for General Mixture Models. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:444-457 [Conf]
  31. Dimitris Achlioptas, Frank McSherry
    On Spectral Learning of Mixtures of Distributions. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:458-469 [Conf]
  32. Matthias Hein, Jean-Yves Audibert, Ulrike von Luxburg
    From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:470-485 [Conf]
  33. Mikhail Belkin, Partha Niyogi
    Towards a Theoretical Foundation for Laplacian-Based Manifold Methods. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:486-500 [Conf]
  34. Polina Golland, Feng Liang, Sayan Mukherjee, Dmitry Panchenko
    Permutation Tests for Classification. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:501-515 [Conf]
  35. Tong Zhang
    Localized Upper and Lower Bounds for Some Estimation Problems. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:516-530 [Conf]
  36. András Antos
    Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:531-544 [Conf]
  37. Nathan Srebro, Adi Shraibman
    Rank, Trace-Norm and Max-Norm. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:545-560 [Conf]
  38. Dana Angluin, Jiang Chen
    Learning a Hidden Hypergraph. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:561-575 [Conf]
  39. Vitaly Feldman
    On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:576-590 [Conf]
  40. Dima Kuzmin, Manfred K. Warmuth
    Unlabeled Compression Schemes for Maximum Classes, . [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:591-605 [Conf]
  41. Sham M. Kakade, Michael J. Kearns
    Trading in Markovian Price Models. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:606-620 [Conf]
  42. Avrim Blum, Yishay Mansour
    From External to Internal Regret. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:621-636 [Conf]
  43. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
    Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:637-651 [Conf]
  44. Peter Grünwald, Steven de Rooij
    Asymptotic Log-Loss of Prequential Maximum Likelihood Codes. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:652-667 [Conf]
  45. Frank Balbach
    Teaching Classes with High Teaching Dimension Using Few Examples. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:668-683 [Conf]
  46. Dima Kuzmin, Manfred K. Warmuth
    Optimum Follow the Leader Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:684-686 [Conf]
  47. John Langford
    The Cross Validation Problem. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:687-688 [Conf]
  48. Wei Luo
    Compute Inclusion Depth of a Pattern. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:689-690 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002