Demo Data from EDBT 2026 / reviewers in the wild / expert
Bokgyeong Kang
dblp:413/2445
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—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 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 |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo |
0.8 | 1 | 2024 | Measuring Sample Quality in Algorithms for Intractable Normalizing Function Problems · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › model criticism
sample quality assessment |
0.8 | 1 | 2024 | Measuring Sample Quality in Algorithms for Intractable Normalizing Function Problems · J. Mach. Learn. Res. 2024 |
Methods — techniques the papers use, named apart from their topics
monte carlo approximation · 0.8kernel stein discrepancy · 0.8bartlett identity · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Measuring Sample Quality in Algorithms for Intractable Normalizing Function ProblemsabstractModels with intractable normalizing functions have numerous applications. Because the normalizing constants are functions of the parameters of interest, standard Markov chain Monte Carlo cannot be used for Bayesian inference for these models. A number of algorithms have been developed for such models. Some have the posterior distribution as their asymptotic distribution. Other "asymptotically inexact" algorithms do not possess this property. There is limited guidance for evaluating approximations based on these algorithms. Hence it is very hard to tune them. We propose two new diagnostics that address these problems for intractable normalizing function models. Our first diagnostic, inspired by the second Bartlett identity, is in principle broadly applicable to Monte Carlo approximations beyond the normalizing function problem. We develop an approximate version of this diagnostic that is applicable to intractable normalizing function problems. Our second diagnostic is a Monte Carlo approximation to a kernel Stein discrepancy-based diagnostic introduced by Gorham and Mackey (2017). We provide theoretical justification for our methods and apply them to several algorithms in challenging simulated and real data examples including an Ising model, an exponential random graph model, and a Conway-Maxwell-Poisson regression model, obtaining interesting insights about the algorithms in these contexts. Bokgyeong Kang, John Hughes 0002, Murali Haran |
J. Mach. Learn. Res. | 1 |