Demo Data from EDBT 2026 / reviewers in the wild / expert
Tetsuya Kaji
dblp:270/3591
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—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 |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › approximate bayesian inference
approximate bayesian computation |
0.6 | 1 | 2022 | Approximate Bayesian Computation via Classification · J. Mach. Learn. Res. 2022 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian asymptotics
posterior concentration |
0.6 | 1 | 2022 | Approximate Bayesian Computation via Classification · J. Mach. Learn. Res. 2022 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › approximate bayesian inference
simulation-based inference |
0.6 | 1 | 2022 | Approximate Bayesian Computation via Classification · J. Mach. Learn. Res. 2022 |
Methods — techniques the papers use, named apart from their topics
contrastive learning · 0.6classification · 0.6KL divergence estimation · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Approximate Bayesian Computation via ClassificationabstractApproximate Bayesian Computation (ABC) enables statistical inference in simulator-based models whose likelihoods are difficult to calculate but easy to simulate from. ABC constructs a kernel-type approximation to the posterior distribution through an accept/reject mechanism which compares summary statistics of real and simulated data. To obviate the need for summary statistics, we directly compare empirical distributions with a Kullback-Leibler (KL) divergence estimator obtained via contrastive learning. In particular, we blend flexible machine learning classifiers within ABC to automate fake/real data comparisons. We consider the traditional accept/reject kernel as well as an exponential weighting scheme which does not require the ABC acceptance threshold. Our theoretical results show that the rate at which our ABC posterior distributions concentrate around the true parameter depends on the estimation error of the classifier. We derive limiting posterior shape results and find that, with a properly scaled exponential kernel, asymptotic normality holds. We demonstrate the usefulness of our approach on simulated examples as well as real data in the context of stock volatility estimation. Yuexi Wang, Tetsuya Kaji, Veronika Rocková |
J. Mach. Learn. Res. | 2 |