Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Derives Õ(d β² A² / ε⁴) oracle complexity for AIS estimating normalizing constant Z to relative error ε and introduces reverse diffusion sampler for geometric paths with large action.
citing papers explorer
-
Deterministic Volume Estimation of Truncated Hypercubes
Deterministic (1+ε)-approximation algorithm for the volume of the unit hypercube truncated by k sums-of-univariate-convex constraints, running in poly_k(n, 1/ε, L, L_o) time.
-
Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond
Derives Õ(d β² A² / ε⁴) oracle complexity for AIS estimating normalizing constant Z to relative error ε and introduces reverse diffusion sampler for geometric paths with large action.