Sciweavers

1837 search results - page 120 / 368
» Learning From Ambiguous Examples
Sort
View
FOCS
2009
IEEE
15 years 11 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
15 years 11 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
ICML
2002
IEEE
16 years 5 months ago
Learning to Share Distributed Probabilistic Beliefs
In this paper, we present a general machine learning approach to the problem of deciding when to share probabilistic beliefs between agents for distributed monitoring. Our approac...
Christopher Leckie, Kotagiri Ramamohanarao
ALT
2003
Springer
16 years 1 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
ICALT
2008
IEEE
15 years 11 months ago
NUCLEO: Adaptive Computer Supported Collaborative Learning in a Role Game Based Scenario
This paper presents the adaptation model used in NUCLEO, a pilot e-learning environment that is currently being developed at the Complutense University of Madrid. The NUCLEO syste...
Pilar Sancho, Rubén Fuentes-Fernánde...