Demo Data from EDBT 2026 / reviewers in the wild / expert
Jinpu Zhou
dblp:321/3797
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—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% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 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
bayesian nonparametric model |
0.7 | 1 | 2023 | Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equations · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning › continuous-time model
stochastic differential equations |
0.7 | 1 | 2023 | Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equations · J. Mach. Learn. Res. 2023 |
Mathematical optimization › continuous optimization
infinite-dimensional optimization |
0.7 | 1 | 2023 | Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equations · J. Mach. Learn. Res. 2023 |
Methods — techniques the papers use, named apart from their topics
sparse learning · 1.3bayesian hierarchical modeling · 1.3shrinkage priors · 0.7shrinkage prior · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equationsabstractThe paper has two major themes. The first part of the paper establishes certain general results for infinite-dimensional optimization problems on Hilbert spaces. These results cover the classical representer theorem and many of its variants as special cases and offer a wider scope of applications. The second part of the paper then develops a systematic approach for learning the drift function of a stochastic differential equation by integrating the results of the first part with Bayesian hierarchical framework. Importantly, our Bayesian approach incorporates low-cost sparse learning through proper use of shrinkage priors while allowing proper quantification of uncertainty through posterior distributions. Several examples at the end illustrate the accuracy of our learning scheme. Arnab Ganguly 0001, Riten Mitra, Jinpu Zhou |
J. Mach. Learn. Res. | 3 |