Sciweavers

63 search results - page 7 / 13
» Complexity Bounds for Batch Active Learning in Classificatio...
Sort
View
ECML
2006
Springer
13 years 11 months ago
Margin-Based Active Learning for Structured Output Spaces
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
Dan Roth, Kevin Small
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 5 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
NEUROSCIENCE
2001
Springer
14 years 8 hour ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
JMLR
2008
137views more  JMLR 2008»
13 years 7 months ago
Online Learning of Complex Prediction Problems Using Simultaneous Projections
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
Yonatan Amit, Shai Shalev-Shwartz, Yoram Singer
NLE
2008
140views more  NLE 2008»
13 years 7 months ago
Active learning and logarithmic opinion pools for HPSG parse selection
For complex tasks such as parse selection, the creation of labelled training sets can be extremely costly. Resource-efficient schemes for creating informative labelled material mu...
Jason Baldridge, Miles Osborne