Unverified50% confidenceFactExact time
The paper proves that when the true mixture measure satisfies the sub-Gaussian assumption, the unconstrained NPMLE achieves the minimax optimal rate log(n)/n under squared Hellinger distance.
1
Sources
50%
Confidence
Long-term
Relevance
10/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper controls the convergence rate of the NPMLE by sharply characterizing the bracketing entropy of finite Gaussian mixture classes under local Hellinger distance.72% similarUnverifiedThe paper derives that under the softmax retrieval framework, the evidence score margin required to maintain a fixed accuracy must grow at a rate of Ω(√log N), where N is the number of effective distractors rather than the context length.72% similarUnverifiedFor learning tasks operating on an intrinsic d*-dimensional submanifold, the paper proves that the optimal partition scaling can achieve the minimax nonparametric rate O(n^{-1/(d*+2)}√ln n).70% similarUnverifiedThe paper proves that there exist networks of constant depth and size Õ_{n,d}(p^{-9}ε^{-max{d/n,2}}log(1/δ)) that satisfy the probabilistic uniform approximation requirement with probability at least 1-δ.69% similarUnverifiedWhen the reward density is uniformly bounded away from zero, the paper establishes a root-n high-probability bound that holds simultaneously for all resolutions m and all Wasserstein orders p (1 ≤ p ≤ ∞), with the estimation error converging at the parametric rate n^{-1/2}.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1083921API
curl https://kongchang.com/api/v1/knowledge/claims/1083921MCP
get_claim(id=1083921)