Concentration of discrepancy-based approximate Bayesian computation via Rademacher complexity
From MaRDI portal
Cites work
- (f,)-divergences: interpolating between f-divergences and integral probability metrics
- 10.1162/153244303321897690
- A comparison of likelihood-free methods with and without summary statistics
- A General Framework for Updating Belief Distributions
- A kernel two-sample test
- Approximate Bayesian computation via classification
- Approximate Bayesian Computation with the Wasserstein Distance
- Approximate Bayesian computational methods
- Asymptotic properties of approximate Bayesian computation
- Concentration of discrepancy-based approximate Bayesian computation via Rademacher complexity
- Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
- High-dimensional statistics. A non-asymptotic viewpoint
- Integral Probability Metrics and Their Generating Classes of Functions
- Kernel Mean Embedding of Distributions: A Review and Beyond
- Kernel methods in machine learning
- Likelihood-free inference via classification
- Local Rademacher complexities
- Mixing: Properties and examples
- Model Misspecification in Approximate Bayesian Computation: Consequences and Diagnostics
- On the asymptotic efficiency of approximate Bayesian computation estimators
- On the empirical estimation of integral probability metrics
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal bounds between f-divergences and integral probability metrics
- Real Analysis and Probability
- Relevant statistics for Bayesian model choice
- Robust Bayesian inference via coarsening
- Robust generalised Bayesian inference for intractable likelihoods
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- The transportation cost from the uniform measure to the empirical measure in dimension \(\geq 3\)
- Uniform and universal Glivenko-Cantelli classes
Cited in
(1)
This page was built for publication: Concentration of discrepancy-based approximate Bayesian computation via Rademacher complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013976)
