paper-with-me

Papers

APP: Anytime Progressive Pruning

2022-04-04 · Diganta Misra, Bharat Runwal, Tianlong Chen, Zhangyang Wang, Irina Rish

With the latest advances in deep learning, there has been a lot of focus on the online learning paradigm due to its relevance in practical settings. Although many methods have been investigated for optimal learning settings in scenarios where the data stream is continuous over time, sparse networks training in such settings have often been overlooked. In this paper, we explore the problem of training a neural network with a target sparsity in a particular case of online learning: the anytime learning at macroscale paradigm (ALMA). We propose a novel way of progressive pruning, referred to as \textit{Anytime Progressive Pruning} (APP); the proposed approach significantly outperforms the baseline dense and Anytime OSP models across multiple architectures and datasets under short, moderate, and long-sequence training. Our method, for example, shows an improvement in accuracy of $\approx 7\%$ and a reduction in the generalization gap by $\approx 22\%$, while being $\approx 1/3$ rd the size of the dense baseline model in few-shot restricted imagenet training. We further observe interesting nonmonotonic transitions in the generalization gap in the high number of megabatches-based ALMA. The code and experiment dashboards can be accessed at \url{https://github.com/landskape-ai/Progressive-Pruning} and \url{https://wandb.ai/landskape/APP}, respectively.

📄 PDF Abstract BibTeX arXiv:2204.01640

Code (1)

landskape-ai/progressive-pruning 공식 구현 pytorch

Tasks

Network PruningSparse Learning

Similar Papers 제목 키워드 기반

A Generic Complete Anytime Beam Search for Optimal Decision Tree

2025-08-08 · Harold Silvère Kiossou, Siegfried Nijssen, Pierre Schaus arxiv

Finding an optimal decision tree that minimizes classification error is known to be NP-hard. While exact algorithms based on MILP, CP, SAT, or dynamic programming guarantee optimality, they often suffer from poor anytime…

Anytime Ranking on Document-Ordered Indexes

2021-04-18 · Joel Mackenzie, Matthias Petri, Alistair Moffat

Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections. While there are a number of possible organizations, document-ordered indexes are the most comm…

Anytime Neural Architecture Search on Tabular Data

2024-03-15 · Naili Xing, Shaofeng Cai, Zhaojing Luo, Beng Chin Ooi 외

The increasing demand for tabular data analysis calls for transitioning from manual architecture design to Neural Architecture Search (NAS). This transition demands an efficient and responsive anytime NAS approach that i…

Neural Architecture Search

Model Compression using Progressive Channel Pruning

2025-07-07 · Jinyang Guo, Weichen Zhang, Wanli Ouyang, Dong Xu arxiv

In this work, we propose a simple but effective channel pruning framework called Progressive Channel Pruning (PCP) to accelerate Convolutional Neural Networks (CNNs). In contrast to the existing channel pruning methods t…

Model CompressionTransfer Learning

Progressive Gradient Pruning for Classification, Detection and DomainAdaptation

2019-06-20 · Le Thanh Nguyen-Meidine, Eric Granger, Madhu Kiran, Louis-Antoine Blais-Morin 외

Although deep neural networks (NNs) have achievedstate-of-the-art accuracy in many visual recognition tasks,the growing computational complexity and energy con-sumption of networks remains an issue, especially for ap-pli…

ClassificationGeneral Classificationobject-detectionObject Detection