Cover Image

A Simple Mixture Policy Parameterization for Improving Sample Efficiency of CVaR Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Luo, Yudong, Pan, Yangchen, Wang, Han, Torr, Philip, Poupart, Pascal
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Autonomous Sparse Mean-CVaR Portfolio Optimization
by: Lin, Yizun, et al.
Published: (2024)

Statistical Robustness of Interval CVaR Based Regression Models under Perturbation and Contamination
by: You, Yulei, et al.
Published: (2026)

Boosting CVaR Policy Optimization with Quantile Gradients
by: Luo, Yudong, et al.
Published: (2026)

Distributionally Robust Safety Verification of Neural Networks via Worst-Case CVaR
by: Kishida, Masako
Published: (2025)

Bayesian Optimization for CVaR-based portfolio optimization
by: Millar, Robert, et al.
Published: (2025)

Measures of Variability for Risk-averse Policy Gradient
by: Luo, Yudong, et al.
Published: (2025)

Actor-Critic Algorithm for Dynamic Expectile and CVaR
by: Luo, Yudong, et al.
Published: (2026)

Sparse Extended Mean-Variance-CVaR Portfolios with Short-selling
by: Mousavi, Ahmad, et al.
Published: (2024)

Dynamically Augmented CVaR for MDPs
by: Feinberg, Eugene A., et al.
Published: (2022)

An Operator Splitting Method for Large-Scale CVaR-Constrained Quadratic Programs
by: Luxenberg, Eric, et al.
Published: (2025)

Tightening CVaR Approximations via Scenario-Wise Scaling for Chance-Constrained Programming
by: Chen, Rui, et al.
Published: (2026)

A Martingale approach to continuous Portfolio Optimization under CVaR like constraints
by: Lelong, Jérôme, et al.
Published: (2025)

Toward Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixture Models
by: Xu, Weihang, et al.
Published: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
by: Wang, Yi-Han, et al.
Published: (2025)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization
by: Sorokin, D., et al.
Published: (2023)

Risk-Aware Control of Discrete-Time Stochastic Systems: Integrating Kalman Filter and Worst-case CVaR in Control Barrier Functions
by: Kishida, Masako
Published: (2023)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Group Distributionally Robust Optimization with Flexible Sample Queries
by: Bai, Haomin, et al.
Published: (2025)

CVaR-Based Variational Quantum Optimization for User Association in Handoff-Aware Vehicular Networks
by: Yan, Zijiang, et al.
Published: (2025)

Return Capping: Sample-Efficient CVaR Policy Gradient Optimisation
by: Mead, Harry, et al.
Published: (2025)

Provably Efficient Exploration in Policy Optimization
by: Cai, Qi, et al.
Published: (2019)

Faster Fixed-Point Methods for Multichain MDPs
by: Zurek, Matthew, et al.
Published: (2025)

Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency
by: Cai, Qi, et al.
Published: (2022)

Dual Lagrangian Learning for Conic Optimization
by: Tanneau, Mathieu, et al.
Published: (2024)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2025)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2024)

Proximal Oracles for Optimization and Sampling
by: Liang, Jiaming, et al.
Published: (2024)

Optimizing Posterior Samples for Bayesian Optimization via Rootfinding
by: Adebiyi, Taiwo A., et al.
Published: (2024)

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
by: Kornowski, Guy, et al.
Published: (2024)

Dual Interior Point Optimization Learning
by: Klamkin, Michael, et al.
Published: (2024)

Reusing Historical Trajectories in Natural Policy Gradient via Importance Sampling: Convergence and Convergence Rate
by: Lin, Yifan, et al.
Published: (2024)

A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence
by: Alfano, Carlo, et al.
Published: (2023)

OptiBench Meets ReSocratic: Measure and Improve LLMs for Optimization Modeling
by: Yang, Zhicheng, et al.
Published: (2024)

Faster Convergence of Local SGD for Over-Parameterized Models
by: Qin, Tiancheng, et al.
Published: (2022)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
by: Wang, Menglian, et al.
Published: (2026)

Progressively Sampled Equality-Constrained Optimization
by: Curtis, Frank E., et al.
Published: (2025)