Dual coordinate descent methods for logistic regression and maximum entropy models
From MaRDI portal
(Redirected from Publication:413884)
Recommendations
- Iterative scaling and coordinate descent methods for maximum entropy models
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Coordinate descent algorithms
- A fast dual algorithm for kernel logistic regression
- A fast dual algorithm for kernel logistic regression
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- A fast dual algorithm for kernel logistic regression
- Coordinate descent method for large-scale L2-loss linear support vector machines
- Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks
- Generalized Iterative Scaling for Log-Linear Models
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- Iterative scaling and coordinate descent methods for maximum entropy models
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the dual formulation of regularized linear systems with convex risks
- On the learnability and design of output codes for multiclass problems
- On the limited memory BFGS method for large scale optimization
- Trust region Newton method for logistic regression
- Working set selection using second order information for training support vector machines
Cited in
(20)- A generic coordinate descent solver for non-smooth convex optimisation
- Trust region Newton method for logistic regression
- An improved GLMNET for L1-regularized logistic regression
- Artificial intelligence classification of wetland vegetation morphology based on deep convolutional neural network
- Sparse classification: a scalable discrete optimization perspective
- Machine learning constructives and local searches for the travelling salesman problem
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- Managing air quality: predicting exceedances of legal limits for PM10 and O\(_3\) concentration using machine learning methods
- Global convergence rate of proximal incremental aggregated gradient methods
- Dual coordinate descent methods for solving AUC optimization problem
- A model of double descent for high-dimensional binary linear classification
- Entropy-based estimation in classification problems
- Surface warping incorporating machine learning assisted domain likelihood estimation: a new paradigm in mine geology modeling and automation
- A fast dual algorithm for kernel logistic regression
- Iterative scaling and coordinate descent methods for maximum entropy models
- Distributed block-diagonal approximation methods for regularized empirical risk minimization
- A fast dual algorithm for kernel logistic regression
- Coupled Generation
- Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine
- scientific article; zbMATH DE number 7370540 (Why is no real title available?)
This page was built for publication: Dual coordinate descent methods for logistic regression and maximum entropy models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413884)
