PPaperPicks

Niao He

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

Venues

Frequent coauthors

Papers

  1. AmorLIP: Efficient Language-Image Pretraining via Amortization
  2. Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective
  3. Efficiently Escaping Saddle Points for Policy Optimization
    UAI 2025 ·
    Mohammadsadegh Khorasani
  4. Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning
  5. From Gradient Clipping to Normalization for Heavy Tailed SGD
  6. Learning to Steer Markovian Agents under Model Uncertainty
  7. Natural Gradient VI: Guarantees for Non-Conjugate Models
  8. On the Crucial Role of Initialization for Matrix Factorization
  9. PoLAR: Polar-Decomposed Low-Rank Adapter Representation
  10. Provable Maximum Entropy Manifold Exploration via Diffusion Models
  11. Scalable Neural Incentive Design with Parameterized Mean-Field Approximation
  12. Steering No-Regret Agents in MFGs under Model Uncertainty
  13. Zeroth-Order Optimization Finds Flat Minima
  14. Achieving Near-Optimal Convergence for Distributed Minimax Optimization with Adaptive Stepsizes
  15. Automated Design of Affine Maximizer Mechanisms in Dynamic Settings
  16. DPZero: Private Fine-Tuning of Language Models without Backpropagation
  17. Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization
  18. Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems
  19. Independent Learning in Constrained Markov Potential Games
  20. Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL
  21. On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximation
  22. Parameter-Agnostic Optimization under Relaxed Smoothness
  23. Provably Learning Nash Policies in Constrained Markov Potential Games
  24. Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
  25. Truly No-Regret Learning in Constrained MDPs
  26. When is Mean-Field Reinforcement Learning Tractable and Relevant?