paper-with-me

홈 › Papers

Efficient Primal-Dual Algorithms for Large-Scale Multiclass Classification

2019-02-11 · Dmitry Babichev, Dmitrii Ostrovskii, Francis Bach

We develop efficient algorithms to train $\ell_1$-regularized linear classifiers with large dimensionality $d$ of the feature space, number of classes $k$, and sample size $n$. Our focus is on a special class of losses that includes, in particular, the multiclass hinge and logistic losses. Our approach combines several ideas: (i) passing to the equivalent saddle-point problem with a quasi-bilinear objective; (ii) applying stochastic mirror descent with a proper choice of geometry which guarantees a favorable accuracy bound; (iii) devising non-uniform sampling schemes to approximate the matrix products. In particular, for the multiclass hinge loss we propose a \textit{sublinear} algorithm with iterations performed in $O(d+n+k)$ arithmetic operations.

📄 PDF Abstract BibTeX arXiv:1902.03755

Code (1)

flykiller/sublinear-svm 공식 구현

Tasks

ClassificationGeneral Classification

Similar Papers 제목 키워드 기반

PD-Sparse : A Primal and Dual Sparse Approach to Extreme Multiclass and Multilabel Classification

2016-06-01 · ICML 2016 6 · Ian En-Hsu Yen, Xiangru Huang, Pradeep Ravikumar, Kai Zhong 외

We consider Multiclass and Multilabel classification with extremely large number of classes, of which only few are labeled to each instance. In such setting, standard methods that have training, prediction cost linear to…

ClassificationGeneral ClassificationText Classification

A Proximal Approach for Sparse Multiclass SVM

2015-01-15 · G. Chierchia, Nelly Pustelnik, Jean-Christophe Pesquet, B. Pesquet-Popescu

Sparsity-inducing penalties are useful tools to design multiclass support vector machines (SVMs). In this paper, we propose a convex optimization approach for efficiently and exactly solving the multiclass SVM learning p…

Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter

2019-05-23 · Wenshuo Guo, Nhat Ho, Michael. I. Jordan

We provide theoretical complexity analysis for new algorithms to compute the optimal transport (OT) distance between two discrete probability distributions, and demonstrate their favorable practical performance over stat…

Convex Optimization for Binary Classifier Aggregation in Multiclass Problems

2014-01-16 · Sunho Park, TaeHyun Hwang, Seungjin Choi

Multiclass problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final answer. Various methods, including all-pairs (APs), one-ve…

Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems

2014-06-20 · Nikos Komodakis, Jean-Christophe Pesquet

Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may dra…