Neural Network Compression by Approximate Differential Equivalence 文章

ArXiv CS.AI2026-06-02NEWSen作者: Ravi Dhiman, Andrea Passarella, Mirco Tribastone, Lorenzo Valerio

摘要

arXiv:2606.01402v1 Announce Type: cross Abstract: Neural network compression is commonly achieved by pruning parameters based on local importance scores, e.g., magnitude-based pruning. We propose a complementary approach that compresses models by aggregating neurons with similar functional behavior rather than removing weights independently. Our method encodes a trained network as a polynomial ODE system and applies a lumping method called Approximate Forward Differential Equivalence to identify neurons with approximately matching induced dynamics. A single tolerance parameter, $\varepsilon$, controls the compression level and induces a smooth trade-off between model size and predictive accuracy. We evaluate the method on synthetic datasets derived from nonlinear dynamical systems with known ground-truth behavior and on public regression benchmarks.

相关公司

暂无数据

相关人物

暂无数据

相关产品

暂无数据