跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2602.03999 · v3

Functional Stochastic Localization

首次提交 2026-02-04 04:34
版本更新 2026-11-12 00:11
雷达观测 2026-11-13 14:16
arXiv ↗PDF ↗

摘要

Eldan's stochastic localization is a probabilistic construction that has proved instrumental to modern breakthroughs in high-dimensional geometry and the design of sampling algorithms. Motivated by sampling under non-Euclidean geometries and the mirror descent algorithm in optimization, we develop a functional generalization of Eldan's process that replaces Gaussian regularization with regularization by any positive integer multiple of a log-Laplace transform. We further give a mixing time bound on the Markov chain induced by our localization process, which holds if our target distribution satisfies a functional Poincaré inequality. Finally, we apply our framework to differentially private convex optimization in ℓp\ell_p norms for p∈[1,2)p \in [1, 2), where we improve state-of-the-art query complexities in a zeroth-order model.

作者备注:Fixed error in previous version

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-12 00:11 · 最新观测版本

Functional Stochastic Localization

Eldan's stochastic localization is a probabilistic construction that has proved instrumental to modern breakthroughs in high-dimensional geometry and the design of sampling algorithms. Motivated by sampling under non-Euclidean geometries and the mirror descent algorithm in optimization, we develop a functional generalization of Eldan's process that replaces Gaussian regularization with regularization by any positive integer multiple of a log-Laplace transform. We further give a mixing time bound on the Markov chain induced by our localization process, which holds if our target distribution satisfies a functional Poincaré inequality. Finally, we apply our framework to differentially private convex optimization in ℓp\ell_p norms for p∈[1,2)p \in [1, 2), where we improve state-of-the-art query complexities in a zeroth-order model.

查看此版本解读 →查看此版本原文 ↗