| TR#: | CS0907 |
| Class: | CS |
| Title: | The Query Complexity of Finding Local Minima in the Lattice |
| Authors: | Felix Geller and Eyal Kushilevitz |
| CS0907.pdf | |
| Abstract: | In this paper we study the query complexity of finding local minimum points of a Boolean function. This task occurs frequently in learning many natural classes, such as monotone DNF, $O(\log n)$-term DNF, unate DNF and decision trees, in the model of exact learning. We prove that any algorithm that produces a local minimum of a function $f$ (chosen from a sufficiently "rich" concept class), given an access to a membership oracle for $f$, must ask $\Omega(n^2)$ membership queries in the worst case. In particular, this bound is attained on the class of decision trees. A simple algorithm is known that achieves this lower bound. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1997/CS/CS0907), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1997
To the main CS technical reports page