Related papers: Lopsided Approximation of Amoebas
We consider the problem of computing the Lebesgue volume of compact basic semi-algebraic sets. In full generality, it can be approximated as closely as desired by a converging hierarchy of upper bounds obtained by applying the Moment-SOS…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
The study of hypersurfaces in a torus leads to the beautiful zoo of amoebas and their contours, whose possible configurations are seen from combinatorial data. There is a deep connection to the logarithmic Gauss map and its critical points.…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…
The topology of amoebas of complex algebraic hypersurfaces is deeply connected to the combinatorics of the Newton polytope and the convex geometry of the Ronkin function. A long-standing conjecture of Passare and Rullgard asserts that the…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
We show that the amoeba of a complex algebraic variety defined as the solutions to a generic system of $n$ polynomials in $n$ variables has a finite basis. In other words, it is the intersection of finitely many hypersurface amoebas.…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
This paper concerns the approximation of smooth, high-dimensional functions from limited samples using polynomials. This task lies at the heart of many applications in computational science and engineering - notably, some of those arising…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
Given an algebraic variety we get Puiseux type parametrizations on suitable Reinhardt domains. These domains are defined using the amoeba of hypersurfaces containing the discriminant locus of a finite projection of the variety.
Archetypal analysis is an unsupervised learning method for exploratory data analysis. One major challenge that limits the applicability of archetypal analysis in practice is the inherent computational complexity of the existing algorithms.…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
In this paper, we study tractability of $L_2$-approximation of one-periodic functions from weighted Korobov spaces in the worst-case setting. The considered weights are of product form. For the algorithms we allow information from the class…
In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
The computation of amoebas has been a challenging open problem for the last dozen years. The most natural approach, namely to compute an amoeba via its boundary, has not been practical so far since only a superset of the boundary, the…
Given a complex algebraic hypersurface~$H$, we introduce a polyhedral complex which is a subset of the Newton polytope of the defining polynomial for~$H$ and enjoys the key topological and combinatorial properties of the amoeba of~$H.$ We…
We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…