Skip to content

6 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Nearly Minimax Optimal Regret for Adversarial Linear Bandits with Strong Corruptions

We study adversarial linear bandits with strong corruption, in which an adaptive adversary chooses the reward vectors and a strong adversary corrupts each observed reward after seeing the learner's action, subject to a known total corruption budget $C$. Strong corruption breaks the importance-weighted reward estimates...

Qi-Wei Di, Quan-Quan Gu · 0 citations

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

A sharp analysis of KL-PCB (Zhao et al., 2026), showing that it achieves a sample complexity of $\tilde{O}(\eta SAC^{\pi^*}/\epsilon)$ under large regularization and a sample complexity of $\tilde{\Omega}(SAC^{\pi^*}/\epsilon^2)$ under small regularization.

Kaixuan Ji, Qi-Wei Di, He-Yang Zhao et al. · 4 citations · ⚡1
#machine learning Preprint Oct 2026

Muon Learns Facts Better: Understanding the Role of Spectral Orthogonalization

The Muon optimizer applies spectral orthogonalization to matrix-valued updates and has shown strong performance in large-scale neural network training, yet the mechanisms of this transformation in feature learning remain poorly understood. In this work, we investigate this question through a tractable factual-recall mo...

Xu-Heng Li, Qi-Wei Di, Yuan Cao et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Understanding Off- vs On-Policy Distillation: A Tale of Distinct Training Objectives

On-policy distillation (OPD) learns from teacher feedback on student-generated responses and has shown promise in reducing forgetting relative to supervised fine-tuning (SFT). However, its benefits and fragility remain incompletely understood. We study sequential distillation from multiple teachers, where the student m...

Qi-Wei Di, Xu-Heng Li, Kaixuan Ji et al. · 0 citations

Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity

We study multi-armed bandits (MAB) with multiple optimal arms, motivated by the fact that many practical decision making problems admit multiple correct answers. For $K$-armed bandits with $A$ optimal arms, we first provide a sharper analysis of previous sub-sampling algorithms (De Heide et al., 2021; Zhu and Nowak, 20...

Kaixuan Ji, Qi-Wei Di, Qing-Yue Zhao et al. · 0 citations
#machine learning Preprint Sep 2026

Saturation-Insensitive Dueling Bandits with General Function Approximation

SI-CDB is introduced, an algorithm that selects opponent arms using a carefully designed heuristic for arm selection that enables saturation-insensitive reward learning and recovers the near-optimal dependence for linear reward classes, eliminating the unfavorable $1/\sigma'(\cdot)$ factor.

Cheng-Gong Zhang, Xu-Heng Li, Qi-Wei Di et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.