6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 1-466, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@Proceedings{bun:LIPIcs.FORC.2025, title = {{LIPIcs, Volume 329, FORC 2025, Complete Volume}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {1--466}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025}, URN = {urn:nbn:de:0030-drops-232678}, doi = {10.4230/LIPIcs.FORC.2025}, annote = {Keywords: LIPIcs, Volume 329, FORC 2025, Complete Volume} }
6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bun:LIPIcs.FORC.2025.0, author = {Bun, Mark}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {0:i--0:x}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.0}, URN = {urn:nbn:de:0030-drops-232664}, doi = {10.4230/LIPIcs.FORC.2025.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Kunal Talwar. Privacy-Computation Trade-Offs in Private Repetition and Metaselection. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 1:1-1:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{talwar:LIPIcs.FORC.2025.1, author = {Talwar, Kunal}, title = {{Privacy-Computation Trade-Offs in Private Repetition and Metaselection}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {1:1--1:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.1}, URN = {urn:nbn:de:0030-drops-231282}, doi = {10.4230/LIPIcs.FORC.2025.1}, annote = {Keywords: Differential Privacy, Hyperparameter Tuning, Metaselection} }
Richard Hladík and Jakub Tětek. Smooth Sensitivity Revisited: Towards Optimality. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hladik_et_al:LIPIcs.FORC.2025.2, author = {Hlad{\'\i}k, Richard and T\v{e}tek, Jakub}, title = {{Smooth Sensitivity Revisited: Towards Optimality}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.2}, URN = {urn:nbn:de:0030-drops-231292}, doi = {10.4230/LIPIcs.FORC.2025.2}, annote = {Keywords: differential privacy, smooth sensitivity} }
Syomantak Chaudhuri and Thomas A. Courtade. Private Estimation When Data and Privacy Demands Are Correlated. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 3:1-3:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chaudhuri_et_al:LIPIcs.FORC.2025.3, author = {Chaudhuri, Syomantak and Courtade, Thomas A.}, title = {{Private Estimation When Data and Privacy Demands Are Correlated}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {3:1--3:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.3}, URN = {urn:nbn:de:0030-drops-231305}, doi = {10.4230/LIPIcs.FORC.2025.3}, annote = {Keywords: Differential Privacy, Personalized Privacy, Heterogeneous Privacy, Correlations in Privacy} }
Prathamesh Dharangutte, Jie Gao, Shang-En Huang, and Fang-Yi Yu. Hardness and Approximation Algorithms for Balanced Districting Problems. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 4:1-4:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{dharangutte_et_al:LIPIcs.FORC.2025.4, author = {Dharangutte, Prathamesh and Gao, Jie and Huang, Shang-En and Yu, Fang-Yi}, title = {{Hardness and Approximation Algorithms for Balanced Districting Problems}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {4:1--4:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.4}, URN = {urn:nbn:de:0030-drops-231310}, doi = {10.4230/LIPIcs.FORC.2025.4}, annote = {Keywords: Approximation algorithms, algorithmic fairness} }
Avrim Blum, Emily Diana, Kavya Ravichandran, and Alexander Tolbert. Pessimism Traps and Algorithmic Interventions. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{blum_et_al:LIPIcs.FORC.2025.5, author = {Blum, Avrim and Diana, Emily and Ravichandran, Kavya and Tolbert, Alexander}, title = {{Pessimism Traps and Algorithmic Interventions}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.5}, URN = {urn:nbn:de:0030-drops-231321}, doi = {10.4230/LIPIcs.FORC.2025.5}, annote = {Keywords: Pessimism trap, opinion dynamics, algorithmic interventions, subsidy, decision-making} }
Richard Hladík and Jakub Tětek. Near-Universally-Optimal Differentially Private Minimum Spanning Trees. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hladik_et_al:LIPIcs.FORC.2025.6, author = {Hlad{\'\i}k, Richard and T\v{e}tek, Jakub}, title = {{Near-Universally-Optimal Differentially Private Minimum Spanning Trees}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {6:1--6:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.6}, URN = {urn:nbn:de:0030-drops-231337}, doi = {10.4230/LIPIcs.FORC.2025.6}, annote = {Keywords: differential privacy, universal optimality, minimum spanning trees} }
Carol Xuan Long, Wael Alghamdi, Alexander Glynn, Yixuan Wu, and Flavio P. Calmon. Kernel Multiaccuracy. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 7:1-7:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{long_et_al:LIPIcs.FORC.2025.7, author = {Long, Carol Xuan and Alghamdi, Wael and Glynn, Alexander and Wu, Yixuan and Calmon, Flavio P.}, title = {{Kernel Multiaccuracy}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {7:1--7:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.7}, URN = {urn:nbn:de:0030-drops-231341}, doi = {10.4230/LIPIcs.FORC.2025.7}, annote = {Keywords: algorithmic fairness, integral probability metrics, information theory} }
Ashish Goel, Zhihao Jiang, Aleksandra Korolova, Kamesh Munagala, and Sahasrajit Sarmasarkar. Differential Privacy Under Multiple Selections. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 8:1-8:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{goel_et_al:LIPIcs.FORC.2025.8, author = {Goel, Ashish and Jiang, Zhihao and Korolova, Aleksandra and Munagala, Kamesh and Sarmasarkar, Sahasrajit}, title = {{Differential Privacy Under Multiple Selections}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {8:1--8:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.8}, URN = {urn:nbn:de:0030-drops-231353}, doi = {10.4230/LIPIcs.FORC.2025.8}, annote = {Keywords: Differential Privacy, Mechanism Design and Multi-Selection} }
Changyu Gao, Andrew Lowy, Xingyu Zhou, and Stephen J. Wright. Optimal Rates for Robust Stochastic Convex Optimization. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 9:1-9:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{gao_et_al:LIPIcs.FORC.2025.9, author = {Gao, Changyu and Lowy, Andrew and Zhou, Xingyu and Wright, Stephen J.}, title = {{Optimal Rates for Robust Stochastic Convex Optimization}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {9:1--9:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.9}, URN = {urn:nbn:de:0030-drops-231369}, doi = {10.4230/LIPIcs.FORC.2025.9}, annote = {Keywords: Adversarial Robustness, Machine Learning, Optimization Algorithms, Robust Optimization, Stochastic Convex Optimization} }
Joel Daniel Andersson, Rasmus Pagh, Teresa Anna Steiner, and Sahel Torkamani. Count on Your Elders: Laplace vs Gaussian Noise. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 10:1-10:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{andersson_et_al:LIPIcs.FORC.2025.10, author = {Andersson, Joel Daniel and Pagh, Rasmus and Steiner, Teresa Anna and Torkamani, Sahel}, title = {{Count on Your Elders: Laplace vs Gaussian Noise}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {10:1--10:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.10}, URN = {urn:nbn:de:0030-drops-231376}, doi = {10.4230/LIPIcs.FORC.2025.10}, annote = {Keywords: differential privacy, continual observation, streaming, prefix sums, trees} }
Rishav Chourasia, Uzair Javaid, and Biplab Sikdar. Laplace Transform Interpretation of Differential Privacy. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 11:1-11:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{chourasia_et_al:LIPIcs.FORC.2025.11, author = {Chourasia, Rishav and Javaid, Uzair and Sikdar, Biplab}, title = {{Laplace Transform Interpretation of Differential Privacy}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {11:1--11:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.11}, URN = {urn:nbn:de:0030-drops-231387}, doi = {10.4230/LIPIcs.FORC.2025.11}, annote = {Keywords: Differential Privacy, Composition Theorem, Laplace Transform} }
Charlie Harrison and Pasin Manurangsi. Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High ε Regime. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 12:1-12:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{harrison_et_al:LIPIcs.FORC.2025.12, author = {Harrison, Charlie and Manurangsi, Pasin}, title = {{Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High \epsilon Regime}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {12:1--12:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.12}, URN = {urn:nbn:de:0030-drops-231396}, doi = {10.4230/LIPIcs.FORC.2025.12}, annote = {Keywords: Differential Privacy, Distributed Noise Addition} }
Kristóf Madarász and Marek Pycia. Cost over Content: Information Choice in Trade (Extended Abstract). In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, p. 13:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{madarasz_et_al:LIPIcs.FORC.2025.13, author = {Madar\'{a}sz, Krist\'{o}f and Pycia, Marek}, title = {{Cost over Content: Information Choice in Trade}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {13:1--13:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.13}, URN = {urn:nbn:de:0030-drops-231409}, doi = {10.4230/LIPIcs.FORC.2025.13}, annote = {Keywords: Communication Costs, Default-based Regulation, Data Trade, Dynamic Pricing, Privacy Paradox, Signaling, Disclosure, Efficiency, Online Platforms} }
Ira Globus Harris, Varun Gupta, Michael Kearns, and Aaron Roth. Model Ensembling for Constrained Optimization. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{globusharris_et_al:LIPIcs.FORC.2025.14, author = {Globus Harris, Ira and Gupta, Varun and Kearns, Michael and Roth, Aaron}, title = {{Model Ensembling for Constrained Optimization}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.14}, URN = {urn:nbn:de:0030-drops-231412}, doi = {10.4230/LIPIcs.FORC.2025.14}, annote = {Keywords: model ensembling, trustworthy AI, decision-making under uncertainty} }
Martin Aumüller, Fabrizio Boninsegna, and Francesco Silvestri. Differentially Private High-Dimensional Approximate Range Counting, Revisited. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 15:1-15:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{aumuller_et_al:LIPIcs.FORC.2025.15, author = {Aum\"{u}ller, Martin and Boninsegna, Fabrizio and Silvestri, Francesco}, title = {{Differentially Private High-Dimensional Approximate Range Counting, Revisited}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {15:1--15:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.15}, URN = {urn:nbn:de:0030-drops-231426}, doi = {10.4230/LIPIcs.FORC.2025.15}, annote = {Keywords: Differential Privacy, Locality Sensitive Filters, Approximate Range Counting, Concominant Statistics} }
Jason Hartline, Yifan Wu, and Yunran Yang. Smooth Calibration and Decision Making. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 16:1-16:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hartline_et_al:LIPIcs.FORC.2025.16, author = {Hartline, Jason and Wu, Yifan and Yang, Yunran}, title = {{Smooth Calibration and Decision Making}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {16:1--16:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.16}, URN = {urn:nbn:de:0030-drops-231438}, doi = {10.4230/LIPIcs.FORC.2025.16}, annote = {Keywords: Calibration, calibration errors, decision making, differential privacy} }
Flavio Calmon, Elbert Du, Cynthia Dwork, Brian Finley, and Grigory Franguridi. Debiasing Functions of Private Statistics in Postprocessing. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 17:1-17:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{calmon_et_al:LIPIcs.FORC.2025.17, author = {Calmon, Flavio and Du, Elbert and Dwork, Cynthia and Finley, Brian and Franguridi, Grigory}, title = {{Debiasing Functions of Private Statistics in Postprocessing}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.17}, URN = {urn:nbn:de:0030-drops-231449}, doi = {10.4230/LIPIcs.FORC.2025.17}, annote = {Keywords: Differential privacy, deconvolution, unbiasedness} }
Yuxin Liu and M. Amin Rahimian. Differentially Private Sequential Learning (Extended Abstract). In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 18:1-18:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{liu_et_al:LIPIcs.FORC.2025.18, author = {Liu, Yuxin and Rahimian, M. Amin}, title = {{Differentially Private Sequential Learning}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {18:1--18:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.18}, URN = {urn:nbn:de:0030-drops-231450}, doi = {10.4230/LIPIcs.FORC.2025.18}, annote = {Keywords: Differential Privacy, Sequential Learning, Randomized Response, Learning Efficiency} }
Etam Benger and Katrina Ligett. Mapping the Tradeoffs and Limitations of Algorithmic Fairness. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 19:1-19:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{benger_et_al:LIPIcs.FORC.2025.19, author = {Benger, Etam and Ligett, Katrina}, title = {{Mapping the Tradeoffs and Limitations of Algorithmic Fairness}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {19:1--19:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.19}, URN = {urn:nbn:de:0030-drops-231465}, doi = {10.4230/LIPIcs.FORC.2025.19}, annote = {Keywords: Algorithmic fairness, information theory, sufficiency-separation tradeoff} }
Santhini K. A., Kamesh Munagala, Meghana Nasre, and Govind S. Sankar. Group Fairness and Multi-Criteria Optimization in School Assignment. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 20:1-20:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{k.a._et_al:LIPIcs.FORC.2025.20, author = {K. A., Santhini and Munagala, Kamesh and Nasre, Meghana and S. Sankar, Govind}, title = {{Group Fairness and Multi-Criteria Optimization in School Assignment}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {20:1--20:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.20}, URN = {urn:nbn:de:0030-drops-231471}, doi = {10.4230/LIPIcs.FORC.2025.20}, annote = {Keywords: School Assignment, Approximation Algorithms, Group Fairness} }
Jabari Hastings, Sigal Oren, and Omer Reingold. OWA for Bipartite Assignments. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 21:1-21:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hastings_et_al:LIPIcs.FORC.2025.21, author = {Hastings, Jabari and Oren, Sigal and Reingold, Omer}, title = {{OWA for Bipartite Assignments}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {21:1--21:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.21}, URN = {urn:nbn:de:0030-drops-231482}, doi = {10.4230/LIPIcs.FORC.2025.21}, annote = {Keywords: fairness, matchings, approximation algorithms} }
Aravind Gollakota, Parikshit Gopalan, Aayush Karan, Charlotte Peale, and Udi Wieder. When Does a Predictor Know Its Own Loss?. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 22:1-22:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{gollakota_et_al:LIPIcs.FORC.2025.22, author = {Gollakota, Aravind and Gopalan, Parikshit and Karan, Aayush and Peale, Charlotte and Wieder, Udi}, title = {{When Does a Predictor Know Its Own Loss?}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {22:1--22:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.22}, URN = {urn:nbn:de:0030-drops-231490}, doi = {10.4230/LIPIcs.FORC.2025.22}, annote = {Keywords: loss prediction, multicalibration, active learning, algorithmic fairness, calibration, predictive uncertainty, uncertainty estimation, machine learning theory} }
Christian Janos Lebeda and Lukas Retschmeier. The Correlated Gaussian Sparse Histogram Mechanism. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 23:1-23:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{lebeda_et_al:LIPIcs.FORC.2025.23, author = {Lebeda, Christian Janos and Retschmeier, Lukas}, title = {{The Correlated Gaussian Sparse Histogram Mechanism}}, booktitle = {6th Symposium on Foundations of Responsible Computing (FORC 2025)}, pages = {23:1--23:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-367-6}, ISSN = {1868-8969}, year = {2025}, volume = {329}, editor = {Bun, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.23}, URN = {urn:nbn:de:0030-drops-231503}, doi = {10.4230/LIPIcs.FORC.2025.23}, annote = {Keywords: differential privacy, correlated noise, sparse gaussian histograms} }
Feedback for Dagstuhl Publishing