Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LEARNABILITY, STRONG CONCEPT CLASSES, BLACK-BOX REDUCTIONS:
Reports tagged with Learnability, strong concept classes, black-box reductions:
TR21-173 | 5th December 2021
Ninad Rajgopal, Rahul Santhanam

On the Structure of Learnability beyond P/poly

Motivated by the goal of showing stronger structural results about the complexity of learning, we study the learnability of strong concept classes beyond P/poly, such as PSPACE/poly and EXP/poly. We show the following:

1. (Unconditional Lower Bounds for Learning) Building on [KKO13], we prove unconditionally that BPE/poly cannot be weakly ... more >>>




ISSN 1433-8092 | Imprint