Sciweavers

535 search results - page 51 / 107
» Online learning over graphs
Sort
View
COLT
2010
Springer
13 years 5 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
ACL
2010
13 years 5 months ago
Learning Script Knowledge with Web Experiments
We describe a novel approach to unsupervised learning of the events that make up a script, along with constraints on their temporal ordering. We collect naturallanguage descriptio...
Michaela Regneri, Alexander Koller, Manfred Pinkal
COLT
2008
Springer
13 years 9 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
ICML
2007
IEEE
14 years 8 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran