Dual coordinate descent methods for logistic regression and maximum entropy models
From MaRDI portal
Publication:413884
DOI10.1007/s10994-010-5221-8zbMath1237.62090OpenAlexW2108712612WikidataQ29029298 ScholiaQ29029298MaRDI QIDQ413884
Chih-Jen Lin, Fang-Lan Huang, Hsiang-Fu Yu
Publication date: 8 May 2012
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-010-5221-8
Generalized linear models (logistic models) (62J12) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Statistical aspects of information-theoretic topics (62B10)
Related Items
Coupled Generation ⋮ Surface warping incorporating machine learning assisted domain likelihood estimation: a new paradigm in mine geology modeling and automation ⋮ Unnamed Item ⋮ Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine ⋮ Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods ⋮ Entropy-based estimation in classification problems ⋮ Sparse classification: a scalable discrete optimization perspective ⋮ Distributed block-diagonal approximation methods for regularized empirical risk minimization ⋮ A generic coordinate descent solver for non-smooth convex optimisation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- Generalized Iterative Scaling for Log-Linear Models
- A fast dual algorithm for kernel logistic regression
- On the dual formulation of regularized linear systems with convex risks
- On the learnability and design of output codes for multiclass problems
