Incremental and Decremental Optimal Margin Distribution Learning
Li-Jun Chen, Teng Zhang, Xuanhua Shi, Hai Jin
Abstract
Incremental and decremental learning (IDL) deals with the tasks where new data arrives sequentially as a stream or old data turns unavailable continually due to the privacy protection. Existing IDL methods mainly focus on support vector machine and its variants with linear-type loss. There are few studies about the quadratic-type loss, whose Lagrange multipliers are unbounded and much more difficult to track. In this paper, we take the latest statistical learning framework optimal margin distribution machine (ODM) which involves a quadratic-type loss due to the optimization of margin variance, for example, and equip it with the ability to handle IDL tasks. Our proposed ID-ODM can avoid updating the Lagrange multipliers in an infinite range by determining their optimal values beforehand so as to enjoy much more efficiency. Moreover, ID-ODM is also applicable when multiple instances come and leave simultaneously. Extensive empirical studies show that ID-ODM can achieve 9.1x speedup on average with almost no generalization lost compared to retraining ODM on new data set from scratch.
BibTeX
@inproceedings{ijcai2023p392,
title = {Incremental and Decremental Optimal Margin Distribution Learning},
author = {Chen, Li-Jun and Zhang, Teng and Shi, Xuanhua and Jin, Hai},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-23}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Edith Elkind},
pages = {3523--3531},
year = {2023},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2023/392},
url = {https://doi.org/10.24963/ijcai.2023/392},
}