Smoothed-score queries to the resolvent of a Gaussian precision matrix yield an O((log κ) log(1/δ)) query sampler for TV error δ and an Ω(log κ) bit lower bound, improving the condition-number dependence from √κ.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Smoothed Score Queries and the Complexity of Sampling
Smoothed-score queries to the resolvent of a Gaussian precision matrix yield an O((log κ) log(1/δ)) query sampler for TV error δ and an Ω(log κ) bit lower bound, improving the condition-number dependence from √κ.