Related papers: A lower bound for the variance of generalized divi…

It is proved that one cannot approximate stably the first derivative of a smooth function given noisy values of this function and a bound on this function and its first derivative. Such an approximation is shown to be possible if an a…

This paper studies the approximation capacity of neural networks with an arbitrary activation function and with norm constraint on the weights. Upper and lower bounds on the approximation error of these networks are computed for smooth…

We develop the theory of discrete-time gradient flows for convex functions on Alexandrov spaces with arbitrary upper or lower curvature bounds. We employ different resolvent maps in the upper and lower curvature bound cases to construct…

We prove that the finite-difference based derivative-free descent (FD-DFD) methods have a capability to find the global minima for a class of multiple minima problems. Our main result shows that, for a class of multiple minima objectives…

The associativity property, usually defined for binary functions, can be generalized to functions of a given fixed arity n>=1 as well as to functions of multiple arities. In this paper, we investigate these two generalizations in the case…

In this paper we establish a new margin-based generalization bound for voting classifiers, refining existing results and yielding tighter generalization guarantees for widely used boosting algorithms such as AdaBoost (Freund and Schapire,…

We compute the variances of sums in arithmetic progressions of arithmetic functions associated with certain $L$-functions of degree two and higher in $\mathbb{F}_q[t]$, in the limit as $q\to\infty$. This is achieved by establishing…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

We address the problem of producing a lower bound for the mean of a discrete probability distribution, with known support over a finite set of real numbers, from an iid sample of that distribution. Up to a constant, this is equivalent to…

Modern regression problems often involve high-dimensional data and a careful tuning of the regularization hyperparameters is crucial to avoid overly complex models that may overfit the training data while guaranteeing desirable properties…

We prove that solutions of a mildly regularized Perona-Malik equation converge, in a slow time scale, to solutions of the total variation flow. The convergence result is global-in-time, and holds true in any space dimension. The proof is…

We provide an elementary proof of the lower bound for the variance of continuous unimodal distributions and obtain analogous bounds for the higher order central moments. A lower bound for the rth central moment of discrete distribution is…

In this paper, we provide a new and sharper bound for the Legendre coefficients of differentiable functions and then derive a new error bound of the truncated Legendre series in the uniform norm. The key idea of proof relies on integration…

We consider the approximation of manifold-valued functions by embedding the manifold into a higher dimensional space, applying a vector-valued approximation operator and projecting the resulting vector back to the manifold. It is well known…

We give a simple proof of the fact that an "$f$-estimate" for the $\bar\partial$-Neumann problem implies a lower bound on the geomatric type of the boundary along any complex one dimensional variety. The proof uses the existence of peak…

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.

An approach will be proposed to determine the existence of a limit distribution of additive arithmetic functions in this work. It is based on assertions that will be proven in this work and on the properties of Dirichlet convolution and…

We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of…