Skip to content

Learning the Geometry of Admissible Hypotheses through Inductive Bias in Training Distributions

Aug 2026 · 0 citations · 27 references
Mathematics Computer Science

TL;DR

This work presents a framework for learning continuous latent representations of admissible partial differential equations by embedding a scientific inductive bias directly into the training distribution, and shows that embedding a scientific inductive bias in the training distribution enables the learning of compact and geometrically meaningful hypothesis manifolds.

Abstract

Scientific discovery often requires reasoning over competing hypotheses that are consistent with experimental observations. For mixed-variable and combinatorial hypothesis spaces, however, constructing probabilistic representations remains challenging because both the active model components and their associated parameters are unknown. In this work, we present a framework for learning continuous latent representations of admissible partial differential equations (PDEs) by embedding a scientific inductive bias directly into the training distribution. Progressively richer structural principles (e.g., sparsity, logical dependencies, common PDE families, and physical admissibility) are used to generate a structured distribution of hypotheses from which a gated variational autoencoder learns a continuous latent manifold. Experimental results show that the resulting 11-dimensional representation accurately reconstructs a broad collection of representative PDEs, while exhibiting smooth geometric transitions both within and across equation families. Through an ablation study we further demonstrate that introducing scientific principles reduces both structural misclassifications of equation forms and parameter estimation errors when reconstructing a representative benchmark set of admissible partial differential equations. These results show that embedding a scientific inductive bias in the training distribution enables the learning of compact and geometrically meaningful hypothesis manifolds, providing a principled foundation for future inference over competing governing equations.

View source

Similar papers

#machine learning Preprint Sep 2026

Optimal Transport Dropout for Structured Predictive Uncertainty

Deterministic neural networks and neural operators provide point predictions with no intrinsic measure of reliability. Yet, predictive uncertainty may stem from irreducible outcome variability, finite data, or limitations of the chosen model class. Monte Carlo dropout offers a computationally convenient way to construc...

Giacomo Lorenzon, Francesco Regazzoni · 0 citations
#machine learning Preprint Sep 2026

High-Dimensional Simulation-Based Inference in Latent Spaces

Neural simulation-based inference (SBI) has been widely successful in inferring a relatively small number of interpretable parameters from potentially high-dimensional observations, such as images or time series. Accordingly, representation learning in SBI has focused almost exclusively on compressing the observations...

Lars Kuhmichel, Stefan T. Radev, B. Koppolu et al. · 0 citations
#machine learning Preprint Sep 2026

Variational Mixtures and Multi-Marginal Flow Matching: Advancing Statistical Inference with Biological Applications

In this thesis I develop methods for statistical inference when the distributions arising from complex biological systems are multi-modal, geometrically structured, and sometimes only defined up to a normalizing constant. I start from variational inference and, when analytic update equations are unavailable, move to bl...

Oskar Kviman · 0 citations
#machine learning Preprint Sep 2026

Learning Samples Importance: Parameterizing Dual Variables in Everywhere Learning

Everywhere learning provides a principled framework for training AI models under constraints that must hold throughout the data distribution. In the dual domain, these pointwise constraints give rise to functional dual variables. In this work, we propose to learn these dual variables, motivated by the fact that their v...

Ignacio Boero, Jonathan Nixon, A. Ribeiro · 0 citations
#machine learning Preprint Sep 2026

SLP-ProbHard: Probabilistic Hard-Constrained Learning via Structural Latent Parameterization

SLP-ProbHard is introduced, a cross-family, representation-centered framework for probabilistic hard-constrained learning when explicit structural parameterizations are available, and how feasible coordinates and maps affect stochastic dimension, dependence, calibration, expressiveness, and computation is studied.

W. Bekele, M. D'Oria · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.