Demo Data from VLDB 2026 / reviewers in the wild / expert
Grigory Neustroev
dblp:245/0384
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-7706-7778ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking
probabilistic verification |
0.9 | 1 | 2025 | Neural Continuous-Time Supermartingale Certificates · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
symbolic reasoning · 1.7neural lyapunov certificate · 1.7machine learning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Neural Continuous-Time Supermartingale CertificatesabstractWe introduce for the first time a neural-certificate framework for continuous-time stochastic dynamical systems. Autonomous learning systems in the physical world demand continuous-time reasoning, yet existing learnable certificates for probabilistic verification assume discretization of the time continuum. Inspired by the success of training neural Lyapunov certificates for deterministic continuous-time systems and neural supermartingale certificates for stochastic discrete-time systems, we propose a framework that bridges the gap between continuous-time and probabilistic neural certification for dynamical systems under complex requirements. Our method combines machine learning and symbolic reasoning to produce formally certified bounds on the probabilities that a nonlinear system satisfies specifications of reachability, avoidance, and persistence. We present both the theoretical justification and the algorithmic implementation of our framework and showcase its efficacy on popular benchmarks. Grigory Neustroev, Mirco Giacobbe, Anna Lukina |
AAAI | 1 |