In this paper, we study a class of online continuous optimization problems. At each round, the utility function is the sum of a weakly diminishing-returns (DR) submodular function and a concave function, certain cost associated with the action will occur, and the problem has total limited budget. Combining the two methods, the penalty function and Frank-Wolfe strategies, we present an online method to solve the considered problem. Choosing appropriate stepsize and penalty parameters, the performance of the online algorithm is guaranteed, that is, it achieves sub-linear regret bound and certain mild constraint violation bound in expectation.
Publications
- Article type
- Year
- Co-author
Year
![](/assets/img/article/article-lock.png)
Tsinghua Science and Technology 2024, 29 (6): 1667-1673
Published: 12 February 2024
Downloads:50
Total 1