Related papers: Optimal L$^1$-bounds for submartingales

Let $(\mathcal{F}_n)_{n\ge 0}$ be the standard dyadic filtration on $[0,1]$. Let $\mathbb{E}_{\mathcal{F}_n}$ be the conditional expectation from $ L_1=L_1[0,1]$ onto $\mathcal{F} _n$, $n\ge 0$, and let $\mathbb{E}_{\mathcal{F} _{-1}} =0$.…

Let (S_0,S_1,...) be a supermartingale relative to a nondecreasing sequence of \sigma-algebras (H_{\le0},H_{\le1},...), with S_0\le0 almost surely (a.s.) and differences X_i:=S_i-S_{i-1}. Suppose that for every i=1,2,... there exist…

We investigate geometric features of the unit ball corresponding to the sum of the nuclear norm of a matrix and the $l_1$ norm of its entries --- a common penalty function encouraging joint low rank and high sparsity. As a byproduct of this…

Let $(M,g)$ be a smooth compact Riemannian manifold of dimension $n \geq 2$. This paper concerns to the validity of the optimal Riemannian $L^1$-Entropy inequality \[ {\bf Ent}_{dv_g}(u) \leq n \log \left(A_{opt} \|D u\|_{BV(M)} +…

Exhausters are families of convex compact sets that allow one to represent directional derivative of the studied function at the considered point in the form of InfMax or SupMin of linear functions. Functions for which such a representation…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

This paper deals with the construction of an optimal quadrature formula for the approximation of Fourier integrals in the Sobolev space $L_2^{(1)}[a,b]$ of non-periodic, complex valued functions which are square integrable with first order…

We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

In contrast to the many continuous global optimization methods that assume the objective function and constraints are factorable, we study how to find globally maximal solutions to problems that are not factorable, focusing on a particular…

For a sequence of random variables $(X_1, X_2, \ldots, X_n)$, $n \geq 1$, that are independent and identically distributed with a regularly varying tail with index $-\alpha$, $\alpha \geq 0$, we show that the contribution of the maximum…

We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…

In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious with respect to querying the submodular function, for both the…

We consider the problem of estimating small ball probabilities $\mathbb P\{f(G) \leqslant \delta \mathbb Ef(G)\}$ for sub-additive,positively homogeneous functions $f$ with respect to the Gaussian measure. We establish estimates that depend…

We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…

We revisit the problem of mean estimation in the Gaussian sequence model with $\ell_p$ constraints for $p \in [0, \infty]$. We demonstrate two phenomena for the behavior of the maximum likelihood estimator (MLE), which depend on the noise…

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

We establish an $L_1$-bound between the coefficients of the optimal causal filter applied to the data-generating process and its finite sample approximation. Here, we assume that the data-generating process is a second-order stationary time…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Maximizing submodular objectives under constraints is a fundamental problem in machine learning and optimization. We study the maximization of a nonnegative, non-monotone $\gamma$-weakly DR-submodular function over a down-closed convex…