Verifiable Data Science via Interactive Proofs

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=O9ialQMWNks


Duration: 0:00
38 views
0

Guy Rothblum (Apple)
https://simons.berkeley.edu/talks/guy-rothblum-apple-2024-08-06
Workshop on Local Algorithms (WoLA)



Other Videos By Simons Institute for the Theory of Computing


2024-10-02A Strong Separation for Adversarially Robust L_0 Estimation for Linear Sketches
2024-10-02Towards Practical Distribution Testing
2024-10-02Toward Optimal Semi-streaming Algorithm for (1+ε)-approximate Maximum Matching
2024-10-02Plenary Talk: Privately Evaluating Untrusted Black-Box Functions
2024-10-02The long path to \sqrt{d} monotonicity testers
2024-10-02O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set
2024-10-02Distribution Learning Meets Graph Structure Sampling
2024-10-02On the instance optimality of detecting collisions and subgraphs
2024-10-02Low Degree Testing over the Reals
2024-10-02Talk By Tal Herman
2024-10-02Verifiable Data Science via Interactive Proofs
2024-10-02Dana is NOT average
2024-10-02Monotonicity testing, routing, and a theorem of Lehman and Ron
2024-10-02Conditional Sampling for Distribution Testing
2024-09-05Challenges in Making LLMs Safe and Robust
2024-09-04Understanding and Steering Generative AI Systems
2024-08-04On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly)
2024-08-04Testing Intersectingness of Uniform Families or how Dana and I intersected
2024-08-04Recent Developments in Testing Bounded-Degree Graphs
2024-08-04Property Testing with Incomplete or Manipulated Inputs
2024-08-01Are there graphs whose shortest path structure requires large edge weights?