Soft and subspace robust multivariate rank tests based on entropy regularized optimal transport

• URL: http://arxiv.org/abs/2103.08811v1
• Date: Tue, 16 Mar 2021 02:48:19 GMT
• Title: Soft and subspace robust multivariate rank tests based on entropy regularized optimal transport
• Authors: Shoaib Bin Masud, Boyang Lyu, Shuchin Aeron
• Abstract summary: We extend the recently proposed multivariate rank energy distance, based on the theory of optimal transport, to soft rank energy distance. Being differentiable, this in turn allows us to extend the rank energy to a subspace robust rank energy distance. We show via experiments that using projected soft rank energy one can trade-off the detection power vs the false alarm.
• Score: 10.605168966435981
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In this paper, we extend the recently proposed multivariate rank energy distance, based on the theory of optimal transport, for statistical testing of distributional similarity, to soft rank energy distance. Being differentiable, this in turn allows us to extend the rank energy to a subspace robust rank energy distance, dubbed Projected soft-Rank Energy distance, which can be computed via optimization over the Stiefel manifold. We show via experiments that using projected soft rank energy one can trade-off the detection power vs the false alarm via projections onto an appropriately selected low dimensional subspace. We also show the utility of the proposed tests on unsupervised change point detection in multivariate time series data. All codes are publicly available at the link provided in the experiment section.

Related papers

• Measuring Heterogeneity in Machine Learning with Distributed Energy Distance [3.8318398579197335]
  We introduce energy distance as a sensitive measure for quantifying distributional discrepancies. We develop Taylor approximations that preserve key theoretical quantitative properties while reducing computational overhead. We propose a novel application of energy distance to assign penalty weights for aligning predictions across heterogeneous nodes.
  arXiv  Detail & Related papers  (2025-01-27T16:15:57Z)
• Optimal Transport Maps are Good Voice Converters [58.42556113055807]
  We present a variety of optimal transport algorithms for different data representations, such as mel-spectrograms and latent representation of self-supervised speech models. For the mel-spectogram data representation, we achieve strong results in terms of Frechet Audio Distance (FAD) We achived state-of-the-art results and outperformed existing methods even with limited reference speaker data.
  arXiv  Detail & Related papers  (2024-10-17T22:48:53Z)
• DPM-OT: A New Diffusion Probabilistic Model Based on Optimal Transport [26.713392774427653]
  DPM-OT is a unified learning framework for fast DPMs with a direct expressway represented by OT map. It can generate high-quality samples within around 10 function evaluations. Experiments validate the effectiveness and advantages of DPM-OT in terms of speed and quality.
  arXiv  Detail & Related papers  (2023-07-21T02:28:54Z)
• Energy-Based Sliced Wasserstein Distance [47.18652387199418]
  A key component of the sliced Wasserstein (SW) distance is the slicing distribution. We propose to design the slicing distribution as an energy-based distribution that is parameter-free. We then derive a novel sliced Wasserstein metric, energy-based sliced Waserstein (EBSW) distance.
  arXiv  Detail & Related papers  (2023-04-26T14:28:45Z)
• On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detection [13.159994710917024]
  We show that the soft rank energy enjoys both fast rates of statistical convergence and robust continuity properties. We quantify the discrepancy between soft rank energy and rank energy in terms of the regularization parameter.
  arXiv  Detail & Related papers  (2023-02-15T22:02:09Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Robust and efficient change point detection using novel multivariate rank-energy GoF test [0.0]
  We show that directly using Rank Energy (RE) leads to high sensitivity to very small changes in distributions. We propose soft-Rank Energy (sRE) that is based on entropy regularized OT and employ it towards CPD. We discuss the advantages of using sRE over RE and demonstrate that the proposed sRE based CPD outperforms all the existing methods in terms of Area Under the Curve (AUC) and F1-score on real and synthetic data sets.
  arXiv  Detail & Related papers  (2021-10-29T19:08:57Z)
• Meta Learning Low Rank Covariance Factors for Energy-Based Deterministic Uncertainty [58.144520501201995]
  Bi-Lipschitz regularization of neural network layers preserve relative distances between data instances in the feature spaces of each layer. With the use of an attentive set encoder, we propose to meta learn either diagonal or diagonal plus low-rank factors to efficiently construct task specific covariance matrices. We also propose an inference procedure which utilizes scaled energy to achieve a final predictive distribution.
  arXiv  Detail & Related papers  (2021-10-12T22:04:19Z)
• Single-atom transport in optical conveyor belts: Enhanced shortcuts-to-adiabaticity approach [0.0]
  atomic transport, enabled by moving the confining trap, is a prerequisite for many quantum-technology applications. We investigate it here in the experimentally relevant setting of a moving optical lattice (em optical conveyor belt) We model single-atom transport in this system by taking fully into account its three-dimensional, anharmonic confining potential.
  arXiv  Detail & Related papers  (2021-08-23T18:01:04Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)
• Targeted free energy estimation via learned mappings [66.20146549150475]
  Free energy perturbation (FEP) was proposed by Zwanzig more than six decades ago as a method to estimate free energy differences. FEP suffers from a severe limitation: the requirement of sufficient overlap between distributions. One strategy to mitigate this problem, called Targeted Free Energy Perturbation, uses a high-dimensional mapping in configuration space to increase overlap.
  arXiv  Detail & Related papers  (2020-02-12T11:10:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.