The bucketing-code exponent inequality for the statistical nearest-neighbor problem
Statement
Let satisfy , and let satisfy
Bucketing-code exponent inequality. The following inequality should hold:
This inequality would establish that the exponent in the stated bucketing-code construction is optimal for the symmetric nearest-neighbor example. The source presents it as the single inequality reducing optimality to the direct lower bound, but gives no resolution here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.