Demo Data from VLDB 2026 / reviewers in the wild / expert
Elizabeth Kleiman
dblp:44/9697
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2011
0009-0009-3155-7630ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 |
Information theory · 50% Coding theory · 50% |
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 › structured models › latent variable model
hidden markov model |
0.1 | 1 | 2011 | Large Deviation Bounds for Functionals of Viterbi Paths · IEEE Trans. Inf. Theory 2011 |
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
MAP inference |
0.1 | 1 | 2011 | Large Deviation Bounds for Functionals of Viterbi Paths · IEEE Trans. Inf. Theory 2011 |
Information theory › probability theory
large deviations |
0.1 | 1 | 2011 | Large Deviation Bounds for Functionals of Viterbi Paths · IEEE Trans. Inf. Theory 2011 |
Coding theory › error-correcting codes › decoding › trellis decoding
viterbi algorithm |
0.1 | 1 | 2011 | Large Deviation Bounds for Functionals of Viterbi Paths · IEEE Trans. Inf. Theory 2011 |
Methods — techniques the papers use, named apart from their topics
regenerative process analysis · 0.2large deviation bounds · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Large Deviation Bounds for Functionals of Viterbi PathsabstractIn a number of applications, the underlying stochastic process is modeled as a finite-state discrete-time Markov chain that cannot be observed directly and is represented by an auxiliary process. The maximum a posteriori (MAP) estimator is widely used to estimate states of this hidden Markov model through available observations. The MAP path estimator based on a finite number of observations is calculated by the Viterbi algorithm, and is often referred to as the Viterbi path. It was recently shown in, and, (see also and) that under mild conditions, the sequence of estimators of a given state converges almost surely to a limiting regenerative process as the number of observations approaches infinity. This in particular implies a law of large numbers for some functionals of hidden states and finite Viterbi paths. The aim of this paper is to provide the corresponding large deviation estimates. Arka P. Ghosh, Elizabeth Kleiman, Alexander Roitershtein |
IEEE Trans. Inf. Theory | 2 |