Conceptio › Archive › arXiv (All)
arXiv (All) open access

Sharp Regret Bounds and a Task-Covariance Correction for Spectral Representation Learning

Tang, Dier et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
94a17g-1-3g-3i-2-6information-theorymachine-learning
Spectral features can remain optimal under strongly uneven task preferences when they retain the directions most useful to the tasks. In a local-task model, expected probing gain depends on the task prior only through its covariance $Λ$: with $B$ recording dependence between views, $k$ spectral feat
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

Record · ID 1116409
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