Sciweavers

3694 search results - page 359 / 739
» Stochastic complexity in learning
Sort
View
ECML
2006
Springer
15 years 10 months ago
Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
Corneliu Henegar, Karine Clément, Jean-Dani...
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 10 months ago
Analysis of the difficulty of learning goal-scoring behaviour for robot soccer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
Jeff Riley, Victor Ciesielski
NIPS
2008
15 years 8 months ago
Bayesian Kernel Shaping for Learning Control
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
Jo-Anne Ting, Mrinal Kalakrishnan, Sethu Vijayakum...
UAI
2003
15 years 8 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
ATAL
2010
Springer
15 years 7 months ago
Self-organization for coordinating decentralized reinforcement learning
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...
Chongjie Zhang, Victor R. Lesser, Sherief Abdallah