English
Related papers

Related papers: Uniform upper estimates and the repeated averages …

200 papers

Within the context of the binomial model, we analyse sequences of values that are almost-uniform and we discuss a prediction method called the frequent outcome approach, in which the outcome that has occurred the most in the observed trials…

Statistics Theory · Mathematics 2022-09-29 Ben O'Neill

This article is devoted to studying individual ergodic theorems for subsequential weighted ergodic averages on the noncommutative Lp-spaces associated to a semifinite von Neumann algebra M. In particular, we establish the convergence of…

Operator Algebras · Mathematics 2022-11-01 Morgan O'Brien

This paper provides a unified framework for analyzing tensor estimation problems that allow for nonlinear observations, heteroskedastic noise, and covariate information. We study a general class of high-dimensional models where each…

Information Theory · Computer Science 2025-06-10 Riccardo Rossetti , Galen Reeves

Under the assumption of the Riemann Hypothesis (RH), we prove explicit quantitative relations between hypothetical error terms in the asymptotic formulae for truncated mean-square average of exponential sums over primes and in the…

Number Theory · Mathematics 2017-05-12 Alessandro Languasco , Alessandro Zaccagnini

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

Probability · Mathematics 2015-11-30 P. Caputo , A. Faggionato , A. Gaudilliere

We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…

Optimization and Control · Mathematics 2024-11-20 Alan Luner , Benjamin Grimmer

We propose a general method for the construction and analysis of unweighted $\epsilon$ - recurrence networks from chaotic time series. The selection of the critical threshold $\epsilon_c$ in our scheme is done empirically and we show that…

Chaotic Dynamics · Physics 2016-01-21 Rinku Jacob , K. P. Harikrishnan , R. Misra , G. Ambika

We utilize quantum superposition principle to establish the improvable upper and lower bounds on the stronger uncertainty relation, i.e., the "weighted-like" sum of the variances of observables. Our bounds include some free parameters which…

Quantum Physics · Physics 2017-04-17 Jun Zhang , Yang Zhang , Chang-shui Yu

Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…

Probability · Mathematics 2007-05-23 Oliver Johnson

The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…

Logic · Mathematics 2022-08-02 Anton Freund , Patrick Uftring

We show that the infinite-dimensional versions of Gowers' $\mathrm{FIN}_k$ and $\mathrm{FIN}_{\pm k}$ theorems can be parametrized by an infinite sequence of perfect subsets of $2^\omega$. To do so, we use ultra-Ramsey theory to obtain…

Combinatorics · Mathematics 2020-06-19 Jamal K. Kawach

For non-uniformly hyperbolic dynamical systems we consider the time series of maxima along typical orbits. Using ideas based upon quantitative recurrence time statistics we prove convergence of the maxima (under suitable normalization) to…

Dynamical Systems · Mathematics 2015-09-11 Mark Holland , Pau Rabassa , Alef Sterk

An ensemble method is introduced that utilizes randomization and loss function gradients to compute a prediction. Multiple weakly-correlated estimators approximate the gradient at randomly sampled points on the error surface and are…

Machine Learning · Computer Science 2020-09-15 Nicholas Smith

Block maxima methods constitute a fundamental part of the statistical toolbox in extreme value analysis. However, most of the corresponding theory is derived under the simplifying assumption that block maxima are independent observations…

Statistics Theory · Mathematics 2019-07-24 Nan Zou , Stanislav Volgushev , Axel Bücher

We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also uncovers previously unknown connections between the low rank…

Machine Learning · Statistics 2017-03-09 Rajiv Khanna , Ethan Elenberg , Alexandros G. Dimakis , Sahand Negahban

We prove a version of a general transfer theorem for random sequences with independent random indexes in the double array limit setting under relaxed conditions. We also prove its partial inverse providing the necessary and sufficient…

Probability · Mathematics 2015-09-08 V. Yu. Korolev , A. I. Zeifman

We show that, under some mild hypotheses, the Gowers uniformity norms (both in the additive and in the hypergraph setting) are essentially equivalent to certain weaker norms which are easier to understand. We present two applications of…

Number Theory · Mathematics 2022-06-10 Pandelis Dodos , Vassilis Kanellopoulos

Abstract upper densities are monotone and subadditive functions from the power set of positive integers to the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

Number Theory · Mathematics 2017-09-12 Mauro Di Nasso , Renling Jin

We show that the Bregman divergence provides a rich framework to estimate unnormalized statistical models for continuous or discrete random variables, that is, models which do not integrate or sum to one, respectively. We prove that recent…

Machine Learning · Computer Science 2012-02-20 Michael Gutmann , Jun-ichiro Hirayama

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

Combinatorics · Mathematics 2022-05-18 Catherine Greenhill , Mikhail Isaev , Tamás Makai , Brendan D. McKay