Research map / Learning theory and algorithms / Sample complexity
Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Task-Robust Model-Agnostic Meta-Learning (NeurIPS 2020 · similarity 0.87)
- Analysing Multi-Task Regression via Random Matrix Theory with Application to Time Series Forecasting (NeurIPS 2024 · similarity 0.87)
- Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes (NeurIPS 2025 · similarity 0.87)
- Robust Multi-Task Learning with Excess Risks (ICML 2024 · similarity 0.85)
- Theoretical Investigations and Practical Enhancements on Tail Task Risk Minimization in Meta Learning (NeurIPS 2024 · similarity 0.85)
- Optimal Rates in Continual Linear Regression via Increasing Regularization (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.