Sciweavers

10054 search results - page 6 / 2011
» On the Complexity of Function Learning
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 7 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
NIPS
2007
13 years 11 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
ICML
2010
IEEE
13 years 11 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 ...
ICCAD
2010
IEEE
156views Hardware» more  ICCAD 2010»
13 years 7 months ago
Boolean matching of function vectors with strengthened learning
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...
Chih-Fan Lai, Jie-Hong R. Jiang, Kuo-Hua Wang
IAT
2008
IEEE
13 years 10 months ago
Scaling Up Multi-agent Reinforcement Learning in Complex Domains
TD-FALCON (Temporal Difference - Fusion Architecture for Learning, COgnition, and Navigation) is a class of self-organizing neural networks that incorporates Temporal Difference (...
Dan Xiao, Ah-Hwee Tan