Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aimee Maurais

dblp:339/0336 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 80% Optimization for machine learning · 20%
Theoretical computer science
2 papers
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
gradient flow
0.812024
Sampling in Unit Time with Kernel Fisher-Rao Flow · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
interacting particle systems
0.812024
Sampling in Unit Time with Kernel Fisher-Rao Flow · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › sequential monte carlo
particle method
0.812024
Sampling in Unit Time with Kernel Fisher-Rao Flow · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning
sampling
0.812024
Sampling in Unit Time with Kernel Fisher-Rao Flow · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
covariance estimation
0.712023
Multi-Fidelity Covariance Estimation in the Log-Euclidean Geometry · ICML 2023
Mathematical optimization
optimal transport
0.212024
Sampling in Unit Time with Kernel Fisher-Rao Flow · ICML 2024
Computational science and engineering
uncertainty quantification
0.212023
Multi-Fidelity Covariance Estimation in the Log-Euclidean Geometry · ICML 2023

Methods — techniques the papers use, named apart from their topics

multi-fidelity estimation · 2.0log-euclidean geometry · 2.0poisson equation · 1.5monge-ampère equations · 1.5kernel methods · 1.5RKHS · 1.5
YearPublicationVenuePosition
2024 Sampling in Unit Time with Kernel Fisher-Rao Flow
abstract
We introduce a new mean-field ODE and corresponding interacting particle systems (IPS) for sampling from an unnormalized target density. The IPS are gradient-free, available in closed form, and only require the ability to sample from a reference density and compute the (unnormalized) target-to-reference density ratio. The mean-field ODE is obtained by solving a Poisson equation for a velocity field that transports samples along the geometric mixture of the two densities, $\pi_0^{1-t} \pi_1^t$, which is the path of a particular Fisher-Rao gradient flow. We employ a RKHS ansatz for the velocity field, which makes the Poisson equation tractable and enables discretization of the resulting mean-field ODE over finite samples. The mean-field ODE can be additionally be derived from a discrete-time perspective as the limit of successive linearizations of the Monge-Ampère equations within a framework known as sample-driven optimal transport. We introduce a stochastic variant of our approach and demonstrate empirically that our IPS can produce high-quality samples from varied target distributions, outperforming comparable gradient-free particle systems and competitive with gradient-based alternatives.
Aimee Maurais, Youssef Marzouk 0001
ICML1
2023 Multi-Fidelity Covariance Estimation in the Log-Euclidean Geometry
abstract
We introduce a multi-fidelity estimator of covariance matrices that employs the log-Euclidean geometry of the symmetric positive-definite manifold. The estimator fuses samples from a hierarchy of data sources of differing fidelities and costs for variance reduction while guaranteeing definiteness, in contrast with previous approaches. The new estimator makes covariance estimation tractable in applications where simulation or data collection is expensive; to that end, we develop an optimal sample allocation scheme that minimizes the mean-squared error of the estimator given a fixed budget. Guaranteed definiteness is crucial to metric learning, data assimilation, and other downstream tasks. Evaluations of our approach using data from physical applications (heat conduction, fluid dynamics) demonstrate more accurate metric learning and speedups of more than one order of magnitude compared to benchmarks.
Aimee Maurais, Terrence Alsup, Benjamin Peherstorfer, Youssef Marzouk 0001
ICML1