TheMachine Press

A daily newspaper for the age of artificial intelligence.

Morning editionPermanent story

research

Pruning Followed the Model's Geometry

A Fisher-geodesic hierarchy beat magnitude and local-Fisher pruning across every tested architecture and dataset combination.

Published Updated Story ID: mp-2026-09-16-003
Read the complete editionStory JSON

Summary

A Fisher-geodesic hierarchy beat magnitude and local-Fisher pruning across every tested architecture and dataset combination.

Setting a neural-network parameter to zero moves the model onto a constrained surface. This paper measures that displacement with the Fisher information geometry, then derives a hierarchy from simple magnitude pruning toward progressively more faithful geodesic approximations. Across fully connected networks and vision transformers on MNIST and CIFAR-10, over the complete zero-to-100% pruning range and five seeds, the proposed schemes outperformed magnitude and local-Fisher pruning on both accuracy and Matthews correlation. Intermediate approximations retained much of the gain with lower computational cost; the evidence remains limited to the reported models and datasets.

Why it matters

A Fisher-geodesic hierarchy beat magnitude and local-Fisher pruning across every tested architecture and dataset combination.

Limits and context

No additional limitation was separately recorded.

Key claims

  1. A Fisher-geodesic hierarchy beat magnitude and local-Fisher pruning across every tested architecture and dataset combination.

    Evidence: source-2026-09-16-003

Sources

  1. arXiv preprint 2609.16129arXiv · primary research

Corrections

No corrections have been recorded for this story.