{"paper_id":"2507.01972","title":"Accelerated Portfolio Optimization and Option Pricing with Reinforcement Learning","authors":["Hadi Keramati","Samaneh Jazayeri"],"paper_date":"2025-06-23","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2507.01972v1","page_url":"https://thequant.space/flowcharts/accelerated-portfolio-optimization-and-option-pricing-with-r/","scores":{"empirical_rigor":6,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a reinforcement learning framework that dynamically adjusts block‑preconditioner sizes to accelerate iterative solvers for portfolio optimization and option pricing linear systems.","quote":"We present a reinforcement learning (RL)-driven framework for optimizing block-preconditioner sizes in iterative solvers used in portfolio optimization and option pricing. To overcome this limitation, we rely on RL to dynamically adjust the block-preconditioner sizes and accelerate iterative solver convergence.","summary":"We present a reinforcement learning (RL)-driven framework for optimizing block-preconditioner sizes in iterative solvers used in portfolio optimization and option pricing. The covariance matrix in portfolio optimization or the discretization of differential operators in option pricing models lead…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The problems can be expressed as large linear systems Ax = b derived from covariance matrices or discretized differential operators.","type":"model","stated":"explicit","quote":"The covariance matrix in portfolio optimization or the discretization of differential operators in option pricing models lead to large linear systems of the form $\\mathbf{A}\\textbf{x}=\\textbf{b}$.","support":"full"},{"assumption":"Iterative Krylov solvers (e.g., GMRES/FGMRES) are used to solve these linear systems.","type":"execution","stated":"explicit","quote":"Therefore, iterative methods are usually used for portfolios in real-world situations. We rely on the GMRES algorithm that begins by selecting an initial vector v1 and then uses the Arnoldi process to generate an orthonormal basis {v1, v2, . . . , vk} and an upper Hessenberg matrix Hk.","support":"full"},{"assumption":"The block‑preconditioner size can be changed at each iteration and applied adaptively.","type":"other","stated":"explicit","quote":"The matrix A is split into smaller submatrices of size k × k, resulting in an approximate block diagonal matrix M: M = diag(A1, A2, . . . , Ak) (16) where Ai ∈Rs×s are the blocks of A. 4 Published as a Workshop paper at Advances in Financial AI Workshop (ICLR 2025) 3.2 BLOCK PRECONDITIONER Since we are changing the size of blocks of preconditioner in each iteration, we use Flexible GMRES (FGMRES). At each iteration,","support":"full"},{"assumption":"A reinforcement learning agent can observe residuals and select an integer block size as its action.","type":"model","stated":"explicit","quote":"At each iteration, the agent observes the residuals of the linear system and, using its current policy, determines an optimal block size to apply the block-preconditioner.","support":"full"},{"assumption":"Proximal Policy Optimization (PPO) can learn an effective policy over multiple episodes.","type":"model","stated":"explicit","quote":"Over multiple episodes, the PPO agent learns a policy that effectively configures the preconditioning process to optimize the overall convergence rate.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Real‑world portfolio optimization matrices","provider":null,"kind":"benchmark","access":"unknown","period":null,"universe":null,"quote":"Evaluations on a suite of real-world portfolio optimization matrices demonstrate that our RL framework can be used to adjust preconditioning and significantly accelerate convergence and reduce computational cost.","support":"full"},{"name":"Option pricing coefficient matrices (e.g., size 2000)","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"Figure 5 illustrates the convergence of the option pricing system for a coefficient matrix A of size 2000 at two different densities. In both cases, a clear speedup in obtaining the solution and achieving low residual values is observed across the different matrix sizes and densities.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The RL‑based preconditioner significantly accelerates convergence and reduces computational cost for portfolio optimization problems.","kind":"performance","quote":"Evaluations on a suite of real-world portfolio optimization matrices demonstrate that our RL framework can be used to adjust preconditioning and significantly accelerate convergence and reduce computational cost.","support":"full"},{"finding":"Across different matrix sizes and densities, a clear speedup and lower residual values are observed.","kind":"performance","quote":"In both cases, a clear speedup in obtaining the solution and achieving low residual values is observed across the different matrix sizes and densities.","support":"full"},{"finding":"Using the RL agent can reduce the number of iterations required for option pricing to as few as two.","kind":"performance","quote":"Although the computational cost of training the RL agent is nontrivial, the results demonstrate that using an RL agent can significantly reduce the number of iterations required to solve an option pricing problem , in some cases, to as few as two iterations.","support":"full"},{"finding":"Accelerated convergence is demonstrated for both portfolio optimization and option pricing across various matrix sizes and densities.","kind":"performance","quote":"Ex-periments demonstrate accelerated convergence across various matrix sizes and densities for both portfolio optimization and option pricing.","support":"full"},{"finding":"The accelerated solver supports faster decision‑making in dynamic portfolio allocation and real‑time option pricing.","kind":"other","quote":"The proposed accelerated solver supports faster decision-making in dynamic portfolio allocation and real-time option pricing.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":19,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:49:33Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}