{"paper_id":"2501.06275","title":"Exploratory Randomization for Discrete-Time Linear Exponential Quadratic Gaussian (LEQG) Problem","authors":["Sebastien Lleo","Wolfgang Runggaldier"],"paper_date":"2025-01-10","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2501.06275v2","page_url":"https://thequant.space/flowcharts/exploratory-randomization-for-discrete-time-linear-exponenti/","scores":{"empirical_rigor":3,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes to introduce exploratory randomization via additive Gaussian perturbations of deterministic controls and to reduce the discrete-time risk‑sensitive LEQG problem to an equivalent risk‑neutral LQG stochastic game with an entropy regularization term using the free‑energy/relative‑ent","quote":"Next, we apply the duality between free energy and relative entropy to reduce the LEQG problem to an equivalent risk-neutral LQG control problem with an entropy regularization term, see, e.g. Dai Pra et al. (1996), for which we present a solution approach based on Dynamic Programming. Our main contribution is to solve the randomized LEQG problem using a duality between free energy and entropy Dai Pra et al. (1996).","summary":"We investigate exploratory randomization for an extended linear-exponential-quadratic-Gaussian (LEQG) control problem in discrete time. This extended control problem is related to the structure of risk-sensitive investment management applications. We introduce exploration through a randomization of…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Controls are randomized by adding an independent Gaussian noise with mean equal to the deterministic control and a variance that models exploration.","type":"model","stated":"explicit","quote":"Here, the mean is the deter-ministic control that captures exploitation, while the variance, which provides an additional (antagonizing) control, models exploration.","support":"full"},{"assumption":"The state noise is i.i.d. Gaussian with possibly time‑varying mean and covariance.","type":"model","stated":"explicit","quote":"Gaussian with mean ¯γt, which may depend on time, and covariance Λt, namely w¯γ t ∼N (¯γt, Λt).","support":"full"},{"assumption":"The randomized control noise is i.i.d. Gaussian with mean \\(\\bar\\eta_t\\) and covariance \\(\\Xi_t\\).","type":"model","stated":"explicit","quote":"Gaussian with mean ¯ηt and covariance Ξt.","support":"full"},{"assumption":"The problem is set in discrete time, which avoids the technical challenges of continuous‑time additive randomization.","type":"model","stated":"explicit","quote":"While implementing additive randomization in continuous-time settings poses significant technical challenges1, the discrete-time framework allows us to focus more directly on the exploration aspect.","support":"full"},{"assumption":"A relative‑entropy penalty is applied to the risk‑neutral reformulation, arising from both the randomized controls and the risk‑sensitive to risk‑neutral transformation.","type":"statistical","stated":"explicit","quote":"This penalization comes from two sources: (i) the randomized controls and (ii) the transition from risk-sensitive to risk-neutral. This risk-neutral randomized stochastic control problem is penalized by an appropriate relative entropy term and formulated as a stochastic game.","support":"full"},{"assumption":"Assumption 3.2 (positivity of certain matrices) holds, ensuring a unique saddle point for the LQG game.","type":"model","stated":"explicit","quote":"As B(1) t > 0, t = 1, . . . , T, Assumption 3.2(i) is satisfied. To check this assumption, we use Sylvester’s criterion.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"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":"none","findings":[{"finding":"The optimal policy and value function are obtained in closed form and are parametrized by the model’s initial data via a backward recursion (Theorem 3.5).","kind":"theoretical","quote":"Both turn out to be parametrized by the initial data of the model via a backward recursion, as stated in Theorem 3.5. We can now state our main Theorem 3.5.","support":"full"},{"finding":"The randomized LEQG problem admits a unique saddle point at \\((u^*,\\gamma^*,\\eta^*)\\) under the stated positivity conditions.","kind":"theoretical","quote":"Nevertheless, we will see below that Assumption 3.2 is satisfied, and so, by Proposition 3.7, the game has a unique saddle point at (u∗, γ∗, η∗). To check this assumption, we use Sylvester’s criterion.","support":"full"},{"finding":"The reduction to a risk‑neutral LQG stochastic game with entropy penalization is established through the energy‑entropy duality.","kind":"theoretical","quote":"risk-sensitive LEQG problem, set with re-spect to an initial measure P, a risk-neutral randomized stochastic control problem, set with respect to a transformed measure. This risk-neutral randomized stochastic control problem is penalized by an appropriate relative entropy term and formulated as a stochastic game.","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":10,"citations":{"cited_by_in_corpus":1,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":1},"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:53:06Z"},"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/"}