← Search

Olivier Teboul

6 accepted papers

2022

Learning Strides in Convolutional Neural Networks

ICLR 2022oral

Convolutional neural networks typically contain several downsampling operators, such as strided convolutions or pooling layers, that progressively reduce the resolution of intermediate representations. This provides some shift-invariance while reducing the computational complexity of the whole archi…

2021

LEAF: A Learnable Frontend for Audio Classification

ICLR 2021poster

Mel-filterbanks are fixed, engineered audio features which emulate human perception and have been used through the history of audio understanding up to today. However, their undeniable qualities are counterbalanced by the fundamental limitations of handmade representations. In this work we show that…

2020

Fast Differentiable Sorting and Ranking

ICML 2020poster

The sorting operation is one of the most commonly used building blocks in computer programming. In machine learning, it is often used for robust statistics. However, seen as a function, it is piecewise linear and as a result includes many kinks where it is non-differentiable. More problematic is the…

2020

Learning with Differentiable Pertubed Optimizers

NeurIPS 2020poster

Machine learning pipelines often rely on optimizers procedures to make discrete decisions (e.g., sorting, picking closest neighbors, or shortest paths). Although these discrete decisions are easily computed in a forward manner, they break the back-propagation of computational graphs. In order to exp…

Cited by 309SourcePDFScholar
2020

Supervised Quantile Normalization for Low Rank Matrix Factorization

ICML 2020poster

Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a matrix factorization step is usually preceded by ad-hoc feature…

Cited by 14SourcePDFScholar
2019

Differentiable Ranking and Sorting using Optimal Transport

NeurIPS 2019spotlight

Sorting is used pervasively in machine learning, either to define elementary algorithms, such as $k$-nearest neighbors ($k$-NN) rules, or to define test-time metrics, such as top-$k$ classification accuracy or ranking losses. Sorting is however a poor match for the end-to-end, automatically differen…