PPaperPicks

Lijun Zhang

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

26 papers at tracked venues · 23 at CORE A* · active 20242025

Venues

Frequent coauthors

Papers

  1. Continuous Subspace Optimization for Continual Learning
  2. Dimension-Free Adaptive Subgradient Methods with Frequent Directions
  3. On the Generalization of Feature Incremental Learning
  4. One-step Label Shift Adaptation via Robust Weight Estimation
  5. Revisiting Projection-Free Online Learning with Time-Varying Constraints
  6. SPACE: Noise Contrastive Estimation Stabilizes Self-Play Fine-Tuning for Large Language Models
  7. Towards Unbiased Information Extraction and Adaptation in Cross-Domain Recommendation
  8. Triplets Better Than Pairs: Towards Stable and Effective Self-Play Fine-Tuning for LLMs
  9. Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions
  10. Advancing Tool-Augmented Large Language Models: Integrating Insights from Errors in Inference Trees
  11. Attack-Resilient Image Watermarking Using Stable Diffusion
    NeurIPS 2024 · Lijun Zhang
  12. Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond
  13. Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction
  14. Efficient Stochastic Approximation of Minimax Excess Risk Optimization
    ICML 2024 · Lijun Zhang
  15. High-Probability Bound for Non-Smooth Non-Convex Stochastic Optimization with Heavy Tails
  16. Improved Regret for Bandit Convex Optimization with Delayed Feedback
  17. Nearly Optimal Regret for Decentralized Online Convex Optimization
  18. Non-stationary Online Convex Optimization with Arbitrary Delays
  19. Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees
  20. Not All Embeddings are Created Equal: Towards Robust Cross-domain Recommendation via Contrastive Learning
  21. Online Composite Optimization Between Stochastic and Adversarial Environments
  22. Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
  23. Small-loss Adaptive Regret for Online Convex Optimization
  24. Thinking Forward: Memory-Efficient Federated Finetuning of Language Models
  25. To Cool or not to Cool? Temperature Network Meets Large Foundation Models via DRO
  26. Universal Online Convex Optimization with 1 Projection per Round