Lower and upper bounds for linkage discovery

Lower and upper bounds for linkage discovery

For a real-valued function f defined on {0,1}n , the linkage graph of f is a hypergraph that represents the interactions among the input variables with respect to f . In this paper, lower and upper bounds for the number of function evaluations required to discover the linkage graph are rigorously an...

Full description

Bibliographic Details
Main Authors: Choi, Sung-Soon, Jung, Kyomin, Moon, Byung-Ro
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2010
Subjects:
lower and upper bounds
linkage graph
linkage discovery
complexity analysis
Walsh analysis
black box scenario
Online Access:http://hdl.handle.net/1721.1/52340

Internet

http://hdl.handle.net/1721.1/52340

Similar Items