← Search

Ally Yalei Du

3 accepted papers

2025

Misspecified $Q$-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error

ICLR 2025poster

The recent work by Dong and Yang (2023) showed for misspecified sparse linear bandits, one can obtain an $O(\epsilon)$-optimal policy using a polynomial number of samples when the sparsity is a constant, where $\epsilon$ is the misspecification error. This result is in sharp contrast to misspecified…

Cited by 1SourcePDFScholar
2025

Tuning Algorithmic and Architectural Hyperparameters in Graph-Based Semi-Supervised Learning with Provable Guarantees

UAI 2025

Graph-based semi-supervised learning is a powerful paradigm in machine learning for modeling and exploiting the underlying graph structure that captures the relationship between labeled and unlabeled data. A large number of classical as well as modern deep learning based algorithms have been propose

Cited by 0SourcePDFScholar