AINeutralarXiv – CS AI · 3h ago5/10
🧠
The Optimal Sample Complexity of Linear Contracts
Researchers have proven optimal sample complexity for learning linear contracts in offline settings, showing that Empirical Utility Maximization requires only O(ln(1/δ)/ε²) samples to approximate optimal contracts. This result matches theoretical lower bounds and establishes uniform convergence guarantees across all linear contracts.