Related papers: Extended Limber Approximation
We show how to compute the edit distance between two strings of length n up to a factor of 2^{\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time,…
We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…
Given a pair of strings, the problems of computing their Longest Common Subsequence and Edit Distance have been extensively studied for decades. For exact algorithms, LCS and Edit Distance (with character insertions and deletions) are…
Using the SU(2) gauge coupling, $g_{W^\pm} (M^2_{W^\pm})$, at the high-energy scale of $M_{W^\pm}$, defined by the (theoretical value of the) leptonic W-width, rather than using the low-energy value, defined via the Fermi coupling, $G_\mu$,…
We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…
We find two convergent series expansions for Legendre's first incomplete elliptic integral $F(\lambda,k)$ in terms of recursively computed elementary functions. Both expansions are valid at every point of the unit square $0<\lambda,k<1$.…
Statistical applications often involve the calculation of intractable multidimensional integrals. The Laplace formula is widely used to approximate such integrals. However, in high-dimensional or small sample size problems, the shape of the…
We propose a new definition for the error threshold of a population evolving through mutation and selection. We compute the correction term due to the finiteness of the population by estimating the lifetime of master sequences. Our…
Expectation Propagation (EP) provides a framework for approximate inference. When the model under consideration is over a latent Gaussian field, with the approximation being Gaussian, we show how these approximations can systematically be…
The accuracy of the Heller's derivative rule to calculate the numerical weights associated with discretized energy spectrum is enhanced by Broad's extension which adds (N-1) more interpolating points to the original N points. The extension…
Data augmentation is one of the most popular techniques for improving the robustness of neural networks. In addition to directly training the model with original samples and augmented samples, a torrent of methods regularizing the distance…
The aim of this paper is to derive a refined first-order expansion formula in Rn, the goal being to get an optimal reduced remainder, compared to the one obtained by usual Taylor's formula. For a given function, the formula we derived is…
We calculate the two-particle irreducible (2PI) effective potential of the O(N) linear sigma model in 1+1 dimensions. The approximations we use are the next-to-leading order of a 1/N expansion (for arbitrary N) and a kind of "resummed loop…
We transform a double integral into a second-order initial value problem, which we solve using Euler's method and Richardson extrapolation. For an example we consider, we achieve accuracy close to machine precision (1e-15). We also use the…
Bregman divergences generalize measures such as the squared Euclidean distance and the KL divergence, and arise throughout many areas of machine learning. In this paper, we focus on the problem of approximating an arbitrary Bregman…
Recently full O(alpha_s^2, alpha_s*beta, beta^2) corrections to the threshold total cross section for e+e- to ttbar have been calculated, and the reported corrections turned out to be unexpectedly large. We study how to reduce theoretical…
We study the convergence rates of the classical Lagrangian-based methods and their variants for solving convex optimization problems with equality constraints. We present a generalized prediction-correction framework to establish $O(1/K^2)$…
We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many…
The aim of this paper is to provide new perspectives on the relative finite elements accuracy. Starting from a geometrical interpretation of the error estimate which can be deduced from Bramble-Hilbert lemma, we derive a probability law…
Pointwise and ergodic iteration-complexity results for the proximal alternating direction method of multipliers (ADMM) for any stepsize in(0,(1+\sqrt{5})/2) have been recently established in the literature. In addition to giving alternative…