arXiv Machine Learning By Gianluca Barmina, Annemette Broch Pirchert, Andrea Blasi N\'u\~nez, Lukas Galke Poech, Peter Schneider-Kamp

BrainSurgery: Reproducible and Reliable Declarative Weight Manipulations for Model Editing and Upcycling

Read the original on arXiv Machine Learning →

arXiv:2606. 09707v1 Announce Type: new Abstract: As deep learning models scale, managing, inspecting, and modifying large checkpoints has become increasingly challenging.

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 Machine Learning.

arXiv AI
Sep 15

Tensorization is a powerful but underexplored tool for compression and interpretability of neural networks

The paper discusses tensorizing neural networks by reshaping dense weight matrices into higher-order tensors and approximating them with low-rank tensor network decompositions. This approach offers promising model compression and introduces bond indices that create new latent spaces, potentially enhancing interpretability. Despite encouraging empirical results, tensorized neural networks remain underused, and the authors call for more research to address practical scaling and adoption challenges.

By Safa Hamreras, Sukhbinder Singh, Rom\'an Or\'us
arXiv Computation and Language
Oct 19

Automatic Tensor-level Execution of Abstract Interpreters for Neural Networks

Neuton is a framework that automatically converts neuron‑level abstract interpreter specifications into tensor‑level executables, enabling the creation of new DNN certifiers without manual tensor programming. It introduces a stack‑based intermediate representation with shape analysis, domain‑specific rewrite rules for efficient tensor operations, and a novel sparse tensor format (gBCSR) tailored to certifier sparsity. The authors demonstrate that Neuton preserves neuron‑level semantics and evaluate it on eight certifiers across 32 DNN benchmarks, compiling four existing certifiers and producing executable implementations for four others, revealing new precision‑runtime trade‑offs such as SkipPoly matching DeepPoly’s precision while often running faster.

By Avaljot Singh, Yasmin Chandini Sarita, Aditya Mishra, Gagandeep Singh, Charith Mendis