Image de couverture de livre

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gu, Yuzhou, Kuang, Nikki Lijing, Ma, Yi-An, Song, Zhao, Zhang, Lichen
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
par: Kook, Yunbum, et autres
Publié: (2023)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
par: Gu, Yuzhou, et autres
Publié: (2023)

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
par: Jiang, Minhui, et autres
Publié: (2024)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
par: Mishra, Nina, et autres
Publié: (2025)

Sublinear Time Quantum Sensitivity Sampling
par: Song, Zhao, et autres
Publié: (2025)

Robust learning of halfspaces under log-concave marginals
par: Lange, Jane, et autres
Publié: (2025)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
par: Kook, Yunbum, et autres
Publié: (2024)

Oracle-based Uniform Sampling from Convex Bodies
par: Dang, Thanh, et autres
Publié: (2025)

Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models
par: Zhou, Huanjian, et autres
Publié: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
par: Song, Zhao, et autres
Publié: (2026)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
par: Song, Zhao, et autres
Publié: (2022)

On the query complexity of sampling from non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
par: Mangoubi, Oren, et autres
Publié: (2024)

Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
par: Song, Zhao, et autres
Publié: (2025)

Complexity of Non-Log-Concave Sampling in Fisher Information
par: Chewi, Sinho, et autres
Publié: (2026)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
par: Oki, Taihei, et autres
Publié: (2026)

Learning and Testing Convex Functions
par: Pinto Jr., Renato Ferreira, et autres
Publié: (2025)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
par: Lin, Honghao, et autres
Publié: (2025)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

The adaptive complexity of parallelized log-concave sampling
par: Zhou, Huanjian, et autres
Publié: (2024)

Chasing Convex Functions with Long-term Constraints
par: Lechowicz, Adam, et autres
Publié: (2024)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
par: Feng, Shiyuan, et autres
Publié: (2025)

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
par: McWhorter, Atticus, et autres
Publié: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
par: Hu, Lunjia, et autres
Publié: (2026)

A proximal gradient algorithm for composite log-concave sampling
par: Liu, Linghai, et autres
Publié: (2026)

Log-Time K-Means Clustering for 1D Data: Novel Approaches with Proof and Implementation
par: Hyun, Jake
Publié: (2024)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
par: Cheng, Kangke, et autres
Publié: (2026)

Breaking the $T^{2/3}$ Barrier for Sequential Calibration
par: Dagan, Yuval, et autres
Publié: (2024)

Sample-Adaptivity Tradeoff in On-Demand Sampling
par: Haghtalab, Nika, et autres
Publié: (2025)

Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
par: Bodwin, Greg, et autres
Publié: (2023)

Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
par: Vaze, Rahul, et autres
Publié: (2024)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
par: Cohen, Edith, et autres
Publié: (2025)

Towards Optimal Robustness in Learning-Augmented Paging
par: Chen, Peng, et autres
Publié: (2026)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
par: Alman, Josh, et autres
Publié: (2025)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
par: Zhou, Yingli, et autres
Publié: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
par: Grigorescu, Elena, et autres
Publié: (2024)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
par: Diakonikolas, Ilias, et autres
Publié: (2026)

On the Adversarial Robustness of Online Importance Sampling
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)