Gap-entropy conjecture
Statement
Let independent arms have distributions , with and a unique optimal arm . Write for , , and, for each integer , let . Define . The gap-entropy conjecture asserts that the optimal expected sample complexity of any algorithm that identifies with probability at least on every such instance is, up to universal constant factors and the unavoidable closest-gap term, ; equivalently, the instance-dependent lower and upper bounds should match at this order.
Record
- Added
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.