Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Optimally Pacing Budget Spending and Learning
Mark Braverman, Jingyi Liu, Jieming Mao +2
We establish near-optimal regret bounds for budget-constrained online learning against arbitrary classes of budget-pacing experts in the adversarial setting. In particular, given a…
cs.DS2026
Additively Competitive Secretaries
Mohammad Mahdian, Jieming Mao, Enze Sun +2
In the secretary problem, a set of secretary candidates arrive in a uniformly random order and reveal their values one by one. A company, who can only hire one candidate and hopes…