打破约束动态投资组合选择的维度障碍
Breaking the Dimensional Barrier for Constrained Dynamic Portfolio Choice
AI总结:
本文提出结合神经策略与庞特里亚金极大值原理的PG-DPO框架,通过障碍正则化哈密顿量满足KKT条件,实现高维约束连续时间投资组合优化,运行时间随资产数线性扩展。
摘要:
我们提出一个可扩展的、以策略为中心的框架,用于不等式约束下的连续时间多资产投资组合-消费优化。该方法将神经策略与庞特里亚金极大值原理(PMP)相结合,并在每个时间-状态对处通过最大化对数障碍正则化的哈密顿量来强制可行性,从而在无需价值函数网格的情况下满足KKT条件。理论上,我们证明障碍正则化的哈密顿量产生O(ε)的策略误差和线性的哈密顿量间隙(当KKT解为内部解时为二次),并将BPTT-PMP对应关系扩展到具有稳定协态收敛的约束设置。实证上,PG-DPO及其投影变体(P-PGDPO)在典型的卖空和消费上限问题中恢复了KKT最优策略,同时在不同维度上保持严格可行性;与PDE/BSDE求解器不同,运行时间随资产数量线性扩展,在n=100时仍保持实用。这些结果为高维约束连续时间投资组合优化提供了严格且可扩展的基础。
英文摘要:
We propose a scalable, policy-centric framework for continuous-time multi-asset portfolio-consumption optimization under inequality constraints. Our method integrates neural policies with Pontryagin's Maximum Principle (PMP) and enforces feasibility by maximizing a log-barrier-regularized Hamiltonian at each time-state pair, thereby satisfying KKT conditions without value-function grids. Theoretically, we show that the barrier-regularized Hamiltonian yields O($ε$) policy error and a linear Hamiltonian gap (quadratic when the KKT solution is interior), and we extend the BPTT-PMP correspondence to constrained settings with stable costate convergence. Empirically, PG-DPO and its projected variant (P-PGDPO) recover KKT-optimal policies in canonical short-sale and consumption-cap problems while maintaining strict feasibility across dimensions; unlike PDE/BSDE solvers, runtime scales linearly with the number of assets and remains practical at n=100. These results provide a rigorous and scalable foundation for high-dimensional constrained continuous-time portfolio optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。