Related papers: Randomization and the Gross-Pitaevskii hierarchy
This work proposes block-coordinate fixed point algorithms with applications to nonlinear analysis and optimization in Hilbert spaces. The asymptotic analysis relies on a notion of stochastic quasi-Fej\'er monotonicity, which is thoroughly…
We study a class of interacting particle systems on $\mathbb{R}$ which was recently investigated by F. G\"otze and the second author [GV14]. These ensembles generalize eigenvalue ensembles of Hermitian random matrices by allowing different…
Random features models play a distinguished role in the theory of deep learning, describing the behavior of neural networks close to their infinite-width limit. In this work, we present a thorough analysis of the generalization performance…
This review article focuses on regularised estimation procedures applicable to geostatistical and spatial econometric models. These methods are particularly relevant in the case of big geospatial data for dimensionality reduction or model…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In this paper, the authors propose a new framework under which a theory of generalized Besov-type and Triebel-Lizorkin-type function spaces is developed. Many function spaces appearing in harmonic analysis fall under the scope of this new…
Let $n$ be a sufficiently large natural number and let $B$ be an origin-symmetric convex body in $R^n$ in the $\ell$-position, and such that the normed space $(R^n,\|\cdot\|_B)$ admits a $1$-unconditional basis. Then for any…
The article is devoted to the construction of expansions of iterated Stratonovich stochastic integrals of fifth, sixth, seventh and eighth multiplicities based on the method of generalized multiple Fourier series converging in the sense of…
This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…
Time series data analytics has been a problem of substantial interests for decades, and Dynamic Time Warping (DTW) has been the most widely adopted technique to measure dissimilarity between time series. A number of global-alignment kernels…
We consider distributional approximation by generalized Dickman distributions, which appear in number theory, perpetuities, logarithmic combinatorial structures and many other areas. We prove bounds in the Kolmogorov distance for the…
In this paper, we explore the version of Hairer's regularity structures based on a greedier index set than trees, as introduced by Otto, Sauer, Smith and Weber. More precisely, we construct and stochastically estimate the renormalized model…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
The article is devoted to the expansions of iterated Ito stochastic integrals based on generalized multiple Fourier series converging in the sense of norm in the space $L_2([t, T]^k),$ $k\in\mathbb{N}.$ The method of generalized multiple…
We study a natural extension of classical empirical risk minimization, where the hypothesis space is a random subspace of a given space. In particular, we consider possibly data dependent subspaces spanned by a random subset of the data,…
The conjectured three generic local bulk statistics amongst all non-Hermitian random matrix symmetry classes have recently been extended to three generic local edge statistics. We study analytically and numerically complex spacing ratios…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
Simulating a Gaussian process requires sampling from a high-dimensional Gaussian distribution, which scales cubically with the number of sample locations. Spectral methods address this challenge by exploiting the Fourier representation,…
Training modern neural networks often relies on large learning rates, operating at the edge of stability, where the optimization dynamics exhibit oscillatory and chaotic behavior. Empirically, this regime often yields improved…
The purpose of this article is to develop a general parametric estimation theory that allows the derivation of the limit distribution of estimators in non-regular models where the true parameter value may lie on the boundary of the…