Related papers: Self-averaging sequences which fail to converge
Recent work has shown that models trained to the same objective, and which achieve similar measures of accuracy on consistent test data, may nonetheless behave very differently on individual predictions. This inconsistency is undesirable in…
We study binomially weighted summation methods given by \[ (x_n)_{n\in \mathbb{N}} \mapsto \left(\sum_{k=0}^n\binom{n}{k}r^k(1-r)^{n-k}x_k\right)_{n\in \mathbb{N}} \] for $r\in (0,1)$, and their behavior under composition with summation…
This paper investigates the weighted-averaging dynamic for unconstrained and constrained consensus problems. Through the use of a suitably defined adjoint dynamic, quadratic Lyapunov comparison functions are constructed to analyze the…
Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a…
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…
We propose a convergence mode for positive Radon measures which allows a sequence of probability measures to have an improper limiting measure. We define a sequence of vague priors as a sequence of probability measures that converges to an…
We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…
We introduce the notion of consistent error bound functions which provides a unifying framework for error bounds for multiple convex sets. This framework goes beyond the classical Lipschitzian and H\"olderian error bounds and includes…
In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which…
Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…
We introduce twin neural network (TNN) regression. This method predicts differences between the target values of two different data points rather than the targets themselves. The solution of a traditional regression problem is then obtained…
In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…
An important consideration for variable selection in interaction models is to design an appropriate penalty that respects hierarchy of the importance of the variables. A common theme is to include an interaction term only after the…
In this paper we define the closure under weak convergence of the class of p-tempered {\alpha}-stable distributions. We give necessary and sufficient conditions for convergence of sequences in this class. Moreover, we show that any element…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…
We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…
A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…