← Search

Runzhe Wang

6 accepted papers

2025

MATH-Perturb: Benchmarking LLMs' Math Reasoning Abilities against Hard Perturbations

ICML 2025poster

Large language models have demonstrated impressive performance on challenging mathematical reasoning tasks, which has triggered the discussion of whether the performance is achieved by true reasoning capability or memorization. To investigate this question, prior work has constructed mathematical be…

2025

Towards Understanding Text Hallucination of Diffusion Models via Local Generation Bias

ICLR 2025poster

Score-based diffusion models have achieved incredible performance in generating realistic images, audio, and video data. While these models produce high-quality samples with impressive details, they often introduce unrealistic artifacts, such as distorted fingers or hallucinated texts with no meanin…

Cited by 0SourcePDFScholar
2024

The Marginal Value of Momentum for Small Learning Rate SGD

ICLR 2024poster

Momentum is known to accelerate the convergence of gradient descent in strongly convex settings without stochastic gradient noise. In stochastic optimization, such as training neural networks, folklore suggests that momentum may help deep learning optimization by reducing the variance of the stochas…

Cited by 12SourcePDFScholar
2021

Going Beyond Linear RL: Sample Efficient Neural Function Approximation

NeurIPS 2021poster

Deep Reinforcement Learning (RL) powered by neural net approximation of the Q function has had enormous empirical success. While the theory of RL has traditionally focused on linear function approximation (or eluder dimension) approaches, little is known about nonlinear RL with neural net approximat…

Cited by 10SourcePDFScholar
2021

Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Bias

NeurIPS 2021poster

The generalization mystery of overparametrized deep nets has motivated efforts to understand how gradient descent (GD) converges to low-loss solutions that generalize well. Real-life neural networks are initialized from small random values and trained with cross-entropy loss for classification (unli…

Cited by 101SourcePDFScholar
2021

Optimal Gradient-based Algorithms for Non-concave Bandit Optimization

NeurIPS 2021poster

Bandit problems with linear or concave reward have been extensively studied, but relatively few works have studied bandits with non-concave reward. This work considers a large family of bandit problems where the unknown underlying reward function is non-concave, including the low-rank generalized li…

Cited by 18SourcePDFScholar