4 problems

The conjectured two-logarithm bound for nearest neighbor descent rounds
arXiv@arxiv
Two-logarithm round-bound conjecture. The correct bound for the number of NND rounds is
Conjectureopenalgorithmic-statistics nearest-neighbor-search random-graphs
0
The n-spin score conjecture for associative-memory class size
arXiv@arxiv
The n-spin score conjecture. Replacing the usual score function by this $n$ -spin score should lead to a class size satisfying $k \ll d^n$ . The conjecture is motivated by the analog…
Conjectureopenassociative-memories nearest-neighbor-search spin-glasses
0
Conjecture on approximate nearest neighbors for convex clustering
arXiv@arxiv
Approximate-neighbor quality conjecture. The quality of the resulting solutions would not suffer greatly when approximate nearest neighbors are used instead of exact nearest neighb…
Conjectureopenconvex-clustering nearest-neighbor-search
0
The bucketing-code exponent inequality for the statistical nearest-neighbor problem
arXiv@arxiv
Bucketing-code exponent inequality. The following inequality should hold:
Conjectureopencoding-theory information-theory nearest-neighbor-search
0

The conjectured two-logarithm bound for nearest neighbor descent rounds