716 search results - page 33 / 144 » Optimizing Sorting with Machine Learning Algorithms |
ECML
2005
Springer
14 years 29 days ago
2005
Springer
The multi-armed bandit problem for a gambler is to decide which arm of a K-slot machine to pull to maximize his total reward in a series of trials. Many real-world learning and opt...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
SEAL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We analyze the formal grounding behind Negative Correlation (NC) Learning, an ensemble learning technique developed in the evolutionary computation literature. We show that by rem...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...