相关论文: Average-case matrix discrepancy: satisfiability bo…

We investigate the extremal values of partial traces of matrix tensors under operator norm constraints. To evaluate these multi-linear quantities, we develop a comprehensive graphical formalism that encodes multi-leg partial traces, partial…

We consider exact algorithms for Subset Balancing, a family of related problems that generalizes Subset Sum, Partition, and Equal Subset Sum. Specifically, given as input an integer vector $\vec{x} \in \mathbb{Z}^n$ and a constant-size…

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

We study the problem of testing whether a matrix $\mathbf{A} \in \mathbb{R}^{n \times n}$ with bounded entries ($\|\mathbf{A}\|_\infty \leq 1$) is positive semi-definite (PSD), or $\epsilon$-far in Euclidean distance from the PSD cone,…

Let us consider i.i.d. random variables $\{a_k,b_k\}_{k \geq 1}$ defined on a common probability space $(\Omega, \mathcal F, \mathbb P)$, following a symmetric Rademacher distribution and the associated random trigonometric polynomials…

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with…

Machine learning approaches relying on such criteria as adversarial robustness or multi-agent settings have raised the need for solving game-theoretic equilibrium problems. Of particular relevance to these applications are methods targeting…

In this paper we consider the (weighted) spectral measure $\mu_n$ of a $n\times n$ random matrix, distributed according to a classical Gaussian, Laguerre or Jacobi ensemble, and show a moderate deviation principle for the standardised…

This work studies the maximum possible sign rank of $N \times N$ sign matrices with a given VC dimension $d$. For $d=1$, this maximum is {three}. For $d=2$, this maximum is $\tilde{\Theta}(N^{1/2})$. For $d >2$, similar but slightly less…

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

We initiate the study of distortion in stable matching. Concretely, we aim to design algorithms that have limited access to the agents' cardinal preferences and compute stable matchings of high quality with respect to some aggregate…

Violation of the assumptions underlying classical (Gaussian) limit theory often yields unreliable statistical inference. This paper shows that the bootstrap can detect such violations by delivering simple and powerful diagnostic tests that…

This paper is concerned with the efficient numerical treatment of 1D stationary Schr\"odinger equations in the semi-classical limit when including a turning point of first order. For the considered scattering problems we show that the wave…

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

We apply iteration schemes and perturbation methods to provide a complete solution of the boundary Yamabe problem with minimal boundary scenario, or equivalently, the existence of a real, positive, smooth solution of $ -\frac{4(n -1)}{n -…

We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…

We investigate the asymptotic behavior as $\varepsilon \to 0$ of singularly perturbed phase transition models of order $n \geq 2$, given by \begin{align} G_\varepsilon^{\lambda,n}[u] := \int_I \frac 1\varepsilon W(u)…

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in J Stat Phys 164:1233 -- 1260, 2016; Commun Math Phys 351:1009 -- 1044, 2017. We consider random Hermitian…

A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…

The Arnoldi process provides an efficient framework for approximating functions of a matrix applied to a vector, i.e., of the form $f(M)\bm{b}$, by repeated matrix-vector multiplications. In this paper, we derive error estimates for…