6 papers
Representative Action Selection for Large Action Space Bandit Families
Quan Zhou, Mark Kozdoba, Shie Mannor
We study the problem of selecting a subset from a large action space shared by a family of bandits. In many natural situations, while the nominal set of actions is large, actions a…
Representative Action Selection for Large Action Space: From Bandits to MDPs
Quan Zhou, Shie Mannor
We study the problem of selecting a small, representative action subset from an extremely large action space shared across a family of reinforcement learning (RL) environments -- a…
Explore and Establish Synergistic Effects Between Weight Pruning and Coreset Selection in Neural Network Training
Weilin Wan, Fan Yi, Weizhong Zhang +2
Modern deep neural networks rely heavily on massive model weights and training samples, incurring substantial computational costs. Weight pruning and coreset selection are two emer…
From Minimax Optimal Importance Sampling to Uniformly Ergodic Importance-tempered MCMC
Quan Zhou
We make two closely related theoretical contributions to the use of importance sampling schemes. First, for independent sampling, we prove that the minimax optimal trial distributi…
Optimisation Strategies for Ensuring Fairness in Machine Learning: With and Without Demographics
Quan Zhou
Ensuring fairness has emerged as one of the primary concerns in AI and its related algorithms. Over time, the field of machine learning fairness has evolved to address these issues…
Importance is Important: Generalized Markov Chain Importance Sampling Methods
Guanxun Li, Aaron Smith, Quan Zhou
We show that for any multiple-try Metropolis algorithm, one can always accept the proposal and evaluate the importance weight that is needed to correct for the bias without extra c…