~/talk

Talk by Katrina Ligett (Hebrew University of Jerusalem)

links:none on file
slides:none on file

Presents two concrete TCS approaches: a principal–agent model where an agent holds a cost-correlated signal X that the principal neither models nor knows, proves agents prefer revealing features that separate high-cost cases and prefer concealing low-cost cases, and shows simple garbling gives Pareto improvement (agents sometimes share noisy signals, benefiting both sides). The second gives a full characterization of one-run auditing for differential privacy, proves it fails on name-and-shame / all-or-nothing / XOR style algorithms, and shows adaptive guessing strengthens the audit bounds.

AI-written summary · about

  1. 0:00Avrim Blum's impact and career
  2. 1:51Black boxes in ML and TCS reliability
  3. 3:18Delegation as principal-agent problem
  4. 6:27Regulator's unknown unknowns challenge
  5. 8:34Courier payment and agent incentives
  6. 10:39Formalizing unknown unknowns
  7. 13:52Agent metrics: reveal or conceal
  8. 16:41Garbling signals for mutual benefit
  9. 19:58Auditing black boxes in sensitive systems
  10. 22:13Differential privacy and loss
  11. 24:40Privacy auditing: purpose and methods
  12. 26:30One-run auditing for efficiency
  13. 28:16Limitations of one-run auditing
  14. 31:08Strengthening auditing with adaptive guessing
  15. 32:32TCS for trustworthy ML systems
  16. 33:58Q&A on delegation and incentives
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.