2014
DOI: 10.1051/proc/201444004
|View full text |Cite
|
Sign up to set email alerts
|

Concentration inequalities, counting processes and adaptive statistics

Abstract: Abstract.Adaptive statistics for counting processes need particular concentration inequalities to define and calibrate the methods as well as to precise the theoretical performance of the statistical inference. The present article is a small (non exhaustive) review of existing concentration inequalities that are useful in this context. Résumé. Les statistiques adaptatives pour les processus de comptage nécessitent des inégalités deconcentration particulières pour définir et calibrer les méthodes ainsi que pour… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 64 publications
0
3
0
Order By: Relevance
“…The derivation of the different proofs requires the two concentration inequalities from Reynaud‐Bouret (2014) and Houdré and Reynaud‐Bouret (2003). The concentration inequality of Proposition 6 is a weak Bernstein inequality; the other of Proposition 7 is an inequality for the Poisson U‐statistic.…”
Section: Proof Of the Oracle Inequalitymentioning
confidence: 99%
See 2 more Smart Citations
“…The derivation of the different proofs requires the two concentration inequalities from Reynaud‐Bouret (2014) and Houdré and Reynaud‐Bouret (2003). The concentration inequality of Proposition 6 is a weak Bernstein inequality; the other of Proposition 7 is an inequality for the Poisson U‐statistic.…”
Section: Proof Of the Oracle Inequalitymentioning
confidence: 99%
“…Proposition (Reynaud‐Bouret, 2014, equation (2.2)) Let f:$$ f:\mathbb{R}\to \mathbb{R} $$ be a Borel function. Let N$$ N $$ be an inhomogeneous Poisson process with intensity λ·$$ {\lambda}_{\cdotp } $$, normalΛ·=0·λudu$$ {\Lambda}_{\cdotp }={\int}_0^{\cdotp }{\lambda}_u du $$ and M=Nprefix−normalΛ$$ M=N-\Lambda $$.…”
Section: Proof Of the Oracle Inequalitymentioning
confidence: 99%
See 1 more Smart Citation