Sciweavers

695 search results - page 5 / 139
» Convex Learning with Invariances
Sort
View
SEAL
2010
Springer
13 years 5 months ago
A Parallel Algorithm for Solving Large Convex Minimax Problems
Ramnik Arora, Utkarsh Upadhyay, Rupesh Tulshyan, J...
CVPR
2004
IEEE
13 years 11 months ago
Scale-Invariant Shape Features for Recognition of Object Categories
We introduce a new class of distinguished regions based on detecting the most salient convex local arrangements of contours in the image. The regions are used in a similar way to ...
Frédéric Jurie, Cordelia Schmid
ATVA
2008
Springer
102views Hardware» more  ATVA 2008»
13 years 9 months ago
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Farn Wang
JMLR
2010
82views more  JMLR 2010»
13 years 2 months ago
Negative Results for Active Learning with Convex Losses
We study the problem of active learning with convex loss functions. We prove that even under bounded noise constraints, the minimax rates for proper active learning are often no b...
Steve Hanneke, Liu Yang
NIPS
2008
13 years 9 months ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang