Sciweavers

3643 search results - page 215 / 729
» Learning Submodular Functions
Sort
View
NPL
2006
172views more  NPL 2006»
15 years 6 months ago
Adapting RBF Neural Networks to Multi-Instance Learning
In multi-instance learning, the training examples are bags composed of instances without labels, and the task is to predict the labels of unseen bags through analyzing the training...
Min-Ling Zhang, Zhi-Hua Zhou
CORR
2010
Springer
204views Education» more  CORR 2010»
15 years 5 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon
CRYPTO
2009
Springer
131views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
Benny Applebaum, David Cash, Chris Peikert, Amit S...
NPL
2006
82views more  NPL 2006»
15 years 6 months ago
How Online Learning Approaches Ornstein Uhlenbeck Processes
We show that under reasonable conditions, online learning for a nonlinear function near a local minimum is similar to a multivariate Ornstein Uhlenbeck process. This implies that ...
Fredrik A. Dahl
AI
1998
Springer
15 years 6 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok