no code implementations • 10 Oct 2020 • Kiarash Mohammadi, Amir-Hossein Karimi, Gilles Barthe, Isabel Valera
Counterfactual explanations (CFE) are being widely used to explain algorithmic decisions, especially in consequential decision-making contexts (e. g., loan approval or pretrial bail).
no code implementations • 8 Oct 2020 • Amir-Hossein Karimi, Gilles Barthe, Bernhard Schölkopf, Isabel Valera
Machine learning is increasingly used to inform decision-making in sensitive situations where decisions have consequential effects on individuals' lives.
no code implementations • NeurIPS 2019 • Borja Balle, Gilles Barthe, Marco Gaboardi, Joseph Geumlek
A fundamental result in differential privacy states that the privacy guarantees of a mechanism are preserved by any post-processing of its output.
1 code implementation • 27 May 2019 • Amir-Hossein Karimi, Gilles Barthe, Borja Balle, Isabel Valera
Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval.
no code implementations • 24 May 2019 • Borja Balle, Gilles Barthe, Marco Gaboardi, Justin Hsu, Tetsuya Sato
These conditions are useful to analyze the distinguishability power of divergences and we use them to study the hypothesis testing interpretation of some relaxations of differential privacy based on Renyi divergence.
no code implementations • NeurIPS 2018 • Borja Balle, Gilles Barthe, Marco Gaboardi
Differential privacy comes equipped with multiple analytical tools for the design of private data analyses.
no code implementations • 15 Mar 2017 • Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, Pierre-Yves Strub
Relational program verification can be used for reasoning about a broad range of properties, including equivalence and refinement, and specialized notions such as continuity, information flow security or relative cost.
Programming Languages
1 code implementation • 13 Feb 2015 • Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, Pierre-Yves Strub
To address both concerns, we explore techniques from computer-aided verification to construct formal proofs of incentive properties.
Computer Science and Game Theory Logic in Computer Science
1 code implementation • 25 Jul 2014 • Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, Pierre-Yves Strub
Unlike typical programmatic properties, it is not sufficient for algorithms to merely satisfy the property---incentive properties are only useful if the strategic agents also believe this fact.
Programming Languages Computer Science and Game Theory