63 search results - page 3 / 13 » Bounds on linear PDEs via semidefinite optimization |
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
120
click to vote
SIAMREV
2010
14 years 4 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
113
click to vote
CVPR
2012
IEEE
13 years 6 hour ago
2012
IEEE
We propose a novel linear method for scale invariant figure ground separation in images and videos. Figure ground separation is treated as a superpixel labeling problem. We optim...
112
click to vote
EMNLP
2011
13 years 9 months ago
2011
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...