Conferences in DBLP
John J. Grefenstette Genetic Algorithms and Machine Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Geoffrey E. Hinton , Drew van Camp Keeping the Neural Networks Simple by Minimizing the Description Length of the Weights. [Citation Graph (0, 0)][DBLP ] Conf ] Robert E. Schapire , Linda Sellie Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples. [Citation Graph (0, 0)][DBLP ] Conf ] Vijay V. Raghavan , Dawn Wilkins Learning µ-branching Programs with Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Ulf Berggren Linear Time Deterministic Learning of k -Term DNF. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Sally A. Goldman , Thomas R. Hancock , Sleiman Matar Asking Questions to Minimize Errors. [Citation Graph (0, 0)][DBLP ] Conf ] Rodney G. Downey , Patricia A. Evans , Michael R. Fellows Parameterized Learning Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan On the Query Complexity of Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Sally A. Goldman , H. David Mathias Teaching a Smart Learner. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Uwe Höffgen Learning and Robust Learning of Product Distributions. [Citation Graph (1, 0)][DBLP ] Conf ] Philip D. Laird , Ronald Saul , Peter Dunning A Model of Sequence Extrapolation. [Citation Graph (0, 0)][DBLP ] Conf ] Kenji Yamanishi On Polynomial-Time Probably almost Discriminative Learnability. [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns , H. Sebastian Seung Learning from a Population of Hypotheses. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev R. Kulkarni , Ofer Zeitouni On Probably Correct Classification of Concepts. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kummer , Frank Stephan On the Structure of Degrees of Inferability. [Citation Graph (0, 0)][DBLP ] Conf ] Steffen Lange , Thomas Zeugmann Language Learning in Dependence on the Space of Hypotheses. [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian , Hava T. Siegelmann On the Power of Sigmoid Neural Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Peter L. Bartlett Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mostefa Golea , Mario Marchand Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Anthony , Sean B. Holden On the Power of Polynomial Discriminators and Radial Basis Function Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Rusins Freivalds , Efim B. Kinber , Carl H. Smith On the Impact of Forgetting on Learning Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Efim B. Kinber , Carl H. Smith , Mahendran Velauthapillai , Rolf Wiehagen On Learning Multiple Concepts in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Robert P. Daley , Bala Kalyanasundaram Capabilities of Probabilistic Learners with Bounded Mind Changes. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjay Jain , Arun Sharma Probability is More Powerful Than Team for Language Identification from Positive Data. [Citation Graph (0, 0)][DBLP ] Conf ] Robert P. Daley , Bala Kalyanasundaram , Mahendran Velauthapillai Capabilities of fallible FINite Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Michal Jacovi On Learning in the Limit and Non-Uniform (epsilon, delta)-Learning. [Citation Graph (1, 0)][DBLP ] Conf ] Dana Ron , Ronitt Rubinfeld Learning Fallible Finite State Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Takashi Yokomori Learning Two-Tape Automata from Queries and Counterexamples. [Citation Graph (0, 0)][DBLP ] Conf ] Alvis Brazma Efficient Identification of Regular Expressions from Representative Examples. [Citation Graph (1, 0)][DBLP ] Conf ] Zhixiang Chen Learning Unions of Two Rectangles in the Plane with Equivalence Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Auer On-Line Learning of Rectangles in Noisy Environments. [Citation Graph (0, 0)][DBLP ] Conf ] Scott E. Decatur Statistical Queries and Faulty PAC Oracles. [Citation Graph (0, 0)][DBLP ] Conf ] William S. Evans , Sridhar Rajagopalan , Umesh V. Vazirani Choosing a Reliable Hypothesis. [Citation Graph (0, 0)][DBLP ] Conf ] Margrit Betke , Ronald L. Rivest , Mona Singh Piecemeal Learning of an Unknown Environment. [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Eli Dichterman Learning with Restricted Focus of Attention. [Citation Graph (0, 0)][DBLP ] Conf ] Tom Bylander Polynomial Learnability of Linear Threshold Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Darken , Michael Donahue , Leonid Gurvits , Eduardo D. Sontag Rate of Approximation Results Motivated by Robust Neural Network Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Shao C. Fang , Santosh S. Venkatesh On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz , Dan Roth On Learning Visual Concepts and DNF Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Michael Lindenbaum Localization vs. Identification of Semi-Algebraic Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Prasad Chalasani , Jeffrey Jackson On Learning Embedded Symmetric Concepts. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Boneh , Richard J. Lipton Amplification of Weak Learning under the Uniform Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas R. Hancock Learning k µ Decision Trees on the Uniform Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Paul W. Goldberg , Mark Jerrum Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] B. K. Natarajan Occam's Razor for Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Eiji Takimoto , Akira Maruoka Conservativeness and Monotonicity for Learning Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] György Turán Lower Bounds for PAC Learning with Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Auer , Philip M. Long , Wolfgang Maass , Gerhard J. Woeginger On the Complexity of Function Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Ulrich Simon General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. [Citation Graph (0, 0)][DBLP ] Conf ] Nick Littlestone , Philip M. Long On-Line Learning with Linear Loss Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Naoki Abe , Jun-ichi Takeuchi The "lob-pass" Problem and an On-line Learning Model of Rational Choice. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolò Cesa-Bianchi , Philip M. Long , Manfred K. Warmuth Worst-Case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule. [Citation Graph (0, 0)][DBLP ] Conf ] S. E. Posner , Sanjeev R. Kulkarni On-Line Learning of Functions of Bounded Variation under Various Sampling Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiyuki Kabashima , Shigeru Shinomoto Acceleration of Learning in Binary Choice Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sally A. Goldman , Manfred K. Warmuth Learning Binary Relations Using Weighted Majority Voting. [Citation Graph (0, 0)][DBLP ] Conf ] 