Related papers: Finding simultaneous Diophantine approximations wi…
Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…
We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.
Many problems in machine learning can be solved by rounding the solution of an appropriate linear program (LP). This paper shows that we can recover solutions of comparable quality by rounding an approximate LP solution instead of the ex-…
We study approximation algorithms for the following three string measures that are widely used in practice: edit distance (ED), longest common subsequence (LCS), and longest increasing sequence (LIS). All three problems can be solved…
In this paper, we study the Dirichlet problem for Laplace's equation in an open disk. The uniqueness of solutions is ensured by the well-known weak maximum principle. We introduce a novel approach to demonstrate the existence of a solution…
We give a polynomial-time approximation algorithm for the (not necessarily metric) $k$-Median problem. The algorithm is an $\alpha$-size-approximation algorithm for $\alpha < 1 + 2 \ln(n/k)$. That is, it guarantees a solution having size at…
We investigate error bounds for numerical solutions of divergence structure linear elliptic PDEs on compact manifolds without boundary. Our focus is on a class of monotone finite difference approximations, which provide a strong form of…
We solve the convergence case of the generalized Baker-Schmidt problem for simultaneous approximation on affine subspaces, under natural diophantine type conditions. In one of our theorems, we do not require monotonicity on the…
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…
Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…
We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.
This work, for the first time, introduces two constant factor approximation algorithms with linear query complexity for non-monotone submodular maximization over a ground set of size $n$ subject to a knapsack constraint, $\mathsf{DLA}$ and…
The fractional Laplacian has been strongly studied during past decades. In this paper we present a different approach for the associated Dirichlet problem, using recent deep learning techniques. In fact, intensively PDEs with a stochastic…
We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…
We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…
This paper investigates the approximability of the Longest Common Subsequence (LCS) problem. The fastest algorithm for solving the LCS problem exactly runs in essentially quadratic time in the length of the input, and it is known that under…
This article derives lower bounds on the convergence rate of continuous-time gradient-based optimization algorithms. The algorithms are subjected to a time-normalization constraint that avoids a reparametrization of time in order to make…
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…