Sciweavers

701 search results - page 68 / 141
» Self Bounding Learning Algorithms
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
Niranjan Srinivas, Andreas Krause, Sham Kakade, Ma...
COLT
2010
Springer
13 years 5 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
ICML
2010
IEEE
13 years 8 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
NIPS
2004
13 years 9 months ago
PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data
We propose a "soft greedy" learning algorithm for building small conjunctions of simple threshold functions, called rays, defined on single real-valued attributes. We al...
Mario Marchand, Mohak Shah
FOCS
2010
IEEE
13 years 5 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala