Related papers: Rational approximation of $x^n$
We give an efficient 0.8395-approximation algorithm for the EPR Hamiltonian. Our improvement comes from a new nonlinear monogamy-of-entanglement bound on star graphs and a refined parameterization of a shallow quantum circuit from previous…
We prove an inequality related to questions in Approximation Theory, Probability Theory, and to Irregularities of Distribution. Let $h_R$ denote an $L ^{\infty}$ normalized Haar function adapted to a dyadic rectangle $R\subset [0,1] ^{3}$.…
This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where…
We consider bottom-k sampling for a set X, picking a sample S_k(X) consisting of the k elements that are smallest according to a given hash function h. With this sample we can estimate the relative size f=|Y|/|X| of any subset Y as |S_k(X)…
We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…
We consider the approximate minimization of a given polynomial on the standard simplex, obtained by taking the minimum value over all rational grid points with given denominator ${r} \in \mathbb{N}$. It was shown in [De Klerk, E., Laurent,…
In this work we construct Gaussian beam approximations to solutions of the high frequency Helmholtz equation with a localized source. Under the assumption of non-trapping rays we show error estimates between the exact outgoing solution and…
As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known…
By making a seminal use of the maximum modulus principle of holomorphic functions we prove existence of $n$-best kernel approximation for a wide class of reproducing kernel Hilbert spaces of holomorphic functions in the unit disc, and for…
In this paper, we describe the randomized QLP (RQLP) algorithm and its enhanced version (ERQLP) for computing the low rank approximation to $A$ of size $m\times n$ efficiently such that $A\approx QLP$, where $L$ is the rank-$k$…
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…
We prove precise rates of convergence for monotone approximation schemes of fractional and nonlocal Hamilton-Jacobi-Bellman (HJB) equations. We consider diffusion corrected difference-quadrature schemes from the literature and new…
This paper is concerned with minimizing a sum of rational functions over a compact set of high-dimension. Our approach relies on the second Lasserre's hierarchy (also known as the upper bounds hierarchy) formulated on the pushforward…
We outline a proof of an analogue of Khintchine's Theorem in R^2, where the ordinary height is replaced by a distance function satisfying an irrationality condition as well as certain decay and symmetry conditions.
We give an approximation algorithm for Quantum Max-Cut which works by rounding an SDP relaxation to an entangled quantum state. The SDP is used to choose the parameters of a variational quantum circuit. The entangled state is then…
For a Hamiltonian $K \in C^2(\mathbb{R}^{N \times n})$ and a map $u:\Omega \subseteq \mathbb{R}^n \longrightarrow \mathbb{R}^N$, we consider the supremal functional \[ \label{1} \tag{1} E_\infty (u,\Omega) \ :=\…
MAX NAE-SAT is a natural optimization problem, closely related to its better-known relative MAX SAT. The approximability status of MAX NAE-SAT is almost completely understood if all clauses have the same size $k$, for some $k\ge 2$. We…
Dirichlet's uniform approximation theorem is a fundamental result in Diophantine approximation that gives an optimal rate of approximation with a given bound. We study uniform Diophantine approximation properties on the Hecke group $\mathbf…
We obtain the result of approximating \( f \) in the \( H^1(\mathbb{R}) \) norm using partial Hausdorff integrals. Specifically, by leveraging the homogeneous multiplier theory of \( H^1(\mathbb{R}) \) and the \( K \) functional theory, one…
Various methods in statistical learning build on kernels considered in reproducing kernel Hilbert spaces. In applications, the kernel is often selected based on characteristics of the problem and the data. This kernel is then employed to…