Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems.
Omid SadeghiReza EghbaliMaryam FazelPublished in: CoRR (2019)
Keyphrases
- optimization problems
- related problems
- orders of magnitude
- practical problems
- continuous domains
- difficult problems
- test problems
- benchmark problems
- online learning
- np complete
- combinatorial optimization
- approximate solutions
- problems in computer vision
- significant improvement
- computational geometry
- real time
- learning algorithm
- hard problems
- convergence rate
- computationally efficient
- computational cost
- heuristic methods
- search methods
- theoretical analysis
- worst case
- computational complexity
- theoretical guarantees
- objective function