Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity.
Nick GravinEnze SunZhihao Gavin TangPublished in: FOCS (2023)
Keyphrases
- search algorithm
- greedy algorithms
- computational cost
- optimization problems
- worst case
- computational complexity
- decision problems
- related problems
- complexity analysis
- run times
- computational problems
- practical problems
- space complexity
- approximate solutions
- benchmark problems
- theoretical guarantees
- orders of magnitude
- online learning
- bayesian networks
- online convex optimization
- exact algorithms
- complexity bounds
- partial solutions
- np hard problems
- learning algorithm
- data mining algorithms
- computationally efficient
- data structure
- difficult problems
- exhaustive search
- test problems
- memory requirements
- high computational complexity
- computational geometry
- specific problems
- theoretical analysis
- lower complexity
- significant improvement
- objective function
- data mining