VLDB 2026 Research / reviewers in the wild / expert
Thanawat Sornwanee
dblp:405/8293
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 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 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 · 61% Generative modeling · 30% Optimization for machine learning · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation |
0.9 | 1 | 2025 | SD-KDE: Score-Debiased Kernel Density Estimation · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › density estimation
kernel density estimation |
0.9 | 1 | 2025 | SD-KDE: Score-Debiased Kernel Density Estimation · NeurIPS 2025 |
Machine learning › Generative modeling
score-based model |
0.9 | 1 | 2025 | SD-KDE: Score-Debiased Kernel Density Estimation · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
score function estimation · 0.9bandwidth selection · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SD-KDE: Score-Debiased Kernel Density EstimationabstractWe propose a method for density estimation that leverages an estimated score function to debias kernel density estimation (SD-KDE).
In our approach, each data point is adjusted by taking a single step along the score function with a specific choice of step size, followed by standard KDE with a modified bandwidth.
The step size and modified bandwidth are chosen to remove the leading order bias in the KDE, improving the asymptotic convergence rate.
Our experiments on synthetic tasks in 1D, 2D and on MNIST, demonstrate that our proposed SD-KDE method significantly reduces the mean integrated squared error compared to the standard Silverman KDE, even with noisy estimates in the score function.
These results underscore the potential of integrating score-based corrections into nonparametric density estimation. Elliot L. Epstein, Rajat Vadiraj Dwaraknath, Thanawat Sornwanee, John Winnicki, Jerry W. Liu |
NeurIPS | 3 |