arXiv (All)
open access
Generalization Bounds via Vector-Valued $L_p$ Correlation $V_α$
Understanding generalization of randomized learning algorithms remains a central challenge. Mutual-information and total-variation bounds provide complementary ways to quantify data--hypothesis dependence, but they can behave quite differently in high-dimensional regimes. We study a one-parameter fa
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
- Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors#1402182
- Sudakov Minoration for Unconditional Log-Concave Vectors#1115738
- UMVUE-Type Estimators under Bregman Losses#800018
- Sudakov minoration for unconditional log-concave vectors with negatively associated magnitudes#1104724
- A Majorization-Minimization Framework for Activity Detection in Mixed Near-and-Far-Field Random Access#1117974
Record · ID 1414030
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