PPaperPicks

Zhi-Hua Zhou

Nanjing University, State Key Laboratory for Novel Software Technology, China

42 papers at tracked venues · 37 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. A simple, optimal and efficient algorithm for online exp-concave optimization
  2. AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams
  3. CoRE-Learning with Look-Ahead and Immediate Resource Allocation
  4. Tabular Learnwares Can Be Repurposed for Seemingly Irrelevant New Tasks
  5. Achieving Nearly-Optimal Regret and Sample Complexity in Dueling Bandits with Applications in Online Recommendations
  6. Adapting to Generalized Online Label Shift by Invariant Representation Learning
  7. Avoiding Undesired Future with Sequential Decisions
  8. Curriculum Abductive Learning
  9. Discovering Symbolic Partial Differential Equation by Abductive Learning
  10. Dynamic Learnware Filtering for Efficient Learnware Identification and System Slimming
  11. Efficient Rectification of Neuro-Symbolic Reasoning Inconsistencies by Abductive Reflection
  12. Efficient Rectification of Neuro-Symbolic Reasoning Inconsistencies by Abductive Reflection (Extended Abstract)
  13. Enabling Optimal Decisions in Rehearsal Learning under CARE Condition
  14. Gradient-Based Nonlinear Rehearsal Learning with Multivariate Alterations
  15. Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
  16. Identifying and Reusing Learnwares Across Different Label Spaces
  17. On the Diversity of Adversarial Ensemble Learning
  18. One-Pass Feature Evolvable Learning with Theoretical Guarantees
  19. Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
  20. Polynomial-Delay MAG Listing with Novel Locally Complete Orientation Rules
  21. Provably Efficient Online RLHF with One-Pass Reward Modeling
  22. TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree
  23. Variance-Reduced Long-Term Rehearsal Learning with Quadratic Programming Reformulation
  24. A Simple and Optimal Approach for Universal Online Learning with Gradient Variations
  25. An Efficient Maximal Ancestral Graph Listing Algorithm
  26. Analysis for Abductive Learning and Neural-Symbolic Reasoning Shortcuts
  27. Avoiding Undesired Future with Minimal Cost in Non-Stationary Environments
  28. Beimingwu: A Learnware Dock System
  29. Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation
  30. Efficient Non-stationary Online Learning by Wavelets with Applications to Online Distribution Shift Adaptation
  31. Gradient-Variation Online Learning under Generalized Smoothness
  32. Handling Learnwares from Heterogeneous Feature Spaces with Explicit Label Exploitation
  33. Handling Varied Objectives by Online Decision Making
  34. Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
  35. Learning Only When It Matters: Cost-Aware Long-Tailed Classification
  36. Learning with Adaptive Resource Allocation
  37. Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
  38. On the Ability of Developers' Training Data Preservation of Learnware
  39. Policy Rehearsing: Training Generalizable Policies for Reinforcement Learning
  40. Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
  41. Safe Abductive Learning in the Presence of Inaccurate Rules
  42. Towards Making Learnware Specification and Market Evolvable