Playing Billiards in Version Space

DOI10.1162/neco.1997.9.1.99zbMath1076.68554arXivcond-mat/9508130OpenAlexW2126291774MaRDI QIDQ3123289

Pàl Rujàn

Publication date: 16 October 1997

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9508130

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Bandit-based Monte-Carlo structure learning of probabilistic logic programs

Cites Work

• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• On the ergodic properties of nowhere dispersing billiards
• Markov partitions for dispersed billiards
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
• Eigenvalues of the Laplacian in Two Dimensions
• Generalization performance of Bayes optimal classification algorithm for learning a perceptron
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Playing Billiards in Version Space