This section provides an algorithm overview for the proposed Instance-Incremental Learning method and details the creation of its benchmarksThis section provides an algorithm overview for the proposed Instance-Incremental Learning method and details the creation of its benchmarks

Algorithm and Data Imbalance: Implementing the New IIL Benchmarks

2025/11/08 00:00
2분 읽기
이 콘텐츠에 대한 의견이나 우려 사항이 있으시면 crypto.news@mexc.com으로 연락주시기 바랍니다

Abstract and 1 Introduction

  1. Related works

  2. Problem setting

  3. Methodology

    4.1. Decision boundary-aware distillation

    4.2. Knowledge consolidation

  4. Experimental results and 5.1. Experiment Setup

    5.2. Comparison with SOTA methods

    5.3. Ablation study

  5. Conclusion and future work and References

    \

Supplementary Material

  1. Details of the theoretical analysis on KCEMA mechanism in IIL
  2. Algorithm overview
  3. Dataset details
  4. Implementation details
  5. Visualization of dusted input images
  6. More experimental results

8. Algorithm overview

The whole process of the proposed method is illustrated in Algorithm 1. Codes will be released to public upon publication.

9. Dataset details

Corresponding to the definition of our new increment-alinstance learning (IIL) task, we reorganize the public dataset Cifar-100 [11] and ImageNet-100 [24] to establish the benchmark in this research topic.

\

\

\ Figure 8. Number of images in each class in the base set and incremental sets of Cifar-100. “D0” means the base set and “Di” denotes the incremental set in task i.

\ As can be seen, the base dataset has a more balance sample distribution, where the largest class is class 6 with 279 images. The smallest class is class 29 and has 215 images. Incremental dataset “D5” has the most imbalance number of samples between classes, where the maximum number is 40 in class 58 and the minimum number is 12 in class 76. That is, the highest imbalance ratio is 3.33 : 1.

\

\

:::info Authors:

(1) Qiang Nie, Hong Kong University of Science and Technology (Guangzhou);

(2) Weifu Fu, Tencent Youtu Lab;

(3) Yuhuan Lin, Tencent Youtu Lab;

(4) Jialin Li, Tencent Youtu Lab;

(5) Yifeng Zhou, Tencent Youtu Lab;

(6) Yong Liu, Tencent Youtu Lab;

(7) Qiang Nie, Hong Kong University of Science and Technology (Guangzhou);

(8) Chengjie Wang, Tencent Youtu Lab.

:::


:::info This paper is available on arxiv under CC BY-NC-ND 4.0 Deed (Attribution-Noncommercial-Noderivs 4.0 International) license.

:::

\

면책 조항: 본 사이트에 재게시된 글들은 공개 플랫폼에서 가져온 것으로 정보 제공 목적으로만 제공됩니다. 이는 반드시 MEXC의 견해를 반영하는 것은 아닙니다. 모든 권리는 원저자에게 있습니다. 제3자의 권리를 침해하는 콘텐츠가 있다고 판단될 경우, crypto.news@mexc.com으로 연락하여 삭제 요청을 해주시기 바랍니다. MEXC는 콘텐츠의 정확성, 완전성 또는 시의적절성에 대해 어떠한 보증도 하지 않으며, 제공된 정보에 기반하여 취해진 어떠한 조치에 대해서도 책임을 지지 않습니다. 본 콘텐츠는 금융, 법률 또는 기타 전문적인 조언을 구성하지 않으며, MEXC의 추천이나 보증으로 간주되어서는 안 됩니다.

Roll the Dice & Win Up to 1 BTC

Roll the Dice & Win Up to 1 BTCRoll the Dice & Win Up to 1 BTC

Invite friends & share 500,000 USDT!