Research map / Optimization / Nonconvex and smooth optimization
Beyond Softmax and Entropy: Convergence Rates of Policy Gradients with $\boldsymbol{f}$-SoftArgmax Parameterization $\&$ Coupled Regularization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Global linear convergence of entropy-regularized softmax policy gradient beyond tabular MDPs (NeurIPS 2026 · similarity 0.92)
- Policy Gradient with Tree Expansion (ICML 2025 · similarity 0.88)
- Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework (NeurIPS 2026 · similarity 0.87)
- Convergence of Policy Mirror Descent Beyond Compatible Function Approximation (ICML 2025 · similarity 0.87)
- Beyond Stationarity: Convergence Analysis of Stochastic Softmax Policy Gradient Methods (ICLR 2024 · similarity 0.87)
- Convergence Analysis of Policy Gradient Methods with Dynamic Stochasticity (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.