Demo Data from EDBT 2026 / reviewers in the wild / expert
Liam Pavlovic
dblp:324/0562
· DBLP profile ↗
2ranked-venue papers
1as 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 · 1 · 1 first-author · 1 since 2021Theory of computation · 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.
| Theoretical computer science
1 paper |
Computational complexity · 87% Mathematical optimization · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
circuit complexity |
0.7 | 1 | 2023 | On Correlation Bounds Against Polynomials · CCC 2023 |
Computational complexity › circuit complexity
correlation bounds |
0.7 | 1 | 2023 | On Correlation Bounds Against Polynomials · CCC 2023 |
Mathematical optimization › approximation theory
polynomial approximation |
0.2 | 1 | 2023 | On Correlation Bounds Against Polynomials · CCC 2023 |
Methods — techniques the papers use, named apart from their topics
correlation analysis · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Trust-Region Method for Graphical Stein Variational InferenceabstractStein variational inference (SVI) is a sample-based approximate Bayesian inference technique that generates a sample set by jointly optimizing the samples’ locations to minimize an information-theoretic measure of discrepancy with the target probability distribution. SVI thus provides a fast and significantly more sample-efficient approach to Bayesian inference than traditional (random-sampling-based) alternatives. However, the optimization techniques employed in existing SVI methods struggle to address problems in which the target distribution is high-dimensional, poorly-conditioned, or non-convex, which severely limits the range of their practical applicability. In this paper, we propose a novel trust-region optimization approach for SVI that successfully addresses each of these challenges. Our method builds upon prior work in SVI by leveraging conditional independences in the target distribution (to achieve high-dimensional scaling) and second-order information (to address poor conditioning), while additionally providing an effective adaptive step control procedure, which is essential for ensuring convergence on challenging non-convex optimization problems. Experimental results show our method achieves superior numerical performance, both in convergence rate and sample accuracy, and scales better in high-dimensional distributions, than previous SVI techniques. Liam Pavlovic, David M. Rosen |
UAI | 1 |
| 2023 | On Correlation Bounds Against Polynomials
Peter Ivanov, Liam Pavlovic, Emanuele Viola |
CCC | 2 |