Sciweavers

COLT
2007
Springer
14 years 2 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
COLT
2007
Springer
14 years 2 months ago
Robust Reductions from Ranking to Classification
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelz...
COLT
2007
Springer
14 years 2 months ago
Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector
We study generalized bootstrapped confidence regions for the mean of a random vector whose coordinates have an unknown dependence structure, with a non-asymptotic control of the co...
Sylvain Arlot, Gilles Blanchard, Étienne Ro...
COLT
2007
Springer
14 years 4 months ago
Regret to the Best vs. Regret to the Average
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...
COLT
2007
Springer
14 years 4 months ago
When Is There a Free Matrix Lunch?
Manfred K. Warmuth
COLT
2007
Springer
14 years 4 months ago
Mind Change Optimal Learning of Bayes Net Structure
Oliver Schulte, Wei Luo, Russell Greiner
COLT
2007
Springer
14 years 4 months ago
Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
Sivan Sabato, Shai Shalev-Shwartz
COLT
2007
Springer
14 years 4 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
COLT
2007
Springer
14 years 4 months ago
Generalised Entropy and Asymptotic Complexities of Languages
Abstract. In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generali...
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin