Mokhtar Z. Alaya

Orcid: 0000-0002-1103-6944

According to our database1, Mokhtar Z. Alaya authored at least 20 papers between 2015 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Bounds in Wasserstein distance for locally stationary functional time series.
Comput. Stat., April, 2026

2025
Sparsified-Learning for Heavy-Tailed Locally Stationary Processes.
CoRR, April, 2025

Adversarial Semi-supervised domain adaptation for semantic segmentation: A new role for labeled target samples.
Comput. Vis. Image Underst., 2025

PatchTrAD: A Patch-Based Transformer Focusing on Patch-Wise Reconstruction Error for Time Series Anomaly Detection.
Proceedings of the 33rd European Signal Processing Conference, 2025

2024
Gaussian-Smoothed Sliced Probability Divergences.
Trans. Mach. Learn. Res., 2024

2022
Theoretical guarantees for bridging metric measure embedding and optimal transport.
Neurocomputing, 2022

2021
POT: Python Optimal Transport.
J. Mach. Learn. Res., 2021

Statistical and Topological Properties of Gaussian Smoothed Sliced Probability Divergences.
CoRR, 2021

Distributional Sliced Embedding Discrepancy for Incomparable Distributions.
CoRR, 2021

2020
Match and Reweight Strategy for Generalized Target Shift.
CoRR, 2020

Non-Aligned Distribution Distance using Metric Measure Embedding and Optimal Transport.
CoRR, 2020

Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning.
CoRR, 2020

Open Set Domain Adaptation Using Optimal Transport.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Partial Optimal Tranport with applications on Positive-Unlabeled Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Collective Matrix Completion.
J. Mach. Learn. Res., 2019

Binarsity: a penalization for one-hot encoded features in linear supervised learning.
J. Mach. Learn. Res., 2019

Screening Sinkhorn Algorithm for Regularized Optimal Transport.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Binacox: automatic cut-points detection in high-dimensional Cox model, with applications to genetic data.
CoRR, 2018

2016
Segmentation of Counting Processes and Dynamical Models. (Segmentation de Processus de Comptage et Modèles Dynamiques).
PhD thesis, 2016

2015
Learning the Intensity of Time Events With Change-Points.
IEEE Trans. Inf. Theory, 2015


  Loading...