Sciweavers

1092 search results - page 96 / 219
» Convex Methods for Transduction
Sort
View
ALENEX
2007
126views Algorithms» more  ALENEX 2007»
14 years 11 months ago
0/1 Vertex and Facet Enumeration with BDDs
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
Markus Behle, Friedrich Eisenbrand
NIPS
2004
14 years 11 months ago
Optimal Aggregation of Classifiers and Boosting Maps in Functional Magnetic Resonance Imaging
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
Vladimir Koltchinskii, Manel Martínez-Ram&o...
NIPS
2001
14 years 11 months ago
Boosting and Maximum Likelihood for Exponential Models
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
Guy Lebanon, John D. Lafferty
AUTOMATICA
2010
104views more  AUTOMATICA 2010»
14 years 10 months ago
Identification for robust H2 deconvolution filtering
This paper addresses robust deconvolution filtering when the system and noise dynamics are obtained by parametric system identification. Consistent with standard identification me...
Xavier Bombois, Håkan Hjalmarsson, Gé...
JMLR
2006
143views more  JMLR 2006»
14 years 10 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert