Search Results for author: Gilles Barthe

Found 9 papers, 3 papers with code

Scaling Guarantees for Nearest Counterfactual Explanations

no code implementations10 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).

counterfactual Decision Making

A survey of algorithmic recourse: definitions, formulations, solutions, and prospects

no code implementations8 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.

Decision Making Fairness

Privacy Amplification by Mixing and Diffusion Mechanisms

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.

Model-Agnostic Counterfactual Explanations for Consequential Decisions

1 code implementation27 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.

counterfactual Decision Making

Hypothesis Testing Interpretations and Renyi Differential Privacy

no code implementations24 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.

Two-sample testing

Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences

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.

A Relational Logic for Higher-Order Programs

no code implementations15 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

Computer-aided verification in mechanism design

1 code implementation13 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

Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy

1 code implementation25 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

Cannot find the paper you are looking for? You can Submit a new open access paper.