← Search

Lie He

8 accepted papers

2025

Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective

ICML 2025poster

This paper considers the sample-efficiency of preference learning, which models and predicts human choices based on comparative judgments. The minimax optimal estimation error rate $\Theta(d/n)$ in classical estimation theory requires that the number of samples $n$ scales linearly with the dimension…

Cited by 0SourcePDFScholar
2022

Byzantine-Robust Learning on Heterogeneous Datasets via Bucketing

ICLR 2022spotlight

In Byzantine robust distributed or federated learning, a central server wants to train a machine learning model over data distributed across multiple workers. However, a fraction of these workers may deviate from the prescribed algorithm and send arbitrary messages. While this problem has received s…

2021

Learning from History for Byzantine Robust Optimization

ICML 2021spotlight

Byzantine robustness has received significant attention recently given its importance for distributed and federated learning. In spite of this, we identify severe flaws in existing algorithms even when the data across the participants is identically distributed. First, we show realistic examples whe…

2021

RelaySum for Decentralized Deep Learning on Heterogeneous Data

NeurIPS 2021poster

In decentralized machine learning, workers compute model updates on their local data. Because the workers only communicate with few neighbors without central coordination, these updates propagate progressively over the network. This paradigm enables distributed training on networks without all-to-al…