Sciweavers

181 search results - page 10 / 37
» Polynomial Learning of Distribution Families
Sort
View
COLT
1992
Springer
14 years 1 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
ALT
2010
Springer
13 years 11 months ago
Lower Bounds on Learning Random Structures with Statistical Queries
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
Dana Angluin, David Eisenstat, Leonid Kontorovich,...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 10 months ago
Tight Sample Complexity of Large-Margin Learning
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...
Sivan Sabato, Nathan Srebro, Naftali Tishby
ICML
1996
IEEE
14 years 10 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile