PolytopeWalk: Sparse MCMC Sampling over Polytopes
Fuente:
arXiv
Saved in:
| Main Authors: | Sun, Benny, Chen, Yuansi |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
by: Jiang, Minhui, et al.
Published: (2024)
by: Jiang, Minhui, et al.
Published: (2024)
Safe Linear Bandits over Unknown Polytopes
by: Gangrade, Aditya, et al.
Published: (2022)
by: Gangrade, Aditya, et al.
Published: (2022)
Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025)
by: Bakaev, Egor, et al.
Published: (2025)
Maxout Polytopes
by: Balakin, Andrei, et al.
Published: (2025)
by: Balakin, Andrei, et al.
Published: (2025)
Introducing Graph Learning over Polytopic Uncertain Graph
by: Kishida, Masako, et al.
Published: (2024)
by: Kishida, Masako, et al.
Published: (2024)
Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes
by: Iommazzo, Gabriele, et al.
Published: (2025)
by: Iommazzo, Gabriele, et al.
Published: (2025)
On Cyclical MCMC Sampling
by: Wang, Liwei, et al.
Published: (2024)
by: Wang, Liwei, et al.
Published: (2024)
Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
by: Mangoubi, Oren, et al.
Published: (2024)
by: Mangoubi, Oren, et al.
Published: (2024)
Defining Neural Network Architecture through Polytope Structures of Dataset
by: Lee, Sangmin, et al.
Published: (2024)
by: Lee, Sangmin, et al.
Published: (2024)
When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?
by: Chen, Yuansi, et al.
Published: (2023)
by: Chen, Yuansi, et al.
Published: (2023)
Polytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows
by: Heiland, Jan, et al.
Published: (2024)
by: Heiland, Jan, et al.
Published: (2024)
Deep ReLU Networks Have Surprisingly Simple Polytopes
by: Fan, Feng-Lei, et al.
Published: (2023)
by: Fan, Feng-Lei, et al.
Published: (2023)
Model Reconstruction Using Counterfactual Explanations: A Perspective From Polytope Theory
by: Dissanayake, Pasan, et al.
Published: (2024)
by: Dissanayake, Pasan, et al.
Published: (2024)
Box Facets and Cut Facets of Lifted Multicut Polytopes
by: Naumann, Lucas Fabian, et al.
Published: (2024)
by: Naumann, Lucas Fabian, et al.
Published: (2024)
Beyond the Birkhoff Polytope: Spectral-Sphere-Constrained Hyper-Connections
by: Liu, Zhaoyi, et al.
Published: (2026)
by: Liu, Zhaoyi, et al.
Published: (2026)
When few labeled target data suffice: a theory of semi-supervised domain adaptation via fine-tuning from multiple adaptive starts
by: Ha, Wooseok, et al.
Published: (2025)
by: Ha, Wooseok, et al.
Published: (2025)
Reinforcement Learning for Adaptive MCMC
by: Wang, Congye, et al.
Published: (2024)
by: Wang, Congye, et al.
Published: (2024)
Robustness Against Adversarial Attacks via Learning Confined Adversarial Polytopes
by: Hamidi, Shayan Mohajer, et al.
Published: (2024)
by: Hamidi, Shayan Mohajer, et al.
Published: (2024)
Certified Robust Invariant Polytope Training in Neural Controlled ODEs
by: Harapanahalli, Akash, et al.
Published: (2024)
by: Harapanahalli, Akash, et al.
Published: (2024)
Efficient Sampling on Riemannian Manifolds via Langevin MCMC
by: Cheng, Xiang, et al.
Published: (2024)
by: Cheng, Xiang, et al.
Published: (2024)
The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
by: McWhorter, Atticus, et al.
Published: (2025)
by: McWhorter, Atticus, et al.
Published: (2025)
Constrained Sampling for Language Models Should Be Easy: An MCMC Perspective
by: Gonzalez, Emmanuel Anaya, et al.
Published: (2025)
by: Gonzalez, Emmanuel Anaya, et al.
Published: (2025)
Harnessing the Power of Reinforcement Learning for Adaptive MCMC
by: Wang, Congye, et al.
Published: (2025)
by: Wang, Congye, et al.
Published: (2025)
Combinatorial Privacy: Private Multi-Party Bitstream Grand Sum by Hiding in Birkhoff Polytopes
by: Vepakomma, Praneeth
Published: (2026)
by: Vepakomma, Praneeth
Published: (2026)
Adaptive Independent Sticky MCMC algorithms
by: Martino, L., et al.
Published: (2013)
by: Martino, L., et al.
Published: (2013)
MCMC-driven learning
by: Bouchard-Côté, Alexandre, et al.
Published: (2024)
by: Bouchard-Côté, Alexandre, et al.
Published: (2024)
AutoStep: Locally adaptive involutive MCMC
by: Liu, Tiange, et al.
Published: (2024)
by: Liu, Tiange, et al.
Published: (2024)
Diffusion Generative Modelling for Divide-and-Conquer MCMC
by: Trojan, C., et al.
Published: (2024)
by: Trojan, C., et al.
Published: (2024)
Policy Gradients for Optimal Parallel Tempering MCMC
by: Zhao, Daniel, et al.
Published: (2024)
by: Zhao, Daniel, et al.
Published: (2024)
Polytopal Stochastic Games
by: Castro, Pablo F., et al.
Published: (2025)
by: Castro, Pablo F., et al.
Published: (2025)
Neural Network Approximation: A View from Polytope Decomposition
by: Li, ZeYu, et al.
Published: (2026)
by: Li, ZeYu, et al.
Published: (2026)
Prominent Roles of Conditionally Invariant Components in Domain Adaptation: Theory and Algorithms
by: Wu, Keru, et al.
Published: (2023)
by: Wu, Keru, et al.
Published: (2023)
Comparison of parallel SMC and MCMC for Bayesian deep learning
by: Liang, Xinzhu, et al.
Published: (2024)
by: Liang, Xinzhu, et al.
Published: (2024)
High-dimensional Adaptive MCMC with Reduced Computational Complexity
by: Hird, Max, et al.
Published: (2026)
by: Hird, Max, et al.
Published: (2026)
Integration of Active Learning and MCMC Sampling for Efficient Bayesian Calibration of Mechanical Properties
by: Riccius, Leon, et al.
Published: (2024)
by: Riccius, Leon, et al.
Published: (2024)
Gaussian Processes Sampling with Sparse Grids under Additive Schwarz Preconditioner
by: Chen, Haoyuan, et al.
Published: (2024)
by: Chen, Haoyuan, et al.
Published: (2024)
Efficiently Vectorized MCMC on Modern Accelerators
by: Dance, Hugh, et al.
Published: (2025)
by: Dance, Hugh, et al.
Published: (2025)
Asymptotically exact variational flows via involutive MCMC kernels
by: Xu, Zuheng, et al.
Published: (2025)
by: Xu, Zuheng, et al.
Published: (2025)
Entropy-MCMC: Sampling from Flat Basins with Ease
by: Li, Bolian, et al.
Published: (2023)
by: Li, Bolian, et al.
Published: (2023)
Efficient MCMC Sampling with Expensive-to-Compute and Irregular Likelihoods
by: Rosato, Conor, et al.
Published: (2025)
by: Rosato, Conor, et al.
Published: (2025)
Similar Items
-
Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
by: Jiang, Minhui, et al.
Published: (2024) -
Safe Linear Bandits over Unknown Polytopes
by: Gangrade, Aditya, et al.
Published: (2022) -
Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025) -
Maxout Polytopes
by: Balakin, Andrei, et al.
Published: (2025) -
Introducing Graph Learning over Polytopic Uncertain Graph
by: Kishida, Masako, et al.
Published: (2024)