Sciweavers

683 search results - page 41 / 137
» Generalization Bounds for Learning Kernels
Sort
View
NIPS
2008
13 years 10 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
IJCNN
2006
IEEE
14 years 2 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 5 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
TSMC
2002
143views more  TSMC 2002»
13 years 8 months ago
Robot visual servoing with iterative learning control
Abstract--This paper presents an iterative learning scheme for visionguided robot trajectory tracking. At first, a stability criterion for designing iterative learning controller i...
Ping Jiang, Rolf Unbehauen
ALT
2010
Springer
13 years 10 months ago
Bayesian Active Learning Using Arbitrary Binary Valued Queries
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
Liu Yang, Steve Hanneke, Jaime G. Carbonell