Sciweavers

3837 search results - page 186 / 768
» Learning Approximate Consistencies
Sort
View
ECCV
2010
Springer
15 years 11 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
168
Voted
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 11 months ago
Support vector regression for classifier prediction
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
Daniele Loiacono, Andrea Marelli, Pier Luca Lanzi
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
256
Voted
NIPS
2007
15 years 8 months ago
Bayes-Adaptive POMDPs
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
Stéphane Ross, Brahim Chaib-draa, Joelle Pi...
233
Voted
ICML
2010
IEEE
15 years 8 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher