Open Source
Anchored Stein Variational Gradient Descent Algorithm for Non-smooth Sampling
arXiv stat.ML0 views
arXiv:2610.36018v1 Announce Type: new Abstract: We introduce a Stein variational framework for sampling from a target density $p\propto e^{-U}$ when the target potential $U$ is possibly non-smooth. The key idea is to introduce a smoother reference potential $U_0$ and the anchor weight $a=e^{U-U_0}$. The resulting anchored Stein variational gradient descent (SVGD) algorithm is able to target $p\propto e^{-U}$ without computing the gradient of $U$ and include standard SVGD as a special case. In particular, we allow the target potential $U$ to be locally Lipschitz while the reference potential $U_0$ is continuously differentiable, along with other suitable assumptions. Under this low regularity regime, we establish a Kullback-Leibler first variation formula for anchored perturbations, identify the corresponding steepest descent direction in the reproducing kernel Hilbert space and prove a nonasymptotic convergence bound for the anchored SVGD algorithm in terms of an anchored kernelized Stein discrepancy. Finally, we also provide guidance on constructing a suitable reference potential $U_0$ based on $U$.
Source:https://arxiv.org/abs/2610.36018PreviousTextCloak: Safeguarding Data from Unauthorized LLM Fine-Tuning via RL-Driven Unlearnable ExamplesNextLearning on-the-fly quasi-stationarity diagnostics from low-dimensional surrogates
Related posts

Forecasting the U.S. Senate with Prediction Markets and Monte Carlo Simulations
0dev.to AI
VoiceStudio: open-source, fully-local ElevenLabs alternative
0Hacker News New
Show HN: X Mode – macOS-style window management for Omarchy
0Hacker News Show
Show HN: Orca Style Workspaces for Herdr
0Hacker News Show
Supermarket freezers across Europe hit by second suspected cyber-attack
0Hacker News
AWS FinOps Field Notes (2026-11-02): Eliminating Idle NAT Gateways & Unattached EIPs with Python
0dev.to AWS