Related papers: A new estimate for a quantity involving the Chebys…
We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…
In this paper, a new framework for continuous-time maximum a posteriori estimation based on the Chebyshev polynomial optimization (ChevOpt) is proposed, which transforms the nonlinear continuous-time state estimation into a problem of…
Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
In this paper, we study optimization problems of numerical differentiation and summation methods on classes of univariate functions. Sharp estimates (in order) of the optimal recovery error and information complexity are calculated for…
We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.
This paper establishes pointwise estimates up to boundary for the gradient of weak solutions to a class of very singular quasilinear elliptic equations with mixed data: \begin{cases} -\operatorname{div}(A(x,D u))=g-\operatorname{div} f…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
In this article we study some new pointwise inequalities between rough singular integral operators, weighted maximal functions of the gradient and weighted Morrey spaces. These pointwise estimates will naturally lead us to a new class of…
Combining the properties of monovariate internal functions as proposed in Kolmogorov superimposition theorem, in tandem with the bounds wielded by the multivariate formulation of Chebyshev inequality, a hybrid model is presented, that…
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs,…
We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.
We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also uncovers previously unknown connections between the low rank…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
Federated Averaging (FedAvg), also known as Local SGD, is one of the most popular algorithms in Federated Learning (FL). Despite its simplicity and popularity, the convergence rate of FedAvg has thus far been undetermined. Even under the…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…
We introduce modified energies that are suitable to get upper bounds on the high Sobolev norms for solutions to the $1$D periodic NLS. Our strategy is rather flexible and allows us to get a new and simpler proof of the bounds obtained by…
In this work, a generalization of Chebyshev functional is presented. New inequalities of Gruss type via Pompeiu's mean value theorem are established. Improvements of some old inequalities are proved. A generalization of pre-Gruss inequality…
In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…
Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain…