62 citations · 146 across the 11 of their papers we have counts for
11 papers
Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation
Yifei Min, Jiafan He, Tianhao Wang +1
We study multi-agent reinforcement learning in the setting of episodic Markov decision processes, where multiple agents cooperate via communication through a central server. We pro…
Finding Regularized Competitive Equilibria of Heterogeneous Agent Macroeconomic Models with Reinforcement Learning
Ruitu Xu, Yifei Min, Tianhao Wang +3
We study a heterogeneous agent macroeconomic model with an infinite number of households and firms competing in a labor market. Each household earns income and engages in consumpti…
Rethinking Semi-Supervised Medical Image Segmentation: A Variance-Reduction Perspective
Chenyu You, Weicheng Dai, Yifei Min +5
For medical image segmentation, contrastive learning is the dominant practice to improve the quality of visual representations by contrasting semantically similar and dissimilar pa…
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits
Jiafan He, Tianhao Wang, Yifei Min +1
We study federated contextual linear bandits, where agents cooperate with each other to solve a global contextual linear bandit problem with the help of a central server. We co…
Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes
Miao Lu, Yifei Min, Zhaoran Wang +1
We study offline reinforcement learning (RL) in partially observable Markov decision processes. In particular, we aim to learn an optimal policy from a dataset collected by a behav…
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets
Yifei Min, Tianhao Wang, Ruitu Xu +3
We study a Markov matching market involving a planner and a set of strategic agents on the two sides of the market. At each step, the agents are presented with a dynamical context,…
Learning Stochastic Shortest Path with Linear Function Approximation
Yifei Min, Jiafan He, Tianhao Wang +1
We study the stochastic shortest path (SSP) problem in reinforcement learning with linear function approximation, where the transition kernel is represented as a linear mixture of…
Variance-Aware Off-Policy Evaluation with Linear Function Approximation
Yifei Min, Tianhao Wang, Dongruo Zhou +1
We study the off-policy evaluation (OPE) problem in reinforcement learning with linear function approximation, which aims to estimate the value function of a target policy based on…
Multiple Descent: Design Your Own Generalization Curve
Lin Chen, Yifei Min, Mikhail Belkin +1
This paper explores the generalization loss of linear regression in variably parameterized families of models, both under-parameterized and over-parameterized. We show that the gen…
The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization
Yifei Min, Lin Chen, Amin Karbasi
Adversarial training has shown its ability in producing models that are robust to perturbations on the input data, but usually at the expense of decrease in the standard accuracy.…
More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Models
Lin Chen, Yifei Min, Mingrui Zhang +1
Despite remarkable success in practice, modern machine learning models have been found to be susceptible to adversarial attacks that make human-imperceptible perturbations to the d…