SHEAP introduces a GPU-accelerated JAX framework for AGN spectral decomposition that achieves ~100x speedup over pPXF with 85-100% parameter agreement within 0.3 dex on four test samples.
Annual Conference Computational Learning Theory , year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
In this paper, we revisit the recently established theoretical guarantees for the convergence of the Langevin Monte Carlo algorithm of sampling from a smooth and (strongly) log-concave density. We improve the existing results when the convergence is measured in the Wasserstein distance and provide further insights on the very tight relations between, on the one hand, the Langevin Monte Carlo for sampling and, on the other hand, the gradient descent for optimization. Finally, we also establish guarantees for the convergence of a version of the Langevin Monte Carlo algorithm that is based on noisy evaluations of the gradient.
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Langevin AIS for multimodal targets has time complexity quadratic in the inverse temperature.
citing papers explorer
-
Convergence of Langevin AIS for multimodal distributions
Langevin AIS for multimodal targets has time complexity quadratic in the inverse temperature.