Demo Data from EDBT 2026 / reviewers in the wild / expert
Arun Hariharan
dblp:371/4436
· DBLP profile ↗
1ranked-venue papers
0as 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 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 › monte carlo methods › markov chain monte carlo
discrete sampling |
0.8 | 1 | 2024 | Gradient-based Discrete Sampling with Automatic Cyclical Scheduling · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo |
0.8 | 1 | 2024 | Gradient-based Discrete Sampling with Automatic Cyclical Scheduling · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › sampling
multimodal sampling |
0.8 | 1 | 2024 | Gradient-based Discrete Sampling with Automatic Cyclical Scheduling · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
gradient-based discrete sampling · 0.8cyclical step size schedule · 0.8automatic hyperparameter tuning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Gradient-based Discrete Sampling with Automatic Cyclical SchedulingabstractDiscrete distributions, particularly in high-dimensional deep models, are often highly multimodal due to inherent discontinuities. While gradient-based discrete sampling has proven effective, it is susceptible to becoming trapped in local modes due to the gradient information. To tackle this challenge, we propose an automatic cyclical scheduling, designed for efficient and accurate sampling in multimodal discrete distributions. Our method contains three key components: (1) a cyclical step size schedule where large steps discover new modes and small steps exploit each mode; (2) a cyclical balancing schedule, ensuring "balanced" proposals for given step sizes and high efficiency of the Markov chain; and (3) an automatic tuning scheme for adjusting the hyperparameters in the cyclical schedules, allowing adaptability across diverse datasets with minimal tuning. We prove the non-asymptotic convergence and inference guarantee for our method in general discrete distributions. Extensive experiments demonstrate the superiority of our method in sampling complex multimodal discrete distributions. Patrick Pynadath, Riddhiman Bhattacharya, Arun Hariharan, Ruqi Zhang |
NeurIPS | 3 |