Results 1  10
of
92
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
 SIAM J. COMPUT
, 1990
"... The authors consider the problem of reconstructing (i.e., interpolating) a tsparse multivariate polynomial given a black box which will produce the value of the polynomial for any value of the arguments. It is shown that, if the polynomial has coefficients in a finite field GF[q] and the black box ..."
Abstract

Cited by 53 (12 self)
 Add to MetaCart
The authors consider the problem of reconstructing (i.e., interpolating) a tsparse multivariate polynomial given a black box which will produce the value of the polynomial for any value of the arguments. It is shown that, if the polynomial has coefficients in a finite field GF[q] and the black box can evaluate the polynomial in the field GF[qr2g,tnt+37], where n is the number of variables, then there is an algorithm to interpolate the polynomial in O(log (nt)) boolean parallel time and O(n2t log nt) processors. This algorithm yields the first efficient deterministic polynomial time algorithm (and moreover boolean NCalgorithm) for interpolating tsparse polynomials over finite fields and should be contrasted with the fact that efficient interpolation using a black box that only evaluates the polynomial at points in GF[q] is
Reconstructing algebraic functions from mixed data. FOCS
, 1992
"... We consider the task of reconstructing algebraic functions given by black boxes. Unlike traditional settings, we are interested in black boxes which represent several algebraic functionsf1;:::;fk, where at each inputx, the box arbitrarily chooses a subset off1(x);:::;fk(x)to output. We show how to ..."
Abstract

Cited by 50 (12 self)
 Add to MetaCart
We consider the task of reconstructing algebraic functions given by black boxes. Unlike traditional settings, we are interested in black boxes which represent several algebraic functionsf1;:::;fk, where at each inputx, the box arbitrarily chooses a subset off1(x);:::;fk(x)to output. We show how to reconstruct the functionsf1;:::;fkfrom the black box. This allows us to group the sample points into sets, such that for each set, all outputs to points in the set are from the same algebraic function. Our methods are robust in the presence of errors in the black box. Our model and techniques can be applied in the areas of computer vision, machine learning, curve fitting and polynomial approximation, selfcorrecting programs and bivariate polynomial factorization. 1
Improved Sparse Multivariate Polynomial Interpolation Algorithms
 ISSAC
, 1988
"... We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to BenOr and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz sys ..."
Abstract

Cited by 45 (11 self)
 Add to MetaCart
We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to BenOr and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the BenOr and Tiwari algorithm and for solving transposed Vandermonde systems of equations, the use of which greatly improves the time complexities of the two interpolation algorithms.
Randomized Interpolation and Approximation of Sparse Polynomials
 SIAM Journal on Computing
, 1995
"... We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L_2 norm). ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L_2 norm).
Symbolicnumeric sparse interpolation of multivariate polynomials
 In Proc. Ninth Rhine Workshop on Computer Algebra (RWCA’04), University of Nijmegen, the Netherlands (2004
, 2006
"... We consider the problem of sparse interpolation of an approximate multivariate blackbox polynomial in floatingpoint arithmetic. That is, both the inputs and outputs of the blackbox polynomial have some error, and all numbers are represented in standard, fixedprecision, floating point arithmetic. ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
We consider the problem of sparse interpolation of an approximate multivariate blackbox polynomial in floatingpoint arithmetic. That is, both the inputs and outputs of the blackbox polynomial have some error, and all numbers are represented in standard, fixedprecision, floating point arithmetic. By interpolating the black box evaluated at random primitive roots of unity, we give efficient and numerically robust solutions. We note the similarity between the exact BenOr/Tiwari sparse interpolation algorithm and the classical Prony’s method for interpolating a sum of exponential functions, and exploit the generalized eigenvalue reformulation of Prony’s method. We analyze the numerical stability of our algorithms and the sensitivity of the solutions, as well as the expected conditioning achieved through randomization. Finally, we demonstrate the effectiveness of our techniques in practice through numerical experiments and applications. 1.
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
 SIAM J. COMPUT
, 2007
"... In this work we study two, seemingly unrelated, notions. Locally decodable codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of the codeword. Polynomial identity testing (PIT) is one of the fundamental problems of algebraic complexity: we are given ..."
Abstract

Cited by 30 (9 self)
 Add to MetaCart
In this work we study two, seemingly unrelated, notions. Locally decodable codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of the codeword. Polynomial identity testing (PIT) is one of the fundamental problems of algebraic complexity: we are given a circuit computing a multivariate polynomial and we have to determine whether the polynomial is identically zero. We improve known results on LDCs and on polynomial identity testing and show a relation between the two notions. In particular we obtain the following results: (1) We show that if E: F n ↦ → F m is a linear LDC with two queries, then m = exp(Ω(n)). Previously this was known only for fields of size ≪ 2 n [O. Goldreich et al., Comput. Complexity, 15 (2006), pp. 263–296]. (2) We show that from every depth 3 arithmetic circuit (ΣΠΣ circuit), C, with a bounded (constant) top fanin that computes the zero polynomial, one can construct an LDC. More formally, assume that C is minimal (no subset of the multiplication gates sums to zero) and simple (no linear function appears in all the multiplication gates). Denote by d the degree of the polynomial computed by C and by r the rank of the linear functions appearing in C. Then we can construct a linear LDC with two queries that encodes messages of length r/polylog(d) by codewords of length O(d). (3) We prove a structural theorem for ΣΠΣ circuits, with a bounded top fanin, that
Learning Functions Represented as Multiplicity Automata
, 2000
"... We study the learnability of multiplicity automata in Angluin’s exact learning model, and we investigate its applications. Our starting point is a known theorem from automata theory relating the ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
We study the learnability of multiplicity automata in Angluin’s exact learning model, and we investigate its applications. Our starting point is a known theorem from automata theory relating the
Property Testing: A Learning Theory Perspective
"... Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is linear or the graph is bipartite) and the case that it differs significantly from any such object. The task should be perfor ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is linear or the graph is bipartite) and the case that it differs significantly from any such object. The task should be performed by observing only a very small part of the object, in particular by querying the object, and the algorithm is allowed a small failure probability. One view of property testing is as a relaxation of learning the object (obtaining an approximate representation of the object). Thus property testing algorithms can serve as a preliminary step to learning. That is, they can be applied in order to select, very efficiently, what hypothesis class to use for learning. This survey takes the learningtheory point of view and focuses on results for testing properties of functions that are of interest to the learning theory community. In particular, we cover results for testing algebraic properties of functions such as linearity, testing properties defined by concise representations, such as having a small DNF representation, and more. 1
Early Termination in Sparse Interpolation Algorithms
"... A probabilistic strategy, early termination, enables di#erent interpolation algorithms to adapt to the degree or the number of terms in the target polynomial when neither is supplied in the input. In addition to dense algorithms, we implement this strategy in sparse interpolation algorithms. Based o ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
A probabilistic strategy, early termination, enables di#erent interpolation algorithms to adapt to the degree or the number of terms in the target polynomial when neither is supplied in the input. In addition to dense algorithms, we implement this strategy in sparse interpolation algorithms. Based on early termination, racing algorithms execute simultaneously a dense and a sparse algorithm. The racing algorithms can be embedded as the univariate interpolation substep within Zippel's multivariate method. In addition, we experimentally verify some heuristics of early termination, which make use of thresholds and postverification. Key words: Early termination, sparse polynomial, black box polynomial, interpolation, sparse interpolation, randomized algorithm, Chebyshev basis, Pochhammer basis, racing two algorithms, Zippel's algorithm, BenOr's and Tiwari's algorithm. Email addresses: kaltofen@math.ncsu.edu (Erich Kaltofen), ws2lee@scg.uwaterloo.ca (Wenshin Lee).