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

Charita Dellaporta

dblp:314/5967 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › optimization under uncertainty › robust optimization
distributionally robust optimization
0.912025
Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets · ICML 2025
Mathematical optimization › stochastic optimization › stochastic programming
sample average approximation
0.912025
Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets · ICML 2025
Mathematical optimization
stochastic optimization
0.912025
Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.312025
Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian prediction
posterior predictive distribution
0.312025
Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets · ICML 2025

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

sample average approximation · 1.7convex duality · 1.7bayesian inference · 1.7
YearPublicationVenuePosition
2025 Decision Making under the Exponential Family: Distributionally Robust Optimisation with Bayesian Ambiguity Sets
abstract
Decision making under uncertainty is challenging as the data-generating process (DGP) is often unknown. Bayesian inference proceeds by estimating the DGP through posterior beliefs on the model’s parameters. However, minimising the expected risk under these beliefs can lead to suboptimal decisions due to model uncertainty or limited, noisy observations. To address this, we introduce Distributionally Robust Optimisation with Bayesian Ambiguity Sets (DRO-BAS) which hedges against model uncertainty by optimising the worst-case risk over a posterior-informed ambiguity set. We provide two such sets, based on the posterior expectation (DRO-BAS(PE)) or the posterior predictive (DRO-BAS(PP)) and prove that both admit, under conditions, strong dual formulations leading to efficient single-stage stochastic programs which are solved with a sample average approximation. For DRO-BAS(PE), this covers all conjugate exponential family members while for DRO-BAS(PP) this is shown under conditions on the predictive's moment generating function. Our DRO-BAS formulations outperform existing Bayesian DRO on the Newsvendor problem and achieve faster solve times with comparable robustness on the Portfolio problem.
Charita Dellaporta, Patrick O'Hara, Theodoros Damoulas
ICML1
2022 Robust Bayesian Inference for Simulator-based Models via the MMD Posterior Bootstrap
abstract
Simulator-based models are models for which the likelihood is intractable but simulation of synthetic data is possible. They are often used to describe complex real-world phenomena, and as such can often be misspecified in practice. Unfortunately, existing Bayesian approaches for simulators are known to perform poorly in those cases. In this paper, we propose a novel algorithm based on the posterior bootstrap and maximum mean discrepancy estimators. This leads to a highly-parallelisable Bayesian inference algorithm with strong robustness properties. This is demonstrated through an in-depth theoretical study which includes generalisation bounds and proofs of frequentist consistency and robustness of our posterior. The approach is then assessed on a range of examples including a g-and-k distribution and a toggle-switch model.
Charita Dellaporta, Jeremias Knoblauch, Theodoros Damoulas, François-Xavier Briol
AISTATS1