Sciweavers

ECCC
2006
97views more  ECCC 2006»
13 years 4 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
ECCC
2006
87views more  ECCC 2006»
13 years 4 months ago
The Learnability of Quantum States
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...
Scott Aaronson
DAGSTUHL
1996
13 years 5 months ago
On-line Algorithms in Machine Learning
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
Avrim Blum
ECML
2006
Springer
13 years 8 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
AII
1989
13 years 8 months ago
Inductive Inference, DFAs, and Computational Complexity
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Leonard Pitt
COLT
1994
Springer
13 years 8 months ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton
COLT
2001
Springer
13 years 9 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour
COLT
2003
Springer
13 years 9 months ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
FOCS
2006
IEEE
13 years 10 months ago
Cryptographic Hardness for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
Adam R. Klivans, Alexander A. Sherstov
ECCV
2002
Springer
14 years 6 months ago
A Tale of Two Classifiers: SNoW vs. SVM in Visual Recognition
Numerous statistical learning methods have been developed for visual recognition tasks. Few attempts, however, have been made to address theoretical issues, and in particular, stud...
Ming-Hsuan Yang, Dan Roth, Narendra Ahuja