Data-Driven Learning of 3-Point Correlation Functions as Microstructure Representations

• URL: http://arxiv.org/abs/2109.02255v1
• Date: Mon, 6 Sep 2021 06:15:57 GMT
• Title: Data-Driven Learning of 3-Point Correlation Functions as Microstructure Representations
• Authors: Sheng Cheng, Yang Jiao, Yi Ren
• Abstract summary: We show that a variety of microstructures can be characterized by a concise subset of three-point correlations. The proposed representation can directly be used to compute material properties based on the effective medium theory.
• Score: 8.978973486638253
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper considers the open challenge of identifying complete, concise, and explainable quantitative microstructure representations for disordered heterogeneous material systems. Completeness and conciseness have been achieved through existing data-driven methods, e.g., deep generative models, which, however, do not provide mathematically explainable latent representations. This study investigates representations composed of three-point correlation functions, which are a special type of spatial convolutions. We show that a variety of microstructures can be characterized by a concise subset of three-point correlations, and the identification of such subsets can be achieved by Bayesian optimization. Lastly, we show that the proposed representation can directly be used to compute material properties based on the effective medium theory.

Related papers

• Prediction of microstructural representativity from a single image [0.0]
  We present a method for predicting the representativity of the phase fraction observed in a single image (2D or 3D) of a material. Our method leverages the Two-Point Correlation function to directly estimate the variance from a single image (2D or 3D)
  arXiv  Detail & Related papers  (2024-10-25T13:59:22Z)
• Simultaneous Identification of Sparse Structures and Communities in Heterogeneous Graphical Models [8.54401530955314]
  We introduce a novel decomposition of the underlying graphical structure into a sparse part and low-rank diagonal blocks. We propose a three-stage estimation procedure with a fast and efficient algorithm for the identification of the sparse structure and communities.
  arXiv  Detail & Related papers  (2024-05-16T06:38:28Z)
• Feature construction using explanations of individual predictions [0.0]
  We propose a novel approach for reducing the search space based on aggregation of instance-based explanations of predictive models. We empirically show that reducing the search to these groups significantly reduces the time of feature construction. We show significant improvements in classification accuracy for several classifiers and demonstrate the feasibility of the proposed feature construction even for large datasets.
  arXiv  Detail & Related papers  (2023-01-23T18:59:01Z)
• Accelerated structured matrix factorization [0.0]
  Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. By exploiting Bayesian shrinkage priors, we devise a computationally convenient approach for high-dimensional matrix factorization. The dependence between row and column entities is modeled by inducing flexible sparse patterns within factors.
  arXiv  Detail & Related papers  (2022-12-13T11:35:01Z)
• On Neural Architecture Inductive Biases for Relational Tasks [76.18938462270503]
  We introduce a simple architecture based on similarity-distribution scores which we name Compositional Network generalization (CoRelNet) We find that simple architectural choices can outperform existing models in out-of-distribution generalizations.
  arXiv  Detail & Related papers  (2022-06-09T16:24:01Z)
• Three-dimensional microstructure generation using generative adversarial neural networks in the context of continuum micromechanics [77.34726150561087]
  This work proposes a generative adversarial network tailored towards three-dimensional microstructure generation. The lightweight algorithm is able to learn the underlying properties of the material from a single microCT-scan without the need of explicit descriptors.
  arXiv  Detail & Related papers  (2022-05-31T13:26:51Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• 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)
• Parsimonious Feature Extraction Methods: Extending Robust Probabilistic Projections with Generalized Skew-t [0.8336315962271392]
  We propose a novel generalisation to the Student-t Probabilistic Principal Component methodology. The new framework provides a more flexible approach to modelling groups of marginal tail dependence in the observation data. The applicability of the new framework is illustrated on a data set that consists of crypto currencies with the highest market capitalisation.
  arXiv  Detail & Related papers  (2020-09-24T05:53:41Z)
• Convolutional Occupancy Networks [88.48287716452002]
  We propose Convolutional Occupancy Networks, a more flexible implicit representation for detailed reconstruction of objects and 3D scenes. By combining convolutional encoders with implicit occupancy decoders, our model incorporates inductive biases, enabling structured reasoning in 3D space. We empirically find that our method enables the fine-grained implicit 3D reconstruction of single objects, scales to large indoor scenes, and generalizes well from synthetic to real data.
  arXiv  Detail & Related papers  (2020-03-10T10:17:07Z)
• New advances in enumerative biclustering algorithms with online partitioning [80.22629846165306]
  This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical datasets. The improved algorithm is called RIn-Close_CVC3, keeps those attractive properties of RIn-Close_CVC, and is characterized by: a drastic reduction in memory usage; a consistent gain in runtime.
  arXiv  Detail & Related papers  (2020-03-07T14:54: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.