On Choosing and Bounding Probability Metrics

DOI10.2307/1403865zbMath1217.62014arXivmath/0209021OpenAlexW2951714068MaRDI QIDQ4832030

Alison L. Gibbs, Francis Edward Su

Publication date: 3 January 2005

Published in: International Statistical Review / Revue Internationale de Statistique (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0209021

Mathematics Subject Classification ID

Characterization and structure theory of statistical distributions (62E10) Convergence of probability measures (60B10) Statistical distribution theory (62E99)

Related Items (only showing first 100 items - show all)

A note on the rate of convergence in the Boolean central limit theorem ⋮ Complexity of distances: Theory of generalized analytic equivalence relations ⋮ Metrics on trace spaces ⋮ Nonlocal Wasserstein distance: metric and asymptotic properties ⋮ Generalized Bayes approach to inverse problems with model misspecification ⋮ On dealing with the unknown population minimum in parametric inference ⋮ Optimal transport and variational Bayesian inference ⋮ On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions ⋮ Universal cutoff for Dyson Ornstein Uhlenbeck process ⋮ Predictive Inference Based on Markov Chain Monte Carlo Output ⋮ Kantorovich functors and characteristic logics for behavioural distances ⋮ Local exchangeability ⋮ Bayesian Inverse Problems Are Usually Well-Posed ⋮ Multiple oracle algorithm to solve continuous games ⋮ Error control of the numerical posterior with Bayes factors in Bayesian uncertainty quantification ⋮ New bounds for the empirical robust Kullback-Leibler divergence problem ⋮ Universal Features for High-Dimensional Learning and Inference ⋮ Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes ⋮ Concentration inequalities for kernel density estimators under uniform mixing ⋮ Truthlikeness for probabilistic laws ⋮ Classification of histogram-valued data with support histogram machines ⋮ Full classification of dynamics for one-dimensional continuous-time Markov chains with polynomial transition rates ⋮ A probabilistic view of latent space graphs and phase transitions ⋮ Level sets semimetrics for probability measures with applications in hypothesis testing ⋮ Community structure recovery and interaction probability estimation for gossip opinion dynamics ⋮ Scaling limit of the Fleming-Viot multicolor process ⋮ Asymptotics for Strassen's optimal transport problem ⋮ Lipschitz continuity of probability kernels in the optimal transport framework ⋮ Interval-valued functional clustering based on the Wasserstein distance with application to stock data ⋮ An elementary approach to the inverse first-passage-time problem for soft-killed Brownian motion ⋮ Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams ⋮ Dirichlet is natural ⋮ Wasserstein Distance and the Distributionally Robust TSP ⋮ Stein's Method for the Beta Distribution and the Pólya-Eggenberger Urn ⋮ Information geometry and non-equilibrium thermodynamic relations in the over-damped stochastic processes ⋮ Lack of phase transitions in staggered magnetic systems. A comparison of uniqueness criteria ⋮ Bisimulation for Markov Decision Processes through Families of Functional Expressions ⋮ Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint ⋮ The role of information in nonstationary regression ⋮ On the distribution of the limit proportion for a two-color, randomly reinforced urn with equal reinforcement distributions ⋮ Fluctuation theorems for synchronization of interacting Pólya's urns ⋮ Extended Laplace principle for empirical measures of a Markov chain ⋮ Can one hear the shape of a population history? ⋮ Unnamed Item ⋮ Local modulated wave model for the reconstruction of space–time energy spectra in turbulent flows ⋮ Discrete Approximation and Quantification in Distributionally Robust Optimization ⋮ Logarithmic Sobolev inequalities in discrete product spaces ⋮ Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods ⋮ Infinite Horizon Average Cost Dynamic Programming Subject to Total Variation Distance Ambiguity ⋮ On the rate of convergence of empirical measure in $\infty $-Wasserstein distance for unbounded density function ⋮ Stochastic Gradient Markov Chain Monte Carlo ⋮ Bayesian Inverse Problems and Kalman Filters ⋮ Technical Note—Approximating Systems Fed by Poisson Processes with Rapidly Changing Arrival Rates ⋮ Some theoretical results regarding the polygonal distribution ⋮ An entropy-based technique for classifying bacterial chromosomes according to synonymous codon usage ⋮ Optimal \(L_2\)-norm empirical importance weights for the change of probability measure ⋮ Laplace transformation and weak convergence with an application to Fluorescence Resonance Energy Transfer (FRET) ⋮ Bounds for the chi-square approximation of the power divergence family of statistics ⋮ Preference Robust Modified Optimized Certainty Equivalent ⋮ KL-optimum designs: theoretical properties and practical computation ⋮ Analysis of the Ensemble and Polynomial Chaos Kalman Filters in Bayesian Inverse Problems ⋮ Transport Map Accelerated Markov Chain Monte Carlo ⋮ Importance Sampling and Necessary Sample Size: An Information Theory Approach ⋮ Weak Solutions of Mean-Field Stochastic Differential Equations and Application to Zero-Sum Stochastic Differential Games ⋮ Hierarchical Bayesian inference for ill-posed problems via variational method ⋮ Estimation of Entropy and Mutual Information ⋮ A General Dynamical Statistical model with Causal Interpretation ⋮ Transportation-information inequalities for Markov processes ⋮ Diffeomorphic Density Matching by Optimal Information Transport ⋮ Some remarks on Bayesian multiple hypothesis testing ⋮ Existence, consistency and computer simulation for selected variants of minimum distance estimators ⋮ Principal axes analysis of symbolic histogram variables ⋮ Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets ⋮ Comparison of distribution selection methods ⋮ Fingerprinting and Reconstruction of Functionals of Discrete Time Markov Chains ⋮ A probabilistic numerical method for a class of mean field games ⋮ Criteria for evaluating approximations of count distributions ⋮ The Prelimit Generator Comparison Approach of Stein’s Method ⋮ Qualitative Robustness in Bayesian Inference ⋮ Co-clustering algorithms for distributional data with automated variable weighting ⋮ Some inequalities for Csiszár divergence via theory of time scales ⋮ Asymptotics of one-dimensional Lévy approximations ⋮ A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities ⋮ Mathematical foundation of the replicating portfolio approach ⋮ Refined normal approximations for the central and noncentral chi-square distributions and some applications ⋮ On quantum versions of the classical Wasserstein distance ⋮ Sparse approximation of triangular transports. I: The finite-dimensional case ⋮ Wasserstein Sensitivity of Risk and Uncertainty Propagation ⋮ Data-driven risk-averse stochastic optimization with Wasserstein metric ⋮ Distributionally Robust Stochastic Programming ⋮ A density-matching approach for optimization under uncertainty ⋮ Budget-limited distribution learning in multifidelity problems ⋮ Estimations of \(f\)- and Rényi divergences by using a cyclic refinement of the Jensen's inequality ⋮ A Monte Carlo approach to quantifying discrepancies between intractable posterior distributions ⋮ Bounds for the asymptotic distribution of the likelihood ratio ⋮ Program algebra for quantitative information flow ⋮ On the convergence of the Laplace approximation and noise-level-robustness of Laplace-based Monte Carlo methods for Bayesian inverse problems ⋮ Stein's method meets computational statistics: a review of some recent developments ⋮ Bounding Kolmogorov distances through Wasserstein and related integral probability metrics ⋮ Chance-constrained set covering with Wasserstein ambiguity

This page was built for publication: On Choosing and Bounding Probability Metrics