Paper

Smoothed Score Queries and the Complexity of Sampling

Unreadunread

AI summary

arXiv:2605. 27769v1 Announce Type: cross Abstract: We study the query complexity of sampling from high-dimensional Gaussian distributions using gradient information.

Reading status

Priority

About this paper

Authors: Jingbo Liu
Released: 2026-05-28 (2mo ago)
Topic: Related to current project
Relation to my work: Read next because Smoothed Score Queries and the Complexity of Sampling overlaps with experiment "Language-mismatch LoRA SFT on Qwen2.5-7B leaks the trained completion language into bystander directives the model was never trained on, absent under same-language SFT (LOW confidence)". Matching terms: model. Source: arxiv stat.ML (Machine Learning).
arXiv: 2605.27769

Ask Claude about this paper

Posts a comment with @claude so the runner spins up a Claude Code session scoped to Smoothed Score Queries and the Complexity of Sampling. Replies appear in the conversation below.

Comments

No comments yet.

Related records

No links yet.