ConceptMinimax complexity
Minimax Complexity
A theoretical framework for measuring the worst-case performance of algorithms, used to establish lower bounds on sample complexity and to assess whether an algorithm is optimal.
Timeline (last 90 days)
Nov 11
Minimax complexity is a theoretical framework for measuring an algorithm's performance in the worst case; an algorithm is called minimax optimal if its sample complexity matches the lower bound up to order.
Unverified50%