Amaury Habrard

dblp:22/2297 · DBLP profile ↗
← Back
22ranked-venue papers in the field
3as first author
6since 2021 · last 2025
0000-0003-3038-9347ORCID · corroborated

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 22 (3 first)
YearPublicationVenuePosition
2025 Provably Accurate Adaptive Sampling for Collocation Points in Physics-Informed Neural Networks
Antoine Caradot, Rémi Emonet, Amaury Habrard, Abdel-Rahim Mezidi, Marc Sebban
ECML/PKDD (5)3
2025 Contextual Hypernetwork for Adaptive Prediction of Laser-Induced Colors on Quasi-random Plasmonic Metasurfaces
Thibault Girardin, Nathalie Destouches, Amaury Habrard
ECML/PKDD (8)3
2024 Approximation Error of Sobolev Regular Functions with Tanh Neural Networks: Theoretical Impact on PINNs
Benjamin Girault, Rémi Emonet, Amaury Habrard, Jordan Patracone, Marc Sebban
ECML/PKDD (4)3
2024 A Theoretically Grounded Extension of Universal Attacks from the Attacker's Viewpoint
Jordan Patracone, Paul Viallard, Emilie Morvant, Gilles Gasso, Amaury Habrard, Stéphane Canu
ECML/PKDD (4)5
2023 Is My Neural Net Driven by the MDL Principle?
Eduardo Brandao, Stefan Duffner, Rémi Emonet, Amaury Habrard, François Jacquenet, Marc Sebban
ECML/PKDD (2)4
2021 Self-bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound
Paul Viallard, Pascal Germain, Amaury Habrard, Emilie Morvant
ECML/PKDD (2)3
2020 Dual Sequential Variational Autoencoders for Fraud Detection
abstract
Fraud detection is an important research area where machine learning has a significant role to play. An important task in that context, on which the quality of the results obtained depends, is feature engineering. Unfortunately, this is very time and human consuming. Thus, in this article, we present the DuSVAE model that consists of a generative model that takes into account the sequential nature of the data. It combines two variational autoencoders that can generate a condensed representation of the input sequential data that can then be processed by a classifier to label each new sequence as fraudulent or genuine. The experiments we carried out on a large real-word dataset, from the Worldline company, demonstrate the ability of our system to better detect frauds in credit card transactions without any feature engineering effort.
Ayman Alazizi, Amaury Habrard, François Jacquenet, Liyun He-Guelton, Frédéric Oblé
IDA2
2020 Landmark-Based Ensemble Learning with Random Fourier Features and Gradient Boosting
Léo Gautheron, Pascal Germain, Amaury Habrard, Guillaume Metzler, Emilie Morvant, Marc Sebban, Valentina Zantedeschi
ECML/PKDD (3)3
2018 Online Non-linear Gradient Boosting in Multi-latent Spaces
Jordan Fréry, Amaury Habrard, Marc Sebban, Olivier Caelen, Liyun He-Guelton
IDA2
2018 Tree-Based Cost Sensitive Methods for Fraud Detection in Imbalanced Data
Guillaume Metzler, Xavier Badiche, Brahim Belkasmi, Élisa Fromont, Amaury Habrard, Marc Sebban
IDA5
2017 Efficient Top Rank Optimization with Gradient Boosting for Supervised Anomaly Detection
Jordan Fréry, Amaury Habrard, Marc Sebban, Olivier Caelen, Liyun He-Guelton
ECML/PKDD (1)2
2017 Theoretical Analysis of Domain Adaptation with Optimal Transport
Ievgen Redko, Amaury Habrard, Marc Sebban
ECML/PKDD (2)2
2016 A new boosting algorithm for provably accurate unsupervised domain adaptation
Amaury Habrard, Jean-Philippe Peyrache, Marc Sebban
Knowl. Inf. Syst.1
2015 Joint Semi-supervised Similarity Learning for Linear Classification
Maria-Irina Nicolae, Éric Gaussier, Amaury Habrard, Marc Sebban
ECML/PKDD (1)3
2013 Boosting for Unsupervised Domain Adaptation
Amaury Habrard, Jean-Philippe Peyrache, Marc Sebban
ECML/PKDD (2)1
2012 Parsimonious unsupervised and semi-supervised domain adaptation with good similarity functions
Emilie Morvant, Amaury Habrard, Stéphane Ayache
Knowl. Inf. Syst.2
2011 Sparse Domain Adaptation in Projection Spaces Based on Good Similarity Functions
abstract
We address the problem of domain adaptation for binary classification which arises when the distributions generating the source learning data and target test data are somewhat different. We consider the challenging case where no target labeled data is available. From a theoretical standpoint, a classifier has better generalization guarantees when the two domain marginal distributions are close. We study a new direction based on a recent framework of Balcan et al. allowing to learn linear classifiers in an explicit projection space based on similarity functions that may be not symmetric and not positive semi-definite. We propose a general method for learning a good classifier on target data with generalization guarantees and we improve its efficiency thanks to an iterative procedure by reweighting the similarity function - compatible with Balcan et al. framework - to move closer the two distributions in a new projection space. Hyper parameters and reweighting quality are controlled by a reverse validation procedure. Our approach is based on a linear programming formulation and shows good adaptation performances with very sparse models. We evaluate it on a synthetic problem and on real image annotation task.
Emilie Morvant, Amaury Habrard, Stéphane Ayache
ICDM2
2011 Learning Good Edit Similarities with Generalization Guarantees
Aurélien Bellet, Amaury Habrard, Marc Sebban
ECML/PKDD (1)2
2008 SEDiL: Software for Edit Distance Learning
Laurent Boyer 0002, Yann Esposito, Amaury Habrard, José Oncina, Marc Sebban
ECML/PKDD (2)3
2007 Learning Metrics Between Tree Structured Data: Application to Image Recognition
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
ECML2
2006 Learning Stochastic Tree Edit Distance
Marc Bernard, Amaury Habrard, Marc Sebban
ECML2
2003 Improvement of the State Merging Rule on Noisy Data in Probabilistic Grammatical Inference
Amaury Habrard, Marc Bernard, Marc Sebban
ECML1