Specifying a positive threshold function via extremal points
Vadim Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai, Yu. Zolotykh

TL;DR
This paper investigates the minimal sets of points needed to specify positive threshold Boolean functions, disproving a conjecture by showing non-nested functions can also have minimal specification sets of size n+1.
Contribution
It demonstrates that non-nested threshold functions can have a specification number of n+1, and characterizes when extremal points precisely determine the function.
Findings
Non-nested threshold functions with n+1 specification points exist.
The set of extremal points characterizes nested functions uniquely.
A structural understanding of extremal points is provided.
Abstract
An extremal point of a positive threshold Boolean function is either a maximal zero or a minimal one. It is known that if depends on all its variables, then the set of its extremal points completely specifies within the universe of threshold functions. However, in some cases, can be specified by a smaller set. The minimum number of points in such a set is the specification number of . It was shown in [S.-T. Hu. Threshold Logic, 1965] that the specification number of a threshold function of variables is at least . In [M. Anthony, G. Brightwell, and J. Shawe-Taylor. On specifying Boolean functions by labelled examples. Discrete Applied Mathematics, 1995] it was proved that this bound is attained for nested functions and conjectured that for all other threshold functions the specification number is strictly greater than . In the present paper, we resolve…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Complexity and Algorithms in Graphs · Optimization and Search Problems
