arXiv (All)
open access
Estimators from Convex Geometries of the Simplex
We unify several geometries of the probability simplex under one principle, their generation by a potential: convex potentials produce the Bregman divergences and dually flat structures of information geometry, and the exponentially concave potentials of Pal and Wong produce the logarithmic divergen
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tight Sample Bounds for Renyi and Min-Entropy Estimation#625535
- Tight Sample Bounds for Renyi and Min-Entropy Estimation#623262
- Scalable Minimum-Volume Simplex Estimation with Non-asymptotic Analysis#1061214
- Lower Bounds for Moments of $L$-functions#927459
- Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture#1105447
Record · ID 1356887
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive