Sciweavers

1106 search results - page 41 / 222
» On regularization algorithms in learning theory
Sort
View
ICRA
2005
IEEE
176views Robotics» more  ICRA 2005»
15 years 10 months ago
Auto-supervised learning in the Bayesian Programming Framework
Domestic and real world robotics requires continuous learning of new skills and behaviors to interact with humans. Auto-supervised learning, a compromise between supervised and co...
Pierre Dangauthier, Pierre Bessière, Anne S...
ICML
2008
IEEE
16 years 5 months ago
Deep learning via semi-supervised embedding
We show how nonlinear embedding algorithms popular for use with shallow semisupervised learning techniques such as kernel methods can be applied to deep multilayer architectures, ...
Frédéric Ratle, Jason Weston, Ronan ...
138
Voted
ATAL
2009
Springer
15 years 11 months ago
Multiagent reinforcement learning: algorithm converging to Nash equilibrium in general-sum discounted stochastic games
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
Natalia Akchurina
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
15 years 6 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
143
Voted
COLT
2007
Springer
15 years 10 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak