Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Continuous-time optimal investment with portfolio constraints: a reinforcement learning approach

T0 review · 3 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read In an entropy-regularized exploratory investment problem, the optimal feedback policy is Gaussian, with mean equal to the Merton strategy and variance equal to the exploration rate divided by squared volatility, and it becomes truncated…

desk verdict Genuine new constrained truncated-Gaussian result, but the value functions carry a systematic factor-e error that needs fixing before the closed forms can be trusted. read the letter →

arxiv 2412.10692 v1 pith:FFX2XHWD submitted 2024-12-14 q-fin.MF

Huy Chau , Duy Nguyen , Thai Nguyen This is my paper · ORCID
classification q-fin.MF MSC 34D2060H1092D2593D0593D20
keywords optimalinvestmententropy-regularizedreinforcementlearningexploratorystochasticcontrolGaussianpolicytruncatedportfolioconstraintsimprovementtheoremmartingalegradient
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper studies a continuous-time reinforcement learning version of expected utility maximization, where the investor samples portfolio weights from a distribution rather than committing to a single strategy. The central claim is that the optimal exploration policy for logarithmic and quadratic utility is a Gaussian, with mean given by the classical Merton fraction and variance proportional to the exploration parameter m divided by σ². When the portfolio weight is constrained to lie in [a, b], the same Gaussian is simply truncated to that interval. The paper further derives closed-form value functions, shows that they converge to the non-exploratory Merton values as m goes to zero, and provides a policy improvement theorem that underpins an implementable reinforcement learning algorithm.

What carries the argument

The central object is the entropy-regularized exploratory control problem, where the agent chooses at each time a probability density λ over portfolio weights and pays a Shannon differential entropy penalty scaled by m. The optimal distribution is obtained by applying the Donsker–Varadhan variational formula to the HJB equation, which yields a Gaussian with mean α = −(µ−r)x v_x / (σ²x² v_xx) and variance −m/(σ²x² v_xx) whenever v_xx < 0. For logarithmic utility the value function is linear in ln x, making the Gaussian parameters independent of wealth, and for quadratic utility the ansatz is quadratic in x, again reducing the PDE to solvable form. In the constrained case the same variational argument gives a truncated Gaussian; its moments and entropy are computed explicitly, which directly yields the exploration cost. The martingale characterization of the value function (Theorem 3.6) and the policy gradient representation (Theorem 3.7) transform the learning problem into a parametric optimization that can be implemented with a standard actor-critic scheme using sampled wealth trajectories.

What would settle it

A concrete test would be to take a non-logarithmic, non-quadratic utility such as a power utility U(x) = x^(1−γ)/(1−γ) with γ ≠ 1 and numerically solve the exploratory HJB (or run the actor-critic algorithm) in an unconstrained Black–Scholes market; if the resulting optimal policy is not Gaussian with mean (µ−r)/σ² and variance m/σ², then the Gaussian-optimality claim is specific to the two utility classes rather than general. More directly, one could search for an admissible policy λ whose value function is known to be non-smooth or for which the Gaussian improvement is not admissible, which would violate the premise of Theorem 3.4.

Watch

Extended reading notes

Core claim

For the entropy-regularized expected utility problem in a Black–Scholes market, the paper establishes that the optimal feedback control distribution is Gaussian for logarithmic utility (Theorem 3.1) and for quadratic utility (Corollary 6.1), with mean equal to the Merton proportion (µ−r)/σ² and variance m/σ². If the portfolio weight is restricted to an interval [a, b], the optimal policy becomes the same Gaussian truncated to that interval (Theorem 4.1). The associated optimal value functions are obtained in closed form, and the paper proves that as the exploration weight m tends to zero, the optimal policies converge to Dirac measures at the corresponding constrained or unconstrained Merton strategies and the value functions converge to the classical expected utility values. A policy improvement theorem (Theorems 3.4 and 4.3) guarantees that iterating the Gaussian (or truncated Gaussian) improvement step monotonically improves the value function, and the martingale-based policy evaluation and gradient formulas yield a concrete actor-critic algorithm.

Load-bearing premise

The policy improvement theorem assumes that for any admissible policy the corresponding value function is smooth with a negative second derivative and that the Gaussian (or truncated Gaussian) policy built from that value function is admissible, but the paper does not establish general conditions under which the average PDE admits such a classical solution.

Editorial extensions

If this is right

  • If the central claim is correct, then for logarithmic and quadratic utility the full trade-off between exploration and exploitation is described by a single scalar parameter m, and the optimal policy is always a Gaussian (or truncated Gaussian) centered at the Merton fraction.
  • In the unconstrained case the exploration cost is exactly mT/2, and in the constrained case it is smaller whenever the Merton fraction lies inside the constraint interval, confirming that restricting the action space lowers the cost of exploration.
  • As m goes to zero, the learned policies and value functions recover the classical Merton solution, so any small-exploration RL implementation is guaranteed to approach the standard optimal investment strategy.
  • The policy improvement theorem implies that starting from any admissible—not necessarily Gaussian—policy, a single Gaussian update improves the value, and repeated updates converge to the optimal Gaussian policy; this provides a theoretical basis for restricting attention to Gaussian policies in practice.
  • For quadratic utility, the exploratory optimal portfolio remains on the mean-variance efficient frontier under a mild condition, which connects the RL solution to classical Markowitz analysis.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The closed-form Gaussian structure likely extends beyond the two utility classes only under strong regularity conditions; for general utilities the optimal exploratory policy would still be Gaussian if the value function is smooth and concave, but verifying those conditions is exactly the open problem the paper identifies for the average PDE.
  • The result that the constrained exploration cost is smaller than the unconstrained one suggests a broader design principle: deliberate exploration is cheaper when the admissible action set is bounded, which could inform how regulators or firms choose portfolio restrictions in learning environments.
  • The convergence as m→0 is a local statement; one could test whether for fixed m the truncated Gaussian remains optimal for other utility functions such as power utility with relative risk aversion not equal to one, but the paper does not address that case.
  • The martingale policy evaluation scheme is likely applicable to other continuous-time stochastic control problems with entropy regularization, especially where the value function can be parametrized in a closed family, but the paper only demonstrates it for logarithmic and quadratic utilities.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. This paper studies an entropy-regularized exploratory optimal investment problem in a Black-Scholes market, with logarithmic and quadratic utility, in both unconstrained and interval-constrained settings. It claims that the optimal feedback policy is Gaussian in the unconstrained case and truncated Gaussian under an interval constraint, derives closed-form value functions, proves convergence to the classical Merton values as the exploration weight m goes to zero, establishes a policy improvement theorem, and proposes a martingale-based actor-critic algorithm with numerical examples. The derivations rely on the Donsker-Varadhan variational formula and an HJB reduction; several proofs are omitted with reference to prior work by Wang-Zhou and Jia-Zhou.

Significance. If the quantitative statements were correct, the paper would make a useful contribution to continuous-time RL portfolio choice: it gives explicit, parameter-free Gaussian policies whose mean is the Merton strategy and whose variance is m/sigma^2, it handles portfolio constraints in a clean way, and it provides an interpretable learning target rather than a black-box neural network. The policy improvement theorem and the martingale formulation are also well aligned with the modern continuous-time RL literature. However, the central closed-form value functions contain a systematic constant error, and the quadratic-utility value function has an additional sign error. These errors directly affect the numerical learning targets and the quantitative interpretation of exploration, so the main quantitative claims are not correct in their current form.

major comments (3)
  1. [Eq. (2.12); Theorems 3.1, 4.1, 6.1; Eqs. (5.4), (5.7), (7.7)] The logarithmic term in the HJB equation (2.12) contains an extra factor e: the Donsker-Varadhan supremum of ∫Hλ dπ - m∫λ log λ dπ is m log∫exp(H/m)dπ, and completing the square gives (m/2)log(-2πm/(σ^2 x^2 v_xx)), not (m/2)log(-2πem/(σ^2 x^2 v_xx)). Consequently the stated value functions in Theorem 3.1, Remark 3.1, Theorem 4.1, Theorem 6.1, Corollary 6.1, and the extension in Eq. (7.7) are off by a term of the form (m/2)(T-t). A direct check for logarithmic utility confirms this: under λ* = N(π_Merton, m/σ^2), one has E[ln X_T] = ln x + (r + 1/2(μ-r)^2/σ^2 - m/2)T, and the entropy contribution is (mT/2)log(2πem/σ^2), so the true regularized value is ln x + (r + 1/2(μ-r)^2/σ^2)T + (mT/2)log(2πm/σ^2), which differs from Eq. (3.1) by mT/2. The Gaussian and truncated-Gaussian policy statements survive because the additive l(t) term cancels in v_x/v_xx, and the m→0 convergence is unaffected, but the closed-form value functions and the numerical learning targets in (5.4), (5.7), and Section 6.1 must be corrected.
  2. [Theorem 6.1, Corollary 6.2, Eq. (C.1), Section 6.1] The quadratic-utility value function also has a sign error. With m=0, the constant term in Eq. (6.13) is written as -K^2/(2ε)(1-e^{-ρ^2(T-t)}), but the ODE (C.1) with m=0 gives q(t)=+K^2/(2ε)(1-e^{-ρ^2(T-t)}). For example, when r=0, x=0, and K=ε, the proposed formula gives a negative value, although the zero-investment strategy yields utility 0. In addition, the exploration term m/4(ρ^2-2r)(T-t)^2 in (6.13) has the wrong sign: substituting the stated q(t) into (C.1) leaves a residual of -m(ρ^2-2r)(T-t), not zero. After also correcting the factor-e error of (2.12), the correct temporal exploration term is -(m/4)(ρ^2-2r)(T-t)^2. The learning target θ2 = m/4(ρ^2-2r) in Section 6.1 and the numerical targets in Section 6.2 therefore have the wrong sign.
  3. [Theorem 3.4, Theorem 4.3, footnote 3] The policy improvement theorem is conditional on v^λ ∈ C^{1,2}, v^λ_xx < 0, and admissibility of the Gaussian (or truncated-Gaussian) improvement, but no conditions are established under which these hypotheses hold for the policies generated by the iteration. The authors note in footnote 3 that well-posedness of the average PDE (3.18) is open. Since Theorems 3.5 and 4.4 assert convergence of the policy-iteration sequence, this is a load-bearing gap: the convergence claims are not unconditional. The theorems should either be stated as purely conditional improvement results or be supplemented with verification results for the logarithmic and quadratic cases where the paper claims convergence.
minor comments (4)
  1. [Eq. (3.8), Eq. (5.5), Appendix A.3] The Gaussian entropy identities contain an extra 1/2: the standard differential entropy is log(b√(2πe)) = 1/2 log(2πeb^2), whereas (5.5) gives 1/2 + 1/2(φ2 + log(2πem)), and (3.8) has the analogous discrepancy. The final exploration cost mT/2 in Proposition 3.1 is nevertheless correct because the errors cancel in that particular calculation, but the intermediate identities should be fixed.
  2. [Theorem 4.2 proof] The proof of Theorem 4.2 refers to "ψ[a,b](t,x;m) given by (4.14)", but the definition of ψ[a,b] appears in Lemma 4.2, not in Eq. (4.14). Please correct the cross-reference.
  3. [Title and Notation] The title in the text is typeset as "POR TFOLIO" with a spurious space, and the paper uses π for both the portfolio weight and the mathematical constant; the footnote on πe helps, but the notation remains awkward in formulas such as (3.1) where "2πem" mixes both uses.
  4. [Section 5.3] The numerical "true" parameter values in Table 2 and the target θ* in Section 5.3 are computed from the uncorrected closed-form value functions and must be recomputed after the corrections described in the major comments.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the closed-form Gaussian and truncated-Gaussian policies are derived from the exploratory HJB and verified by an explicit ansatz; no fitted parameter is renamed as a prediction, and no load-bearing self-citation chain appears.

full rationale

The paper's derivation chain is self-contained. The exploratory HJB (2.9) is solved by the Donsker-Varadhan variational formula to obtain the optimal distributional control, and the resulting PDE (2.12) is then solved explicitly by an ansatz v(t,x;m) = k(t) ln x + l(t) for logarithmic utility and by a quadratic ansatz for quadratic utility. The Gaussian policy in Theorem 3.1 and the truncated-Gaussian policy in Theorem 4.1 follow algebraically from the form of the maximizer, not from an assumed conclusion. No parameter is fitted to a subset of data and then reported as a prediction: the numerical section uses the closed-form solution as ground truth to validate the learning algorithm, which is a consistency check rather than a circular prediction. The policy improvement and policy gradient results either are proved in the paper or are reduced to external independent references such as Jia and Zhou, which are not authored by the present researchers, so no self-citation is load-bearing. The regularity assumptions in Theorem 3.4 and the open well-posedness of the average PDE noted in the paper are rigor gaps, not circular reasoning. Any possible factor-e discrepancy in Eq. (2.12) is a correctness concern, not a circularity concern, because it does not make the stated value functions equivalent to the inputs by construction. The central claims are therefore not circular.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The theoretical results rest on the exploratory framework of prior authors plus a concavity and regularity premise for arbitrary policies. The only tunable parameter introduced is the exploration weight m. No new unobserved entities are postulated.

free parameters (1)
  • exploration weight m = not fitted, exogenous
    Controls the variance of the Gaussian and truncated Gaussian policy and enters all value functions and exploration costs. It is a modeling choice in the reinforcement learning objective, not a parameter estimated from data.
assumptions (5)
  • domain assumption Complete Black-Scholes market with constant r, mu > r, sigma > 0 and one risky asset
    Sections 2 and 3 set dS_t/S_t = mu dt + sigma dW_t and assume one risky and one risk-free asset; all closed forms rely on constant coefficients.
  • domain assumption Exploratory wealth dynamics replace random control by averaged drift and averaged squared volatility (Eqs. 2.5 and 2.6)
    The RL exploration model from Wang et al. (2020) is taken as primitive; the paper does not derive it from an underlying N-round learning limit.
  • domain assumption Admissibility set in Assumption 2.1: lambda is a density, measurable, and the exploratory SDE has a unique positive strong solution with finite regularized objective
    Invoked in the HJB verification step in Section 2.3 and in the policy improvement proofs.
  • ad hoc to paper For an arbitrary policy lambda in Theorems 3.4 and 4.3, v^lambda is C^{1,2} and v^lambda_xx < 0, and the Gaussian improvement is admissible
    This regularity and concavity premise is assumed without conditions. The paper notes in footnote 3 of Section 3.4 that well-posedness of the average PDE (3.18) is open.
  • domain assumption For the random coefficient extension in Section 7, the boundedness conditions in (7.8) and bounded differentiable coefficients
    Used to guarantee existence and uniqueness of the Cauchy problem for f(t,y;m) via Friedman's PDE theorems.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Continuous-time optimal investment with portfolio constraints: a reinforcement learning approach." pith.science (2026). https://pith.science/paper/FFX2XHWD

@misc{pith2026241210692,
  author       = {Pith},
  title        = {Pith review of: Continuous-time optimal investment with portfolio constraints: a reinforcement learning approach},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FFX2XHWD}},
  note         = {Machine review of arXiv:2412.10692}
}
read the original abstract

In a reinforcement learning (RL) framework, we study the exploratory version of the continuous time expected utility (EU) maximization problem with a portfolio constraint that includes widely-used financial regulations such as short-selling constraints and borrowing prohibition. The optimal feedback policy of the exploratory unconstrained classical EU problem is shown to be Gaussian. In the case where the portfolio weight is constrained to a given interval, the corresponding constrained optimal exploratory policy follows a truncated Gaussian distribution. We verify that the closed form optimal solution obtained for logarithmic utility and quadratic utility for both unconstrained and constrained situations converge to the non-exploratory expected utility counterpart when the exploration weight goes to zero. Finally, we establish a policy improvement theorem and devise an implementable reinforcement learning algorithm by casting the optimal problem in a martingale framework. Our numerical examples show that exploration leads to an optimal wealth process that is more dispersedly distributed with heavier tail compared to that of the case without exploration. This effect becomes less significant as the exploration parameter is smaller. Moreover, the numerical implementation also confirms the intuitive understanding that a broader domain of investment opportunities necessitates a higher exploration cost. Notably, when subjected to both short-selling and money borrowing constraints, the exploration cost becomes negligible compared to the unconstrained case.

Figures

Figures reproduced from arXiv: 2412.10692 by the authors.

Figure 1
Figure 1. Exploration cost versus exploration rate The left (resp. right) panel of [PITH_FULL_IMAGE:figures/full_fig_p019_1.png] view at source ↗
Figure 2
Figure 2. The effect of the exploration rate m on |v ∗,[a,b] (t, x; m) − v ∗,[a,b] (t, x; 0)|. Next, we choose the learning rates which are used to update θ and φ to be ηθ = 0.01, ηφ = 0.001, respectively with the decay rate l(i) = 1/i0.51. From the closed-from formula, the true value of (θ1, θ2) is given by θ ∗ = (0.055929, −0.001497). For each learning episode, we start with an initial guess θ = (θ1, θ2) = θ ∗ + (ǫ1, ǫ2) wh… view at source ↗
Figure 3
Figure 3. Learned policy for different exploration rates [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Convergence of the constrained policy when the exploration rate m → 0. To have a more concrete comparison between the true optimal optimal policy and the learned optimal policy, in [PITH_FULL_IMAGE:figures/full_fig_p021_4.png]
Figure 5
Figure 5. Figure 5: Error versus iterations Iteration True (θ1, θ2) Learned (θ1, θ2) True (φ1, φ2) Learned (φ1, φ2) 500 (0.055929,-0.001497) (0.052141,-0.001261) (0.555556,2.407946) (0.552537,2.407276) 1000 (0.055929,-0.001497) (0.057109 ,-0.001836) (0.555556,2.407946) (0.554388,2.413809 …
Figure 6
Figure 6. Figure 6: Density plot of wealth process: Exploration vs non exploration 6. Optimal portfolio with portfolio constraints and exploration for quadratic utility We consider in this section the case with a quadratic utility function. It is worth noting that in portfolio theory the …
Figure 7
Figure 7. Figure 7: Convergence of θ1 (Left), θ2 (Center) and θ3 (Right) In this case, it is evident from [PITH_FULL_IMAGE:figures/full_fig_p028_7.png]
Figure 8
Figure 8. Figure 8: Quadratic utility: True policy versus learned policy It is clear from [PITH_FULL_IMAGE:figures/full_fig_p028_8.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Continuous Policy and Value Iteration for Stochastic Control Problems and Its Convergence

    math.OC 2025-06 conditional novelty 6.0 of 10

    A new coupled continuous-time policy-value iteration dynamics is shown to converge to the optimal value and control for relaxed and classical stochastic control problems, under Hamiltonian monotonicity conditions.

Reference graph

Works this paper leans on

125 extracted references · 67 canonical work pages · cited by 1 Pith paper

  1. [1]

    Silver , author A

    author D. Silver , author A. Huang , author C. J. Maddison , author A. Guez , author L. Sifre , author G. Van Den Driessche , author J. Schrittwieser , author I. Antonoglou , author V. Panneershelvam , author M. Lanctot , et al., title Mastering the game of go with deep neural networks and tree search , journal nature volume 529 ( year 2016 ) pages 484--489

    2016

  2. [2]

    Silver , author J

    author D. Silver , author J. Schrittwieser , author K. Simonyan , author I. Antonoglou , author A. Huang , author A. Guez , author T. Hubert , author L. Baker , author M. Lai , author A. Bolton , et al., title Mastering the game of go without human knowledge , journal nature volume 550 ( year 2017 ) pages 354--359

    2017

  3. [3]

    Bertsekas , title Reinforcement learning and optimal control , publisher Athena Scientific , year 2019

    author D. Bertsekas , title Reinforcement learning and optimal control , publisher Athena Scientific , year 2019

    2019

  4. [4]

    Williams , author N

    author G. Williams , author N. Wagener , author B. Goldfain , author P. Drews , author J. M. Rehg , author B. Boots , author E. A. Theodorou , title Information theoretic mpc for model-based reinforcement learning , in: booktitle 2017 IEEE International Conference on Robotics and Automation (ICRA) , organization IEEE , year 2017 , pp. pages 1714--1721

    2017

  5. [5]

    author L. P. Kaelbling , author M. L. Littman , author A. W. Moore , title Reinforcement learning: A survey , journal Journal of artificial intelligence research volume 4 ( year 1996 ) pages 237--285

    1996

  6. [6]

    Schneckenreither , author S

    author M. Schneckenreither , author S. Haeussler , title Reinforcement learning methods for operations research applications: The order release problem , in: booktitle Machine Learning, Optimization, and Data Science: 4th International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018, Revised Selected Papers 4 , organization Springer , year 20...

    2018

  7. [7]

    Bertsimas , author A

    author D. Bertsimas , author A. Thiele , title A robust optimization approach to inventory theory , journal Operations research volume 54 ( year 2006 ) pages 150--168

    2006

  8. [8]

    Nevmyvaka , author Y

    author Y. Nevmyvaka , author Y. Feng , author M. Kearns , title Reinforcement learning for optimized trade execution , in: booktitle Proceedings of the 23rd international conference on Machine learning , year 2006 , pp. pages 673--680

    2006

Show all 125 references
  1. [9]

    author M. Schnaubelt , title Deep reinforcement learning for the optimal placement of cryptocurrency limit orders , journal European Journal of Operational Research volume 296 ( year 2022 ) pages 993--1006

    2022

  2. [10]

    Hendricks , author D

    author D. Hendricks , author D. Wilcox , title A reinforcement learning extension to the almgren-chriss framework for optimal trade execution , in: booktitle 2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr) , organization IEEE , ...

    2014

  3. [11]

    Moody , author L

    author J. Moody , author L. Wu , author Y. Liao , author M. Saffell , title Performance functions and reinforcement learning for trading systems and portfolios , journal Journal of Forecasting volume 17 ( year 1998 ) pages 441--470

    1998

  4. [12]

    Wang , author X

    author H. Wang , author X. Y. Zhou , title Continuous-time mean--variance portfolio selection: A reinforcement learning framework , journal Mathematical Finance volume 30 ( year 2020 ) pages 1273--1308

    2020

  5. [14]

    Dai , author Y

    author M. Dai , author Y. Dong , author Y. Jia , title Learning equilibrium mean-variance strategy , journal Available at SSRN 3770818 ( year 2020 )

    2020

  6. [15]

    Jia , author X

    author Y. Jia , author X. Y. Zhou , title Policy gradient and actor-critic learning in continuous time and space: Theory and algorithms , journal Journal of Machine Learning Research volume 23 ( year 2022 ) pages 1--55

    2022

  7. [16]

    Gosavi , title Reinforcement learning: A tutorial survey and recent advances , journal INFORMS Journal on Computing volume 21 ( year 2009 ) pages 178--192

    author A. Gosavi , title Reinforcement learning: A tutorial survey and recent advances , journal INFORMS Journal on Computing volume 21 ( year 2009 ) pages 178--192

    2009

  8. [18]

    Jaimungal , title Reinforcement learning and stochastic optimisation , journal Finance and Stochastics volume 26 ( year 2022 ) pages 103--129

    author S. Jaimungal , title Reinforcement learning and stochastic optimisation , journal Finance and Stochastics volume 26 ( year 2022 ) pages 103--129

    2022

  9. [19]

    Charpentier , author R

    author A. Charpentier , author R. Elie , author C. Remlinger , title Reinforcement learning in economics and finance , journal Computational Economics ( year 2021 ) pages 1--38

    2021

  10. [20]

    Doya , title Reinforcement learning in continuous time and space , journal Neural computation volume 12 ( year 2000 ) pages 219--245

    author K. Doya , title Reinforcement learning in continuous time and space , journal Neural computation volume 12 ( year 2000 ) pages 219--245

    2000

  11. [21]

    Fr \'e maux , author H

    author N. Fr \'e maux , author H. Sprekeler , author W. Gerstner , title Reinforcement learning using a continuous time actor-critic framework with spiking neurons , journal PLoS computational biology volume 9 ( year 2013 ) pages e1003024

    2013

  12. [22]

    Lee , author R

    author J. Lee , author R. S. Sutton , title Policy iterations for reinforcement learning problems in continuous time and space—fundamental theory and methods , journal Automatica volume 126 ( year 2021 ) pages 109421

    2021

  13. [23]

    author R. S. Sutton , author A. G. Barto , title Reinforcement learning: An introduction , publisher MIT press , year 2018

    2018

  14. [24]

    Liu , author Y

    author Y. Liu , author Y. Chen , author T. Jiang , title Dynamic selective maintenance optimization for multi-state systems over a finite horizon: A deep reinforcement learning approach , journal European Journal of Operational Research volume 283 ( year 2020 ) pages 166--181

    2020

  15. [25]

    Lee , author T

    author H.-R. Lee , author T. Lee , title Multi-agent reinforcement learning algorithm to solve a partially-observable multi-agent problem in disaster response , journal European Journal of Operational Research volume 291 ( year 2021 ) pages 296--308

    2021

  16. [26]

    Wang , author T

    author H. Wang , author T. Zariphopoulou , author X. Y. Zhou , title Reinforcement learning in continuous time and space: A stochastic control approach. , journal Journal of Machine Learning Research volume 21 ( year 2020 ) pages 1--34

    2020

  17. [27]

    Jia , author X

    author Y. Jia , author X. Y. Zhou , title Policy evaluation and temporal-difference learning in continuous time and space: A martingale approach , journal Journal of Machine Learning Research volume 23 ( year 2022 ) pages 1--55

    2022

  18. [28]

    Barnard , title Temporal-difference methods and markov models , journal IEEE Transactions on Systems, Man, and Cybernetics volume 23 ( year 1993 ) pages 357--365

    author E. Barnard , title Temporal-difference methods and markov models , journal IEEE Transactions on Systems, Man, and Cybernetics volume 23 ( year 1993 ) pages 357--365

    1993

  19. [29]

    Baird , title Residual algorithms: Reinforcement learning with function approximation , in: booktitle Machine Learning Proceedings 1995 , publisher Elsevier , year 1995 , pp

    author L. Baird , title Residual algorithms: Reinforcement learning with function approximation , in: booktitle Machine Learning Proceedings 1995 , publisher Elsevier , year 1995 , pp. pages 30--37

    1995

  20. [30]

    Guo , author A

    author X. Guo , author A. Hu , author R. Xu , author J. Zhang , title A general framework for learning mean-field games , journal Mathematics of Operations Research ( year 2022 )

    2022

  21. [32]

    Tang , author Y

    author W. Tang , author Y. P. Zhang , author X. Y. Zhou , title Exploratory hjb equations and their convergence , journal SIAM Journal on Control and Optimization volume 60 ( year 2022 ) pages 3191--3216

    2022

  22. [34]

    Cuoco , title Optimal consumption and equilibrium prices with portfolio constraints and stochastic income , journal Journal of Economic Theory volume 72 ( year 1997 ) pages 33--73

    author D. Cuoco , title Optimal consumption and equilibrium prices with portfolio constraints and stochastic income , journal Journal of Economic Theory volume 72 ( year 1997 ) pages 33--73

    1997

  23. [35]

    Dai , author Y

    author M. Dai , author Y. Dong , author Y. Jia , title Learning equilibrium mean-variance strategy , journal Mathematical Finance volume 33 ( year 2023 ) pages 1166--1212

    2023

  24. [36]

    Dai , author H

    author M. Dai , author H. Jin , author S. Kou , author Y. Xu , title A dynamic mean-variance analysis for log returns , journal Management Science volume 67 ( year 2021 ) pages 1093--1108

    2021

  25. [37]

    author W. H. Fleming , author H. M. Soner , title Controlled Markov processes and viscosity solutions , volume volume 25 , publisher Springer Science & Business Media , year 2006

    2006

  26. [38]

    Pham , title Continuous-time stochastic control and optimization with financial applications , volume volume 61 , publisher Springer Science & Business Media , year 2009

    author H. Pham , title Continuous-time stochastic control and optimization with financial applications , volume volume 61 , publisher Springer Science & Business Media , year 2009

    2009

  27. [39]

    Chen , author M

    author A. Chen , author M. Vellekoop , title Optimal investment and consumption when allowing terminal debt , journal European Journal of Operational Research volume 258 ( year 2017 ) pages 385--397

    2017

  28. [40]

    Kamma , author A

    author T. Kamma , author A. Pelsser , title Near-optimal asset allocation in financial markets with trading constraints , journal European Journal of Operational Research volume 297 ( year 2022 ) pages 766--781

    2022

  29. [41]

    Karatzas , author S

    author I. Karatzas , author S. E. Shreve , title Methods of mathematical finance , volume volume 39 , publisher Springer , year 1998

    1998

  30. [42]

    author D. G. Luenberger , title Investment science , publisher Oxford university press , year 1998

    1998

  31. [43]

    author W. H. Fleming , title Generalized solutions in optimal stochastic control , publisher Brown Univ. , year 1976

    1976

  32. [44]

    author W. H. Fleming , author M. Nisio , title On stochastic relaxed control for partially observed diffusions , journal Nagoya Mathematical Journal volume 93 ( year 1984 ) pages 71--108

    1984

  33. [45]

    Nicole el , author N

    author K. Nicole el , author N. Du Huu , author J.-P. Monique , title Compactification methods in the control of degenerate diffusions: existence of an optimal control , journal Stochastics: an international journal of probability and stochastic processes volume 20 ( year 1987...

    1987

  34. [46]

    Donsker , author S

    author M. Donsker , author S. Varadhan , title Large deviations for markov processes and the asymptotic evaluation of certain markov process expectations for large times , in: booktitle Probabilistic Methods in Differential Equations: Proceedings of the Conference Held at the ...

    1974

  35. [47]

    author M. Rubinstein , title The strong case for the generalized logarithmic utility model as the premier model of financial markets , in: booktitle Financial Dec Making Under Uncertainty , publisher Elsevier , year 1977 , pp. pages 11--62

    1977

  36. [48]

    author L. B. Pulley , title Mean-variance approximations to expected logarithmic utility , journal Operations Research volume 31 ( year 1983 ) pages 685--696

    1983

  37. [49]

    Gerrard , author I

    author R. Gerrard , author I. Kyriakou , author J. P. Nielsen , author P. Vodi c ka , title On optimal constrained investment strategies for long-term savers in stochastic environments and probability hedging , journal European Journal of Operational Research volume 307 ( year...

    2023

  38. [50]

    author R. C. Merton , title Optimum consumption and portfolio rules in a continuous-time model , in: booktitle Stochastic optimization models in finance , publisher Elsevier , year 1975 , pp. pages 621--661

    1975

  39. [51]

    El Karoui , author M

    author N. El Karoui , author M. Jeanblanc-Picqu \'e , title Optimization of consumption with labor income , journal Finance and Stochastics volume 2 ( year 1998 ) pages 409--440

    1998

  40. [52]

    Friedman , title Partial differential equations of parabolic type , publisher Courier Dover Publications , year 2008

    author A. Friedman , title Partial differential equations of parabolic type , publisher Courier Dover Publications , year 2008

    2008

  41. [53]

    Kotz , author N

    author S. Kotz , author N. Balakrishnan , author N. L. Johnson , title Continuous multivariate distributions, Volume 1: Models and applications , volume volume 1 , publisher John Wiley & Sons , year 2004

    2004

  42. [54]

    Csisz \'a r , title I-divergence geometry of probability distributions and minimization problems , journal The annals of probability ( year 1975 ) pages 146--158

    author I. Csisz \'a r , title I-divergence geometry of probability distributions and minimization problems , journal The annals of probability ( year 1975 ) pages 146--158

    1975

  43. [55]

    Duffie , author H

    author D. Duffie , author H. R. Richardson , title Mean-variance hedging in continuous time , journal The Annals of Applied Probability ( year 1991 ) pages 1--15

    1991

  44. [56]

    Bodnar , author N

    author T. Bodnar , author N. Parolya , author W. Schmid , title On the equivalence of quadratic optimization problems commonly used in portfolio theory , journal European Journal of Operational Research volume 229 ( year 2013 ) pages 637--644

    2013

  45. [57]

    Li , author X

    author X. Li , author X. Y. Zhou , author A. E. Lim , title Dynamic mean-variance portfolio selection with no-shorting constraints , journal SIAM Journal on Control and Optimization volume 40 ( year 2002 ) pages 1540--1555

    2002

  46. [58]

    author T. R. Bielecki , author H. Jin , author S. R. Pliska , author X. Y. Zhou , title Continuous-time mean-variance portfolio selection with bankruptcy prohibition , journal Mathematical Finance: An International Journal of Mathematics, Statistics and Financial Economics vol...

    2005

  47. [59]

    Li , author Z

    author X. Li , author Z. Q. Xu , title Continuous-time markowitz’s model with constraints on wealth and portfolio , journal Operations research letters volume 44 ( year 2016 ) pages 729--736

    2016

  48. [61]

    Jia , author X

    author Y. Jia , author X. Y. Zhou , title Q -learning in continuous time , journal Journal of Machine Learning Research ( year 2023 )

    2023

  49. [62]

    Baird, L. (1995). Residual algorithms: Reinforcement learning with function approximation. In Machine Learning Proceedings 1995 , pages 30--37. Elsevier

    1995

  50. [63]

    Barnard, E. (1993). Temporal-difference methods and markov models. IEEE Transactions on Systems, Man, and Cybernetics , 23(2):357--365

    1993

  51. [64]

    Bertsekas, D. (2019). Reinforcement learning and optimal control . Athena Scientific

    2019

  52. [65]

    and Thiele, A

    Bertsimas, D. and Thiele, A. (2006). A robust optimization approach to inventory theory. Operations research , 54(1):150--168

    2006

  53. [66]

    R., Jin, H., Pliska, S

    Bielecki, T. R., Jin, H., Pliska, S. R., and Zhou, X. Y. (2005). Continuous-time mean-variance portfolio selection with bankruptcy prohibition. Mathematical Finance: An International Journal of Mathematics, Statistics and Financial Economics , 15(2):213--244

    2005

  54. [67]

    Bodnar, T., Parolya, N., and Schmid, W. (2013). On the equivalence of quadratic optimization problems commonly used in portfolio theory. European Journal of Operational Research , 229(3):637--644

    2013

  55. [68]

    Charpentier, A., Elie, R., and Remlinger, C. (2021). Reinforcement learning in economics and finance. Computational Economics , pages 1--38

    2021

  56. [69]

    and Vellekoop, M

    Chen, A. and Vellekoop, M. (2017). Optimal investment and consumption when allowing terminal debt. European Journal of Operational Research , 258(1):385--397

    2017

  57. [70]

    Csisz \'a r, I. (1975). I-divergence geometry of probability distributions and minimization problems. The annals of probability , pages 146--158

    1975

  58. [71]

    Cuoco, D. (1997). Optimal consumption and equilibrium prices with portfolio constraints and stochastic income. Journal of Economic Theory , 72(1):33--73

    1997

  59. [72]

    Dai, M., Dong, Y., and Jia, Y. (2020). Learning equilibrium mean-variance strategy. Available at SSRN 3770818

    2020

  60. [73]

    Dai, M., Dong, Y., and Jia, Y. (2023). Learning equilibrium mean-variance strategy. Mathematical Finance , 33(4):1166--1212

    2023

  61. [74]

    Dai, M., Jin, H., Kou, S., and Xu, Y. (2021). A dynamic mean-variance analysis for log returns. Management Science , 67(2):1093--1108

    2021

  62. [75]

    and Varadhan, S

    Donsker, M. and Varadhan, S. (2006). Large deviations for markov processes and the asymptotic evaluation of certain markov process expectations for large times. In Probabilistic Methods in Differential Equations: Proceedings of the Conference Held at the University of Victoria...

    2006

  63. [76]

    Doya, K. (2000). Reinforcement learning in continuous time and space. Neural computation , 12(1):219--245

    2000

  64. [77]

    and Richardson, H

    Duffie, D. and Richardson, H. R. (1991). Mean-variance hedging in continuous time. The Annals of Applied Probability , pages 1--15

    1991

  65. [78]

    and Jeanblanc-Picqu \'e , M

    El Karoui, N. and Jeanblanc-Picqu \'e , M. (1998). Optimization of consumption with labor income. Finance and Stochastics , 2:409--440

    1998

  66. [79]

    Fleming, W. H. (1976). Generalized solutions in optimal stochastic control . Brown Univ

    1976

  67. [80]

    Fleming, W. H. and Nisio, M. (1984). On stochastic relaxed control for partially observed diffusions. Nagoya Mathematical Journal , 93:71--108

    1984

  68. [81]

    Fleming, W. H. and Soner, H. M. (2006). Controlled Markov processes and viscosity solutions , volume 25. Springer Science & Business Media

    2006

  69. [82]

    Fr \'e maux, N., Sprekeler, H., and Gerstner, W. (2013). Reinforcement learning using a continuous time actor-critic framework with spiking neurons. PLoS computational biology , 9(4):e1003024

    2013

  70. [83]

    Friedman, A. (2008). Partial differential equations of parabolic type . Courier Dover Publications

    2008

  71. [84]

    P., and Vodi c ka, P

    Gerrard, R., Kyriakou, I., Nielsen, J. P., and Vodi c ka, P. (2023). On optimal constrained investment strategies for long-term savers in stochastic environments and probability hedging. European Journal of Operational Research , 307(2):948--962

    2023

  72. [85]

    Gosavi, A. (2009). Reinforcement learning: A tutorial survey and recent advances. INFORMS Journal on Computing , 21(2):178--192

    2009

  73. [86]

    Guo, X., Hu, A., Xu, R., and Zhang, J. (2022). A general framework for learning mean-field games. Mathematics of Operations Research

    2022

  74. [87]

    Hambly, B., Xu, R., and Yang, H. (2021). Recent advances in reinforcement learning in finance. arXiv preprint arXiv:2112.04553

    2021 arXiv

  75. [88]

    and Wilcox, D

    Hendricks, D. and Wilcox, D. (2014). A reinforcement learning extension to the almgren-chriss framework for optimal trade execution. In 2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr) , pages 457--464. IEEE

    2014

  76. [89]

    Huang, Y.-J., Wang, Z., and Zhou, Z. (2022). Convergence of policy improvement for entropy-regularized stochastic control problems. arXiv preprint arXiv:2209.07059

    2022 arXiv

  77. [90]

    Jaimungal, S. (2022). Reinforcement learning and stochastic optimisation. Finance and Stochastics , 26(1):103--129

    2022

  78. [91]

    and Zhou, X

    Jia, Y. and Zhou, X. Y. (2022a). Policy evaluation and temporal-difference learning in continuous time and space: A martingale approach. Journal of Machine Learning Research , 23(154):1--55

    2022

  79. [92]

    and Zhou, X

    Jia, Y. and Zhou, X. Y. (2022b). Policy gradient and actor-critic learning in continuous time and space: Theory and algorithms. Journal of Machine Learning Research , 23(154):1--55

    2022

  80. [93]

    and Zhou, X

    Jia, Y. and Zhou, X. Y. (2023). Q -learning in continuous time. Journal of Machine Learning Research

    2023

  81. [94]

    P., Littman, M

    Kaelbling, L. P., Littman, M. L., and Moore, A. W. (1996). Reinforcement learning: A survey. Journal of artificial intelligence research , 4:237--285

    1996

  82. [95]

    and Pelsser, A

    Kamma, T. and Pelsser, A. (2022). Near-optimal asset allocation in financial markets with trading constraints. European Journal of Operational Research , 297(2):766--781

    2022

  83. [96]

    and Shreve, S

    Karatzas, I. and Shreve, S. E. (1998). Methods of mathematical finance , volume 39. Springer

    1998

  84. [97]

    Kato, M., Nakagawa, K., Abe, K., and Morimura, T. (2020). Mean-variance efficient reinforcement learning by expected quadratic utility maximization. arXiv preprint arXiv:2010.01404

    2020 arXiv

  85. [98]

    Kotz, S., Balakrishnan, N., and Johnson, N. L. (2004). Continuous multivariate distributions, Volume 1: Models and applications , volume 1. John Wiley & Sons

    2004

  86. [99]

    and Lee, T

    Lee, H.-R. and Lee, T. (2021). Multi-agent reinforcement learning algorithm to solve a partially-observable multi-agent problem in disaster response. European Journal of Operational Research , 291(1):296--308

    2021

  87. [100]

    and Sutton, R

    Lee, J. and Sutton, R. S. (2021). Policy iterations for reinforcement learning problems in continuous time and space—fundamental theory and methods. Automatica , 126:109421

    2021

  88. [101]

    and Xu, Z

    Li, X. and Xu, Z. Q. (2016). Continuous-time markowitz’s model with constraints on wealth and portfolio. Operations research letters , 44(6):729--736

    2016

  89. [102]

    Y., and Lim, A

    Li, X., Zhou, X. Y., and Lim, A. E. (2002). Dynamic mean-variance portfolio selection with no-shorting constraints. SIAM Journal on Control and Optimization , 40(5):1540--1555

    2002

  90. [103]

    Liu, Y., Chen, Y., and Jiang, T. (2020). Dynamic selective maintenance optimization for multi-state systems over a finite horizon: A deep reinforcement learning approach. European Journal of Operational Research , 283(1):166--181

    2020

  91. [104]

    Luenberger, D. G. (1998). Investment science . Oxford university press

    1998

  92. [105]

    Merton, R. C. (1975). Optimum consumption and portfolio rules in a continuous-time model. In Stochastic optimization models in finance , pages 621--661. Elsevier

    1975

  93. [106]

    Moody, J., Wu, L., Liao, Y., and Saffell, M. (1998). Performance functions and reinforcement learning for trading systems and portfolios. Journal of Forecasting , 17(5-6):441--470

    1998

  94. [107]

    Mou, C., Zhang, W., and Zhou, C. (2021). Robust exploratory mean-variance problem with drift uncertainty. arXiv preprint arXiv:2108.04100

    2021 arXiv

  95. [108]

    Nevmyvaka, Y., Feng, Y., and Kearns, M. (2006). Reinforcement learning for optimized trade execution. In Proceedings of the 23rd international conference on Machine learning , pages 673--680

    2006

  96. [109]

    Nicole el, K., Du Huu, N., and Monique, J.-P. (1987). Compactification methods in the control of degenerate diffusions: existence of an optimal control. Stochastics: an international journal of probability and stochastic processes , 20(3):169--219

    1987

  97. [110]

    Pham, H. (2009). Continuous-time stochastic control and optimization with financial applications , volume 61. Springer Science & Business Media

    2009

  98. [111]

    Pulley, L. B. (1983). Mean-variance approximations to expected logarithmic utility. Operations Research , 31(4):685--696

    1983

  99. [112]

    Rubinstein, M. (1977). The strong case for the generalized logarithmic utility model as the premier model of financial markets. In Financial Dec Making Under Uncertainty , pages 11--62. Elsevier

    1977

  100. [113]

    Schnaubelt, M. (2022). Deep reinforcement learning for the optimal placement of cryptocurrency limit orders. European Journal of Operational Research , 296(3):993--1006

    2022

  101. [114]

    and Haeussler, S

    Schneckenreither, M. and Haeussler, S. (2019). Reinforcement learning methods for operations research applications: The order release problem. In Machine Learning, Optimization, and Data Science: 4th International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018, R...

    2019

  102. [115]

    J., Guez, A., Sifre, L., Van Den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al

    Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., Van Den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016). Mastering the game of go with deep neural networks and tree search. nature , 529(7587):484--489

    2016

  103. [116]

    Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017). Mastering the game of go without human knowledge. nature , 550(7676):354--359

    2017

  104. [117]

    Sutton, R. S. and Barto, A. G. (2018). Reinforcement learning: An introduction . MIT press

    2018

  105. [118]

    P., and Zhou, X

    Tang, W., Zhang, Y. P., and Zhou, X. Y. (2022). Exploratory hjb equations and their convergence. SIAM Journal on Control and Optimization , 60(6):3191--3216

    2022

  106. [119]

    Wang, H. (2019). Large scale continuous-time mean-variance portfolio allocation via reinforcement learning. arXiv preprint arXiv:1907.11718

    2019 arXiv

  107. [120]

    Wang, H., Zariphopoulou, T., and Zhou, X. Y. (2020). Reinforcement learning in continuous time and space: A stochastic control approach. Journal of Machine Learning Research , 21(198):1--34

    2020

  108. [121]

    and Zhou, X

    Wang, H. and Zhou, X. Y. (2020). Continuous-time mean--variance portfolio selection: A reinforcement learning framework. Mathematical Finance , 30(4):1273--1308

    2020

  109. [122]

    M., Boots, B., and Theodorou, E

    Williams, G., Wagener, N., Goldfain, B., Drews, P., Rehg, J. M., Boots, B., and Theodorou, E. A. (2017). Information theoretic mpc for model-based reinforcement learning. In 2017 IEEE International Conference on Robotics and Automation (ICRA) , pages 1714--1721. IEEE

    2017

  110. [123]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  111. [124]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  112. [125]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  113. [126]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter edition editor howpublished institution isbn issn journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence af...

  114. [127]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  115. [128]

    @esa (Ref

    \@ifclassloaded aguplus natbib The aguplus class already includes natbib coding, so you should not add it explicitly Type <Return> for now, but then later remove the command natbib from the document \@ifclassloaded nlinproc natbib The nlinproc class already includes natbib cod...

  116. [129]

    @stdbsttrue NAT@ctr \@lbibitem[ NAT@ctr ] \@lbibitem[#1]#2 \@extra@b@citeb \@ifundefined br@#2\@extra@b@citeb \@namedef br@#2 \@nameuse br@#2\@extra@b@citeb \@ifundefined b@#2\@extra@b@citeb @num @parse #2 [ @natanchorstart #2\@extra@b@citeb \@biblabel @num @natanchorend] @ifc...

  117. [130]

    \@@@lbr \@tempdima\@@@rbr\@@@lbr\@@@pcr

    @open @close @open @close and [1] URL: #1 \@ifundefined chapter * \@mkboth \@ifundefined NAT@sectionbib * \@mkboth * \@mkboth\@gobbletwo \@ifclassloaded amsart * \@ifclassloaded amsbook * \@ifundefined bib@heading @heading NAT@ctr thebibliography [1] @ \@biblabel NAT@ctr \@bib...

    1920

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.