Sciweavers

23 search results - page 4 / 5
» Exact Convex Confidence-Weighted Learning
Sort
View
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
KSEM
2009
Springer
13 years 12 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
COLT
2004
Springer
13 years 10 months ago
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
Peter L. Bartlett, Ambuj Tewari
CVPR
2008
IEEE
13 years 11 months ago
Scene understanding with discriminative structured prediction
Spatial priors play crucial roles in many high-level vision tasks, e.g. scene understanding. Usually, learning spatial priors relies on training a structured output model. In this...
Jinhui Yuan, Jianmin Li, Bo Zhang
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 5 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi