mlsanityData to 7 Oct 2026

A Pseudo-Metric between Probability Distributions based on Depth-Trimmed Regions

arXiv 2103.12711 ↗First posted 23 Mar 2021stat.ML cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

The design of a metric between probability distributions is a longstanding problem motivated by numerous applications in Machine Learning. Focusing on continuous probability distributions on the Euclidean space ℝd, we introduce a novel pseudo-metric between probability distributions by leveraging the extension of univariate quantiles to multivariate spaces. Data depth is a nonparametric statistical tool that measures the centrality of any element x∈ℝd with respect to (w.r.t.) a probability distribution or a data set. It is a natural median-oriented extension of the cumulative distribution function (cdf) to the multivariate case. Thus, its upper-level sets -- the depth-trimmed regions -- give rise to a definition of multivariate quantiles. The new pseudo-metric relies on the average of the Hausdorff distance between the depth-based quantile regions w.r.t. each distribution. Its good behavior w.r.t. major transformation groups, as well as its ability to factor out translations, are depicted. Robustness, an appealing feature of this pseudo-metric, is studied through the finite sample breakdown point. Moreover, we propose an efficient approximation method with linear time complexity w.r.t. the size of the data set and its dimension. The quality of this approximation as well as the performance of the proposed approach are illustrated in numerical experiments.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 51 of its 161 references that are in the map. First posted on arXiv 23 Mar 2021.

Builds on

51 of 161 references.

References · 51

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  5. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  6. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  7. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  8. 2018Deep contextualized word representationscited by 2,285
  9. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  10. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  11. 2016Variational Inference: A Review for Statisticianscited by 1,466
  12. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
38 more
  1. 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,100
  2. 2018Computational Optimal Transportcited by 765
  3. 2019Unified Language Model Pre-training for Natural Language Understanding and Generationcited by 668
  4. 2017Wasserstein GANcited by 635
  5. 2019Text Summarization with Pretrained Encoderscited by 553
  6. 2015Optimal Transport for Domain Adaptationcited by 457
  7. 2019MoverScore: Text Generation Evaluating with Contextualized Embeddings and Earth Mover Distancecited by 415
  8. 2017Advances in Pre-Training Distributed Word Representationscited by 207
  9. 2018Statistical Aspects of Wasserstein Distancescited by 202
  10. 2020Extractive Summarization as Text Matchingcited by 189
  11. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  12. 2018Bottom-Up Abstractive Summarizationcited by 177
  13. 2018Fast Abstractive Summarization with Reinforce-Selected Sentence Rewritingcited by 158
  14. 2020Re-evaluating Evaluation in Text Summarizationcited by 144
  15. 2015Semantically Conditioned LSTM-based Natural Language Generation for Spoken Dialogue Systemscited by 134
  16. 2018Ranking Sentences for Extractive Summarization with Reinforcement Learningcited by 128
  17. 2020Heterogeneous Graph Neural Networks for Extractive Document Summarizationcited by 90
  18. 2019Subspace Robust Wasserstein Distancescited by 89
  19. 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
  20. 2018Content Selection in Deep Learning Models of Summarizationcited by 64
  21. 2018Neural Document Summarization by Jointly Learning to Score and Select Sentencescited by 56
  22. 2019Affect-Driven Dialog Generationcited by 50
  23. 2020Outlier-Robust Optimal Transportcited by 45
  24. 2018Statistical Optimal Transport via Factored Couplingscited by 38
  25. 2019Searching for Effective Neural Extractive Summarization: What Works and What's Nextcited by 38
  26. 2020Hierarchical Pre-training for Sequence Labelling in Spoken Dialogcited by 36
  27. 2020Guiding attention in Sequence-to-sequence models for Dialogue Act predictioncited by 26
  28. 2019Minimax Confidence Intervals for the Sliced Wasserstein Distancecited by 24
  29. 2020When OT meets MoM: Robust estimation of Wasserstein Distancecited by 23
  30. 2017Anomaly Detection by Robust Statisticscited by 22
  31. 2019Functional Isolation Forestcited by 19
  32. 2018Wasserstein regularization for sparse multi-task regressioncited by 18
  33. 2019From the Token to the Review: A Hierarchical Multimodal approach to Opinion Miningcited by 14
  34. 2020Choosing among notions of multivariate depth statisticscited by 14
  35. 2019The Area of the Convex Hull of Sampled Curves: a Robust Functional Statistical Depth Measurecited by 9
  36. 2019Depth for curve data and applicationscited by 8
  37. 2020Learning by Semantic Similarity Makes Abstractive Summarization Bettercited by 7
  38. 2016Depth and depth-based classification with R-package ddalphacited by 5

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 5; 2023: 5; 2024: 7.

17 papers.

Sort:

  1. 2022Of Human Criteria and Automatic Metrics: A Benchmark of the Evaluation of Story Generationcited by 73
  2. 2024SaulLM-54B & SaulLM-141B: Scaling Up Domain Adaptation for the Legal Domaincited by 39
  3. 2024What Makes a Good Story and How Can We Measure It? A Comprehensive Survey of Story Evaluationcited by 17
  4. 2023Unsupervised Layer-wise Score Aggregation for Textual OOD Detectioncited by 15
  5. 2022Learning Disentangled Textual Representations via Statistical Measures of Similaritycited by 14
  6. 2023Revisiting Instruction Fine-tuned Model Evaluation to Guide Industrial Applicationscited by 11
  7. 2022Functional Anomaly Detection: a Benchmark Studycited by 10
  8. 2024Enhanced Hallucination Detection in Neural Machine Translation through Simple Detector Aggregationcited by 9
  9. 2023Hypothesis Transfer Learning with Surrogate Classification Losses: Generalization Bounds through Algorithmic Stabilitycited by 4
  10. 2022Beyond Mahalanobis-Based Scores for Textual OOD Detectioncited by 3
  11. 2023Toward Stronger Textual Attack Detectorscited by 3
  12. 2024PerSEval: Assessing Personalization in Text Summarizerscited by 3
5 more
  1. 2022Repro: An Open-Source Library for Improving the Reproducibility and Usability of Publicly Available Research Codecited by 2
  2. 2023A Novel Information-Theoretic Objective to Disentangle Representations for Fair Classificationcited by 1
  3. 2024LUNA: A Framework for Language Understanding and Naturalness Assessmentcited by 1
  4. 2024Towards Trustworthy Reranking: A Simple yet Effective Abstention Mechanismcited by 1
  5. 2024Signature Isolation Forestcited by 1