Research map / Learning theory and algorithms / Sample complexity
The Optimal Sample Complexity of Linear Contracts
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
- Learning Optimal Contracts: How to Exploit Small Action Spaces (ICLR 2024 · similarity 0.88)
- Contract Design Under Approximate Best Responses (ICML 2025 · similarity 0.86)
- Contracting with a Learning Agent (NeurIPS 2024 · similarity 0.86)
- Paid with Models: Optimal Contract Design for Collaborative Machine Learning (AAAI 2025 · similarity 0.85)
- Near-Optimal Sample Complexity for MDPs via Anchoring (ICML 2025 · similarity 0.85)
- Multidimensional Bayesian Utility Maximization: Tight Approximations to Welfare (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.