相关论文: Universal gaps for XOR games from estimates on ten…

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

In this paper, a universal approximation theorem (UAT) for shallow neural networks whose inputs belong to a topological vector space (TVS) and whose outputs take values in a Hausdorff locally convex TVS is established. The networks are…

We show that if $X$ is a complete metric space with uniform relative normal structure and $G$ is a subgroup of the isometry group of $X$ with bounded orbits, then there is a point in $X$ fixed by every isometry in $G$. As a corollary, we…

Let $X = [0,1]$, and let $T:X\to X$ be an expanding piecewise linear map sending each interval of linearity to $[0,1]$. For $\psi:\mathbb N\to\mathbb R_{\geq 0}$, $x\in X$, and $N\in\mathbb N$ we consider the recurrence counting function \[…

We study the computational properties of two canonical planted average-case problems -- noisy planted $k$-XOR and Tensor PCA -- by formally unifying them into a family of planted problems parametrized by tensor order $k$, number of entries…

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…

Optimal behavior in (competitive) situation is traditionally determined with the help of utility functions that measure the payoff of different actions. Given an ordering on the space of revenues (payoffs), the classical axiomatic approach…

The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the…

In this work, we establish near-linear and strong convergence for a natural first-order iterative algorithm that simulates Von Neumann's Alternating Projections method in zero-sum games. First, we provide a precise analysis of Optimistic…

This paper constructs the geometrically natural objects which are associated with any projection tensor field on a manifold with any affine connection. The approaches to projection tensor fields which have been used in general relativity…

In [A dozen de {F}inetti-style results in search of a theory, Ann. Inst. H. Poincar\'{e} Probab. Statist. 23(2)(1987), 397--423], Diaconis and Freedman studied low-dimensional projections of random vectors from the Euclidean unit sphere and…

We study the local convergence of diffusive mean-field systems, including Wasserstein gradient flows, min-max dynamics, and multi-species games. We establish exponential local convergence in $\chi^2$-divergence with sharp rates, under two…

Tensor completion is a core machine learning algorithm used in recommender systems and other domains with missing data. While the matrix case is well-understood, theoretical results for tensor problems are limited, particularly when the…

We consider a generalization of the Bauer maximum principle. We work with tensorial products of convex measures sets, that are non necessarily compact but generated by their extreme points. We show that the maximum of a quasi-convex lower…

We construct Nash-equilibria in mean-field portfolio games of optimal investment and hedging under relative performance concerns with exponential (CARA) utility preferences. Common noise dynamics are modeled by integer-valued random…

The classical Mazur-Ulam theorem establishes that every surjective isometry between normed real vector spaces is an affine transformation. In various applied mathematical settings, however, one encounters maps that preserve distances not…

We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals:…

We consider Schmidt's game on the space of compact subsets of a given metric space equipped with the Hausdorff metric, and the space of continuous functions equipped with the supremum norm. We are interested in determining the generic…

We study the asymptotic error of score-based diffusion model sampling in large-sample scenarios from a non-parametric statistics perspective. We show that a kernel-based score estimator achieves an optimal mean square error of…