Demo Data from EDBT 2026 / reviewers in the wild / expert
Li-Jun Chen
dblp:354/1249
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Learning theory · 33% Learning paradigms · 33% Optimization for machine learning · 33% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms
incremental and decremental learning |
0.7 | 1 | 2023 | Incremental and Decremental Optimal Margin Distribution Learning · IJCAI 2023 |
Machine learning › Learning theory
online learning |
0.7 | 1 | 2023 | Incremental and Decremental Optimal Margin Distribution Learning · IJCAI 2023 |
Methods — techniques the papers use, named apart from their topics
lagrange multipliers · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Incremental and Decremental Optimal Margin Distribution LearningabstractIncremental 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. Li-Jun Chen, Teng Zhang 0001, Xuanhua Shi, Hai Jin 0001 |
IJCAI | 1 |