Related papers: Log-Quadratic Bounds for the Gaussian Q-function
Greedy-GQ with linear function approximation, originally proposed in \cite{maei2010toward}, is a value-based off-policy algorithm for optimal control in reinforcement learning, and it has a non-linear two timescale structure with the…
For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
We implement a full nonlinear optimization method to fit continuum states with complex Gaussians. The application to a set of regular scattering Coulomb functions allows us to validate the numerical feasibility, to explore the range of…
New results on comparison of distributions of Gaussian quadratic forms are presented
In this paper, we introduce the Quasi-Quadratic Gradient (QQG), a novel search direction designed to accelerate the BFGS method within the quasi-Newton framework. By defining the QQG as the product of the inverse Hessian approximation and…
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q^p of Q, as it is for example…
Quadratic matrix equations of the kind $A_1X^2+A_0X+A_{-1}=X$ are encountered in the analysis of Quasi--Birth-Death stochastic processes where the solution of interest is the minimal nonnegative solution $G$. In many queueing models,…
This paper presents a quadratic formula-based nonlinear representation for a given single-variable function f(x), $-1 \leq x \leq 1$. First, we construct the explicit polynomial coefficient functions a(x), b(x), and c(x) using a…
We present the even-N moments N =< 20 of the fourth-order (N^3LO) contribution P_{gq}^(3)(x) to the quark-to-gluon splitting function in perturbative QCD. These moments, obtained by analytically computing off-shell operator matrix elements…
In this paper, we provide upper and lower estimates for the minimal number of functions needed to represent a bounded variation function with an accuracy of epsilon with respect to ${\bf L}^1$-distance.
Different features of a potential in the form of a Gaussian well have been discussed extensively. Although the details of the calculation are involved, the general approach uses a variational method and WKB approximation, techniques which…
The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…
In this note, we give a probabilistic interpretation of the Central Limit Theorem used for approximating isotropic Gaussians in [1].
In this paper, an approximation of the optimal compressor function using the quadratic spline functions has been presented. The coefficients of the quadratic spline functions are determined by minimizing the mean-square error (MSE). Based…
In this paper, we prove a result on the $2$-adic logarithm of the fundamental unit of the field $\mathbb{Q}(\sqrt[4]{-q}) $, where $q\equiv 3\bmod 4$ is a prime. When $q\equiv 15\bmod 16$, this result confirms a speculation of Coates-Li and…
The convergence of the so-called quadratic method for computing eigenvalue enclosures of general self-adjoint operators is examined. Explicit asymptotic bounds for convergence to isolated eigenvalues are found. These bounds turn out to…
We give an improved lower bound for the error of any quadrature computing $\int_{-1}^1 f(x) d\alpha(x)$ of analytic functions bounded in the neighborhood of $[-1,1]$.
Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by…
We show that Nechiporuk's method for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an n^2 / log^2 n lower bound for quantum formulas computing an explicit function. The only known previous…
We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.