Uncovering the Limits of Proof Sharing for Neural Networks

arXiv:2608.19351 · cs.LG · Submitted 2026-08-19 · Read on arXiv

cs.LG

Submitted: 2026-08-19

Updated: 2026-08-25

Comments: To appear at the 33rd Static Analysis Symposium (SAS 2026)

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Verification — 3× in this paper · explained in 2 episodes
• Robustness — 2× in this paper · explained in 5 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks