arXiv AI By David S. Berman, Yen-Yu Fu, Edward Hirst, Thelma Chiwete Obirai

Optimal Pruning for Neural Architectures using Fisher Information Distances

Read the original on arXiv AI →

The paper introduces a new parameter pruning scheme based on the Fisher information metric, using the geodesic distance in model space to determine the minimal change when a parameter is set to zero. This approach creates a hierarchy of pruning methods, starting from traditional magnitude pruning and progressing to more sophisticated, effective schemes. Experiments on fully‑connected networks and vision transformers across MNIST and CIFAR‑10 show that the Fisher‑based method outperforms magnitude pruning and local Fisher pruning in accuracy and Matthews correlation coefficient, while intermediate approximations offer computational efficiency with near‑optimal performance.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 12

Structured vs. Unstructured Pruning: An Exponential Gap

arXiv:2603. 02234v3 Announce Type: replace-cross Abstract: The Strong Lottery Ticket Hypothesis (SLTH) states that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initialization without training, suggesting that pruning alone is sufficient.

By Davide Ferre' (CNRS, COATI, UniCA, I3S), Fr\'ed\'eric Giroire (I3S, COATI, UniCA), Frederik Mallmann-Trenn (CNRS, COATI, I3S, UniCA), Emanuele Natale (CNRS, COATI, I3S, UniCA)
arXiv Machine Learning
Sep 22

Task-Aware Hybrid QUBO Optimization for Structured Neural Network Pruning

The paper introduces a Hybrid Quadratic Unconstrained Binary Optimization (QUBO) framework for structured neural network pruning that integrates task‑aware sensitivity metrics (first‑order Taylor and Weight‑Fisher) into the objective’s linear term and optionally uses activation similarity for quadratic interactions. It controls pruning cardinality via a binary search over a capacity incentive rather than an explicit penalty and further refines the pruning mask with a two‑stage QUBO–Tensor‑Train strategy that employs gradient‑free black‑box optimization. Experiments on SIDD image denoising with a Half‑UNet model demonstrate that this Hybrid QUBO outperforms Taylor and L1‑based QUBO baselines in PSNR and SSIM, while also revealing computational and deployment challenges of mask‑based pruning.

By Osama Orabi, Artur Zagitov, Hadi Salloum, Viktor A. Lobachev, Yaroslav Kholodov
arXiv Computer Vision
Oct 27

Is Oracle Pruning the True Oracle?

arXiv:2412.00143v3 Announce Type: replace-cross Abstract: Oracle pruning, which selects unimportant weights by minimizing the pruned train loss, has served as the foundation for most neural network p...

By Sicheng Feng, Keda Tao, Huan Wang