Sciweavers

495 search results - page 61 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
83
Voted
JMLR
2010
195views more  JMLR 2010»
14 years 8 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
86
Voted
ICMLA
2010
14 years 7 months ago
Ensembles of Neural Networks for Robust Reinforcement Learning
Reinforcement learning algorithms that employ neural networks as function approximators have proven to be powerful tools for solving optimal control problems. However, their traini...
Alexander Hans, Steffen Udluft
94
Voted
NIPS
1998
14 years 11 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
72
Voted
ALT
2006
Springer
15 years 6 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann
76
Voted
ICTAI
2009
IEEE
15 years 4 months ago
Evolution Strategies for Constants Optimization in Genetic Programming
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
César Luis Alonso, José Luis Monta&n...