PPaperPicks

Peng Zhao

Nanjing University, National Key Laboratory for Novel Software Technology, Cjina

19 papers at tracked venues · 16 at CORE A* · active 2024–2026

DBLP profile ↗ORCID 0000-0001-7925-8255 ↗

Venues

NeurIPS ×8ICML ×6COLT ×2AAAI ×1AISTATS ×1SIGMOD ×1

Frequent coauthors

Long-Fei Li
DBLP profile ↗ORCID search ↗
×5
Yu-Hu Yan
DBLP profile ↗ORCID search ↗
×3
Yuheng Zhao
DBLP profile ↗ORCID search ↗
×2
Jing Wang
DBLP profile ↗ORCID search ↗
×2
Yu-Yang Qian
DBLP profile ↗ORCID search ↗
×2
Yi-Han Wang
DBLP profile ↗ORCID search ↗
×1
Hanyan Yin
DBLP profile ↗ORCID search ↗
×1
Yu-Jie Zhang
DBLP profile ↗ORCID search ↗
×1
Yan-Feng Xie
DBLP profile ↗ORCID search ↗
×1
Wenhao Yang
DBLP profile ↗ORCID search ↗
×1

Papers

  1. A simple, optimal and efficient algorithm for online exp-concave optimization
    COLT 2026 ·
    Yi-Han Wang
    DBLP profile ↗ORCID search ↗
  2. AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams
    SIGMOD 2026 ·
    Hanyan Yin
    DBLP profile ↗ORCID search ↗
  3. Gradient-Variation Regret Bounds for Unconstrained Online Learning
    COLT 2026 ·
    Yuheng Zhao
    DBLP profile ↗ORCID search ↗
  4. Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness
    NeurIPS 2025 ·
    Yuheng Zhao
    DBLP profile ↗ORCID search ↗
  5. Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
    ICML 2025 ·
    Jing Wang
    DBLP profile ↗ORCID search ↗
  6. Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
    ICML 2025 ·
    Yu-Jie Zhang
    DBLP profile ↗ORCID search ↗
  7. Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
    NeurIPS 2025 ·
    Yu-Hu Yan
    DBLP profile ↗ORCID search ↗
  8. Provably Efficient Online RLHF with One-Pass Reward Modeling
    NeurIPS 2025 ·
    Long-Fei Li
    DBLP profile ↗ORCID search ↗
  9. TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree
    ICML 2025 ·
    Yu-Yang Qian
    DBLP profile ↗ORCID search ↗
  10. A Simple and Optimal Approach for Universal Online Learning with Gradient Variations
    NeurIPS 2024 ·
    Yu-Hu Yan
    DBLP profile ↗ORCID search ↗
  11. Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation
    AAAI 2024 ·
    Long-Fei Li
    DBLP profile ↗ORCID search ↗
  12. Efficient Non-stationary Online Learning by Wavelets with Applications to Online Distribution Shift Adaptation
    ICML 2024 ·
    Yu-Yang Qian
    DBLP profile ↗ORCID search ↗
  13. Gradient-Variation Online Learning under Generalized Smoothness
    NeurIPS 2024 ·
    Yan-Feng Xie
    DBLP profile ↗ORCID search ↗
  14. Handling Heterogeneous Curvatures in Bandit LQR Control
    ICML 2024 ·
    Yu-Hu Yan
    DBLP profile ↗ORCID search ↗
  15. Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
    AISTATS 2024 ·
    Long-Fei Li
    DBLP profile ↗ORCID search ↗
  16. Learning with Adaptive Resource Allocation
    ICML 2024 ·
    Jing Wang
    DBLP profile ↗ORCID search ↗
  17. Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
    NeurIPS 2024 ·
    Long-Fei Li
    DBLP profile ↗ORCID search ↗
  18. Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
    NeurIPS 2024 ·
    Long-Fei Li
    DBLP profile ↗ORCID search ↗
  19. Universal Online Convex Optimization with 1 Projection per Round
    NeurIPS 2024 ·
    Wenhao Yang
    DBLP profile ↗ORCID search ↗