IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.17808.html

Self-Consistent Adjoint Policy Iteration for Constrained Dynamic Portfolio Choice

Author

Listed:
  • Jeonggyu Huh
  • Yeoneung Kim
  • Seungwon Jeong

Abstract

We develop simulation-based policy iteration for continuous-time portfolio choice with predictable returns and convex constraints. Each outer step re-evaluates a fixed-latent OL-BPTT adjoint after deployment and solves the constrained update. Shifted-adjoint cancellation controls the adjoint--HJB Hamiltonian-gradient discrepancy by the policy-improvement residual. For CRRA portfolios, exact HJB policy iteration identifies the optimal reduced value factor, while population OL-BPTT iteration converges globally when the adjoint update is directionally improving and approximate stationarity is asymptotically HJB-compatible. A theorem-matched occupation audit yields maximal 95% upper endpoints of 0.066 for the primitive directional ratio and 0.074 for a stronger norm-relative ratio, both against the half-step threshold 0.75. In a three-factor, fifty-asset design, current-policy re-evaluation outperforms matched pooled refinement under both evaluation laws.

Suggested Citation

  • Jeonggyu Huh & Yeoneung Kim & Seungwon Jeong, 2026. "Self-Consistent Adjoint Policy Iteration for Constrained Dynamic Portfolio Choice," Papers 2608.17808, arXiv.org, revised Aug 2026.
  • Handle: RePEc:arx:papers:2608.17808
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.17808
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2608.17808. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.