Proximal sampler with approximate RGO from log-concave Renyi results yields relative Fisher information complexity for non-log-concave sampling that matches log-concave dimension dependence, plus a converse reduction.
Proceedings of Thirty Third Conference on Learning Theory , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity of Non-Log-Concave Sampling in Fisher Information
Proximal sampler with approximate RGO from log-concave Renyi results yields relative Fisher information complexity for non-log-concave sampling that matches log-concave dimension dependence, plus a converse reduction.