Moritz Hardt

Circumventing the Computational Hardness of Computational Arbitrage

This work formalizes computational arbitrage as an allocation problem and proves that it is generally NP-hard, but shows that the optimal allocation can be computed efficiently under a natural diminishing-returns condition on how model performance scales with inference spending.