Copertina

Approximating the Total Variation Distance between Gaussians

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bhattacharyya, Arnab, Feng, Weiming, Srivastava, Piyush
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Machine Learning Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

Sparsifying Suprema of Gaussian Processes
di: De, Anindya, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

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

Outlier Robust Multivariate Polynomial Regression
di: Arora, Vipul, et al.
Pubblicazione: (2024)

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

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

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

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

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

Minimal spanning arborescence
di: Ray, Gourab, et al.
Pubblicazione: (2024)

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

Markov Chains Approximate Message Passing
di: Rajaraman, Amit, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

Perspectives on Stochastic Localization
di: Shi, Bobby, et al.
Pubblicazione: (2025)