arrow
Return

SUPPORT POINTS

delete2018-12-01
delete106
delete
OA
AI
S
Simon Mak *
V
V. Roshan Joseph
DOI:10.1214/17-AOS1629delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
This paper introduces a new way to compact a continuous probability distribution F into a set of representative points called support points. These points are obtained by minimizing the energy distance, a statistical potential measure initially proposed by Szekely and Rizzo [InterStat 5 (2004) 1-6] for testing goodness-of-fit. The energy distance has two appealing features. First, its distance-based structure allows us to exploit the duality between powers of the Euclidean distance and its Fourier transform for theoretical analysis. Using this duality, we show that support points converge in distribution to F, and enjoy an improved error rate to Monte Carlo for integrating a large class of functions. Second, the minimization of the energy distance can be formulated as a difference-of-convex program, which we manipulate using two algorithms to efficiently generate representative point sets. In simulation studies, support points provide improved integration performance to both Monte Carlo and a specific quasi-Monte Carlo method. Two important applications of support points are then highlighted: (a) as a way to quantify the propagation of uncertainty in expensive simulations and (b) as a method to optimally compact Markov chain Monte Carlo (MCMC) samples in Bayesian computation.
Keywords:
Bayesian computation
energy distance
Monte Carlo
numerical integration
quasi-Monte Carlo
representative points
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Annals of Statistics cover
Annals of Statistics
IF:
3.7
Papers:
2.8K
Citations:
2.9W

Organization

U
university system of georgia
Scholars:
7.3W
Papers: 6.5W
Citations: 101