Unverified50% confidenceFactExact time
For distribution families with quadratic potential functions or dimension equal to one, R equals 1 identically for any pair of endpoints, meaning the NGD path is exactly the shortest path.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor non-quadratic distribution families with bounded third-order skewness and finite Fisher–Rao diameter, R is bounded by a constant independent of dimension d.68% similarUnverifiedUnder a per-step Fisher chord budget constraint, NGD asymptotically requires at least R times more iteration steps than an optimizer advancing along the Fisher–Rao geodesic.68% similarUnverifiedRRF对各路检索的原始分数分布不敏感，相比简单的线性加权在混合检索场景中更加鲁棒63% similarUnverified早停在优化角度上等价于限制参数从初始化点出发的移动距离，与L2正则化具有等价性63% similarUnverifiedNew shortest path algorithms have proven that the SSSP problem can be solved in complexity below O(m + n log n) under specific graph models.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/983525API
curl https://kongchang.com/api/v1/knowledge/claims/983525MCP
get_claim(id=983525)