Cover Image

Approximating the Total Variation Distance between Gaussians

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhattacharyya, Arnab, Feng, Weiming, Srivastava, Piyush
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Computing Total Variation Distance Between Mixtures of Product Distributions
by: Feng, Weiming, et al.
Published: (2026)

Approximating the total variation distance between spin systems
by: Feng, Weiming, et al.
Published: (2025)

On approximating the $f$-divergence between two Ising models
by: Feng, Weiming, et al.
Published: (2025)

Rapid mixing in positively weighted restricted Boltzmann machines
by: Feng, Weiming, et al.
Published: (2026)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Total Variation Distance Meets Probabilistic Inference
by: Bhattacharyya, Arnab, et al.
Published: (2023)

Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance
by: Wirth, Leoni Carla, et al.
Published: (2025)

Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
by: Chen, Xiaoyu, et al.
Published: (2024)

Sampling from convex sets with a cold start using multiscale decompositions
by: Narayanan, Hariharan, et al.
Published: (2022)

Sparsifying Suprema of Gaussian Processes
by: De, Anindya, et al.
Published: (2024)

Computational Explorations of Total Variation Distance
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Learning multivariate Gaussians with imperfect advice
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)

Leaf Stripping on Uniform Attachment Trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Simple, unified analysis of Johnson-Lindenstrauss with applications
by: Li, Yingru
Published: (2024)

Efficiently learning and sampling multimodal distributions with data-based initialization
by: Koehler, Frederic, et al.
Published: (2024)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
by: Attia, Amit, et al.
Published: (2024)

The graph alignment problem: fundamental limits and efficient algorithms
by: Ganassali, Luca
Published: (2024)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2022)

Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
by: Mangoubi, Oren, et al.
Published: (2025)

Outlier Robust Multivariate Polynomial Regression
by: Arora, Vipul, et al.
Published: (2024)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

The Transient Cost of Learning in Queueing Systems
by: Freund, Daniel, et al.
Published: (2023)

Distribution Learning Meets Graph Structure Sampling
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Distance Estimation for High-Dimensional Discrete Distributions
by: Kumar, Gunjan, et al.
Published: (2023)

Minimal spanning arborescence
by: Ray, Gourab, et al.
Published: (2024)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
by: Beretta, Lorenzo, et al.
Published: (2025)

Markov Chains Approximate Message Passing
by: Rajaraman, Amit, et al.
Published: (2025)

On Unbiased Low-Rank Approximation with Minimum Distortion
by: Barnes, Leighton Pate, et al.
Published: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
by: Harris, David G., et al.
Published: (2026)

Spectral Alignment of Correlated Gaussian matrices
by: Ganassali, Luca, et al.
Published: (2019)

Data organization limits the predictability of binary classification
by: Jing, Fei, et al.
Published: (2024)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
by: Zhou, Leo, et al.
Published: (2024)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)

Learning CNF formulas from uniform random solutions in the local lemma regime
by: Feng, Weiming, et al.
Published: (2025)

Spectral Independence Beyond Total Influence on Trees and Related Graphs
by: Chen, Xiaoyu, et al.
Published: (2024)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)

Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)