Abstract
Fitness functions of binary strings (pseudo-boolean functions) canbe represented as polynomials over a set of boolean variables. Weshow that any such function has a unique best approximation in thelinear span of any subset of polynomials. For example, there is aunique best linear approximation and a unique best quadraticapproximation. The error of an approximation here isroot-mean-squared error. If all the details of the function to beapproximated are known, then the approximation can be calculateddirectly. Of more practical importance, we give a method for usingsampling to estimate the coefficients of the approximation, anddescribe its limitations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boros E and Hammer PL (2001) Pseudo-Boolean Optimization. Technical report, Center for Discrete Mathematics and Theoretical Computer Science(DIMACS) Hammer PL (1992) Approximations of pseudo-boolean functions: Applications to game theory. ZOR. Methods and Models of Operations Research 36: 3–21
Jin Y (2003) A comprehensive survey of fitness approximation in evolutionary computation. Soft Computing Journal (in press)
Kreyszig E (1989) Introductory Functional Analysis with Applications. John Wiley and Sons Inc.
Powell MJD (1981) Approximation Theory and Methods. Cambridge University Press, UK
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, H., Rowe, J.E. Best approximations of fitness functions of binary strings. Natural Computing 3, 113–124 (2004). https://doi.org/10.1023/B:NACO.0000023418.20610.4d
Issue Date:
DOI: https://doi.org/10.1023/B:NACO.0000023418.20610.4d