VLDB 2026 Research / reviewers in the wild / expert
Anna Melnykova
dblp:261/9537
· 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 · 75% Learning theory · 25% |
Topics — the 4 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 › causal inference › causal discovery
granger causality |
0.8 | 1 | 2024 | Granger Causal Inference in Multivariate Hawkes Processes by Minimum Message Length · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process › temporal point process
hawkes process |
0.8 | 1 | 2024 | Granger Causal Inference in Multivariate Hawkes Processes by Minimum Message Length · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian model selection
minimum message length |
0.8 | 1 | 2024 | Granger Causal Inference in Multivariate Hawkes Processes by Minimum Message Length · J. Mach. Learn. Res. 2024 |
Machine learning › Learning theory
model selection |
0.8 | 1 | 2024 | Granger Causal Inference in Multivariate Hawkes Processes by Minimum Message Length · J. Mach. Learn. Res. 2024 |
Methods — techniques the papers use, named apart from their topics
minimum message length · 0.8lasso penalization · 0.8exponential decay kernel · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Granger Causal Inference in Multivariate Hawkes Processes by Minimum Message LengthabstractMultivariate Hawkes processes (MHPs) are versatile probabilistic tools used to model various real-life phenomena: earthquakes, operations on stock markets, neuronal activity, virus propagation and many others. In this paper, we focus on MHPs with exponential decay kernels and estimate connectivity graphs, which represent the Granger causal relations between their components. We approach this inference problem by proposing an optimization criterion and model selection algorithm based on the minimum message length (MML) principle. MML compares Granger causal models using the Occam's razor principle in the following way: even when models have a comparable goodness-of-fit to the observed data, the one generating the most concise explanation of the data is preferred. While most of the state-of-art methods using lasso-type penalization tend to overfitting in scenarios with short time horizons, the proposed MML-based method achieves high F1 scores in these settings. We conduct a numerical study comparing the proposed algorithm to other related classical and state-of-art methods, where we achieve the highest F1 scores in specific sparse graph settings. We illustrate the proposed method also on G7 sovereign bond data and obtain causal connections, which are in agreement with the expert knowledge available in the literature. Katerina Hlavácková-Schindler, Anna Melnykova, Irene Tubikanec |
J. Mach. Learn. Res. | 2 |