Sciweavers

1845 search results - page 31 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
COLT
2010
Springer
13 years 6 months ago
Mansour's Conjecture is True for Random DNF Formulas
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
Adam R. Klivans, Homin K. Lee, Andrew Wan
ICML
2009
IEEE
14 years 8 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
ICML
2009
IEEE
14 years 8 months ago
Learning structural SVMs with latent variables
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
Chun-Nam John Yu, Thorsten Joachims
ICML
2009
IEEE
14 years 8 months ago
Unsupervised search-based structured prediction
We describe an adaptation and application of a search-based structured prediction algorithm "Searn" to unsupervised learning problems. We show that it is possible to red...
Hal Daumé III
CP
2006
Springer
13 years 11 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...