The reviewed record of science sign in
Pith

arxiv: 2010.01809 · v4 · pith:BCXZ4XKM · submitted 2020-10-05 · cs.CV

Long-tailed Recognition by Routing Diverse Distribution-Aware Experts

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BCXZ4XKMrecord.jsonopen to challenge →

classification cs.CV
keywords datamodelbiasexpertslong-tailedreducesroutingtail
0
0 comments X
read the original abstract

Natural data are often long-tail distributed over semantic classes. Existing recognition methods tackle this imbalanced classification by placing more emphasis on the tail data, through class re-balancing/re-weighting or ensembling over different data groups, resulting in increased tail accuracies but reduced head accuracies. We take a dynamic view of the training data and provide a principled model bias and variance analysis as the training data fluctuates: Existing long-tail classifiers invariably increase the model variance and the head-tail model bias gap remains large, due to more and larger confusion with hard negatives for the tail. We propose a new long-tailed classifier called RoutIng Diverse Experts (RIDE). It reduces the model variance with multiple experts, reduces the model bias with a distribution-aware diversity loss, reduces the computational cost with a dynamic expert routing module. RIDE outperforms the state-of-the-art by 5% to 7% on CIFAR100-LT, ImageNet-LT and iNaturalist 2018 benchmarks. It is also a universal framework that is applicable to various backbone networks, long-tailed algorithms, and training mechanisms for consistent performance gains. Our code is available at: https://github.com/frank-xwang/RIDE-LongTailRecognition.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Class-frequency Guided Noise Schedule for Diffusion Models

    cs.LG 2026-06 unverdicted novelty 6.0

    Proposes CFRG noise schedule for diffusion models that assigns larger noises to low-frequency classes to improve generation on imbalanced datasets.

  2. Rethinking Loss Reweighting for Imbalance Learning as an Inverse Problem: A Neural Collapse Point of View

    cs.LG 2026-05 unverdicted novelty 6.0

    Loss reweighting is cast as an inverse problem that dynamically infers class weights to equalize per-class average losses under the Neural Collapse simplex ETF target.

  3. Decouple then Converge: Handling Unknown Unlabeled Distributions in Long-Tailed Semi-Supervised Learning

    cs.LG 2024-06 unverdicted novelty 6.0

    DeCon decouples LTSSL into head-class and tail-class branches that interact and converge, delivering SOTA accuracy on mismatched-distribution benchmarks and outperforming prior methods even on matched distributions.