Publications associées à Distance de Mahalanobis

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

Distance de Mahalanobis

Graph Chatbot

Chattez avec Graph Search

On Generalizations of Some Distance Based Classifiers for HDLSS Data

Automatic Dysarthric Speech Detection Exploiting Pairwise Distance-Based Convolutional Neural Networks

Robust Generalization despite Distribution Shift via Minimum Discriminating Information

AUTOMATIC DYSARTHRIC SPEECH DETECTION EXPLOITING PAIRWISE DISTANCE-BASED CONVOLUTIONAL NEURAL NETWORKS

Robust Generalization via f−Mutual Information

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

On Perfect Clustering of High Dimension, Low Sample Size Data

Online Robust Regression via SGD on the l1 loss

Joint estimation of RETF vector and power spectral densities for speech enhancement based on alternating least squares

Recovering covariance from functional fragments

On Generalizations of Some Distance Based Classifiers for HDLSS Data

Recovering covariance from functional fragments

Automatic Dysarthric Speech Detection Exploiting Pairwise Distance-Based Convolutional Neural Networks

On Perfect Clustering of High Dimension, Low Sample Size Data

AUTOMATIC DYSARTHRIC SPEECH DETECTION EXPLOITING PAIRWISE DISTANCE-BASED CONVOLUTIONAL NEURAL NETWORKS

Robust Generalization despite Distribution Shift via Minimum Discriminating Information

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Robust Generalization via f−Mutual Information

Online Robust Regression via SGD on the l1 loss

Joint estimation of RETF vector and power spectral densities for speech enhancement based on alternating least squares