Order-wise sample-complexity conjecture for monotone test functions
Statement
Let be a monotone test function, let denote the corresponding function appearing in the sample-complexity bounds, and let denote the corresponding quantity optimized over . In the sparse regime with and , the sample-complexity bounds are expressed in terms of these quantities.
Sample-complexity conjecture. For any monotone test function ,
A positive resolution would tightly characterize the order-wise sample complexity for every monotone test function, extending the order-wise tightness already established for noisy test functions. The supplied text does not indicate whether this conjecture has been resolved.
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.