11 citations · 20 across the 7 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2024★ 4 cited
On the Power of Interactive Proofs for Learning
Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh +3
We continue the study of doubly-efficient proof systems for verifying agnostic PAC learning, for which we obtain the following results. - We construct an interactive protocol for l…
cs.CC2023
Distribution-Free Proofs of Proximity
Hugo Aaronson, Tom Gur, Ninad Rajgopal +1
Motivated by the fact that input distributions are often unknown in advance, distribution-free property testing considers a setting where the algorithmic task is to accept function…
cs.CC2019★ 4 cited
Beyond Natural Proofs: Hardness Magnification and Locality
Lijie Chen, Shuichi Hirahara, Igor C. Oliveira +3
Hardness magnification reduces major complexity separations (such as ) to proving lower bounds for some natural problem against…