4 citations · 4 across the 11 of their papers we have counts for
5 papers · 1 filter
A finitary Kronecker's lemma and large deviations in the Strong Law of Large numbers on Banach spaces
Morenikeji Neri
We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result…
A quantitative Robbins-Siegmund theorem
Morenikeji Neri, Thomas Powell
The Robbins-Siegmund theorem is one of the most important results in stochastic optimization, where it is widely used to prove the convergence of stochastic algorithms. We provide…
On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales
Morenikeji Neri, Thomas Powell
We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes…
Quantitative Strong Laws of Large Numbers
Morenikeji Neri
Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of r…
Proof mining and probability theory
Morenikeji Neri, Nicholas Pischke
We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima f…