Dongruo Zhou

Orcid: 0009-0005-3889-071X

According to our database1, Dongruo Zhou authored at least 61 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization.
Trans. Mach. Learn. Res., 2024

Return Augmented Decision Transformer for Off-Dynamics Reinforcement Learning.
CoRR, 2024

CoPS: Empowering LLM Agents with Provable Cross-Task Experience Sharing.
CoRR, 2024

Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds.
CoRR, 2024

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits.
CoRR, 2024

DPAdapter: Improving Differentially Private Deep Learning through Noise Tolerance Pre-training.
CoRR, 2024

DPAdapter: Improving Differentially Private Deep Learning through Noise Tolerance Pre-training.
Proceedings of the 33rd USENIX Security Symposium, 2024

Uncertainty-Aware Reward-Free Exploration with General Function Approximation.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Risk Bounds of Accelerated SGD for Overparameterized Linear Regression.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Efficient Reinforcement Learning through Uncertainties
PhD thesis, 2023

Provably efficient representation selection in Low-rank Markov Decision Processes: from online to offline RL.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes.
Proceedings of the International Conference on Machine Learning, 2023

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path.
Proceedings of the International Conference on Machine Learning, 2023

Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Learning Two-Player Mixture Markov Games: Kernel Function Approximation and Correlated Equilibrium.
CoRR, 2022

Bandit Learning with General Function Classes: Heteroscedastic Noise and Variance-dependent Regret Bounds.
CoRR, 2022

Learning Contextual Bandits Through Perturbed Rewards.
CoRR, 2022

Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning Two-Player Markov Games: Neural Function Approximation and Correlated Equilibrium.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum Optimization.
Proceedings of the International Conference on Machine Learning, 2022

Learning Neural Contextual Bandits through Perturbed Rewards.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Faster Perturbed Stochastic Gradient Methods for Finding Local Minima.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Linear Contextual Bandits with Adversarial Corruptions.
CoRR, 2021

Provably Efficient Representation Learning in Low-rank Markov Decision Processes.
CoRR, 2021

Batched Neural Bandits.
CoRR, 2021

Nearly Optimal Regret for Learning Adversarial MDPs with Linear Function Approximation.
CoRR, 2021

Almost Optimal Algorithms for Two-player Markov Games with Linear Function Approximation.
CoRR, 2021

Pure Exploration in Kernel and Neural Bandits.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Iterative Teacher-Aware Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Provably Efficient Reinforcement Learning with Linear Function Approximation under Adaptivity Constraints.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Variance-Aware Off-Policy Evaluation with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping.
Proceedings of the 38th International Conference on Machine Learning, 2021

Logarithmic Regret for Reinforcement Learning with Linear Function Approximation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Neural Thompson Sampling.
Proceedings of the 9th International Conference on Learning Representations, 2021

Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes.
Proceedings of the Conference on Learning Theory, 2021

2020
Gradient descent optimizes over-parameterized deep ReLU networks.
Mach. Learn., 2020

Stochastic Nested Variance Reduction for Nonconvex Optimization.
J. Mach. Learn. Res., 2020

Provable Multi-Objective Reinforcement Learning with Generative Models.
CoRR, 2020

Minimax Optimal Reinforcement Learning for Discounted MDPs.
CoRR, 2020

Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networks.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Neural Contextual Bandits with UCB-based Exploration.
Proceedings of the 37th International Conference on Machine Learning, 2020

Stochastic Recursive Variance-Reduced Cubic Regularization Methods.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Accelerated Factored Gradient Descent for Low-Rank Matrix Factorization.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Stochastic Variance-Reduced Cubic Regularization Methods.
J. Mach. Learn. Res., 2019

Neural Contextual Bandits with Upper Confidence Bound-Based Exploration.
CoRR, 2019

Lower Bounds for Smooth Nonconvex Finite-Sum Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Sample Efficient Stochastic Variance-Reduced Cubic Regularization Method.
CoRR, 2018

Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks.
CoRR, 2018

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization.
CoRR, 2018

Finding Local Minima via Stochastic Nested Variance Reduction.
CoRR, 2018

Stochastic Nested Variance Reduced Gradient Descent for Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Stochastic Variance-Reduced Cubic Regularized Newton Method.
Proceedings of the 35th International Conference on Machine Learning, 2018


  Loading...