An improved GLMNET for L1-regularized logistic regression
From MaRDI portal
Recommendations
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- An interior-point method for large-scale l₁-regularized logistic regression
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
- Dual coordinate descent methods for logistic regression and maximum entropy models
- A coordinate majorization descent algorithm for _1 penalized learning
Cited in
(34)- A modified local quadratic approximation algorithm for penalized optimization problems
- A multicriteria approach to find predictive and sparse models with stable feature selection for high-dimensional data
- Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- An effective procedure for feature subset selection in logistic regression based on information criteria
- A guide for sparse PCA: model comparison and applications
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
- Empirical risk minimization: probabilistic complexity and stepsize strategy
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- An inexact successive quadratic approximation method for L-1 regularized optimization
- scientific article; zbMATH DE number 6982986 (Why is no real title available?)
- A distributed block coordinate descent method for training l₁ regularized linear classifiers
- FarRSA for \(\ell_1\)-regularized convex optimization: local convergence and numerical experience
- A two-level decomposition framework exploiting first and second order information for SVM training problems
- Bayesian text classification and summarization via a class-specified topic model
- Sparse approximations with interior point methods
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Dual extrapolation for sparse GLMs
- scientific article; zbMATH DE number 7400716 (Why is no real title available?)
- Fused multiple graphical lasso
- A reduced-space algorithm for minimizing _1-regularized convex functions
- Lasso regularization within the LocalGLMnet architecture
- Concave Likelihood-Based Regression with Finite-Support Response Variables
- A new large-scale learning algorithm for generalized additive models
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
- A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
- A Geometry-Adaptive Regularized Newton-Type Method for Manifold-Affine Intersection Problems
- A centroid-based gene selection method for microarray data classification
This page was built for publication: An improved GLMNET for L1-regularized logistic regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405181)
