Related papers: Tail Behavior of Sphere-Decoding Complexity in Ran…
Lattice scalar field theories encounter a sign problem when the coupling constant is complex. This is a close cousin of the real-time sign problems that afflict the lattice Schwinger-Keldysh formalism, and a more distant relative of the…
A common bottleneck in evaluating extremal performance measures is that, due to their very nature, tail data are often very limited. The conventional approach selects the best probability distribution from tail data using parametric…
Understanding the tail behavior of distributions is crucial in statistical theory. For instance, the tail of a distribution plays a ubiquitous role in extreme value statistics, where it is associated with the likelihood of extreme events.…
In recent works on the theory of machine learning, it has been observed that heavy tail properties of Stochastic Gradient Descent (SGD) can be studied in the probabilistic framework of stochastic recursions. In particular,…
The objective of this paper is to investigate the layered structure of topological complexity in the tail of a probability distribution. We establish the functional strong law of large numbers for Betti numbers, a basic quantifier of…
Given a lattice \Gamma in a locally compact group G and a closed subgroup H of G, one has a natural action of \Gamma on the homogeneous space V=H\G. For an increasing family of finite subsets {\Gamma_T: T>0}, a dense orbit v\Gamma, v\in V,…
Semantic segmentation usually suffers from a long-tail data distribution. Due to the imbalanced number of samples across categories, the features of those tail classes may get squeezed into a narrow area in the feature space. Towards a…
The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10…
We discuss the asymptotic behaviour of models of lattice polygons, mainly on the square lattice. In particular, we focus on limiting area laws in the uniform perimeter ensemble where, for fixed perimeter, each polygon of a given area occurs…
We consider the inverse scattering problems for two types of Schr\"odinger operators on locally perturbed periodic lattices. For the discrete Hamiltonian, the knowledge of the S-matrix for all energies determines the graph structure and the…
Despite its success in a wide range of applications, characterizing the generalization properties of stochastic gradient descent (SGD) in non-convex deep learning problems is still an important challenge. While modeling the trajectories of…
Taking one-dimensional random transverse Ising model (RTIM) with the double-Gaussian disorder for example, we investigated the spin autocorrelation function (SAF) and associated spectral density at high temperature by the recursion method.…
Deep probabilistic forecasting is gaining attention in numerous applications ranging from weather prognosis, through electricity consumption estimation, to autonomous vehicle trajectory prediction. However, existing approaches focus on…
We study the shape of the tail of a heap of granular material. A simple theoretical argument shows that the tail adds a logarithmic correction to the slope given by the angle of repose. This expression is in good agreement with experiments.…
In risk management, tail risks are of crucial importance. The quality of a tail model, which is determined by data from an unknown distribution, depends critically on the subset of data used to model the tail. Based on a suitably weighted…
It is well-known that the dominant late time behavior of waves propagating on a Schwarzschild spacetime is a power-law tail; tails for other spacetimes have also been studied. This paper presents a systematic treatment of the tail…
We establish maximal concentration bounds for the iterates generated by stochastic approximation algorithms with general step sizes, where the noise has a finite-state Markovian component plus a Martingale-difference component. When the…
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be…
Bond-percolation graphs are random subgraphs of the d-dimensional integer lattice generated by a standard bond-percolation process. The associated graph Laplacians, subject to Dirichlet or Neumann conditions at cluster boundaries, represent…
The relaxation in complex systems is in general nonexponential. After an initial rapid decay the system relax slowly following a long time tail. In the present paper a sandpile modelation of the relaxation in complex systems is analysed.…