Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Randomized algorithms
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
An optimal procedure for gap closing in whole genome shotgun sequencing
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Gene Expression and Fast Construction of Distributed Evolutionary Representation
Evolutionary Computation
Linkage Problem, Distribution Estimation, and Bayesian Networks
Evolutionary Computation
Efficient Linkage Discovery by Limited Probing
Evolutionary Computation
gLINC: identifying composability using group perturbation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
The Journal of Machine Learning Research
Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions
The Journal of Machine Learning Research
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Evolutionary Computation
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
Optimal query complexity bounds for finding graphs
Artificial Intelligence
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Combinatorial search on graphs motivated by bioinformatics applications: a brief survey
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A k-bounded pseudo-Boolean function is a real-valued function on {0,1}^n that can be expressed as a sum of functions depending on at most k input bits. The k-bounded functions play an important role in a number of areas including molecular biology, biophysics, and evolutionary computation. We consider the problem of finding the Fourier coefficients of k-bounded functions, or equivalently, finding the coefficients of multilinear polynomials on {-1,1}^n of degree k or less. Given a k-bounded function f with m non-zero Fourier coefficients for constant k, we present a randomized algorithm to find the Fourier coefficients of f with high probability in O(mlogn) function evaluations. The best known upper bound was O(@l(n,m)mlogn), where @l(n,m) is between n^1^2 and n depending on m. Our bound improves the previous bound by a factor of @W(n^1^2). It is almost tight with respect to the lower bound @W(mlognlogm). In the process, we also consider the problem of finding k-bounded hypergraphs with a certain type of queries under an oracle with one-sided error. The problem is of self interest and we give an optimal algorithm for the problem.