Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Near-Linear Accuracy Bounds for Moreau--Yosida Unadjusted Langevin Sampling
Yuchen Xin, Zhihua Zhang
We establish near-linear accuracy bounds for the classical Moreau--Yosida unadjusted Langevin algorithm (MYULA). The target is , where i…
cs.LG2026
Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling
Yuchen Xin, Zhihua Zhang
We study the Moreau--Yosida unadjusted Langevin algorithm (MYULA) for the nonsmooth composite target \[ π(dx)\propto \exp\{-f(x)-g(x)\}\,dx, \qquad x\in\mathbb R^d, \] where \(f\)…
cs.LG2025
Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems
Jingxin Zhan, Yuchen Xin, Chenjie Sun +1
We consider a common case of the combinatorial semi-bandit problem, the -set semi-bandit, where the learner exactly selects arms from the total arms. In the adversarial…