mlsanityData to 14 Oct 2026

Neural Network Training Using ℓ1-Regularization and Bi-fidelity Data

arXiv 2105.13011 ↗First posted 27 May 2021stat.ML cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

With the capability of accurately representing a functional relationship between the inputs of a physical system's model and output quantities of interest, neural networks have become popular for surrogate modeling in scientific applications. However, as these networks are over-parameterized, their training often requires a large amount of data. To prevent overfitting and improve generalization error, regularization based on, e.g., ℓ1- and ℓ2-norms of the parameters is applied. Similarly, multiple connections of the network may be pruned to increase sparsity in the network parameters. In this paper, we explore the effects of sparsity promoting ℓ1-regularization on training neural networks when only a small training dataset from a high-fidelity model is available. As opposed to standard ℓ1-regularization that is known to be inadequate, we consider two variants of ℓ1-regularization informed by the parameters of an identical network trained using data from lower-fidelity models of the problem at hand. These bi-fidelity strategies are generalizations of transfer learning of neural networks that uses the parameters learned from a large low-fidelity dataset to efficiently train networks for a small high-fidelity dataset. We also compare the bi-fidelity strategies with two ℓ1-regularization methods that only use the high-fidelity dataset. Three numerical examples for propagating uncertainty through physical systems are used to show that the proposed bi-fidelity ℓ1-regularization strategies produce errors that are one order of magnitude smaller than those of networks trained only using datasets from the high-fidelity models.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 27 of its 70 references that are in the map. First posted on arXiv 27 May 2021.

Builds on

27 of 70 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  3. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  4. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  5. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,070
  6. 2016An overview of gradient descent optimization algorithmscited by 1,033
  7. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  8. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  9. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  10. 2018Rethinking the Value of Network Pruningcited by 599
  11. 2016Error bounds for approximations with deep ReLU networkscited by 574
  12. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
15 more
  1. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  2. 2015Adversarial Autoencoderscited by 364
  3. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
  4. 2017Hidden Physics Models: Machine Learning of Nonlinear Partial Differential Equationscited by 208
  5. 2019Prediction of Aerodynamic Flow Fields Using Convolutional Neural Networkscited by 145
  6. 2016Group Sparse Regularization for Deep Neural Networkscited by 89
  7. 2015Fast ConvNets Using Group-wise Brain Damagecited by 82
  8. 2016Learning the Number of Neurons in Deep Networkscited by 69
  9. 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
  10. 2020The gap between theory and practice in function approximation with deep neural networkscited by 54
  11. 2020On transfer learning of neural networks using bi-fidelity data for uncertainty propagationcited by 26
  12. 2020Deep Neural Networks Are Effective At Learning High-Dimensional Hilbert-Valued Functions From Limited Datacited by 22
  13. 2014Memory Bounded Deep Convolutional Networkscited by 17
  14. 2019Topology Optimization under Uncertainty using a Stochastic Gradient-based Approachcited by 6
  15. 2019Bi-fidelity Stochastic Gradient Descent for Structural Optimization under Uncertaintycited by 5

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 5; 2024: 4; 2025: 4.

16 papers.

Sort:

By area:

  1. 2022Multifidelity Deep Operator Networks For Data-Driven and Physics-Informed Problemscited by 58
  2. 2022Bi-fidelity Modeling of Uncertain and Partially Unknown Systems using DeepONetscited by 27
  3. 2022Multi-fidelity wavelet neural operator with application to uncertainty quantificationcited by 12
  4. 2023Interpreting and generalizing deep learning in physics-based problems with functional linear modelscited by 9
  5. 2024Multifidelity Kolmogorov-Arnold Networkscited by 9
  6. 2023Feature-adjacent multi-fidelity physics-informed machine learning for partial differential equationscited by 8
  7. 2023Bi-fidelity Variational Auto-encoder for Uncertainty Quantificationcited by 8
  8. 2023PINN surrogate of Li-ion battery models for parameter inference. Part I: Implementation and multi-fidelity hierarchies for the single-particle modelcited by 6
  9. 2025Data-Efficient Deep Operator Network for Unsteady Flow: A Multi-Fidelity Approach with Physics-Guided Subsamplingcited by 5
  10. 2024Multifidelity linear regression for scientific machine learning from scarce datacited by 3
  11. 2025On the Interplay Between Sparsity and Training in Deep Reinforcement Learningcited by 3
  12. 2024Empowering Bayesian Neural Networks with Functional Priors through Anchored Ensembling for Mechanics Surrogate Modeling Applicationscited by 2
4 more
  1. 2024Mathematical Formalism for Memory Compression in Selective State Space Modelscited by 2
  2. 2025CoNNect: Connectivity-Based Regularization for Structural Pruningcited by 1
  3. 2023Transfer learning for predicting source terms of principal component transport in chemically reactive flowcited by 0
  4. 2025Stochastic Subspace Descent Accelerated via Bi-fidelity Line Searchcited by 0