181 search results - page 16 / 37 » Polynomial Learning of Distribution Families |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
FOCS
2009
IEEE
13 years 7 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information o...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...
JMLR
2010
13 years 4 months ago
2010
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...