arXiv (All)
open access
Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases
We revisit the problem of estimating $k$ linear regressors with self-selection bias in $d$ dimensions with the maximum selection criterion, as introduced by Cherapanamjeri, Daskalakis, Ilyas, and Zampetakis [CDIZ23, STOC'23]. Our main result is a $\mathrm{poly}(d, k, 1/\varepsilon) + (k \log k)^{O(k
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
- Sudakov Minoration for Unconditional Log-Concave Vectors#1115738
- Latent Order Bandits#629999
- Incremental Column Subset Selection via Conditional Determinantal Point Processes#1034369
- Free-Probabilistic State Evolution and Random Matrix Discrepancy#999518
- Machine Learning Methods Through the Lens of Infinite-Dimensional Lasso#634850
Record · ID 999649
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