paper-with-me

홈 › Papers

Exploring 3D Dataset Pruning

2026-02-28 · Xiaohan Zhao, Xinyi Shang, Jiacheng Liu, Zhiqiang Shen arxiv

Dataset pruning has been widely studied for 2D images to remove redundancy and accelerate training, while particular pruning methods for 3D data remain largely unexplored. In this work, we study dataset pruning for 3D data, where its observed common long-tail class distribution nature make optimization under conventional evaluation metrics Overall Accuracy (OA) and Mean Accuracy (mAcc) inherently conflicting, and further make pruning particularly challenging. To address this, we formulate pruning as approximating the full-data expected risk with a weighted subset, which reveals two key errors: coverage error from insufficient representativeness and prior-mismatch bias from inconsistency between subset-induced class weights and target metrics. We propose representation-aware subset selection with per-class retention quotas for long-tail coverage, and prior-invariant teacher supervision using calibrated soft labels and embedding-geometry distillation. The retention quota also serves as a switch to control the OA-mAcc trade-off. Extensive experiments on 3D datasets show that our method can improve both metrics across multiple settings while adapting to different downstream preferences. Our code is available at https://github.com/XiaohanZhao123/3D-Dataset-Pruning.

📄 PDF Abstract BibTeX arXiv:2603.00651

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Large-scale Dataset Pruning with Dynamic Uncertainty

2023-06-08 · Muyang He, Shuo Yang, Tiejun Huang, Bo Zhao

The state of the art of many learning tasks, e.g., image classification, is advanced by collecting larger datasets and then training larger models on them. As the outcome, the increasing computational cost is becoming un…

image-classificationImage Classification

Exploring the Performance of Pruning Methods in Neural Networks: An Empirical Study of the Lottery Ticket Hypothesis

2023-03-26 · Eirik Fladmark, Muhammad Hamza Sajjad, Laura Brinkholm Justesen

In this paper, we explore the performance of different pruning methods in the context of the lottery ticket hypothesis. We compare the performance of L1 unstructured pruning, Fisher pruning, and random pruning on differe…

Exploring Learning Complexity for Efficient Downstream Dataset Pruning

2024-02-08 · Wenyu Jiang, Zhenlong Liu, Zejian Xie, Songxin Zhang 외

The ever-increasing fine-tuning cost of large-scale pre-trained models gives rise to the importance of dataset pruning, which aims to reduce dataset size while maintaining task performance. However, existing dataset prun…

Informativeness

Exploring Weight Importance and Hessian Bias in Model Pruning

2020-06-19 · Mingchen Li, Yahya Sattar, Christos Thrampoulidis, Samet Oymak

Model pruning is an essential procedure for building compact and computationally-efficient machine learning models. A key feature of a good pruning algorithm is that it accurately quantifies the relative importance of th…

Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neurons

2024-03-12 · Simon Dufort-Labbé, Pierluca D'Oro, Evgenii Nikishin, Razvan Pascanu 외

When training deep neural networks, the phenomenon of $\textit{dying neurons}$ $\unicode{x2013}$units that become inactive or saturated, output zero during training$\unicode{x2013}$ has traditionally been viewed as undes…

Continual LearningModel Compression