arXiv (All)
open access
Scalable Minimum-Volume Simplex Estimation with Non-asymptotic Analysis
We study the estimation of a $K$-dimensional simplex from $N$ i.i.d.\ points sampled uniformly from its interior; the observations are convex combinations of $K+1$ unknown prototypes. Existing polynomial-time estimators need cubic per-sample work or $O(NK)$ storage and are impractical at $N\sim 10^6
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
- Signed random Fourier features for fast density estimation with indefinite kernels#794074
- Signed random Fourier features for fast density estimation with indefinite kernels#790055
- Estimation of multiple mean vectors in high dimension#1014458
- Non-stationary Gaussian random fields on hypersurfaces: Sampling and strong error analysis#629736
- Non-stationary Gaussian random fields on hypersurfaces: Sampling and strong error analysis#627874
Record · ID 1061214
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