English
Related papers

Related papers: Average-case matrix discrepancy: satisfiability bo…

200 papers

We prove a matrix discrepancy bound that strengthens the famous Kadison-Singer result of Marcus, Spielman, and Srivastava. Consider any independent scalar random variables $\xi_1, \ldots, \xi_n$ with finite support, e.g. $\{ \pm 1 \}$ or…

Combinatorics · Mathematics 2020-08-05 Rasmus Kyng , Kyle Luh , Zhao Song

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

The aim of the paper is to find representation for solutions of $2\times 2$ system of ordinary differential equations $$ \mathbf{y^\prime} - B(x)\mathbf{y} = \lambda A(x)\mathbf{y}, \quad \ x \in [0, 1], $$ where $A(x) = diag\{a_1(x),…

Functional Analysis · Mathematics 2022-12-14 A. P. Kosarev , A. A. Shkalikov

We are concerned with the existence of solution of the problem $ -\Delta ^H_pu+|u|^{p-2}u=\lambda|u|^{q-2}u+ |u|^{p^*-2}u\quad \mbox{in}\quad\Omega,$ $u>0\quad \mbox{in}\quad\Omega,$ $a(\nabla u)\cdot \nu =0\quad \mbox{on}\quad\partial…

Analysis of PDEs · Mathematics 2023-10-04 Gustavo F. Madeira , Olímpio H. Miyakaki , Alânnio B. Nóbrega

In this article, we present a simpler and alternative proof of the solvability of the regularity problem - that is, the Dirichlet problem with boundary data in $\dot W^{1,p}$ - for uniformly elliptic operators on $\mathbb{R}^n_+$ under a…

Analysis of PDEs · Mathematics 2025-08-05 Joseph Feneuil

We extend Stein's celebrated Wasserstein bound for normal approximation via exchangeable pairs to the multi-dimensional setting. As an intermediate step, we exploit the symmetry of exchangeable pairs to obtain an error bound for smooth test…

Probability · Mathematics 2020-09-22 Xiao Fang , Yuta Koike

We prove a unified trace-average formula for the $k$-th higher trace $\lambda_k(A)=\operatorname{tr}(\Lambda^k A)$ of a linear operator $A$ on a finite-dimensional normed space. The formula averages the matrix coefficient…

Functional Analysis · Mathematics 2025-10-21 Tomasz Kania

We study \emph{sublinear} algorithms that solve linear systems locally. In the classical version of this problem the input is a matrix $S\in \mathbb{R}^{n\times n}$ and a vector $b\in\mathbb{R}^n$ in the range of $S$, and the goal is to…

Data Structures and Algorithms · Computer Science 2026-02-23 Alexandr Andoni , Robert Krauthgamer , Yosef Pogrow

Traces of large powers of real-valued Wigner matrices are known to have Gaussian fluctuations: for $A=\frac{1}{\sqrt{n}}(a_{ij})_{1 \leq i,j \leq n}\in \mathbb{R}^{n \times n}, A=A^T$ with $(a_{ij})_{1 \leq i \leq j \leq n}$ i.i.d.,…

Probability · Mathematics 2024-12-24 Simona Diaconu

We present the first efficient averaging sampler that achieves asymptotically optimal randomness complexity and near-optimal sample complexity. For any $\delta < \varepsilon$ and any constant $\alpha > 0$, our sampler uses $m + O(\log (1 /…

Computational Complexity · Computer Science 2025-08-18 Zhiyang Xun , David Zuckerman

We consider the problem of estimating the spectrum of a symmetric bounded entry (not necessarily PSD) matrix via entrywise sampling. This problem was introduced by [Bhattacharjee, Dexter, Drineas, Musco, Ray '22], where it was shown that…

Data Structures and Algorithms · Computer Science 2024-11-06 William Swartworth , David P. Woodruff

Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…

Combinatorics · Mathematics 2022-07-28 Peter Ayre , Amin Coja-Oghlan , Pu Gao , Noëla Müller

$ \newcommand{\cclass}[1]{{\normalfont\textsf{##1}}} $We show average-case lower bounds for explicit Boolean functions against bounded-depth threshold circuits with a superlinear number of wires. We show that for each integer $d > 1$, there…

Computational Complexity · Computer Science 2018-06-19 Ruiwen Chen , Rahul Santhanam , Srikanth Srinivasan

Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…

Computational Complexity · Computer Science 2015-02-24 Yash Deshpande , Andrea Montanari

We consider a high-dimensional mean estimation problem over a binary hidden Markov model, which illuminates the interplay between memory in data, sample size, dimension, and signal strength in statistical inference. In this model, an…

Statistics Theory · Mathematics 2022-10-13 Yihan Zhang , Nir Weinberger

The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…

Combinatorics · Mathematics 2021-05-25 Jiaxin Xie , Zhiqiang Xu , Ziheng Zhu

This paper derives non-asymptotic error bounds for nonlinear stochastic approximation algorithms in the Wasserstein-$p$ distance. To obtain explicit finite-sample guarantees for the last iterate, we develop a coupling argument that compares…

Machine Learning · Computer Science 2026-02-03 Seo Taek Kong , R. Srikant

Using the established $d$-concavity of the $k$-Hessian type functions $F_k(R)=\log(S_k(R)),$ whose variables are nonsymmetric matrices, we prove $ C^{2, \alpha}(\overline{\Omega}) $ estimates for strictly $(\delta, \widetilde{\gamma}_k)…

Analysis of PDEs · Mathematics 2022-04-06 Bang Tran Van , Ngoan Ha Tien , Tho Nguyen Huu , Tien Phan Trong

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

Discrete Mathematics · Computer Science 2020-11-10 Paxton Turner , Raghu Meka , Philippe Rigollet

We derive an algorithm to compute satisfiability bounds for arbitrary {\omega}-regular properties in an Interval-valued Markov Chain (IMC) interpreted in the adversarial sense. IMCs generalize regular Markov Chains by assigning a range of…

Systems and Control · Computer Science 2018-09-18 Maxence Dutreix , Samuel Coogan