相关论文: Universality in polytope phase transitions and mes…

Nonequilibrium phase transitions are characterized by the so-called critical exponents, each of which is related to a different observable. Systems that share the same set of values for these exponents also share the same universality…

Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local…

Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…

We consider certain large random matrices, called random inner-product kernel matrices, which are essentially given by a nonlinear function $f$ applied entrywise to a sample-covariance matrix, $f(X^TX)$, where $X \in \mathbb{R}^{d \times…

The universal approximation theorem, in one of its most general versions, says that if we consider only continuous activation functions $\sigma$, then a standard feedforward neural network with one hidden layer is able to approximate any…

We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

The statistics of transmission through random 1D media are generally presumed to be universal and to depend only upon a single dimensionless parameter-the ratio of the sample length and the mean free path, s = L/l. Here, we show in…

It is well-known that the partition function of the unitary ensembles of random matrices is given by a tau-function of the Toda lattice hierarchy and those of the orthogonal and symplectic ensembles are tau-functions of the Pfaff lattice…

Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in…

We consider two different systems exhibiting a continuous phase transition into an absorbing state. Both models belong to the same universality class, i.e., they are characterized by the same scaling functions and the same critical…

Phenomenological scaling arguments suggest the existence of universal amplitudes in the finite-size scaling of certain correlation lengths in strongly anisotropic or dynamical phase transitions. For equilibrium systems, provided that…

The Universal Approximation Theorem (UAT) guarantees universal function approximation but does not explain how residual models distribute approximation across layers. We reframe residual networks as a layer-wise approximation process that…

We present a generic approach that allows us to develop a fully polynomial-time approximation scheme (FTPAS) for minimizing nonlinear functions over the integer points in a rational polyhedron in fixed dimension. The approach combines the…

Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be…

We prove simultaneous Universal Approximation of a certain type of Pade Approximants and of Taylor series with the same indexes. This is a generic phenomenon in the space of holomorphic functions in any simply connected domain, as well as…

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

Generative models provide a powerful framework for probabilistic reasoning. However, in many domains their use has been hampered by the practical difficulties of inference. This is particularly the case in computer vision, where models of…

We propose the existence of a new universality in classical chaotic systems when the number of degrees of freedom is large: the statistical property of the Lyapunov spectrum is described by Random Matrix Theory. We demonstrate it by…

A set $\mathcal{S}$ of points in $\mathbb{R}^n$ is called a rationally parameterisable hypersurface if $\mathcal{S}=\{\boldsymbol{\sigma}(\mathbf{t}): \mathbf{t} \in D\}$, where $\boldsymbol{\sigma}: \mathbb{R}^{n-1} \rightarrow…