output
20152025
most citedFeature relevance quantification in explainable AI: A causal problem

156 citations

Showing 2020 · cs.LGShow all

18 papers · 2 filters

cs.LG20205 cited

Pareto-efficient Acquisition Functions for Cost-Aware Bayesian Optimization

Gauthier Guinet, Valerio Perrone, Cédric Archambeau

Bayesian optimization (BO) is a popular method to optimize expensive black-box functions. It efficiently tunes machine learning algorithms under the implicit assumption that hyperp…

cs.LG20203 cited

Differentially Private Adversarial Robustness Through Randomized Perturbations

Nan Xu, Oluwaseyi Feyisetan, Abhinav Aggarwal +2

Deep Neural Networks, despite their great success in diverse domains, are provably sensitive to small perturbations on correctly classified examples and lead to erroneous predictio…

cs.LG20201 cited

On Primes, Log-Loss Scores and (No) Privacy

Abhinav Aggarwal, Zekun Xu, Oluwaseyi Feyisetan +1

Membership Inference Attacks exploit the vulnerabilities of exposing models trained on customer data to queries by an adversary. In a recently proposed implementation of an auditin…

cs.LG20206 cited

Predicting Training Time Without Training

Luca Zancato, Alessandro Achille, Avinash Ravichandran +2

We tackle the problem of predicting the number of optimization steps that a pre-trained deep network needs to converge to a given value of the loss function. To do so, we leverage…

cs.LG2020

Tomographic Auto-Encoder: Unsupervised Bayesian Recovery of Corrupted Data

Francesco Tonolini, Pablo G. Moreno, Andreas Damianou +1

We propose a new probabilistic method for unsupervised recovery of corrupted data. Given a large ensemble of degraded samples, our method recovers accurate posteriors of clean valu…

cs.LG20203 cited

DDPG++: Striving for Simplicity in Continuous-control Off-Policy Reinforcement Learning

Rasool Fakoor, Pratik Chaudhari, Alexander J. Smola

This paper prescribes a suite of techniques for off-policy Reinforcement Learning (RL) that simplify the training process and reduce the sample complexity. First, we show that simp…