Dual coordinate descent methods for logistic regression and maximum entropy models
From MaRDI portal
Publication:413884
DOI10.1007/s10994-010-5221-8zbMath1237.62090WikidataQ29029298 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
62J12: Generalized linear models (logistic models)
90C90: Applications of mathematical programming
68T05: Learning and adaptive systems in artificial intelligence
62B10: Statistical aspects of information-theoretic topics
Related Items
Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods, Unnamed Item, A generic coordinate descent solver for non-smooth convex optimisation, Coupled Generation, Distributed block-diagonal approximation methods for regularized empirical risk minimization, Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine, Sparse classification: a scalable discrete optimization perspective, Entropy-based estimation in classification problems, Surface warping incorporating machine learning assisted domain likelihood estimation: a new paradigm in mine geology modeling and automation
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
