scientific article; zbMATH DE number 6276173
From MaRDI portal
Publication:5405181
zbMath1432.68404MaRDI QIDQ5405181
Chia-Hua Ho, Guo-Xun Yuan, Chih-Jen Lin
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/yuan12a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
logistic regressionsupport vector machinesoptimization methodslinear classificationL1 regularization
Ridge regression; shrinkage estimators (Lasso) (62J07) Generalized linear models (logistic models) (62J12) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (30)
Sparse Approximations with Interior Point Methods ⋮ An inexact successive quadratic approximation method for L-1 regularized optimization ⋮ A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization ⋮ A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer ⋮ A multicriteria approach to find predictive and sparse models with stable feature selection for high-dimensional data ⋮ A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions ⋮ A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics ⋮ Empirical risk minimization: probabilistic complexity and stepsize strategy ⋮ Concave Likelihood-Based Regression with Finite-Support Response Variables ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new large-scale learning algorithm for generalized additive models ⋮ A globally convergent proximal Newton-type method in nonsmooth convex optimization ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions ⋮ Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property ⋮ FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience ⋮ Unnamed Item ⋮ An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets ⋮ A centroid-based gene selection method for microarray data classification ⋮ A modified local quadratic approximation algorithm for penalized optimization problems ⋮ An effective procedure for feature subset selection in logistic regression based on information criteria ⋮ A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression ⋮ A guide for sparse PCA: model comparison and applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fused Multiple Graphical Lasso ⋮ Unnamed Item
Uses Software
This page was built for publication:
