566 citations · 2.5k across the 42 of their papers we have counts for
6 papers · 1 filter
Measuring and signing fairness as performance under multiple stakeholder distributions
David Lopez-Paz, Diane Bouchacourt, Levent Sagun +1
As learning machines increase their influence on decisions concerning human lives, analyzing their fairness properties becomes a subject of central importance. Yet, our best tools…
Tensor Decompositions for temporal knowledge base completion
Timothée Lacroix, Guillaume Obozinski, Nicolas Usunier
Most algorithms for representation learning and link prediction in relational data have been designed for static data. However, the data they are applied to usually evolves with ti…
A Simple Convergence Proof of Adam and Adagrad
Alexandre Défossez, Léon Bottou, Francis Bach +1
We provide a simple proof of convergence covering both the Adam and Adagrad adaptive optimization algorithms when applied to smooth (possibly non-convex) objective functions with b…
Canonical Tensor Decomposition for Knowledge Base Completion
Timothée Lacroix, Nicolas Usunier, Guillaume Obozinski
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) see…
Parseval Networks: Improving Robustness to Adversarial Examples
Moustapha Cisse, Piotr Bojanowski, Edouard Grave +2
We introduce Parseval networks, a form of deep neural networks in which the Lipschitz constant of linear, convolutional and aggregation layers is constrained to be smaller than 1.…
An Empirical Comparison of V-fold Penalisation and Cross Validation for Model Selection in Distribution-Free Regression
Charanpal Dhanjal, Nicolas Baskiotis, Stéphan Clémençon +1
Model selection is a crucial issue in machine-learning and a wide variety of penalisation methods (with possibly data dependent complexity penalties) have recently been introduced…