mlsanityData to 14 Oct 2026

Sparse Flows: Pruning Continuous-depth Models

arXiv 2106.12718 ↗First posted 24 Jun 2021cs.LG cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

Continuous deep learning architectures enable learning of flexible probabilistic models for predictive modeling as neural ordinary differential equations (ODEs), and for generative modeling as continuous normalizing flows. In this work, we design a framework to decipher the internal dynamics of these continuous depth models by pruning their network architectures. Our empirical results suggest that pruning improves generalization for neural ODEs in generative modeling. We empirically show that the improvement is because pruning helps avoid mode-collapse and flatten the loss surface. Moreover, pruning finds efficient neural ODE representations with up to 98% less parameters compared to the original network, without loss of accuracy. We hope our results will invigorate further research into the performance-size trade-offs of modern continuous-depth models.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 53 of its 79 references that are in the map. First posted on arXiv 24 Jun 2021.

Builds on

53 of 79 references.

References · 53

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2018Neural Ordinary Differential Equationscited by 3,779
  3. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  6. 2015Variational Inference with Normalizing Flowscited by 2,170
  7. 2016Density estimation using Real NVPcited by 2,042
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  9. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
  10. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  11. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  12. 2014NICE: Non-linear Independent Components Estimationcited by 1,058
38 more
  1. 2017Masked Autoregressive Flow for Density Estimationcited by 684
  2. 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 640
  3. 2019Neural Spline Flowscited by 596
  4. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
  5. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
  6. 2019Augmented Neural ODEscited by 397
  7. 2015MADE: Masked Autoencoder for Distribution Estimationcited by 307
  8. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  9. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
  10. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
  11. 2020Scalable Gradients for Stochastic Differential Equationscited by 271
  12. 2019Residual Flows for Invertible Generative Modelingcited by 257
  13. 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
  14. 2018Neural Autoregressive Flowscited by 208
  15. 2017VEEGAN: Reducing Mode Collapse in GANs using Implicit Variational Learningcited by 200
  16. 2020Liquid Time-constant Networkscited by 161
  17. 2018Neural Importance Samplingcited by 155
  18. 2020Dissecting Neural ODEscited by 153
  19. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  20. 2016Designing Energy-Efficient Convolutional Neural Networks using Energy-Aware Pruningcited by 134
  21. 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
  22. 2019Unconstrained Monotonic Neural Networkscited by 92
  23. 2020Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimizationcited by 90
  24. 2020Lipschitz Recurrent Neural Networkscited by 89
  25. 2020Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximatorscited by 85
  26. 2020Learning Long-Term Dependencies in Irregularly-Sampled Time Seriescited by 83
  27. 2018Sylvester Normalizing Flows for Variational Inferencecited by 72
  28. 2019Sum-of-Squares Polynomial Flowcited by 62
  29. 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
  30. 2018Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Boundscited by 43
  31. 2020The Expressive Power of a Class of Normalizing Flow Modelscited by 35
  32. 2020Hypersolvers: Toward Fast Continuous-Depth Modelscited by 33
  33. 2019Potential Flow Generator with L2 Optimal Transport Regularity for Generative Modelscited by 31
  34. 2018Transformation Autoregressive Networkscited by 27
  35. 2021Causal Navigation by Continuous-time Neural Networkscited by 23
  36. 2021Adversarial Training is Not Ready for Robot Learningcited by 20
  37. 2019SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networkscited by 17
  38. 2020TorchDyn: A Neural Differential Equations Librarycited by 17

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 7; 2023: 0; 2024: 2; 2025: 2.

13 papers.

Sort: