Distributional inverse homogenization learns microstructural statistics from bulk mechanical measurements by inverting the homogenization process statistically.
Stochastic inverse problem: stability, regularization and wasserstein gradient flow.arXiv preprint arXiv:2410.00229
5 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 2polarities
background 2representative citing papers
A quadratic self-test loss derived from the weak-form evolution equation allows robust learning of particle interaction potentials directly from unlabeled data without trajectory recovery.
SCSI iteratively refines a self-consistent transport map to invert black-box corruptions and enable generative modeling of clean data.
Diffeomorphisms and vector fields are uniquely identifiable from finitely many pushforward densities or weighted divergences, with the number of required observations determined by embedding theorems.
A methodology for populational inverse problems that simultaneously deconvolves unknown observational noise and recovers parameter distributions via structured gradient descent and adaptive empirical measure-based active learning for surrogates.
citing papers explorer
-
Distributional Inverse Homogenization
Distributional inverse homogenization learns microstructural statistics from bulk mechanical measurements by inverting the homogenization process statistically.
-
Learning interacting particle systems from unlabeled data
A quadratic self-test loss derived from the weak-form evolution equation allows robust learning of particle interaction potentials directly from unlabeled data without trajectory recovery.
-
Generative Modeling from Black-box Corruptions via Self-Consistent Stochastic Interpolants
SCSI iteratively refines a self-consistent transport map to invert black-box corruptions and enable generative modeling of clean data.
-
On the Unique Recovery of Transport Maps and Vector Fields from Finite Measure-Valued Data
Diffeomorphisms and vector fields are uniquely identifiable from finitely many pushforward densities or weighted divergences, with the number of required observations determined by embedding theorems.
-
Efficient Deconvolution in Populational Inverse Problems
A methodology for populational inverse problems that simultaneously deconvolves unknown observational noise and recovers parameter distributions via structured gradient descent and adaptive empirical measure-based active learning for surrogates.