相关论文: A simple Fourier analytic proof of the AKT optimal…

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Estimating some mathematical expectations from partially observed data and in particular missing outcomes is a central problem encountered in numerous fields such as transfer learning, counterfactual analysis or causal inference. Matching…

In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…

We study the Active Simple Hypothesis Testing (ASHT) problem, a simpler variant of the Fixed Budget Best Arm Identification problem. In this work, we provide novel game theoretic formulation of the upper bounds of the ASHT problem. This…

We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected.…

This paper aims first at a simultaneous axiomatic presentation of the proof of optimal convergence rates for adaptive finite element methods and second at some refinements of particular questions like the avoidance of (discrete) lower…

The machine learning random Fourier feature method for data in high dimension is computationally and theoretically attractive since the optimization is based on a convex standard least squares problem and independent sampling of Fourier…

We study several distinct but related Fourier analytic variants of the well-known Kakeya and Furstenberg set problems in the plane. For example, given $0<s,t<1$, we call a set $K \subseteq \mathbb{R}^2$ an $(s,t)$-Kakeya set if there exists…

The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem in dimension two. These bounds show that up to a logarithmically divergent shift, the optimal transport maps are close to be the identity…

We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the…

We study the $q$-analogue of the average of Montgomery's function $F(\alpha, T)$ over bounded intervals. Assuming the Generalized Riemann Hypothesis for Dirichlet $L$-functions, we obtain upper and lower bounds for this average over an…

We prove the 3-fold DT/PT correspondence for K-theoretic vertices via wall-crossing techniques. We provide two different setups, following Mochizuki and following Joyce; both reduce the problem to q-combinatorial identities on word…

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article aims to bring pleasure to the reader by giving short…

By analogy with conjectures for random matrices, Fyodorov-Hiary-Keating and Fyodorov-Keating proposed precise asymptotics for the maximum of the Riemann zeta function in a typical short interval on the critical line. In this paper, we…

We provide a new proof of the linear convergence of the alternating direction method of multipliers (ADMM) when one of the objective terms is strongly convex. Our proof is based on a framework for analyzing optimization algorithms…

We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence…

The epsilon alternating least squares ($\epsilon$-ALS) is developed and analyzed for canonical polyadic decomposition (approximation) of a higher-order tensor where one or more of the factor matrices are assumed to be columnwisely…

The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many…