Sciweavers

COLT
2010
Springer
13 years 10 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...
ICMLA
2004
14 years 1 months ago
A new landmarker generation algorithm based on correlativity
Landmarking is a recent and promising metalearning strategy, which defines meta-features that are themselves efficient learning algorithms. However, the choice of landmarkers is m...
Daren Ler, Irena Koprinska, Sanjay Chawla
COLT
2006
Springer
14 years 4 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
ICML
2000
IEEE
15 years 1 months ago
Meta-Learning by Landmarking Various Learning Algorithms
Landmarking is a novel approach to describing tasks in meta-learning. Previous approaches to meta-learning mostly considered only statistics-inspired measures of the data as a sou...
Bernhard Pfahringer, Hilan Bensusan, Christophe G....
CVPR
2007
IEEE
15 years 2 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman