towards lower bounds for efficient robust estimation from worst case assumptions
Published Streamed 3 years ago • 452 plays • Length 30:51Download video MP4
Download video MP3
Similar videos
-
19:14
algorithms and lower bounds for comparator circuits from shrinkage
-
53:31
lower bounds on statistical estimation rates under various constraints (continued)
-
1:07:50
lower bounds on statistical estimation rates under various constraints
-
34:24
the pathset approach to formula lower bounds
-
24:25
sample complexity bounds for realizable multicalibration
-
22:25
efficient algorithms for certifying lower bounds on the discrepancy of random matrices
-
30:34
average-case hardness of np and ph from worst-case fine-grained assumptions
-
47:35
unprovability of strong complexity lower bounds in bounded arithmetic
-
34:41
superlinear lower bounds for multipass graph processing
-
47:41
higher lower bounds from the 3sum conjecture
-
53:22
designing robust learners
-
37:10
towards “one-shot” privacy auditing and estimation
-
31:17
realizing robustness
-
47:56
provable robustness beyond bound propagation
-
14:41
learning versus proofs of complexity lower boundes
-
27:15
connections between multicalibration and doubly robust estimation