Cited By
View all- Yang JLi PIslam MRen S(2024)Online Allocation with Replenishable Budgets: Worst Case and BeyondProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36390308:1(1-34)Online publication date: 21-Feb-2024
- Yang JRen SWilliams BChen YNeville J(2023)Learning-assisted algorithm unrolling for online optimization with budget constraintsProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i9.26278(10771-10779)Online publication date: 7-Feb-2023
- Guo HWei HLiu XYing LKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Online convex optimization with hard constraintsProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602909(36426-36439)Online publication date: 28-Nov-2022
- Show More Cited By