Physics-Informed Machine Learning Under Small-Data Constraints: Lessons from Abrasive Waterjet Milling

• URL: http://arxiv.org/abs/2607.07863v1
• Date: Wed, 08 Jul 2026 18:54:09 GMT
• Title: Physics-Informed Machine Learning Under Small-Data Constraints: Lessons from Abrasive Waterjet Milling
• Abstract summary: In physically dominated machining processes, experimental datasets are small, expensive, and material-specific.<n>We make three methodological contributions using an abrasive waterjet milling dataset.<n>For small, expensive process datasets, our results suggest that, in this setting, reliable model comparison benefits from explicit curation hypotheses.
• Score: 0.16283634001181238
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In physically dominated machining processes, experimental datasets are small, expensive, and material-specific; in this regime, data curation, evaluation design, and the form of physics integration can matter as much as the learning algorithm. Using an abrasive waterjet milling dataset ($n{=}155$, Inconel\,718), we make three methodological contributions. First, we separate physics-based data \emph{cleaning} from statistical \emph{curation} and treat the latter as competing modelling hypotheses rather than silent preprocessing. Second, we find that model rankings from a 15-point hold-out set can be unstable: the single-split winner drops from rank~1 to rank~7 under 10-fold cross-validation, while Gaussian Process (GP) variants occupy the top ranks. Third, we study a spectrum of physics integration levels and find that residual learning on a compact physics baseline is competitive for GP, yielding lower variance and an interpretable decomposition, but degrades tree-based models. Bayesian hyper parameter tuning improves parameter-sensitive baselines such as gradient boosting and SVR, yet harms multi-stage hybrid pipelines at this sample size. GP uncertainty intervals are approximately calibrated ($86\%$ empirical coverage at nominal $90\%$). The resulting picture is methodological: for small, expensive process datasets, our results suggest that, in this setting, reliable model comparison benefits from explicit curation hypotheses, robust evaluation, and careful choices about how physics enters the model.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Scalable Learning of Multivariate Distributions via Coresets [48.02318786960811]
  We develop a novel coreset construction for multivariate conditional transformation models (MCTMs) to enhance their scalability and training efficiency.<n>Our approach yields substantial data reduction via importance sampling.<n>Compared to conventional full-parametric models, where coresets have been incorporated before, our semi-parametric approach exhibits enhanced adaptability.
  arXiv  Detail & Related papers  (2026-03-20T09:28:43Z)
• Can Small Training Runs Reliably Guide Data Curation? Rethinking Proxy-Model Practice [109.9635246405237]
  We show that the experiment conclusions about data quality can flip with even minor adjustments to training hyper parameters.<n>We introduce a simple patch to the evaluation protocol: using reduced learning rates for proxy model training.<n> Empirically, we validate this approach across 23 data recipes covering four critical dimensions of data curation.
  arXiv  Detail & Related papers  (2025-12-30T23:02:44Z)
• Parameter-Efficient Conditioning for Material Generalization in Graph-Based Simulators [2.504298819189614]
  Graph network-based simulators (GNS) have demonstrated strong potential for learning particle-based physics.<n>Existing models are typically trained for a single material type and fail to generalize across distinct behaviors.<n>We propose a parameter-efficient conditioning mechanism that makes the GNS model adaptive to material parameters.
  arXiv  Detail & Related papers  (2025-11-07T17:55:35Z)
• Uncertainty-Aware Diagnostics for Physics-Informed Machine Learning [7.677300807530908]
  Physics-informed machine learning (PIML) integrates prior physical information, often in the form of differential equation constraints, into the process of fitting models to physical data.<n>We introduce the Physics-Informed Log Evidence (PILE) score to measure the quality of PIML models.<n>We show that PILE yields excellent choices for a wide variety of model parameters, including kernel bandwidth, least squares regularization weights, and even kernel function selection.
  arXiv  Detail & Related papers  (2025-10-30T04:05:49Z)
• Hybrid Generative Modeling for Incomplete Physics: Deep Grey-Box Meets Optimal Transport [48.06072022424773]
  Many real-world systems are described only approximately with missing or unknown terms in the equations.<n>This makes the distribution of the physics model differ from the true data-generating process (DGP)<n>We present a novel hybrid generative model approach combining deep grey-box modelling with Optimal Transport (OT) methods to enhance incomplete physics models.
  arXiv  Detail & Related papers  (2025-06-27T13:23:27Z)
• Estimating properties of a homogeneous bounded soil using machine learning models [0.0]
  This work focuses on estimating soil properties from water moisture measurements.<n>We consider simulated data generated by solving the initial-boundary value problem governing vertical infiltration in a homogeneous, bounded soil profile.<n>To address the parameter identification problem, which is formulated as a two-output regression task, we explore various machine learning models.
  arXiv  Detail & Related papers  (2025-06-02T07:25:03Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• M-DEW: Extending Dynamic Ensemble Weighting to Handle Missing Values [2.8861431208787525]
  We develop a novel AutoML technique for making downstream predictions with missing data. M-DEW is shown to outperform the state-of-the-art in that it produces statistically significant reductions in model perplexity in 17 out of 18 experiments.
  arXiv  Detail & Related papers  (2024-04-30T20:13:18Z)
• Physics-informed Variational Autoencoders for Improved Robustness to Environmental Factors of Variation [0.6384650391969042]
  p$3$VAE is a variational autoencoder that integrates prior physical knowledge about the latent factors of variation related to the data acquisition conditions.<n>We introduce a semi-supervised learning algorithm that strikes a balance between the machine learning part and the physics part.
  arXiv  Detail & Related papers  (2022-10-19T09:32:15Z)
• Physics-informed machine learning with differentiable programming for heterogeneous underground reservoir pressure management [64.17887333976593]
  Avoiding over-pressurization in subsurface reservoirs is critical for applications like CO2 sequestration and wastewater injection. Managing the pressures by controlling injection/extraction are challenging because of complex heterogeneity in the subsurface. We use differentiable programming with a full-physics model and machine learning to determine the fluid extraction rates that prevent over-pressurization.
  arXiv  Detail & Related papers  (2022-06-21T20:38:13Z)
• Attentional-Biased Stochastic Gradient Descent [74.49926199036481]
  We present a provable method (named ABSGD) for addressing the data imbalance or label noise problem in deep learning. Our method is a simple modification to momentum SGD where we assign an individual importance weight to each sample in the mini-batch. ABSGD is flexible enough to combine with other robust losses without any additional cost.
  arXiv  Detail & Related papers  (2020-12-13T03:41:52Z)
• Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shift [81.74795324629712]
  We call prediction-time batch normalization, which significantly improves model accuracy and calibration under covariate shift. We show that prediction-time batch normalization provides complementary benefits to existing state-of-the-art approaches for improving robustness. The method has mixed results when used alongside pre-training, and does not seem to perform as well under more natural types of dataset shift.
  arXiv  Detail & Related papers  (2020-06-19T05:08:43Z)
• Addressing Class-Imbalance Problem in Personalized Ranking [47.11372043636176]
  We propose an efficient emphunderlineVital underlineNegative underlineSampler (VINS) to alleviate the class-imbalance issue for pairwise ranking model. VINS is a bias sampler with reject probability that will tend to accept a negative candidate with a larger degree weight than the given positive item.
  arXiv  Detail & Related papers  (2020-05-19T08:11:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.