no code implementations • 8 Apr 2022 • Mitas Ray, Dmitriy Drusvyatskiy, Maryam Fazel, Lillian J. Ratliff
This paper studies the problem of expected loss minimization given a data distribution that is dependent on the decision-maker's action and evolves dynamically in time according to a geometric decay process.
no code implementations • 23 Dec 2020 • Mitas Ray, Omid Sadeghi, Lillian J. Ratliff, Maryam Fazel
We study the problem of online resource allocation, where multiple customers arrive sequentially and the seller must irrevocably allocate resources to each incoming customer while also facing a procurement cost for the total allocation.
no code implementations • 22 May 2018 • Vidya Muthukumar, Mitas Ray, Anant Sahai, Peter L. Bartlett
We introduce algorithms for online, full-information prediction that are competitive with contextual tree experts of unknown complexity, in both probabilistic and adversarial settings.