Support points
From MaRDI portal
Publication:1991669
DOI10.1214/17-AOS1629zbMath1408.62030arXiv1609.01811OpenAlexW4206341000MaRDI QIDQ1991669
Publication date: 30 October 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.01811
numerical integrationMonte CarloBayesian computationquasi-Monte Carloenergy distancerepresentative points
Estimation in multivariate analysis (62H12) Probability distributions: general theory (60E05) Approximations to statistical distributions (nonasymptotic) (62E17) Numerical integration (65D30)
Related Items
Properties and generation of representative points of the exponential distribution ⋮ Score-matching representative approach for big data analysis with generalized linear models ⋮ Population Quasi-Monte Carlo ⋮ Consensus Monte Carlo for Random Subsets Using Shared Anchors ⋮ Gaussian Process Prediction using Design-Based Subsampling ⋮ Best finite constrained approximations of one-dimensional probabilities ⋮ A Riemann-Stein kernel method ⋮ Minimum energy representative points ⋮ Predictive Subdata Selection for Computer Models ⋮ Bayes estimator of process capability index Cpk with a specified prior mean ⋮ Bayesian uncertainty quantification for low-rank matrix completion ⋮ Stacking Designs: Designing Multifidelity Computer Experiments with Target Predictive Accuracy ⋮ Discrepancy-based inference for intractable generative models using quasi-Monte Carlo ⋮ Neighborhood-based cross fitting approach to treatment effects with high-dimensional data ⋮ Optimal designs for generalized linear mixed models based on the penalized quasi-likelihood method ⋮ Bayesian Optimization of Expected Quadratic Loss for Multiresponse Computer Experiments with Internal Noise ⋮ Bayesian Quadrature, Energy Minimization, and Space-Filling Design ⋮ Uniform decomposition of probability measures: quantization, clustering and rate of convergence ⋮ A quasi-Monte Carlo data compression algorithm for machine learning ⋮ Model-robust subdata selection for big data ⋮ Bayesian optimization of functional output in inverse problems ⋮ Approximation rate in Wasserstein distance of probability measures on the real line by deterministic empirical measures ⋮ Batch sequential adaptive designs for global optimization ⋮ Performance analysis of greedy algorithms for minimising a maximum mean discrepancy ⋮ Geometric Integration of Measure-Preserving Flows for Sampling ⋮ Sequential support points ⋮ Subdata selection algorithm for linear model discrimination ⋮ Representative points for distribution recovering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax and Minimax Projection Designs Using Clustering
- A probability path
- Energy statistics: a class of statistics based on distances
- Hitchhiker's guide to the fractional Sobolev spaces
- Low complexity methods for discretizing manifolds via Riesz energy minimization
- Scrambling Sobol' and Niederreiter-Xing points
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The design and analysis of computer experiments.
- Constructions of uniform designs by using resolvable packings and coverings.
- Goodness-of-fit statistics, discrepancies and robust designs
- Foundations of quantization for probability distributions
- Fast CBC construction of randomly shifted lattice rules achieving \(\mathcal{O}(n^{- 1 + \delta})\) convergence for unbounded integrands over \(\mathbb{R}^s\) in weighted spaces with POD weights
- Variations and extension of the convex-concave procedure
- On large deviations of the empiric D.F. of vector chance variables and a law of the iterated logarithm
- MM Optimization Algorithms
- Principal points
- Fourier Analysis and Nonlinear Partial Differential Equations
- Note on Grouping
- Approximation Theorems of Mathematical Statistics
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Convergence Rate for Degenerate von Mises Functionals
- Asymptotic quantization error of continuous signals and the quantization dimension
- Mersenne twister
- A generalized discrepancy and quadrature error bound
- The Concave-Convex Procedure
- Probability for Statisticians
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Least squares quantization in PCM
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Iterative Solution of Nonlinear Equations in Several Variables
- Maximum projection designs for computer experiments
- A quasi-Monte Carlo Metropolis algorithm
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- High-dimensional integration: The quasi-Monte Carlo way
- Remark on algorithm 659
- Remarks on a Multivariate Transformation
- Scattered Data Approximation
