Sciweavers

214 search results - page 8 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
AAAI
2006
13 years 9 months ago
Robust Support Vector Machine Training via Convex Outlier Ablation
One of the well known risks of large margin training methods, such as boosting and support vector machines (SVMs), is their sensitivity to outliers. These risks are normally mitig...
Linli Xu, Koby Crammer, Dale Schuurmans
APAL
2008
104views more  APAL 2008»
13 years 7 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
CCE
2004
13 years 7 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
UAI
1997
13 years 9 months ago
Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...
Fabio Gagliardi Cozman