VLDB 2026 Research / reviewers in the wild / expert
Frances Dean
dblp:265/1338
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-9801-3015ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Med-Real2Sim: Non-Invasive Medical Digital Twins using Physics-Informed Self-Supervised LearningabstractA digital twin is a virtual replica of a real-world physical phenomena that uses mathematical modeling to characterize and simulate its defining features. By constructing digital twins for disease processes, we can perform in-silico simulations that mimic patients' health conditions and counterfactual outcomes under hypothetical interventions in a virtual setting. This eliminates the need for invasive procedures or uncertain treatment decisions. In this paper, we propose a method to identify digital twin model parameters using only noninvasive patient health data. We approach the digital twin modeling as a composite inverse problem, and observe that its structure resembles pretraining and finetuning in self-supervised learning (SSL). Leveraging this, we introduce a physics-informed SSL algorithm that initially pretrains a neural network on the pretext task of learning a differentiable simulator of a physiological process. Subsequently, the model is trained to reconstruct physiological measurements from noninvasive modalities while being constrained by the physical equations learned in pretraining. We apply our method to identify digital twins of cardiac hemodynamics using noninvasive echocardiogram videos, and demonstrate its utility in unsupervised disease detection and in-silico clinical trials. Keying Kuang, Frances Dean, Jack B. Jedlicki, David Ouyang, Anthony Philippakis, David A. Sontag, Ahmed Alaa 0001 |
NeurIPS | 2 |
| 2021 | Gonality Sequences of GraphsabstractWe associate to any graph a sequence of integers called the gonality sequence of the graph, consisting of the minimum degrees of divisors of increasing rank on the graph. This is a tropical analogue of the gonality sequence of an algebraic curve. We study gonality sequences for graphs of low genus, proving that for genus up to 5, the gonality sequence is determined by the genus and the first gonality. We then prove that any reasonable pair of the first two gonalities is achieved by some graph. We also develop a modified version of Dhar's burning algorithm more suited for studying higher gonalities. Ivan Aidun, Frances Dean, Ralph Morrison, Teresa Yu, Julie Yuan |
SIAM J. Discret. Math. | 2 |
| 2020 | Treewidth and gonality of glued grid graphs
Ivan Aidun, Frances Dean, Ralph Morrison, Teresa Yu, Julie Yuan |
Discret. Appl. Math. | 2 |