Related papers: Note on a Theoretical Justification for Approximat…
Approximate Bayesian computation performs approximate inference for models where likelihood computations are expensive or impossible. Instead simulations from the model are performed for various parameter values and accepted if they are…
Approximate algorithms for structured prediction problems---such as LP relaxations and the popular alpha-expansion algorithm (Boykov et al. 2001)---typically far exceed their theoretical performance guarantees on real-world instances. These…
This paper investigates, a new class of fractional order Runge-Kutta (FORK) methods for numerical approximation to the solution of fractional differential equations (FDEs). By using the Caputo generalizedTaylor formula and the total…
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is…
For a purely $N$-periodic continued fraction $\xi=[\overline{a_0,a_1,\dots,a_{N-1}}]=[a_0,a_1,\cdots]$, with $a_k=a_{k+N}$ for all $k\ge 0$, and convergents $h_n/k_n=[a_0,a_1,\dots,a_n]$, we obtain explicit expressions for the weighted…
In this paper we generalize and analyze the model for pricing American-style Asian options due to (Hansen and Jorgensen 2000) by including a continuous dividend rate $q$ and a general method of averaging of the floating strike. We focus on…
Floating-point arithmetic (FPA) is a mechanical representation of real arithmetic (RA), where each operation is replaced with a rounded counterpart. Various numerical properties can be verified by using SMT solvers that support the logic of…
Krylov subspace methods for approximating a matrix function $f(A)$ times a vector $v$ are analyzed in this paper. For the Arnoldi approximation to $e^{-\tau A}v$, two reliable a posteriori error estimates are derived from the new bounds and…
We consider the problem of finding a rational function in barycentric form to approximate a given function or data set in $\mathbb{R}$ or $\mathbb{C}$. The famous AAA algorithm, introduced in 2018, constructs such a rational function: the…
This paper provides a new approach to derive various arbitrary high order finite difference formulae for the numerical differentiation of analytic functions. In this approach, various first and second order formulae for the numerical…
Algorithmic fairness has emerged as an important consideration when using machine learning to make high-stakes societal decisions. Yet, improved fairness often comes at the expense of model accuracy. While aspects of the fairness-accuracy…
We consider a generalization of $k$-median and $k$-center, called the {\em ordered $k$-median} problem. In this problem, we are given a metric space $(\mathcal{D},\{c_{ij}\})$ with $n=|\mathcal{D}|$ points, and a non-increasing weight…
We estimate the covariance in counts of almost-primes in $\mathbb{F}_q[T]$, weighted by higher-order von Mangoldt functions. The answer takes a pleasant algebraic form. This generalizes recent work of Keating and Rudnick that estimates the…
Tensor time series data appears naturally in a lot of fields, including finance and economics. As a major dimension reduction tool, similar to its factor model counterpart, the idiosyncratic components of a tensor time series factor model…
Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…
Exponential approximation based on the first order mean spherical approximation (FMSA) is applied to the study of the structure and thermodynamics of hard-core repulsive Yukawa fluids. The proposed theory utilizes an exponential enhancement…
The ODE method has been a workhorse for algorithm design and analysis since the introduction of the stochastic approximation. It is now understood that convergence theory amounts to establishing robustness of Euler approximations for ODEs,…
We derive a residual based a-posteriori error estimate for the outer normal flux of approximations to {the diffusion problem with variable coefficient}. By analyzing the solution of the adjoint problem, we show that error indicators in the…
We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $\Delta$ on $n$ vertices, for all $k \le (1-\delta)m^*(G)$, where $\delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an…
Let $X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n}X_ka_k $ with respect to the arithmetic structure of…