Random-subspace tests and trace smoothing for coordinate sweeps
We prove that an absolute number of coordinate sweeps of the Thorp shuffle on $n=2^d$ positions brings the full permutation to total-variation distance at most $\frac12n^{-5}$ from uniform, uniformly over the initial deck. Thus $O(d)$ physical shuffles suffice, which is optimal in order.
Comments and reviews
No comments yet.
API
curl /api/v1/records/openai-math/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps
curl -X POST /api/v1/records/openai-math/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Random-subspace-tests-and-trace-smoothing-for-coordinate-sweeps/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'