arXiv (All)
open access
Sharp Structure-Agnostic Minimax Risk for Partial Linear Models
We characterize the sharp structure-agnostic minimax risk for coefficient estimation in the partial linear model when the outcome and treatment nuisances are learned by two distinct black-box learners, which resolves the open problem in double machine learning posed by Gu (2025). For each nuisance \
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
- A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learning#996846
- On the Reliability of Generative Augmentation: A Wasserstein-Based Theoretical and Empirical Study#821345
- Towards Optimal Inventory Control under Censored Demand: A Biased Sample-Average Approximation Approach#1144364
- Inference for H{ü}sler-Reiss block models#1062392
- Hybrid models of sparse and robust regression to solve heterogeneity problem in black pepper big data#5690
Record · ID 985398
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