Measuring dissimilarity with diffeomorphism ...
Type de document :
Pré-publication ou Document de travail
Titre :
Measuring dissimilarity with diffeomorphism invariance
Auteur(s) :
Cantelobre, Théophile [Auteur]
The Inria London Programme [Inria-London]
MOdel for Data Analysis and Learning [MODAL]
Statistical Machine Learning and Parsimony [SIERRA]
Ciliberto, Carlo [Auteur]
University College of London [London] [UCL]
Department of Computer science [University College of London] [UCL-CS]
Guedj, Benjamin [Auteur]
MOdel for Data Analysis and Learning [MODAL]
The Inria London Programme [Inria-London]
The Alan Turing Institute
Department of Computer science [University College of London] [UCL-CS]
University College of London [London] [UCL]
Rudi, Alessandro [Auteur]
Statistical Machine Learning and Parsimony [SIERRA]
The Inria London Programme [Inria-London]
MOdel for Data Analysis and Learning [MODAL]
Statistical Machine Learning and Parsimony [SIERRA]
Ciliberto, Carlo [Auteur]
University College of London [London] [UCL]
Department of Computer science [University College of London] [UCL-CS]
Guedj, Benjamin [Auteur]

MOdel for Data Analysis and Learning [MODAL]
The Inria London Programme [Inria-London]
The Alan Turing Institute
Department of Computer science [University College of London] [UCL-CS]
University College of London [London] [UCL]
Rudi, Alessandro [Auteur]
Statistical Machine Learning and Parsimony [SIERRA]
Discipline(s) HAL :
Informatique [cs]/Apprentissage [cs.LG]
Statistiques [stat]/Machine Learning [stat.ML]
Statistiques [stat]/Théorie [stat.TH]
Statistiques [stat]/Machine Learning [stat.ML]
Statistiques [stat]/Théorie [stat.TH]
Résumé en anglais : [en]
Measures of similarity (or dissimilarity) are a key ingredient to many machine learning algorithms. We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces, which leverages the data's ...
Lire la suite >Measures of similarity (or dissimilarity) are a key ingredient to many machine learning algorithms. We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces, which leverages the data's internal structure to be invariant to diffeomorphisms. We prove that DID enjoys properties which make it relevant for theoretical study and practical use. By representing each datum as a function, DID is defined as the solution to an optimization problem in a Reproducing Kernel Hilbert Space and can be expressed in closed-form. In practice, it can be efficiently approximated via Nystr\"om sampling. Empirical experiments support the merits of DID.Lire moins >
Lire la suite >Measures of similarity (or dissimilarity) are a key ingredient to many machine learning algorithms. We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces, which leverages the data's internal structure to be invariant to diffeomorphisms. We prove that DID enjoys properties which make it relevant for theoretical study and practical use. By representing each datum as a function, DID is defined as the solution to an optimization problem in a Reproducing Kernel Hilbert Space and can be expressed in closed-form. In practice, it can be efficiently approximated via Nystr\"om sampling. Empirical experiments support the merits of DID.Lire moins >
Langue :
Anglais
Commentaire :
A pre-print
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- 2202.05614.pdf
- Accès libre
- Accéder au document
- 2202.05614
- Accès libre
- Accéder au document