Topological Data Analysis combined with Machine Learning for Predicting Permeability of Porous Media

• URL: http://arxiv.org/abs/2605.17581v1
• Date: Sun, 17 May 2026 18:19:20 GMT
• Title: Topological Data Analysis combined with Machine Learning for Predicting Permeability of Porous Media
• Abstract summary: Flow in porous media is difficult to address using standard analytical or numerical methods due to its complexity.<n>We discuss a number of features that can be extracted from such data, and their utility as input variables into a standard machine learning algorithm.<n>These features include structural measures describing the geometry of the porous media, topological measures describing the connectivity, and network measures obtained by modeling the porous media as simplified pore networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Flow in porous media is difficult to address using standard analytical or numerical methods due to its complexity. However, since synthetic representations of porous media are easy to produce and data from physical experiments are becoming more widely available, the problem is well-suited to studies that include machine learning (ML) techniques. We discuss a number of features that can be extracted from such data, and their utility as input variables into a standard ML algorithm. These features include structural measures describing the geometry of the porous media, topological measures describing the connectivity, and network measures obtained by modeling the porous media as simplified pore networks. These features enable the prediction of the permeability of the considered (synthetic) porous materials using ML techniques that also leverage the separately computed exact permeability (ground truth). Comparing results obtained using different input variables helps develop a better understanding of the utility of various measures for predicting permeability based on the porous media structure. We show, in particular, that topological data analysis (TDA) provides a useful set of features that can be easily combined with ML to yield meaningful results.

Related papers

• 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)
• Mitigating loss of variance in ensemble data assimilation: machine learning-based and distance-free localization [44.99833362998488]
  Two new methods are proposed to enhance the covariance estimations in ensemble data assimilation.<n>The main goal is to enhance the data assimilation results by mitigating loss of variance due to sampling errors.<n>The methods are integrated into the Ensemble Smoother with Multiple Data Assimilation (ES-MDA) framework.
  arXiv  Detail & Related papers  (2025-06-16T11:09:27Z)
• A Unified MDL-based Binning and Tensor Factorization Framework for PDF Estimation [19.747102062281545]
  We present a novel non-parametric approach for multivariate probability density function estimation (PDF)<n>Our approach builds upon tensor factorization techniques, leveraging the canonical polyadic decomposition (CPD) of a joint probability tensor.<n>We demonstrate the effectiveness of our method on synthetic data and a challenging real dry bean classification dataset.
  arXiv  Detail & Related papers  (2025-04-25T20:27:04Z)
• Extrapolative ML Models for Copolymers [1.901715290314837]
  Machine learning models have been progressively used for predicting materials properties. These models are inherently interpolative, and their efficacy for searching candidates outside a material's known range of property is unresolved. Here, we determine the relationship between the extrapolation ability of an ML model, the size and range of its training dataset, and its learning approach.
  arXiv  Detail & Related papers  (2024-09-15T11:02:01Z)
• Data-free Weight Compress and Denoise for Large Language Models [96.68582094536032]
  We propose a novel approach termed Data-free Joint Rank-k Approximation for compressing the parameter matrices.<n>We achieve a model pruning of 80% parameters while retaining 93.43% of the original performance without any calibration data.
  arXiv  Detail & Related papers  (2024-02-26T05:51:47Z)
• Sparse high-dimensional linear mixed modeling with a partitioned empirical Bayes ECM algorithm [41.25603565852633]
  This work presents an efficient and accurate Bayesian framework for high-dimensional LMMs. The novelty of the approach lies in its partitioning and parameter expansion as well as its fast and scalable computation. A real-world example is provided using data from a study of lupus in children, where we identify genes and clinical factors associated with a new lupus biomarker and predict the biomarker over time.
  arXiv  Detail & Related papers  (2023-10-18T19:34:56Z)
• Joint machine learning analysis of muon spectroscopy data from different materials [0.0]
  We use principal component analysis (PCA) to study data from muon spectroscopy. PCA is an unsupervised machine learning tool, which means that no assumption about the input data is required. The method was applied to a range of magnetic materials with different underlying physics.
  arXiv  Detail & Related papers  (2021-12-17T16:21:53Z)
• A deep learning driven pseudospectral PCE based FFT homogenization algorithm for complex microstructures [68.8204255655161]
  It is shown that the proposed method is able to predict central moments of interest while being magnitudes faster to evaluate than traditional approaches. It is shown, that the proposed method is able to predict central moments of interest while being magnitudes faster to evaluate than traditional approaches.
  arXiv  Detail & Related papers  (2021-10-26T07:02:14Z)
• Learning with Density Matrices and Random Features [44.98964870180375]
  A density matrix describes the statistical state of a quantum system. It is a powerful formalism to represent both the quantum and classical uncertainty of quantum systems. This paper explores how density matrices can be used as a building block for machine learning models.
  arXiv  Detail & Related papers  (2021-02-08T17:54:59Z)
• Estimating informativeness of samples with Smooth Unique Information [108.25192785062367]
  We measure how much a sample informs the final weights and how much it informs the function computed by the weights. We give efficient approximations of these quantities using a linearized network. We apply these measures to several problems, such as dataset summarization.
  arXiv  Detail & Related papers  (2021-01-17T10:29:29Z)
• Physically interpretable machine learning algorithm on multidimensional non-linear fields [0.0]
  Polynomial Chaos Expansion (PCE) has long been employed as a robust representation for probabilistic input-to-output mapping. Dimensionality Reduction (DR) techniques are increasingly used for pattern recognition and data compression. The goal of the present paper was to combine POD and PCE for a field-measurement-based forecasting.
  arXiv  Detail & Related papers  (2020-05-28T11:26:06Z)

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.