← Authors

Peng Zhao

61 papers · 2006–2026 · 12 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird πŸƒ Academic Marathon (19) 🌍 Conference Polyglot (12) πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (29) 🌈 Renaissance Researcher (11) 🧭 Keyword Pioneer 🐝 Cross-Pollinator (10) 🀝 Dynamic Duo (36) πŸ”¬ Deep Specialist (12) πŸ† Keyword Champion (10) πŸ’Ž Century Club (60) πŸ”₯ Unstoppable (6) πŸ—ƒοΈ Keyword Collector (96) ⚑ Prolific Year (8) πŸ“ˆ Trend Setter

Conferences

NIPS (14) ICML (11) JMLR (9) AAAI (8) AISTATS (7) IJCAI (5) COLT (2) ACL (1) EACL (1) ICCV (1) L4DC (1) UAI (1)

Top co-authors

Zhi-Hua Zhou (36) Yu-Jie Zhang (13) Lijun Zhang (12) Yu-Hu Yan (8) Long-Fei Li (6) Masashi Sugiyama (4) Jing Wang (4) Mengxiao Zhang (3) Yan-Feng Xie (3) Cong Zhao (3)

Research topics

Differential Privacy (1) Statistics (1)

Keywords

online learning (22) dynamic regret (20) online convex optimization (11) regret bound (11) non-stationary environment (6) stochastic optimization (6) gradient variation (5) distribution shift (4) strongly convex function (4) linear mixture mdp (3) convex optimization (3) reinforcement learning (3) domain adaptation (3) bandit convex optimization (3) action recognition (2) contrastive learning (2) model compression (2) markov decision process (2) adversarial learning (2) policy optimization (2)

Papers

Efficient Few-Step Solution Generation via Discrete Flow Matching for Combinatorial Optimization AAAI 2026
TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree ICML 2025
Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update ICML 2025
DGL: Dynamic Global-Local Information Aggregation for Scalable VRP Generalization with Self-Improvement Learning IJCAI 2025
Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability ICML 2025
Efficient Methods for Non-stationary Online Learning JMLR 2025
M2RC-EVAL: Massively Multilingual Repository-level Code Completion Evaluation ACL 2025
CEAN: Contrastive Event Aggregation Network with LLM-based Augmentation for Event Extraction EACL 2024
Language Without Borders: A Dataset and Benchmark for Code-Switching Lip Reading NIPS 2024
Handling Heterogeneous Curvatures in Bandit LQR Control ICML 2024
Universal Online Convex Optimization with $1$ Projection per Round NIPS 2024
Gradient-Variation Online Learning under Generalized Smoothness NIPS 2024
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs NIPS 2024
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation NIPS 2024
Learning with Adaptive Resource Allocation ICML 2024
Structured Optimal Variational Inference for Dynamic Latent Space Models JMLR 2024
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization JMLR 2024
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization JMLR 2024
Efficient Non-stationary Online Learning by Wavelets with Applications to Online Distribution Shift Adaptation ICML 2024
Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation AAAI 2024
Generative Model-Based Feature Knowledge Distillation for Action Recognition AAAI 2024
Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition AISTATS 2024
A Simple and Optimal Approach for Universal Online Learning with Gradient Variations NIPS 2024
Multi-Attention Based Visual-Semantic Interaction for Few-Shot Learning IJCAI 2024
Stochastic Approximation Approaches to Group Distributionally Robust Optimization NIPS 2023
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023
Fast Rates in Time-Varying Strongly Monotone Games ICML 2023
Online Non-stochastic Control with Partial Feedback JMLR 2023
Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023
Adapting to Continuous Covariate Shift via Online Density Ratio Estimation NIPS 2023
Revisiting Weighted Strategy for Non-stationary Parametric Bandits AISTATS 2023
Beyond Performative Prediction: Open-environment Learning with Presence of Corruptions AISTATS 2023
Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach NIPS 2023
Weakly-Supervised Action Localization by Hierarchically-Structured Latent Attention Modeling ICCV 2023
Dynamic Regret of Adversarial Linear Mixture MDPs NIPS 2023
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022
Efficient Methods for Non-stationary Online Learning NIPS 2022
Adapting to Online Label Shift with Provable Guarantees NIPS 2022
Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits AISTATS 2022
Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022
Adaptive Bandit Convex Optimization with Heterogeneous Curvature COLT 2022
No-Regret Learning in Time-Varying Zero-Sum Games ICML 2022
Dynamic Regret of Online Markov Decision Processes ICML 2022
Contrastive Multi-view Hyperbolic Hierarchical Clustering IJCAI 2022
Large Motion Video Super-Resolution with Dual Subnet and Multi-Stage Communicated Upsampling AAAI 2021
Bandit Convex Optimization in Non-stationary Environments JMLR 2021
Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021
Exploratory Machine Learning with Unknown Unknowns AAAI 2021
Towards Enabling Learnware to Handle Unseen Jobs AAAI 2021
Storage Fit Learning with Feature Evolvable Streams AAAI 2021
Learning with Feature and Distribution Evolvable Streams ICML 2020
CDC: Classification Driven Compression for Bandwidth Efficient Edge-Cloud Collaborative Deep Learning IJCAI 2020
Dynamic Regret of Convex and Smooth Functions NIPS 2020
An Unbiased Risk Estimator for Learning with Augmented Classes NIPS 2020
Bandit Convex Optimization in Non-stationary Environments AISTATS 2020
A Simple Approach for Non-stationary Linear Bandits AISTATS 2020
Optimal Margin Distribution Learning in Dynamic Environments AAAI 2020
A Simple Online Algorithm for Competing with Dynamic Comparators UAI 2020
Robust Softmax Regression for Multi-class Classification with Self-Paced Learning IJCAI 2017
Stagewise Lasso JMLR 2007
On Model Selection Consistency of Lasso JMLR 2006