Related papers: A Slightly Improved Bound for the KLS Constant
We give a shorter proof of Kanter's (1976) sharp Bessel function bound for concentrations of sums of independent symmetric random vectors. We provide sharp upper bounds for the sum of modified Bessel functions $I_0(x)+I_1(x)$, which might…
We investigate the growth of the polynomial and multilinear Hardy--Littlewood inequalities. Analytical and numerical approaches are performed and, in particular, among other results, we show that a simple application of the best known…
Some of the conclusions of an improved JWKB method by Eleuch H., Rostovtsev Y. V. and Scully M. O., EPL, 89 (2010) 50004 are clarified. The degree of approximation to exact solutions is quantitatively assessed. The improved JWKB method is…
A proposed modification of the dinamic subgrid scale closure method for LES.
We prove logarithmic conditional stability up to the final time for backward-parabolic operators whose coefficients are Log-Lipschitz continuous in $t$ and Lipschitz continuous in $x$. The result complements previous achievements of Del…
Kalton and Roberts [Trans. Amer. Math. Soc., 278 (1983), 803--816] proved that there exists a universal constant $K\leqslant 44.5$ such that for every set algebra $\mathcal{F}$ and every 1-additive function $f\colon \mathcal{F}\to \mathbb…
The k-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is a state-of-the-art algorithm for solving the k-means clustering problem and is known to give an O(log k)-approximation in expectation. Recently, Lattanzi and Sohler (ICML…
We estimate the error term in the asymptotic formula of the Sidon constant for (ordinary) Dirichlet polynomials by providing explicit lower and upper bounds. The lower bound is already implicitly known, but we supply the necessary…
Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…
We present algorithms for efficiently learning regularizers that improve generalization. Our approach is based on the insight that regularizers can be viewed as upper bounds on the generalization gap, and that reducing the slack in the…
We construct the first asymptotically good relaxed locally correctable codes with polylogarithmic query complexity, bringing the upper bound polynomially close to the lower bound of Gur and Lachish (SICOMP 2021). Our result follows from…
We present an elementary, self-contained proof of Grothendieck's inequality that unifies the real and complex cases and yields both the Krivine and Haagerup bounds, the current best-known explicit bounds for the real and complex…
We study Riesz means of the eigenvalues of the Heisenberg Laplacian with Dirichlet boundary conditions on bounded domains. We obtain an inequality with a sharp leading term and an additional lower order term, improving the result of Hanson…
Some new Frobenius norm bounds of the unique solution to certain structured Sylvester equation are derived. Based on the derived norm upper bounds, new multiplicative perturbation bounds are provided both for subunitary polar factors and…
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…
We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz…
We give a bound of $k$ for a very ample lattice polytope to be $k$-normal. Equivalently, we give a new combinatorial bound for the Castelnuovo-Mumford regularity of normal projective toric varieties.
We present new bounds for the Berezin number inequalities which improve on the existing bounds. We also obtain bounds for the Berezin norm of operators as well as the sum of two operators.
The shifted-i expansion technique (SLET) is extended to solve for Dirac particle trapped in spherically symmetric scalar and/or 4-vector potentials. A parameter {\lambda}=0,1 is introduced in such a way that one can obtain the Klein-Gordon…
We offer new proofs, refinements as well as new results related to classical means of two variables, including the identric and logarithmic means.