Jan 20, 2023 · The lower bound holds, even if the learner knows the distribution, can draw a sample according to the distribution in polynomial time, and can ...
Superpolynomial Lower Bounds for Learning Monotone Classes - DROPS
drops.dagstuhl.de › RANDOM.2023.34
Sep 4, 2023 · The lower bound holds, even if the learner knows the distribution, can draw a sample according to the distribution in polynomial time, and can ...
Superpolynomial Lower Bounds for Learning Monotone Classes. In various learning models, it is widely recognized that the task of learning classes of monotone ...
Jan 30, 2023 · Superpolynomial Lower Bounds for Learning Monotone Classes. Nader H ... In this paper, we give the same lower bounds for PAC-learning of the ...
Sep 11, 2023 · The lower bound holds, even if the learner knows the distribution, can draw a sample according to the distribution in polynomial time, and can ...
Mar 6, 2023 · Bibliographic details on Superpolynomial Lower Bounds for Learning Monotone Classes.
In this paper we obtain the first superpolynomial lower bounds for monotone span programs computing explicit functions. The best previ- ous lower bound was Ω(n5 ...
Missing: Learning | Show results with:Learning
Jan 20, 2023 · The lower bound holds, even if the learner knows the distribution, can draw a sample according to the distribution in polynomial time, and can ...
Abstract. Much work has been done on learning various classes of “simple” monotone functions under the uniform distribution. In this paper we give the first ...
People also ask
What are lower bounds in computational complexity?
What are lower bounds for algorithms?
Abstract. A monotone distribution P over a (partially) ordered domain has P(y) ≥ P(x) if y ≥ x in the order. We study several natural problems of testing ...