Sciweavers

3607 search results - page 275 / 722
» Learning with structured sparsity
Sort
View
FLAIRS
2004
15 years 7 months ago
State Space Reduction For Hierarchical Reinforcement Learning
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
Mehran Asadi, Manfred Huber
IANDC
2006
101views more  IANDC 2006»
15 years 6 months ago
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
Wei Luo, Oliver Schulte
IIE
2008
188views more  IIE 2008»
15 years 5 months ago
Exploring Individual and Collaborative Dimensions of Knowledge Building in an Online Learning Community of Practice
Abstract. An exploratory study of students' engagement in online learning and knowledge building is presented in this paper. Learning in an online community, composed of stude...
Lina Markauskaite, Louise M. Sutherland
IJAR
2010
130views more  IJAR 2010»
15 years 4 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
AAAI
2010
15 years 4 months ago
Non-I.I.D. Multi-Instance Dimensionality Reduction by Learning a Maximum Bag Margin Subspace
Multi-instance learning, as other machine learning tasks, also suffers from the curse of dimensionality. Although dimensionality reduction methods have been investigated for many ...
Wei Ping, Ye Xu, Kexin Ren, Chi-Hung Chi, Shen Fur...