activity
20232026
most citedOnline Conversion with Switching Costs: Robust and Learning-Augmented Algorithms

4 citations · 17 across the 34 of their papers we have counts for

collaborators
Showing 2024Show all

15 papers · 1 filter

cs.LG2024★ 1 cited

Towards Environmentally Equitable AI

Mohammad Hajiesmaili, Shaolei Ren, Ramesh K. Sitaraman +1

The skyrocketing demand for artificial intelligence (AI) has created an enormous appetite for globally deployed power-hungry servers. As a result, the environmental footprint of AI…

cs.LG2024

Safe Exploitative Play with Untrusted Type Beliefs

Tongxin Li, Tinashe Handina, Shaolei Ren +1

The combination of the Bayesian game and learning has a rich history, with the idea of controlling a single agent in a system composed of multiple agents with unknown behaviors giv…

cs.GT2024

Online Budgeted Matching with General Bids

Jianyi Yang, Pengfei Li, Adam Wierman +1

Online Budgeted Matching (OBM) is a classic problem with important applications in online advertising, online service matching, revenue management, and beyond. Traditional online a…

cs.LG2024★ 2 cited

Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization

Chenbei Lu, Laixi Shi, Zaiwei Chen +2

Reinforcement Learning (RL) algorithms are known to suffer from the curse of dimensionality, which refers to the fact that large-scale problems often lead to exponentially high sam…

cs.LG2024

Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data

Chengrui Qu, Laixi Shi, Kishan Panaganti +2

Online Reinforcement learning (RL) typically requires high-stakes online interaction data to learn a policy for a target task. This prompts interest in leveraging historical data t…

math.OC2024

Optimal Decentralized Smoothed Online Convex Optimization

Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman

We study the multi-agent Smoothed Online Convex Optimization (SOCO) problem, where agents interact through a communication graph. In each round, each agent receives a stron…

cs.LG2024

Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning

Laixi Shi, Jingchu Gai, Eric Mazumdar +2

Standard multi-agent reinforcement learning (MARL) algorithms are vulnerable to sim-to-real gaps. To address this, distributionally robust Markov games (RMGs) have been proposed to…

cs.LG2024

Decentralized Best-Response-Based Learning in Two-Player Zero-Sum Stochastic Games: A Finite-Sample Analysis

Zaiwei Chen, Kaiqing Zhang, Eric Mazumdar +2

We present a finite-sample analysis of decentralized learning in two-player zero-sum matrix games and stochastic games, with a focus on best-response-based learning algorithms. In…

cs.LG2024

Distributionally Robust Constrained Reinforcement Learning under Strong Duality

Zhengfei Zhang, Kishan Panaganti, Laixi Shi +3

We study the problem of Distributionally Robust Constrained RL (DRC-RL), where the goal is to maximize the expected reward subject to environmental distribution shifts and constrai…

cs.LG2024

Enhancing Efficiency of Safe Reinforcement Learning via Sample Manipulation

Shangding Gu, Laixi Shi, Yuhao Ding +4

Safe reinforcement learning (RL) is crucial for deploying RL agents in real-world applications, as it aims to maximize long-term rewards while satisfying safety constraints. Howeve…

cs.LG2024

Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty

Laixi Shi, Eric Mazumdar, Yuejie Chi +1

To overcome the sim-to-real gap in reinforcement learning (RL), learned policies must maintain robustness against environmental uncertainties. While robust RL has been widely studi…

cs.LG2024

Model-Free Robust -Divergence Reinforcement Learning Using Both Offline and Online Data

Kishan Panaganti, Adam Wierman, Eric Mazumdar

The robust -regularized Markov Decision Process (RRMDP) framework focuses on designing control policies that are robust against parameter uncertainties due to mismatches between…

cs.DC2024★ 1 cited

Carbon Connect: An Ecosystem for Sustainable Computing

Benjamin C. Lee, David Brooks, Arthur van Benthem +10

Computing is at a moment of profound opportunity. Emerging applications -- such as capable artificial intelligence, immersive virtual realities, and pervasive sensor systems -- dri…

math.OC2024

Characterizing Controllability and Observability for Systems with Locality, Communication, and Actuation Constraints

Lauren Conger, Yiheng Lin, Adam Wierman +1

This paper presents a closed-form notion of controllability and observability for systems with communication delays, actuation delays, and locality constraints. The formulation red…

cs.DS2024

Chasing Convex Functions with Long-term Constraints

Adam Lechowicz, Nicolas Christianson, Bo Sun +4

We introduce and study a family of online metric problems with long-term constraints. In these problems, an online player makes decisions in a metric space t…