Portrait de Pablo Piantanida

Pablo Piantanida

Membre académique associé
Professeur titulaire, Université Paris-Saclay
Directeur, Laboratoire international sur les systèmes d'apprentissage (ILLS), McGill University
Professeur associé, École de technologie supérieure (ETS), Département de génie des systèmes
Sujets de recherche
Sécurité de l'IA
Théorie de l'apprentissage automatique
Théorie de l'information
Traitement du langage naturel

Biographie

Je suis professeur au CentraleSupélec de l'Université Paris-Saclay avec le Centre national français de la recherche scientifique (CNRS), et directeur du Laboratoire international sur les systèmes d'apprentissage (ILLS) qui regroupe l'Université McGill, l'École de technologie supérieure (ÉTS), Mila - Institut québécois d'intelligence artificielle, le Centre national français de la recherche scientifique (CNRS), l'Université Paris-Saclay et l'École CentraleSupélec.

Mes recherches portent sur l'application de techniques statistiques et de théorie de l'information avancées au domaine de l'apprentissage automatique. Je m'intéresse au développement de techniques rigoureuses basées sur des mesures et des concepts d'information pour construire des systèmes d'IA sûrs et fiables et établir la confiance dans leur comportement et leur robustesse, sécurisant ainsi leur utilisation dans la société. Mes principaux domaines d'expertise sont la théorie de l'information, la géométrie de l'information, la théorie de l'apprentissage, la protection de la vie privée, l'équité, avec des applications à la vision par ordinateur et au traitement du langage naturel.

J'ai fait mes études de premier cycle à l'université de Buenos Aires et j'ai poursuivi des études supérieures en mathématiques appliquées à l'université Paris-Saclay en France. Tout au long de ma carrière, j'ai également occupé des postes d'invité à l'INRIA, à l'Université de Montréal et à l'École de technologie supérieure (ÉTS), entre autres.

Mes recherches antérieures ont porté sur les domaines de la théorie de l'information au-delà de la compression distribuée, de la décision statistique, du codage universel des sources, de la coopération, de la rétroaction, du codage d'index, de la génération de clés, de la sécurité et de la protection des données.

Je donne des cours sur l'apprentissage automatique, la théorie de l'information et l'apprentissage profond, couvrant des sujets tels que la théorie de l'apprentissage statistique, les mesures de l'information, les principes statistiques des réseaux neuronaux.

Étudiants actuels

Doctorat - McGill
Superviseur⋅e principal⋅e :
Doctorat - McGill
Superviseur⋅e principal⋅e :
Doctorat - École de technologie suprérieure
Postdoctorat - École de technologie suprérieure
Co-superviseur⋅e :
Doctorat - Université Paris-Saclay
Doctorat - McGill
Superviseur⋅e principal⋅e :
Doctorat - Université Paris Dauphine-PSL
Maîtrise recherche - École de technologie suprérieure
Co-superviseur⋅e :
Collaborateur·rice de recherche - Sorbonne Université

Publications

Transductive Learning for Textual Few-Shot Classification in API-based Embedding Models
Pierre Colombo
Victor Pellegrain
Malik Boudiaf
Victor Storchan
Myriam Tami
Ismail Ben Ayed
C'eline Hudelot
Proprietary and closed APIs are becoming increasingly common to process natural language, and are impacting the practical applications of na… (voir plus)tural language processing, including few-shot classification. Few-shot classification involves training a model to perform a new classification task with a handful of labeled data. This paper presents three contributions. First, we introduce a scenario where the embedding of a pre-trained model is served through a gated API with compute-cost and data-privacy constraints. Second, we propose a transductive inference, a learning paradigm that has been overlooked by the NLP community. Transductive inference, unlike traditional inductive learning, leverages the statistics of unlabeled data. We also introduce a new parameter-free transductive regularizer based on the Fisher-Rao loss, which can be used on top of the gated API embeddings. This method fully utilizes unlabeled data, does not share any label with the third-party API provider and could serve as a baseline for future research. Third, we propose an improved experimental setting and compile a benchmark of eight datasets involving multiclass classification in four different languages, with up to 151 classes. We evaluate our methods using eight backbone models, along with an episodic evaluation over 1,000 episodes, which demonstrate the superiority of transductive inference over the standard inductive setting.
A Novel Information-Theoretic Objective to Disentangle Representations for Fair Classification
Pierre Colombo
Nathan Noiry
Guillaume Staerman
Fundamental Limits of Membership Inference Attacks on Machine Learning Models
Elisabeth Gassiat
Membership inference attacks (MIA) can reveal whether a particular data point was part of the training dataset, potentially exposing sensiti… (voir plus)ve information about individuals. This article provides theoretical guarantees by exploring the fundamental statistical limitations associated with MIAs on machine learning models. More precisely, we first derive the statistical quantity that governs the effectiveness and success of such attacks. We then deduce that in a very general regression setting with overfitting algorithms, attacks may have a high probability of success. Finally, we investigate several situations for which we provide bounds on this quantity of interest. Our results enable us to deduce the accuracy of potential attacks based on the number of samples and other structural parameters of learning models. In certain instances, these parameters can be directly estimated from the dataset.
RainProof: An Umbrella to Shield Text Generator from Out-Of-Distribution Data
Implementing effective control mechanisms to ensure the proper functioning and security of deployed NLP models, from translation to chatbots… (voir plus), is essential. A key ingredient to ensure safe system behaviour is Out-Of-Distribution (OOD) detection, which aims to detect whether an input sample is statistically far from the training distribution. Although OOD detection is a widely covered topic in classification tasks, most methods rely on hidden features output by the encoder. In this work, we focus on leveraging soft-probabilities in a black-box framework, i.e. we can access the soft-predictions but not the internal states of the model. Our contributions include: (i) RAINPROOF a Relative informAItioN Projection OOD detection framework; and (ii) a more operational evaluation setting for OOD detection. Surprisingly, we find that OOD detection is not necessarily aligned with task-specific measures. The OOD detector may filter out samples well processed by the model and keep samples that are not, leading to weaker performance. Our results show that RAINPROOF provides OOD detection methods more aligned with task-specific performance metrics than traditional OOD detectors.
Optimal Transport for Unsupervised Hallucination Detection in Neural Machine Translation
Nuno M. Guerreiro
Pierre Colombo
André Martins
Neural machine translation (NMT) has become the de-facto standard in real-world machine translation applications. However, NMT models can un… (voir plus)predictably produce severely pathological translations, known as hallucinations, that seriously undermine user trust. It becomes thus crucial to implement effective preventive strategies to guarantee their proper functioning. In this paper, we address the problem of hallucination detection in NMT by following a simple intuition: as hallucinations are detached from the source content, they exhibit encoder-decoder attention patterns that are statistically different from those of good quality translations. We frame this problem with an optimal transport formulation and propose a fully unsupervised, plug-in detector that can be used with any attention-based NMT model. Experimental results show that our detector not only outperforms all previous model-based detectors, but is also competitive with detectors that employ external models trained on millions of samples for related tasks such as quality estimation and cross-lingual sentence similarity.
Open-Set Likelihood Maximization for Few-Shot Learning
Malik Boudiaf
Etienne Bennequin
Myriam Tami
Antoine Toubhans
Celine Hudelot
Ismail Ben Ayed
We tackle the Few-Shot Open-Set Recognition (FSOSR) problem, i.e. classifying instances among a set of classes for which we only have a few … (voir plus)labeled samples, while simultaneously detecting instances that do not belong to any known class. We explore the popular transductive setting, which leverages the unlabelled query instances at inference. Motivated by the observation that existing transductive methods perform poorly in open-set scenarios, we propose a generalization of the maximum likelihood principle, in which latent scores down-weighing the influence of potential outliers are introduced alongside the usual parametric model. Our formulation embeds supervision constraints from the support set and additional penalties discouraging overconfident predictions on the query set. We proceed with a block-coordinate descent, with the latent scores and parametric model co-optimized alternately, thereby benefiting from each other. We call our resulting formulation Open-Set Likelihood Optimization (OSLO). OSLO is interpretable and fully modular; it can be applied on top of any pre-trained model seamlessly. Through extensive experiments, we show that our method surpasses existing inductive and transductive methods on both aspects of open-set recognition, namely inlier classification and outlier detection. Code is available at https://github.com/ebennequin/few-shot-open-set.
A Functional Data Perspective and Baseline On Multi-Layer Out-of-Distribution Detection
Eduardo Dadalto Câmara Gomes
Pierre Colombo
Guillaume Staerman
Nathan Noiry
A Halfspace-Mass Depth-Based Method for Adversarial Attack Detection
Marine Picot
Federica Granese
Guillaume Staerman
Marco Romanelli
Francisco Messina
Pierre Colombo
Unsupervised Layer-wise Score Aggregation for Textual OOD Detection
Guillaume Staerman
Eduardo DC Gomez
Jackie CK Cheung
Pierre Colombo
Out-of-distribution (OOD) detection is a rapidly growing field due to new robustness and security requirements driven by an increased number… (voir plus) of AI-based systems. Existing OOD textual detectors often rely on an anomaly score (e.g., Mahalanobis distance) computed on the embedding output of the last layer of the encoder. In this work, we observe that OOD detection performance varies greatly depending on the task and layer output. More importantly, we show that the usual choice (the last layer) is rarely the best one for OOD detection and that far better results could be achieved if the best layer were picked. To leverage this observation, we propose a data-driven, unsupervised method to combine layer-wise anomaly scores. In addition, we extend classical textual OOD benchmarks by including classification tasks with a greater number of classes (up to 77), which reflects more realistic settings. On this augmented benchmark, we show that the proposed post-aggregation methods achieve robust and consistent results while removing manual feature selection altogether. Their performance achieves near oracle's best layer performance.
A Minimax Approach Against Multi-Armed Adversarial Attacks Detection
Federica Granese
Marco Romanelli
Siddharth Garg
On the (Im)Possibility of Estimating Various Notions of Differential Privacy (short paper)
Daniele Gorla
Louis Jalouzot
Federica Granese
Catuscia Palamidessi
We analyze to what extent final users can infer information about the level of protection of their data when the data obfuscation mechanism … (voir plus)is a priori unknown to them (the so-called “black-box" scenario). In particular, we delve into the investigation of two notions of local differential privacy (LDP), namely 𝜀 -LDP and Rényi LDP. On one hand, we prove that, without any assumption on the underlying distributions, it is not possible to have an algorithm able to infer the level of data protection with provable guarantees. On the other hand, we demonstrate that, under reasonable assumptions (namely, Lipschitzness of the involved densities on a closed interval), such guarantees exist and can be achieved by a simple histogram-based estimator.
Beyond Mahalanobis-Based Scores for Textual OOD Detection
Pierre Colombo
Eduardo D. C. Gomes
Guillaume Staerman
Nathan Noiry