Sciweavers

3643 search results - page 227 / 729
» Learning Submodular Functions
Sort
View
AIPS
2007
15 years 9 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
ICCV
2011
IEEE
14 years 6 months ago
Sparse Dictionary-based Representation and Recognition of Action Attributes
We present an approach for dictionary learning of action attributes via information maximization. We unify the class distribution and appearance information into an objective func...
Qiang Qiu, Zhuolin Jiang, Rama Chellappa
NIPS
2001
15 years 8 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
SAB
2010
Springer
117views Optimization» more  SAB 2010»
15 years 5 months ago
Indirectly Encoding Neural Plasticity as a Pattern of Local Rules
Biological brains can adapt and learn from past experience. In neuroevolution, i.e. evolving artificial neural networks (ANNs), one way that agents controlled by ANNs can evolve t...
Sebastian Risi, Kenneth O. Stanley
NIPS
1993
15 years 7 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson