A Tutorial on Dimensionless Learning: Geometric Interpretation and the Effect of Noise

• URL: http://arxiv.org/abs/2512.15760v1
• Date: Fri, 12 Dec 2025 06:56:24 GMT
• Title: A Tutorial on Dimensionless Learning: Geometric Interpretation and the Effect of Noise
• Authors: Zhengtao Jake Gan, Xiaoyu Xie,
• Abstract summary: Dimensionless learning is a data-driven framework for discovering dimensionless numbers and scaling laws from experimental measurements.<n>This tutorial introduces the method, explaining how it transforms experimental data into compact physical laws.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dimensionless learning is a data-driven framework for discovering dimensionless numbers and scaling laws from experimental measurements. This tutorial introduces the method, explaining how it transforms experimental data into compact physical laws that reveal compact dimensional invariance between variables. The approach combines classical dimensional analysis with modern machine learning techniques. Starting from measurements of physical quantities, the method identifies the fundamental ways to combine variables into dimensionless groups, then uses neural networks to discover which combinations best predict the experimental output. A key innovation is a regularization technique that encourages the learned coefficients to take simple, interpretable values like integers or half-integers, making the discovered laws both accurate and physically meaningful. We systematically investigate how measurement noise and discrete sampling affect the discovery process, demonstrating that the regularization approach provides robustness to experimental uncertainties. The method successfully handles cases with single or multiple dimensionless numbers, revealing how different but equivalent representations can capture the same underlying physics. Despite recent progress, key challenges remain, including managing the computational cost of identifying multiple dimensionless groups, understanding the influence of data characteristics, automating the selection of relevant input variables, and developing user-friendly tools for experimentalists. This tutorial serves as both an educational resource and a practical guide for researchers seeking to apply dimensionless learning to their experimental data.

Related papers

• Identification and Debiased Learning of Causal Effects with General Instrumental Variables [5.00731378650601]
  We develop a general nonparametric framework for identification and learning with multi-categorical or continuous instrumental variables.<n>We derive consistent, efficientally normal estimators via debiased machine learning.<n>We demonstrate the proposed method by employing simulation studies and analyzing real data from the Job Training Partnership Act program.
  arXiv  Detail & Related papers  (2025-10-23T10:10:11Z)
• Machine learning enabled experimental design and parameter estimation for ultrafast spin dynamics [54.172707311728885]
  We introduce a methodology that combines machine learning with Bayesian optimal experimental design (BOED) Our method employs a neural network model for large-scale spin dynamics simulations for precise distribution and utility calculations in BOED. Our numerical benchmarks demonstrate the superior performance of our method in guiding XPFS experiments, predicting model parameters, and yielding more informative measurements within limited experimental time.
  arXiv  Detail & Related papers  (2023-06-03T06:19:20Z)
• Some of the variables, some of the parameters, some of the times, with some physics known: Identification with partial information [0.0]
  We exploit neural network architectures based on numerical integration methods and $textita priori$ physical knowledge. Iterates such neural-network models allow for learning from data sampled at arbitrary time points. This enables learning unknown kinetic rates or microbial growth functions while simultaneously estimating experimental parameters.
  arXiv  Detail & Related papers  (2023-04-27T14:21:05Z)
• Dynamic Latent Separation for Deep Learning [67.62190501599176]
  A core problem in machine learning is to learn expressive latent variables for model prediction on complex data. Here, we develop an approach that improves expressiveness, provides partial interpretation, and is not restricted to specific applications.
  arXiv  Detail & Related papers  (2022-10-07T17:56:53Z)
• Deep Active Learning with Noise Stability [24.54974925491753]
  Uncertainty estimation for unlabeled data is crucial to active learning. We propose a novel algorithm that leverages noise stability to estimate data uncertainty. Our method is generally applicable in various tasks, including computer vision, natural language processing, and structural data analysis.
  arXiv  Detail & Related papers  (2022-05-26T13:21:01Z)
• A Data-Driven Method for Automated Data Superposition with Applications in Soft Matter Science [0.0]
  We develop a data-driven, non-parametric method for superposing experimental data with arbitrary coordinate transformations. Our method produces interpretable data-driven models that may inform applications such as materials classification, design, and discovery.
  arXiv  Detail & Related papers  (2022-04-20T14:58:04Z)
• Learning new physics efficiently with nonparametric methods [11.970219534238444]
  We present a machine learning approach for model-independent new physics searches. The corresponding algorithm is powered by recent large-scale implementations of kernel methods. We show that our approach has dramatic advantages compared to neural network implementations in terms of training times and computational resources.
  arXiv  Detail & Related papers  (2022-04-05T16:17:59Z)
• BatchFormer: Learning to Explore Sample Relationships for Robust Representation Learning [93.38239238988719]
  We propose to enable deep neural networks with the ability to learn the sample relationships from each mini-batch. BatchFormer is applied into the batch dimension of each mini-batch to implicitly explore sample relationships during training. We perform extensive experiments on over ten datasets and the proposed method achieves significant improvements on different data scarcity applications.
  arXiv  Detail & Related papers  (2022-03-03T05:31:33Z)
• What Matters in Learning from Offline Human Demonstrations for Robot Manipulation [64.43440450794495]
  We conduct an extensive study of six offline learning algorithms for robot manipulation. Our study analyzes the most critical challenges when learning from offline human data. We highlight opportunities for learning from human datasets.
  arXiv  Detail & Related papers  (2021-08-06T20:48:30Z)
• Nonparametric Estimation of Heterogeneous Treatment Effects: From Theory to Learning Algorithms [91.3755431537592]
  We analyze four broad meta-learning strategies which rely on plug-in estimation and pseudo-outcome regression. We highlight how this theoretical reasoning can be used to guide principled algorithm design and translate our analyses into practice.
  arXiv  Detail & Related papers  (2021-01-26T17:11:40Z)
• Towards Improved and Interpretable Deep Metric Learning via Attentive Grouping [103.71992720794421]
  Grouping has been commonly used in deep metric learning for computing diverse features. We propose an improved and interpretable grouping method to be integrated flexibly with any metric learning framework.
  arXiv  Detail & Related papers  (2020-11-17T19:08:24Z)
• On the Robustness of Active Learning [0.7340017786387767]
  Active Learning is concerned with how to identify the most useful samples for a Machine Learning algorithm to be trained with. We find that it is often applied with not enough care and domain knowledge. We propose the new "Sum of Squared Logits" method based on the Simpson diversity index and investigate the effect of using the confusion matrix for balancing in sample selection.
  arXiv  Detail & Related papers  (2020-06-18T09:07:23Z)

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.