Indistinguishable predictions and multi-group fair learning

DOI10.1007/978-3-031-30545-0_1OpenAlexW4365935196MaRDI QIDQ6138076FDOQ6138076

Guy N. Rothblum

Publication date: 16 January 2024

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_1

zbMATH Keywords

computational indistinguishabilityprediction algorithmsoutcome indistinguishability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• The Well-Calibrated Bayesian
• Fairness through awareness
• Title not available (Why is that?)
• Computational Complexity
• Asymptotic calibration
• Toward efficient agnostic learning
• Foundations of Cryptography
• Title not available (Why is that?)
• The reproducible properties of correct forecasts
• Pseudorandomness
• Calibration with Many Checking Rules
• An easier way to calibrate.
• The Complexity of Forecast Testing
• On individual risk
• Title not available (Why is that?)
• Advancing subgroup fairness via sleeping experts
• Outcome indistinguishability
• Can theories be tested?

This page was built for publication: Indistinguishable predictions and multi-group fair learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138076)