Demo Data from EDBT 2026 / reviewers in the wild / expert
Jennifer Z. Sun
dblp:404/6658
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 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
1 paper |
Generative modeling · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
variational autoencoder |
0.9 | 1 | 2025 | A Deep Generative Learning Approach for Two-stage Adaptive Robust Optimization · ICLR 2025 |
Mathematical optimization › optimization under uncertainty
robust optimization |
0.9 | 1 | 2025 | A Deep Generative Learning Approach for Two-stage Adaptive Robust Optimization · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
variational autoencoder · 1.7projected gradient ascent · 1.7column-and-constraint algorithm · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Deep Generative Learning Approach for Two-stage Adaptive Robust OptimizationabstractTwo-stage adaptive robust optimization (ARO) is a powerful approach for planning under uncertainty, balancing first-stage decisions with recourse decisions made after uncertainty is realized. To account for uncertainty, modelers typically define a simple uncertainty set over which potential outcomes are considered. However, classical methods for defining these sets unintentionally capture a wide range of unrealistic outcomes, resulting in overly-conservative and costly planning in anticipation of unlikely contingencies. In this work, we introduce AGRO, a solution algorithm that performs adversarial generation for two-stage adaptive robust optimization using a variational autoencoder. AGRO generates high-dimensional contingencies that are simultaneously adversarial and realistic, improving the robustness of first-stage decisions at a lower planning cost than standard methods. To ensure generated contingencies lie in high-density regions of the uncertainty distribution, AGRO defines a tight uncertainty set as the image of "latent" uncertainty sets under the VAE decoding transformation. Projected gradient ascent is then used to maximize recourse costs over the latent uncertainty sets by leveraging differentiable optimization methods. We demonstrate the cost-efficiency of AGRO by applying it to both a synthetic production-distribution problem and a real-world power system expansion setting. We show that AGRO outperforms the standard column-and-constraint algorithm by up to 1.8% in production-distribution planning and up to 8% in power system expansion. Aron Brenner, Rahman Khorramfar, Jennifer Z. Sun, Saurabh Amin |
ICLR | 3 |