Guy N. Rothblum
where else to find them
what they talk about
all 5 in the filters
where they keep going back
- ITCS3 editions2021–2023
all 5 in the filters
on a stage with
- Gal Yona2×
- Amir Yehudayoffonce
- Gili Karnionce
all 8 in the filters
who talks about the same things
- Gal Yona4 talks
- Oded Goldreich4 talks
- Dor Minzer8 talks
- Yuval Filmus9 talks
- Mark Braverman5 talks
- Guy Kindler4 talks
| title | conference | date |
|---|---|---|
| Verifiable Data Science via Interactive Proofs | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Work describes concrete interactive‑proof systems that let a lightweight verifier check statistical claims using far fewer samples than re‑running the… | ||
| Constant-Round Arguments from One-Way Functions | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Assumes only one-way functions and constructs a constant-round doubly-efficient argument for any language with log-space-uniform, polynomial-size circuits of… | ||
| Decision Making under Miscalibration | ITCS 2023 | 2023-01-10 |
Defines a minimax threshold ĵ that minimizes worst-case regret under a bounded miscalibration α and shows closed-form answers for both expected and max… | ||
| On Interactive Proofs of Proximity with Proof-Oblivious Queries | ITCS 2023 | 2023-01-10 |
Authors Oded Goldreich, Guy N. Rothblum and Tal Skverer show a concrete exponential separation between property testing and interactive proofs of proximity… | ||
| A Multi-Group Approach To Algorithmic Fairness | Algorithmic Aspects of Causal Inference 2022 | 2022-03-18 |
Claims that multi-calibration yields predictors that are calibrated simultaneously over very rich, even exponential, families of overlapping subgroups and that… | ||
| Sample-based Proofs of Proximity | ITCS 2022 | 2022-01-31 |
Shows how query-based interactive proofs of proximity convert to sample-based ones with only Q samples and about Q + C communication, using k‑wise independent… | ||
| On Fairness and Stability in Two-Sided Matchings | ITCS 2022 | 2022-01-31 |
Shows that sampling fair hospital orders and running Gale Shapley fails via a 3x3 counterexample where two doctors in one cluster get systematically worse… | ||
| Interactive Proofs for Verifying Machine Learning | ITCS 2021 | 2021-01-06 |
Defines PAC verification (verifier with sample access plus an interactive prover) and gives concrete separations: realizable thresholds admit order 1/ε… | ||
| A Multi-Group Perspective on Fairness | Recent Developments in Research on Fairness 2019 | 2019-07-08 |
Claims that multi calibration guarantees exist for any class C and that small, efficient predictors can be learned from labeled outcomes; algorithm starts with… | ||
| nothing matches | ||