A linear-time algorithm samples confined equilateral polygons via combinatorial sampling of a symplectic moment polytope, yielding explicit distance formulas and a curvature conjecture.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Deterministic envelopes decouple stochastic-gradient noise from taming in SGLD, splitting stationary error into oracle-dependent bias and deterministic stabilization error, with a hybrid soft-hard design for far tails.
The historical sequence of papal names is consistent with a random-copying process with innovation, as predicted by Ewens sampling theory and the Chinese restaurant process.
citing papers explorer
-
Direct Sampling of Confined Polygons in Linear Time
A linear-time algorithm samples confined equilateral polygons via combinatorial sampling of a symplectic moment polytope, yielding explicit distance formulas and a curvature conjecture.
-
Deterministic Envelopes for Tamed SGLD: Decoupling Stochastic-Gradient Noise and Localizing Taming
Deterministic envelopes decouple stochastic-gradient noise from taming in SGLD, splitting stationary error into oracle-dependent bias and deterministic stabilization error, with a hybrid soft-hard design for far tails.
-
Quo nomine vis vocari? A random-copying model explains the temporal sequence of papal names
The historical sequence of papal names is consistent with a random-copying process with innovation, as predicted by Ewens sampling theory and the Chinese restaurant process.