Sciweavers

3250 search results - page 204 / 650
» Parameterized Learning Complexity
Sort
View
ALT
2011
Springer
14 years 6 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
ICML
2000
IEEE
16 years 7 months ago
On-line Learning for Humanoid Robot Systems
Humanoid robots are high-dimensional movement systems for which analytical system identification and control methods are insufficient due to unknown nonlinearities in the system s...
Gaurav Tevatia, Jörg Conradt, Sethu Vijayakum...
FOCS
2006
IEEE
16 years 17 days ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
DELFI
2006
15 years 8 months ago
Mobile Learning is Coming of Age - What we have and what we still miss
: Mobile learning has left the status of a new born child. It is time now to implement some structure into the complex and various activities by a framework presented in this paper...
Dirk Frohberg
ICML
2010
IEEE
15 years 7 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...