Logarithmic Regret for parameter-free Online Logistic Regression
- LPSM, Sorbonne Université（巴黎索邦大学概率与随机模型实验室）
机构由 AI 辅助整理，请以论文原文为准。
更新
英文摘要：
We consider online optimization procedures in the context of logistic regression, focusing on the Extended Kalman Filter (EKF). We introduce a second-order algorithm close to the EKF, named Semi-Online Step (SOS), for which we prove a O(log(n)) regret in the adversarial setting, paving the way to similar results for the EKF. This regret bound on SOS is the first for such parameter-free algorithm in the adversarial logistic regression. We prove for the EKF in constant dynamics a O(log(n)) regret in expectation and in the well-specified logistic regression model.
