ALT 2004

37 papers

A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks Yoshiyuki Kabashima, Shinsuke Uda

A Criterion for the Existence of Predictive Complexity for Binary Games Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin

Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data Daniil Ryabko

Applications of Regularized Least Squares to Classification Problems Nicolò Cesa-Bianchi

Approximate Inference in Probabilistic Models Manfred Opper, Ole Winther

Boosting Based on Divide and Merge Eiji Takimoto, Syuhei Koya, Akira Maruoka

Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space Steffen Lange, Sandra Zilles

Complexity of Pattern Classes and Lipschitz Property Amiran Ambroladze, John Shawe-Taylor

Convergence of a Generalized Gradient Selection Approach for the Decomposition Method Nikolas List

Decision Trees: More Theoretical Justification for Practical Algorithms Amos Fiat, Dmitry Pechyony

Estimation of the Data Region Using Extreme-Value Distributions Kazuho Watanabe, Sumio Watanabe

Full Information Game with Gains and Losses Chamy Allenberg-Neeman, Benny Neeman

Hidden Markov Modelling Techniques for Haplotype Analysis Mikko Koivisto, Teemu Kivioja, Heikki Mannila, Pasi Rastas, Esko Ukkonen

Inductive Inference of Term Rewriting Systems from Positive Data M. R. K. Krishna Rao

Learnability of Relatively Quantified Generalized Formulas Andrei A. Bulatov, Hubie Chen, Víctor Dalmau

Learning Boolean Functions in AC0 on Attribute and Classification Noise Akinobu Miyata, Jun Tarui, Etsuji Tomita

Learning Content Sequencing in an Educational Environment According to Student Needs Ana Iglesias, Paloma Martínez, Ricardo Aler, Fernando Fernández

Learning Languages from Positive Data and Negative Counterexamples Sanjay Jain, Efim B. Kinber

Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages Yasuhito Mukouchi, Masako Sato

Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries Satoshi Matsumoto, Takayoshi Shoudai

Learning R-of-K Functions by Boosting Kohei Hatano, Osamu Watanabe

Learning Tree Languages from Positive Examples and Membership Queries Jérôme Besombes, Jean-Yves Marion

Learning, Logic, and Probability: A Unified View Pedro M. Domingos

Maximum Entropy Principle in Non-Ordered Setting Victor P. Maslov, Vladimir V. V'yugin

New Revision Algorithms Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán

Newton Diagram and Stochastic Complexity in Mixture of Binomial Distributions Keisuke Yamazaki, Sumio Watanabe

On Kernels, Margins, and Low-Dimensional Mappings Maria-Florina Balcan, Avrim Blum, Santosh S. Vempala

On the Complexity of Working Set Selection Hans Ulrich Simon

On the Convergence Speed of MDL Predictions for Bernoulli Sequences Jan Poland, Marcus Hutter

On the Data Consumption Benefits of Accepting Increased Uncertainty Eric Martin, Arun Sharma, Frank Stephan

Prediction with Expert Advice by Following the Perturbed Leader for General Weights Marcus Hutter, Jan Poland

Probabilistic Inductive Logic Programming Luc De Raedt, Kristian Kersting

Relative Loss Bounds and Polynomial-Time Predictions for the K-Lms-Net Algorithm Mark Herbster

Statistical Learning in Digital Wireless Communications Toshiyuki Tanaka

String Pattern Discovery Ayumi Shinohara

The Subsumption Lattice and Query Learning Marta Arias, Roni Khardon

Universal Convergence of Semimeasures on Individual Random Sequences Marcus Hutter, Andrej Muchnik