21 citations · 45 across the 10 of their papers we have counts for
11 papers
PatchTrAD: A Patch-Based Transformer focusing on Patch-Wise Reconstruction Error for Time Series Anomaly Detection
Samy-Melwan Vilhes, Gilles Gasso, Mokhtar Z Alaya
Time series anomaly detection (TSAD) focuses on identifying whether observations in streaming data deviate significantly from normal patterns. With the prevalence of connected devi…
Adversarial Semi-Supervised Domain Adaptation for Semantic Segmentation: A New Role for Labeled Target Samples
Marwa Kechaou, Mokhtar Z. Alaya, Romain Hérault +1
Adversarial learning baselines for domain adaptation (DA) approaches in the context of semantic segmentation are under explored in semi-supervised framework. These baselines involv…
Statistical and Topological Properties of Gaussian Smoothed Sliced Probability Divergences
Alain Rakotomamonjy, Mokhtar Z. Alaya, Maxime Berar +1
Gaussian smoothed sliced Wasserstein distance has been recently introduced for comparing probability distributions, while preserving privacy on the data. It has been shown, in appl…
Open Set Domain Adaptation using Optimal Transport
Marwa Kechaou, Romain Hérault, Mokhtar Z. Alaya +1
We present a 2-step optimal transport approach that performs a mapping from a source distribution to a target distribution. Here, the target has the particularity to present new cl…
Optimal Transport for Conditional Domain Matching and Label Shift
Alain Rakotomamonjy, Rémi Flamary, Gilles Gasso +3
We address the problem of unsupervised domain adaptation under the setting of generalized target shift (joint class-conditional and label shifts). For this framework, we theoretica…
Theoretical Guarantees for Bridging Metric Measure Embedding and Optimal Transport
Mokhtar Z. Alaya, Maxime Bérar, Gilles Gasso +1
We propose a novel approach for comparing distributions whose supports do not necessarily lie on the same metric space. Unlike Gromov-Wasserstein (GW) distance which compares pairw…
Partial Optimal Transport with Applications on Positive-Unlabeled Learning
Laetitia Chapel, Mokhtar Z. Alaya, Gilles Gasso
Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be…
Screening Sinkhorn Algorithm for Regularized Optimal Transport
Mokhtar Z. Alaya, Maxime Bérar, Gilles Gasso +1
We introduce in this paper a novel strategy for efficiently approximating the Sinkhorn distance between two discrete measures. After identifying neglectable components of the dual…
Collective Matrix Completion
Mokhtar Z. Alaya, Olga Klopp
Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be…
Binarsity: a penalization for one-hot encoded features in linear supervised learning
Mokhtar Z. Alaya, Simon Bussy, Stéphane Gaïffas +1
This paper deals with the problem of large-scale linear supervised learning in settings where a large number of continuous features are available. We propose to combine the well-kn…
Learning the intensity of time events with change-points
Mokhtar Zahdi Alaya, Stéphane Gaïffas, Agathe Guilloux
We consider the problem of learning the inhomogeneous intensity of a counting process, under a sparse segmentation assumption. We introduce a weighted total-variation penalization,…