Sciweavers

791 search results - page 40 / 159
» Learning Probabilistic Ontologies with Distributed Parameter...
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Fully distributed EM for very large datasets
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
Jason Wolfe, Aria Haghighi, Dan Klein
ICML
2003
IEEE
14 years 9 months ago
Learning on the Test Data: Leveraging Unseen Features
This paper addresses the problem of classification in situations where the data distribution is not homogeneous: Data instances might come from different locations or times, and t...
Benjamin Taskar, Ming Fai Wong, Daphne Koller
GECCO
2006
Springer
138views Optimization» more  GECCO 2006»
14 years 16 days ago
Does overfitting affect performance in estimation of distribution algorithms
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...
Hao Wu, Jonathan L. Shapiro
COLT
1997
Springer
14 years 1 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
COLT
2007
Springer
14 years 3 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret