Related papers: Smoothed Analysis of Interior-Point Algorithms: Co…

We propose a novel stochastic smoothing accelerated gradient (SSAG) method for general constrained nonsmooth convex composite optimization, and analyze the convergence rates. The SSAG method allows various smoothing techniques, and can deal…

There has been recent interest in the conditional central limit question for (strictly) stationary, ergodic processes $...,X_{-1},X_0,X_1,...$ whose partial sums $S_n=X_1+...+X_n$ are of the form $S_n=M_n+R_n$, where $M_n$ is a square…

Ingham (1940) proved that $N(\sigma,T)\ll T^{3(1-\sigma)/(2-\sigma)}\log^{5}{T}$, where $N(\sigma,T)$ counts the number of the non-trivial zeros $\rho$ of the Riemann zeta-function with $\Re\{\rho\}\geq\sigma\geq 1/2$ and $0<\Im\{\rho\}\leq…

We study $m$-linear homogeneous rough singular integral operators $\mathcal{L}_{\Omega}$ associated with integrable functions $\Omega$ on $\mathbb{S}^{mn-1}$ with mean value zero. We prove boundedness for $\mathcal{L}_{\Omega}$ from…

The Erd\H{o}s multiplication table problem asks what is the number of distinct integers appearing in the $N\times N$ multiplication table. The order of magnitude of this quantity was determined by Ford in 2008. In this paper we study the…

Kolmogorov complexity measures the algorithmic complexity of a finite binary string $\sigma$ in terms of the length of the shortest description $\sigma^*$ of $\sigma$. Traditionally, the length of a string is taken to measure the amount of…

In recent works, the authors of this chapter have shown with co-authors how a basis consisting of dilated and shifted $\text{sinc}$-functions can be used to solve fractional partial differential equations. As a model problem, the fractional…

Given real numbers whose sum is an integer, we study the problem of finding integers which match these real numbers as closely as possible, in the sense of L^p norm, while preserving the sum. We describe the structure of solutions for this…

We develop a class of algorithms, as variants of the stochastically controlled stochastic gradient (SCSG) methods (Lei and Jordan, 2016), for the smooth non-convex finite-sum optimization problem. Assuming the smoothness of each component,…

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

In this paper, we study stochastic optimization of two-level composition of functions without Lipschitz continuous gradient. The smoothness property is generalized by the notion of relative smoothness which provokes the Bregman gradient…

In this paper we give a variant of the Robin inequality which states that $\frac{\sigma(n)}{n} \leq \frac{e^\gamma}{2} \log\log n + \frac{0.7398\cdots}{\log\log n}$ for any odd integer $n \geq 3$.

Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$-SUM, resulting in $O(n^3 \log^3{n})$ linear queries, we present a further improvement to $O(n^2 \log^2{n})$ such queries.

We show that a bilinear radial Fourier multiplier operator with symbol $\sigma$ is $L^2(\R^n)\times L^2(\R^n) \to L^1(\R^n)$ bounded, $n\in \mathbb N,$ if the function $\sigma$ satisfies the smoothness condition $\sigma(2^j\cdot)\Phi\in…

We revisit the sample and computational complexity of completing a rank-1 tensor in $\otimes_{i=1}^{N} \mathbb{R}^{d}$, given a uniformly sampled subset of its entries. We present a characterization of the problem (i.e. nonzero entries)…

Sparse reconstruction approaches using the re-weighted l1-penalty have been shown, both empirically and theoretically, to provide a significant improvement in recovering sparse signals in comparison to the l1-relaxation. However, numerical…

Let $S(t)$ denote the argument of the Riemann zeta-function, defined as $$ S(t)=\dfrac{1}{\pi}\,\Im\log\zeta(1/2+it). $$ Assuming the Riemann hypothesis, we prove that $$ S(t)=\Omega_{\pm}\bigg(\dfrac{\log t\log\log\log t}{\log\log…

We define the notion of a thick open set $\Omega$ in a Euclidean space and show that a local Hardy-Littlewood inequality holds in $L^p(\Omega)$, $p \in (1, \infty]$. We then establish pointwise and $L^p(\Omega)$ convergence for families of…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…