Demo Data from SIGIR 2026 / reviewers in the wild / expert
Victor V. Konev
dblp:73/8555
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
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 |
Information theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › hypothesis testing
change-point detection |
0.3 | 1 | 2017 | Quickest Detection of Parameter Changes in Stochastic Regression: Nonparametric CUSUM · IEEE Trans. Inf. Theory 2017 |
Information theory › statistical inference › sequential analysis › sequential detection
CUSUM |
0.3 | 1 | 2017 | Quickest Detection of Parameter Changes in Stochastic Regression: Nonparametric CUSUM · IEEE Trans. Inf. Theory 2017 |
Information theory › statistical inference › sequential analysis
sequential detection |
0.3 | 1 | 2017 | Quickest Detection of Parameter Changes in Stochastic Regression: Nonparametric CUSUM · IEEE Trans. Inf. Theory 2017 |
Methods — techniques the papers use, named apart from their topics
martingale · 0.3kullback-leibler divergence · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Quickest Detection of Parameter Changes in Stochastic Regression: Nonparametric CUSUMabstractWe consider the problem of detecting abrupt parameter changes in a stochastic regression with unknown noise distribution. The process changes at some unknown point of time. Under general conditions on the regression function and unknown distributions of observations before and after the disruption, the paper develops a nonparametric cumulative sum procedure (CUSUM). Unlike likelihood-based CUSUM algorithms, constructed mostly on log-likelihood ratio statistics, we use a special system of basic statistics in Page's procedure. By applying a sequential sampling scheme, which measures time in terms of accumulated Kullback-Leibler (K-L) divergence, we come to a system of statistics with the martingale properties close to those of the log-likelihood ratios. The proposed approach suggests also an alternative performance criterion in the analysis of the procedure by replacing the expected detection delay by the corresponding K-L divergence. We show that, under the false alarm probability constraint, the nonparametric CUSUM rule is optimal in the sense that it ensures the logarithmic asymptotic for the detection delay. Victor V. Konev, Sergey E. Vorobeychikov |
IEEE Trans. Inf. Theory | 1 |