2022
DOI: 10.1214/22-ejs1992
|View full text |Cite
|
Sign up to set email alerts
|

Concentration inequalities for non-causal random fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…Notice that the infimum is always attained. The following is the main result of this section; it tells us that τ L L is indeed the optimal stopping time for problem (11). It comes from [36, Theorem 1.2].…”
Section: Optimal Number Of Layersmentioning
confidence: 96%
See 2 more Smart Citations
“…Notice that the infimum is always attained. The following is the main result of this section; it tells us that τ L L is indeed the optimal stopping time for problem (11). It comes from [36, Theorem 1.2].…”
Section: Optimal Number Of Layersmentioning
confidence: 96%
“…Our first goal is to give concentration inequalities for the outputs of the hidden layers of a generic SDNN. This problem has already been studied for particular types of SDNNs in [11], [34]. In the former, the authors establish a framework for modeling non-causal random fields and prove a Hoeffding-type concentration inequality; it is especially important because it can be applied to the field of Natural Language Processing (NLP).…”
Section: B Contributionsmentioning
confidence: 99%
See 1 more Smart Citation