Optimal rates for non-log-concave sampling and log-partition estimation are sometimes equal to or faster than optimization rates, but polynomial-time algorithms fall short of near-optimal performance.
Hence, the constructed counterexamples do not directly apply to Fd,m,Bm,d
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation
Optimal rates for non-log-concave sampling and log-partition estimation are sometimes equal to or faster than optimization rates, but polynomial-time algorithms fall short of near-optimal performance.