Related papers: Constructive l2-Discrepancy Minimization with Addi…

We consider the problem of robustly predicting as well as the best linear combination of $d$ given functions in least squares regression, and variants of this problem including constraints on the parameters of the linear combination. For…

We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most $t$ sets. We give an algorithm that finds a coloring with discrepancy $O((t \log n \log s)^{1/2})$ where $s$ is the…

Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \emph{et al.}, "Optimal locally repairable codes and connections to…

This paper considers the linear inverse problem where we wish to estimate a structured signal $x$ from its corrupted observations. When the problem is ill-posed, it is natural to make use of a convex function $f(\cdot)$ that exploits the…

The $\ell$-1 norm based optimization is widely used in signal processing, especially in recent compressed sensing theory. This paper studies the solution path of the $\ell$-1 norm penalized least-square problem, whose constrained form is…

We study existence problem for semilinear equations with Borel measure data and operator generated by a symmetric Markov semigroup. We assume merely that the nonlinear part satisfies the so-called sign condition. Using the method of sub and…

We present a new non-parametric statistic, called the weighed $\ell_2$ divergence, based on empirical distributions for sequential change detection. We start by constructing the weighed $\ell_2$ divergence as a fundamental building block…

An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\mathbb{R}^m$ of $\ell_2$ norm at most $1$ and any convex body $K$ in $\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\pm 1$…

The bad science matrix problem consists in finding, among all matrices $A \in \mathbb{R}^{n \times n}$ with rows having unit $\ell^2$ norm, one that maximizes $\beta(A) = \frac{1}{2^n} \sum_{x \in \{-1, 1\}^n} \|Ax\|_\infty$. Our main…

The sum rule for the structure function $g_1^{p}$ which is related to the cross section of the photo-production is used to show that a sign change of the integral corresponding to the appropriately defined moment at $n=0$ where the integral…

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have…

We investigate the square variation operator $V^2$ (which majorizes the partial sum maximal operator) on general orthonormal systems (ONS) of size $N$. We prove that the $L^2$ norm of the $V^2$ operator is bounded by $O(\ln(N))$ on any ONS.…

Let $S\big(x; \frac{a_1}{q_1}, \frac{a_2}{q_2}\big)=\mathop{{\sum}'}_{mn\leq x} \cos\big(2\pi m\frac{a_1}{q_1}\big)\sin\big(2\pi n\frac{a_2}{q_2}\big)$ with $x\geq q_1q_2, 1\leq a_i\leq q_i$, and $(a_i, q_i)=1$ ($i=1, 2$). We study the sign…

In the stochastic online vector balancing problem, vectors $v_1,v_2,\ldots,v_T$ chosen independently from an arbitrary distribution in $\mathbb{R}^n$ arrive one-by-one and must be immediately given a $\pm$ sign. The goal is to keep the norm…

The recent work of \cite{CRT,DonohoPol} rigorously proved (in a large dimensional and statistical context) that if the number of equations (measurements in the compressed sensing terminology) in the system is proportional to the length of…

Constructing small-sized coresets for various clustering problems in different metric spaces has attracted significant attention for the past decade. A central problem in the coreset literature is to understand what is the best possible…

Our starting point is an improved version of a result of D. Hajela related to a question of Koml\'{o}s: we show that if $f(n)$ is a function such that $\lim\limits_{n\to\infty }f(n)=\infty $ and $f(n)=o(n)$, there exists $n_0=n_0(f)$ such…

In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear…

We study the problem of predicting as well as the best linear predictor in a bounded Euclidean ball with respect to the squared loss. When only boundedness of the data generating distribution is assumed, we establish that the least squares…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…