Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime.
Hilal AsiVitaly FeldmanTomer KorenKunal TalwarPublished in: ICML (2023)
Keyphrases
- optimization problems
- discrete optimization
- computationally expensive
- real time
- learning algorithm
- stochastic search
- online learning
- theoretical analysis
- graph theory
- optimization methods
- times faster
- combinatorial optimization
- recently developed
- convex optimization problems
- database
- optimization approaches
- global optimization
- privacy preserving
- orders of magnitude
- computational cost
- significant improvement
- computational complexity
- website