Peng Zhao

Orcid: 0000-0001-7925-8255

Affiliations:
  • Nanjing University, National Key Laboratory for Novel Software Technology, Cjina


According to our database1, Peng Zhao authored at least 46 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exploratory machine learning with unknown unknowns.
Artif. Intell., February, 2024

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition.
CoRR, 2024

Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Non-stationary Online Learning with Memory and Non-stochastic Control.
J. Mach. Learn. Res., 2023

Universal Online Learning with Gradual Variations: A Multi-layer Online Ensemble Approach.
CoRR, 2023

Stochastic Approximation Approaches to Group Distributionally Robust Optimization.
CoRR, 2023

Adapting to Continuous Covariate Shift via Online Density Ratio Estimation.
CoRR, 2023

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Dynamic Regret of Adversarial Linear Mixture MDPs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Stochastic Approximation Approaches to Group Distributionally Robust Optimization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fast Rates in Time-Varying Strongly Monotone Games.
Proceedings of the International Conference on Machine Learning, 2023

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Handling New Class in Online Label Shift.
Proceedings of the IEEE International Conference on Data Mining, 2023

Revisiting Weighted Strategy for Non-stationary Parametric Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Beyond Performative Prediction: Open-environment Learning with Presence of Corruptions.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Learning From Incomplete and Inaccurate Supervision.
IEEE Trans. Knowl. Data Eng., 2022

Improving Deep Forest by Screening.
IEEE Trans. Knowl. Data Eng., 2022

Adapting to Online Label Shift with Provable Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Efficient Methods for Non-stationary Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Dynamic Regret of Online Markov Decision Processes.
Proceedings of the International Conference on Machine Learning, 2022

No-Regret Learning in Time-Varying Zero-Sum Games.
Proceedings of the International Conference on Machine Learning, 2022

Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Adaptive Bandit Convex Optimization with Heterogeneous Curvature.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Non-stationary Online Learning with Memory and Non-stochastic Control.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Distribution-Free One-Pass Learning.
IEEE Trans. Knowl. Data Eng., 2021

Bandit Convex Optimization in Non-stationary Environments.
J. Mach. Learn. Res., 2021

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization.
CoRR, 2021

Non-stationary Linear Bandits Revisited.
CoRR, 2021

Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions.
Proceedings of the 3rd Annual Conference on Learning for Dynamics and Control, 2021

Towards Enabling Learnware to Handle Unseen Jobs.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Storage Fit Learning with Feature Evolvable Streams.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Exploratory Machine Learning with Unknown Unknowns.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Handling concept drift via model reuse.
Mach. Learn., 2020

A Simple Online Algorithm for Competing with Dynamic Comparators.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

An Unbiased Risk Estimator for Learning with Augmented Classes.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Dynamic Regret of Convex and Smooth Functions.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning with Feature and Distribution Evolvable Streams.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Simple Approach for Non-stationary Linear Bandits.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
An Unbiased Risk Estimator for Learning with Augmented Classes.
CoRR, 2019

Learning from Incomplete and Inaccurate Supervision.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Nearest Neighbor Ensembles: An Effective Method for Difficult Problems in Streaming Classification with Emerging New Classes.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018
Improving Deep Forest by Confidence Screening.
Proceedings of the IEEE International Conference on Data Mining, 2018

Label Distribution Learning by Optimal Transport.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Dual Set Multi-Label Learning.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Distribution-Free One-Pass Learning.
CoRR, 2017

Multi-View Matrix Completion for Clustering with Side Information.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017


  Loading...