4 citations · 4 across the 11 of their papers we have counts for
12 papers
Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle
Ulrich Kohlenbach, Morenikeji Neri, Jin Wei
We extend the proof-theoretic treatment of uniform bound extraction from normed structures axiomatized in positive bounded logic [Advances in Mathematics, 290:503-551, 2016] (as de…
Quantitative limit theorems for generalized Pólya urns with applications to random tree models
Morenikeji Neri, Pedro Pinto
We establish novel quantitative limit theorems for the asymptotic distribution of colours in a generalized Pólya urn. Concretely, we construct explicit rates of convergence for the…
A systematic way of analysing proofs in probability theory
Morenikeji Neri, Paulo Oliva, Nicholas Pischke
Over extended systems of finite type arithmetic, we utilize a formal representation of the outer measure to define a translation which allows for the systematic formalization of pr…
Generalized fluctuation bounds for stochastic algorithms in the presence of compactness
Morenikeji Neri, Nicholas Pischke, Thomas Powell
We provide a convergence result for sequences of random variables taking values in a metric space that satisfy a stochastic quasi-Fejér monotonicity condition, in the context of a…
The pointwise ergodic theorem on finitely additive spaces
Morenikeji Neri
The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of a…
An abstract effective convergence theorem for stochastic processes, with applications to stochastic approximation
Morenikeji Neri, Nicholas Pischke, Thomas Powell
We provide a general theorem on the asymptotic behavior of stochastic processes that conform to a relaxed supermartingale condition. The distinguishing feature of our result is tha…
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…
A computational study of a class of recursive inequalities
Morenikeji Neri, Thomas Powell
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and c…