Projection-based techniques for high-dimensional optimal transport problems
From MaRDI portal
Publication:6602009
Cites work
- scientific article; zbMATH DE number 47282 (Why is no real title available?)
- scientific article; zbMATH DE number 6734253 (Why is no real title available?)
- scientific article; zbMATH DE number 3099866 (Why is no real title available?)
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- A geometric view of optimal transportation and generative model
- Central limit theorem and bootstrap procedure for Wasserstein's variations with an application to structural relationships between distributions
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Comment
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Empirical regularized optimal transport: statistical theory and applications
- Exact post-selection inference, with application to the Lasso
- Fréchet means and Procrustes analysis in Wasserstein space
- Geodesic PCA versus Log-PCA of Histograms in the Wasserstein Space
- High-dimensional integration: The quasi-Monte Carlo way
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Introduction to quasi-Monte Carlo integration and applications
- Minimax estimation of smooth optimal transport maps
- Model-Free Feature Screening and FDR Control With Knockoff Features
- Monte Carlo and quasi-Monte Carlo sampling
- More efficient approximation of smoothing splines via space-filling basis selection
- On Directional Regression for Dimension Reduction
- On Principal Hessian Directions for Data Visualization and Dimension Reduction: Another Application of Stein's Lemma
- On parameter estimation with the Wasserstein distance
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- Polar factorization and monotone rearrangement of vector‐valued functions
- Post-selection inference for \(\ell_1\)-penalized likelihood models
- Projection pursuit
- Revisiting the Nyström method for improved large-scale machine learning
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Sketching earth-mover distance on graph metrics
- Sliced Inverse Regression for Dimension Reduction
- Sliced and Radon Wasserstein barycenters of measures
- Stability of a 4th-order curvature condition arising in optimal transport theory
- Statistical inference for Bures-Wasserstein barycenters
- Sublinear time algorithms for earth mover's distance
- Sufficient dimension reduction: methods and applications with R
- The Speed of Mean Glivenko-Cantelli Convergence
- The boosting approach to machine learning: an overview
- The phylogenetic Kantorovich-Rubinstein metric for environmental sequence samples
- Uncoupled isotonic regression via minimum Wasserstein deconvolution
- Valid post-selection inference
- Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
- Wasserstein discriminant analysis
This page was built for publication: Projection-based techniques for high-dimensional optimal transport problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602009)
