activity
20142023
most citedByzantine-Robust Distributed Learning: Towards Optimal Statistical Rates

610 citations · 1.2k across the 24 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.LG2021★ 4 cited

Wide Neural Networks Forget Less Catastrophically

Seyed Iman Mirzadeh, Arslan Chaudhry, Dong Yin +4

A primary focus area in continual learning research is alleviating the "catastrophic forgetting" problem in neural networks by designing new algorithms that are more robust to the…

cs.CR2021★ 1 cited

Morse-STF: Improved Protocols for Privacy-Preserving Machine Learning

Qizhi Zhang, Sijun Tan, Lichun Li +3

Secure multi-party computation enables multiple mutually distrusting parties to perform computations on data without revealing the data itself, and has become one of the core techn…

cs.LG2021★ 2 cited

Efficient Local Planning with Linear Function Approximation

Dong Yin, Botao Hao, Yasin Abbasi-Yadkori +2

We study query and computationally efficient planning algorithms with linear function approximation and a simulator. We assume that the agent only has local access to the simulator…

cs.LG2021★ 1 cited

An Instance-Dependent Simulation Framework for Learning with Label Noise

Keren Gu, Xander Masotto, Vandana Bachani +3

We propose a simulation framework for generating instance-dependent noisy labels via a pseudo-labeling paradigm. We show that the distribution of the synthetic noisy labels generat…

cs.LG2021★ 2 cited

Improved Regret Bound and Experience Replay in Regularized Policy Iteration

Nevena Lazic, Dong Yin, Yasin Abbasi-Yadkori +1

In this work, we study algorithms for learning in infinite-horizon undiscounted Markov decision processes (MDPs) with function approximation. We first show that the regret analysis…