Computational learning theory. 15th annual conference, COLT 2002, Sydney, Australia, July 8--10, 2002. Proceedings
The articles of mathematical interest will be reviewed individually. The preceding conference (14th, 2001) has been reviewed (see Zbl 0969.00077). Indexed articles: \textit{Mendelson, Shahar; Williamson, Robert C.}, Agnostic learning nonconvex function classes, 1-13 [Zbl 1050.68072] \textit{Mendelson, Shahar; Vershynin, Roman}, Entropy, combinatorial dimensions and random averages, 14-28 [Zbl 1050.68071] \textit{Mendelson, Shahar}, Geometric parameters of kernel machines, 29-43 [Zbl 1050.68070] \textit{Bartlett, Peter L.; Bousquet, Olivier; Mendelson, Shahar}, Localized Rademacher complexities, 44-58 [Zbl 1050.68054] \textit{Bousquet, Olivier; Koltchinskii, Vladimir; Panchenko, Dmitriy}, Some local measures of complexity of convex hulls and generalization bounds, 59-73 [Zbl 1050.68055] \textit{Takimoto, Eiji; Warmuth, Manfred K.}, Path kernels and multiplicative updates, 74-89 [Zbl 1050.68078] \textit{Vyugin, Michael V.; V'yugin, Vladimir V.}, Predictive complexity and information, 90-104 [Zbl 1050.68080] \textit{Kalnishkan, Yuri; Vyugin, Michael V.}, Mixability and the existence of weak complexities, 105-120 [Zbl 1050.68067] \textit{Cesa-Bianchi, Nicolò; Conconi, Alex; Gentile, Claudio}, A second-order Perceptron algorithm, 121-137 [Zbl 1050.68573] \textit{Mesterharm, Chris}, Tracking linear-threshold concepts with Winnow, 138-152 [Zbl 1050.68582] \textit{Fernau, Henning}, Learning tree languages from text, 153-168 [Zbl 1050.68060] \textit{Suzuki, Yusuke; Akanuma, Ryuta; Shoudai, Takayoshi; Miyahara, Tetsuhiro; Uchida, Tomoyuki}, Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data, 169-184 [Zbl 1050.68077] \textit{de la Higuera, Colin; Oncina, Jose}, Inferring deterministic linear languages, 185-200 [Zbl 1050.68085] \textit{Zilles, Sandra}, Merging uniform inductive learners, 201-215 [Zbl 1050.68083] \textit{Schmidhuber, Jürgen}, The Speed Prior: A new simplicity measure yielding near-optimal computable predictions, 216-228 [Zbl 1050.68076] \textit{Yang, Ke}, New lower bounds for statistical query learning, 229-243 [Zbl 1050.68081] \textit{Bshouty, Nader H.; Jackson, Jeffrey C.; Tamon, Christino}, Exploring learnability between exact and PAC, 244-254 [Zbl 1050.68572] \textit{Even-Dar, Eyal; Mannor, Shie; Mansour, Yishay}, PAC bounds for multi-armed bandit and Markov decision processes, 255-270 [Zbl 1050.68059] \textit{Bshouty, Nader H.; Burroughs, Lynn}, Bounds for the minimum disagreement problem with applications to learning theory, 271-286 [Zbl 1050.68056] \textit{Bshouty, Nader H.; Burroughs, Lynn}, On the proper learning of axis parallel concepts, 287-302 [Zbl 1050.68057] \textit{Lugosi, Gábor; Vayatis, Nicolas}, A consistent strategy for boosting algorithms, 303-318 [Zbl 1050.68580] \textit{Mannor, Shie; Meir, Ron; Zhang, Tong}, The consistency of greedy algorithms for classification, 319-333 [Zbl 1050.68581] \textit{Rätsch, Gunnar; Warmuth, Manfred K.}, Maximizing the margin with boosting, 334-350 [Zbl 1050.68583] \textit{Dasgupta, Sanjoy}, Performance guarantees for hierarchical clustering, 351-363 [Zbl 1050.68576] \textit{Hutter, Marcus}, Self-optimizing and Pareto-optimal policies in general environments based on Bayes-mixtures, 364-379 [Zbl 1050.68062] \textit{Fortnow, Lance; Lutz, Jack H.}, Prediction and dimension., 380-395 [Zbl 1050.68061] \textit{Papadimitriou, Christos}, Learning the internet, 396 [Zbl 1050.68860]
scientific article; zbMATH DE number 1789472