.png){kind=icon}
返回
A Third-Order Majorization Algorithm for Logistic Regression With Convergence Rate Guarantees
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2024.3413306.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the classical Logistic Regression (LR) problem in machine learning. Traditionally, the solving algorithms are based on either the first- or second-order approximation of the objective. For instance, the Fixed-Hessian Newton (FHN) method approximates the true Hessian with a constant estimate. In contrast, our design additionally exploits the third-order information. Applying the majorization-minimization (MM) framework, we construct a novel majorizing function based on the third-order Taylor expansion and the minimization solution is in closed-form with perseverance of the true gradient and Hessian structures. In analysis, we prove the convergence rate of the proposed algorithm. The enhanced numerical performance can be verified through simulation results.
Keyword:
Signal processing algorithms
Minimization
Convergence
Optimization
Taylor series
Machine learning algorithms
Logistic regression
Convergence rate
logistic regression
majorization-minimization
third-order
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏
Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏
查看更多内容