Fetching the paper…
Reading the bibliography…
An importance weight quantifies the relative importance of one example over another, coming up in applications of boosting, asymmetric classification costs, reductions, and active learning.
The strength of weak learnability
Robert E. Schapire · 1990
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Y. Freund and R. Schapire · 1995
Earlier work this paper cites.
Exponentiated Gradient versus Gradient Descent for Linear Predictors
J. Kivinen and M.K. Warmuth · 1997
Earlier work this paper cites.
Beating the holdout: Bounds for kfold and progressive cross-validation
A. Blum, A. Kalai, and J. Langford · 1999
Earlier work this paper cites.
Learning additive models online with fast evaluating kernels
M. Herbster · 2001
Earlier work this paper cites.
Cost-sensitive learning by cost-proportionate example weighting
B. Zadrozny, J. Langford, and N. Abe · 2003
Earlier work this paper cites.
Online convex programming and generalised infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Rcv1: A new benchmark collection for text categorization research
D.D. Lewis, Y. Yang, T.G. Rose, and F. Li · 2004
Cited alongside, same era.
Smooth ε \varepsilon -Insensitive Regression by Loss Symmetrization
O. Dekel, S. Shalev-Shwartz, and Y. Singer · 2005
Cited alongside, same era.
Online passive-aggressive algorithms
K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer · 2006
Cited alongside, same era.
Training linear SVMs in linear time
T. Joachims · 2006
Cited alongside, same era.
Correcting sample selection bias by unlabeled data
J. Huang, A.J. Smola, A. Gretton, K.M. Borgwardt, and B. Scholkopf · 2007
Cited alongside, same era.
Vowpal wabbit online learning project, 2007
J. Langford, L. Li, and A. Strehl · 2007
Cited alongside, same era.
Importance weighted active learning
A. Beygelzimer, S. Dasgupta, and J. Langford · 2009
Later among the works it cites.
Efficient online and batch learning using forward backward splitting
J. Duchi and Y. Singer · 2009
Later among the works it cites.
Sparse online learning via truncated gradient
J. Langford, L. Li, and T. Zhang · 2009
Later among the works it cites.
Agnostic Active Learning Without Constraints
A. Beygelzimer, D. Hsu, J. Langford, and T. Zhang · 2010
Closest in time.
Adaptive Bound Optimization for Online Convex Optimization
H. Brendan McMahan and M. Streeter · 2010
Closest in time.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Logarithmic regret algorithms for strongly convex repeated games
S. Shalev-Shwartz and Y. Singer · 2007
Cited alongside, same era.
Implicit Online Learning
B. Kulis and P. Bartlett · 2010
Closest in time.