Pith. sign in

REVIEW 2 cited by

OTOV2: Automatic, Generic, User-Friendly

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.06862 v2 pith:UDIJQY6T submitted 2023-03-13 cs.CV cs.AI

classification cs.CVcs.AI
keywords otov2modeleffortsapplicationsautomaticautomaticallyautonomyengineering
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The existing model compression methods via structured pruning typically require complicated multi-stage procedures. Each individual stage necessitates numerous engineering efforts and domain-knowledge from the end-users which prevent their wider applications onto broader scenarios. We propose the second generation of Only-Train-Once (OTOv2), which first automatically trains and compresses a general DNN only once from scratch to produce a more compact model with competitive performance without fine-tuning. OTOv2 is automatic and pluggable into various deep learning applications, and requires almost minimal engineering efforts from the users. Methodologically, OTOv2 proposes two major improvements: (i) Autonomy: automatically exploits the dependency of general DNNs, partitions the trainable variables into Zero-Invariant Groups (ZIGs), and constructs the compressed model; and (ii) Dual Half-Space Projected Gradient (DHSPG): a novel optimizer to more reliably solve structured-sparsity problems. Numerically, we demonstrate the generality and autonomy of OTOv2 on a variety of model architectures such as VGG, ResNet, CARN, ConvNeXt, DenseNet and StackedUnets, the majority of which cannot be handled by other methods without extensive handcrafting efforts. Together with benchmark datasets including CIFAR10/100, DIV2K, Fashion-MNIST, SVNH and ImageNet, its effectiveness is validated by performing competitively or even better than the state-of-the-arts. The source code is available at https://github.com/tianyic/only_train_once.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Loss-Aware Automatic Selection of Structured Pruning Criteria for Deep Neural Network Acceleration

    cs.CV 2025-06 conditional novelty 6.0 of 10

    LAASP prunes neural networks during training by greedily selecting the best layer and filter-importance criterion at each step using the network's loss on a data subset.

  2. ALTER: All-in-One Layer Pruning and Temporal Expert Routing for Efficient Diffusion Generation

    cs.CV 2025-05 conditional novelty 6.0 of 10

    ALTER jointly learns layer pruning masks and timestep-to-expert routing for diffusion UNets, cutting MACs to 26% of the 50-step baseline while keeping FID and CLIP scores near parity.

Pith tools