Researchers have characterized the sharp structure-agnostic minimax risk for coefficient estimation in partial linear models. This work resolves an open problem in double machine learning by defining the available learner by approximation-error and stochastic-error budgets. The findings indicate that standard double machine learning may overstate the intrinsic difficulty of target estimation and suggest a principle for learner selection that balances approximation and stochastic complexity across nuisance learners. AI
RANK_REASON The cluster contains a single academic paper published on arXiv. [lever_c_demoted from research: ic=1 ai=1.0]
- alphaXiv
- arXiv
- CatalyzeX Code Finder for Papers
- DagsHub
- Georgetown University
- Gotit.pub
- Hugging Face
- Influence Flower
- Rademacher Complexity
- ScienceCast
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →