Related papers: Restriction estimates using polynomial partitionin…
We prove an L2 recovery bound for a family of sparse estimators defined as minimizers of some empirical loss functions -- which include hinge loss and logistic loss. More precisely, we achieve an upper-bound for coefficients estimation…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
For cylindrically symmetric functions dyadically supported on the paraboloid, we obtain a family of sharp linear and bilinear adjoint restriction estimates. As corollaries, we first extend the ranges of exponents for the classical…
In this paper, we revisit approximation properties of piecewise polynomial spaces, which contain more than ${\cal P}_{r-1}$ but not ${\cal P}_r$. We develop more accurate upper and lower error bounds that are sharper than those used in…
We improve the $L^p(\mathbb{R}^n)$ bounds on Stein's square function to the best-known range of the Fourier restriction problem when $n\geq4$. Applications including certain local smoothing estimates are also discussed.
We study linear regression models with clustered data, high-dimensional controls, and intricate exclusion restrictions. We propose a correctly centered internal instrument IV estimator that accommodates a broad class of exclusion…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
We propose a general algorithm of constructing an extended formulation for any given set of linear constraints with integer coefficients. Our algorithm consists of two phases: first construct a decision diagram $(V,E)$ that somehow…
Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…
We study the density estimation problem defined as follows: given $k$ distributions $p_1, \ldots, p_k$ over a discrete domain $[n]$, as well as a collection of samples chosen from a ``query'' distribution $q$ over $[n]$, output $p_i$ that…
In this paper, we consider Bayesian point estimation and predictive density estimation in the binomial case. After presenting preliminary results on these problems, we compare the risk functions of the Bayes estimators based on the…
We establish a gradient estimate for a very weak solution to a quasilinear elliptic equation with a nonstandard growth condition, which is a natural generalization of the $p$-Laplace equation. We investigate the maximum extent for the…
In this paper we study sharp estimates for the Schr\"odinger operator via the framework of orthogonal polynomials. We use spherical harmonics and Gegenbauer polynomials to prove a new weighted inequality for the Schr\"odinger equation that…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
We obtain truncated restriction estimates of an unexpected form for discrete surfaces \begin{align} S = \{\, ( n_1 , \dots , n_d , R( n_1 , \dots, n_d ) ) \,,\, n_i \in [-N,N] \cap \mathbb{Z} \,\}, \end{align} where $R$ is an indefinite…
We propose two least-squares estimators of a discrete probability under the constraint of k-monotony and study their statistical properties. We give a characterization of these estimators based on the decomposition on a spline basis of…
We propose a new approach to the Fourier restriction conjectures. It is based on a discretization of the Fourier extension operators in terms of quadratically modulated wave packets. Using this new point of view, and by combining natural…
This paper proves several weak limit theorems for the joint version of extreme order statistics and partial sums of independently and identically distributed random variables. The results are also extended to almost sure limit version.