scientific article
From MaRDI portal
Publication:2896183
zbMath1242.62065MaRDI QIDQ2896183
Chih-Jen Lin, Kai-Wei Chang, Cho-Jui Hsieh, Guo-Xun Yuan
Publication date: 13 July 2012
Full work available at URL: http://www.jmlr.org/papers/v11/yuan10c.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
logistic regressionsupport vector machinesdocument classificationoptimization methodsL1 regularization
Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
An inexact successive quadratic approximation method for L-1 regularized optimization, Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems, Practical inexact proximal quasi-Newton method with global complexity analysis, Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models, An Iterative Reduction FISTA Algorithm for Large-Scale LASSO, Sparse and kernel OPLS feature extraction based on eigenvalue problem solving, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, Block coordinate descent algorithms for large-scale sparse multiclass classification, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, A reduced half thresholding algorithm, Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, Convex Optimization for Group Feature Selection in Networked Data, A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property, Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates, ADMM-softmax: an ADMM approach for multinomial logistic regression, Unnamed Item, Hybrid MPI/OpenMP parallel asynchronous distributed alternating direction method of multipliers, Unnamed Item, Stochastic proximal quasi-Newton methods for non-convex composite optimization, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets, Structured sparsity through convex optimization, An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems, A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression, A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization, A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning, Unnamed Item, A decomposition method for Lasso problems with zero-sum constraint
Uses Software
