Computational-overhead characterization for compression and deployment

Characterize the computational overhead of dynamic-system-based neural-network model compression during both the compression process and model deployment.

Background

The proposed framework uses nearest-state assignment, KD-trees, coordinate templates, trajectory generation, and decompression from stored indices. Although these engineering techniques are intended to improve scalability, the paper does not provide a complete characterization of their computational overhead across compression and deployment. The authors explicitly list this characterization as an open question for future work.

References

Several open questions remain for future work, including automatic selection of the dynamic system and its configuration and a more complete characterization of computational overhead during both compression and deployment.

— Dynamics as Code: On Model Compression via Dynamic System  (2610.11115 - Gao et al., 8 Oct 2026) in Section Conclusion