Sciweavers

JMLR
2012
11 years 9 months ago
A Simple Geometric Interpretation of SVM using Stochastic Adversaries
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...
Roi Livni, Koby Crammer, Amir Globerson
NIPS
1997
13 years 8 months ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth
NIPS
2008
13 years 8 months ago
Exact Convex Confidence-Weighted Learning
Confidence-weighted (CW) learning [6], an online learning method for linear classifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that repr...
Koby Crammer, Mark Dredze, Fernando Pereira
ECML
2006
Springer
13 years 10 months ago
Constant Rate Approximate Maximum Margin Algorithms
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
Petroula Tsampouka, John Shawe-Taylor
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
13 years 10 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...