Copertina

Efficient Diffusion Models for Symmetric Manifolds

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Mangoubi, Oren, He, Neil, Vishnoi, Nisheeth K.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Artificial Intelligence Data Structures and Algorithms Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
di: Mangoubi, Oren, et al.
Pubblicazione: (2024)

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
di: Lai, Peiyao, et al.
Pubblicazione: (2024)

Parallel Sampling via Counting
di: Anari, Nima, et al.
Pubblicazione: (2024)

Perturbation Bounds for Low-Rank Inverse Approximations under Noise
di: Tran, Phuc, et al.
Pubblicazione: (2025)

Coresets for Clustering Under Stochastic Noise
di: Huang, Lingxiao, et al.
Pubblicazione: (2025)

Centralized Selection with Preferences in the Presence of Biases
di: Celis, L. Elisa, et al.
Pubblicazione: (2024)

Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
di: Tran, Phuc, et al.
Pubblicazione: (2025)

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

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

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

Approximating the Total Variation Distance between Gaussians
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2025)

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

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

Approximating the total variation distance between spin systems
di: Feng, Weiming, 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)

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

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

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

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

Efficient Detection of Commutative Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
di: Li, Dongyue, et al.
Pubblicazione: (2025)

Learning-augmented smooth integer programs with PAC-learnable oracles
di: He, Hao-Yuan, et al.
Pubblicazione: (2026)

Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
di: Ailon, Nir, et al.
Pubblicazione: (2025)

Model Stealing for Any Low-Rank Language Model
di: Liu, Allen, et al.
Pubblicazione: (2024)

Approximate Lifted Model Construction
di: Luttermann, Malte, et al.
Pubblicazione: (2025)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
di: Liu, Zhouyang, et al.
Pubblicazione: (2025)

Efficiently matching random inhomogeneous graphs via degree profiles
di: Ding, Jian, et al.
Pubblicazione: (2023)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
di: de Wynter, Adrian
Pubblicazione: (2020)

Provably Learning from Modern Language Models via Low Logit Rank
di: Golowich, Noah, et al.
Pubblicazione: (2025)

Hardness of sampling solutions from the Symmetric Binary Perceptron
di: Alaoui, Ahmed El, et al.
Pubblicazione: (2024)

Online Differentially Private Synthetic Data Generation
di: He, Yiyun, 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)

Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics
di: Xun, Zhiyang, et al.
Pubblicazione: (2025)

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
di: Hosseininasab, Amin, et al.
Pubblicazione: (2022)

Active Learning for Non-Parametric Choice Models
di: Susan, Fransisca, et al.
Pubblicazione: (2022)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
di: Yao, Jasper
Pubblicazione: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
di: Guan, Xinyu, et al.
Pubblicazione: (2025)