Mayukh Das
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mayukh Das has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Adithya S Kolavi
Microsoft Research, Bengaluru, India
1 shared publication - Ajay Manchepalli
Microsoft Research, Bengaluru, India
1 shared publication - Bo Qiao
Microsoft, Beijing, China
1 shared publication - Chao Du
Microsoft, Beijing, China
1 shared publication - Chetan Bansal
Microsoft, Redmond, Washington, USA
1 shared publication - Dongmei Zhang
Microsoft Research Asia, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
INLAY: Preemptive, In-Context Intelligence for Casual Web Browsing
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessINLAY: Preemptive, In-Context Intelligence for Casual Web Browsing
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 4939-4947
COIN: Chance-Constrained Imitation Learning for Safe and Adaptive Resource Oversubscription under Uncertainty
We address the real problem of safe, robust, adaptive resource oversubscription in uncertain environments with our proposed novel technique of chance-constrained imitation learning. Our objective is to enhance resource efficiency while ensuring safety against congestion risk. Traditional supervised or forecasting models are ineffective in learning adaptive oversubscription policies, and conventional online optimization or reinforcement learning is difficult to deploy on real systems. Offline policy learning methods, such as Imitation Learning (IL) can leverage historical resource utilization telemetry data to learn effective policies if we can ensure robustness and safety from the underlying uncertainty in the domain, and thus the data. Our work investigates the nature of this uncertainty, how it can be quantified and proposes a novel chance-constrained IL that implicitly models such uncertainty in a principled manner via additional knowledge in the form of stochastic constraints on the associated risk, to learn provably safe and robust policies. We show empirically a substantial improvement (~ 3-4×) in capacity efficiency and congestion safety in test as well as real deployments.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 4939-4947
Open AccessCOIN: Chance-Constrained Imitation Learning for Safe and Adaptive Resource Oversubscription under Uncertainty
We address the real problem of safe, robust, adaptive resource oversubscription in uncertain environments with our proposed novel technique of chance-constrained imitation learning. Our objective is to enhance resource efficiency while ensuring safety against congestion risk. Traditional supervised or forecasting models are ineffective in learning adaptive oversubscription policies, and conventional online optimization or reinforcement learning is difficult to deploy on real systems. Offline policy learning methods, such as Imitation Learning (IL) can leverage historical resource utilization telemetry data to learn effective policies if we can ensure robustness and safety from the underlying uncertainty in the domain, and thus the data. Our work investigates the nature of this uncertainty, how it can be quantified and proposes a novel chance-constrained IL that implicitly models such uncertainty in a principled manner via additional knowledge in the form of stochastic constraints on the associated risk, to learn provably safe and robust policies. We show empirically a substantial improvement (~ 3-4×) in capacity efficiency and congestion safety in test as well as real deployments.