You are currently offline. Some features of the site may not work correctly.

Corpus ID: 67855865

Logarithmic Regret for parameter-free Online Logistic Regression

@article{Vilmarest2019LogarithmicRF,
title={Logarithmic Regret for parameter-free Online Logistic Regression},
author={Joseph De Vilmarest and O. Wintenberger},
journal={ArXiv},
year={2019},
volume={abs/1902.09803}
}

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… Expand