Nearest-neighbor optimality for the general one-dimensional classification setting
Let , , and be three points on the real line, where and are generated independently from two distinct distributions and is generated from their 50--50 mixture. The hypotheses and nearest-neighbor rule are those of Theorem 1 in the paper. Nearest-neighbor optimality conjecture. Under these hypotheses, the optimal rule for deciding whether came from the same distribution as or is the nearest-neighbor rule. The question is left open after the paper proves that the rule is better than chance in the stated setting but does not prove its optimality.
References
- Kevin Bleakley, “Extreme change-point detection”, arXiv:2403.19237 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.