arXiv (All)
open access
A proximal gradient algorithm for composite log-concave sampling
We propose an algorithm to sample from composite log-concave distributions over $\mathbb{R}^d$, i.e., densities of the form $π\propto e^{-f-g}$, assuming access to gradient evaluations of $α_f$-convex $f$ and a restricted Gaussian oracle (RGO) for $α_g$-convex $g$, where $α_g \ge 0$. The latter requ
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A proximal gradient algorithm for composite log-concave sampling#178871
- Reflected Proximal Dynamics for Accelerated High-Accuracy Log-Concave Sampling#1327838
- Sampling theorems for inverse problems on Riemannian manifolds#1069669
- Accelerated Sampling with the Inertial Langevin Algorithm#972393
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model#1078286
Record · ID 1356043
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive