Skip to content
DraconiticResearch
Search Sources API
190,335 studies31 sourcesUpdated 20 min ago
PreprintarXiv licencearXiv

Dual Effect and Certainty Equivalence Revisited for a Linear-Gaussian Dual Control Problem

Abstract

This paper revisits the relation between dual effect and certainty equivalence (CE) through a scalar linear-Gaussian model. In dual control, the current input affects not only the immediate cost but also the information available for future decisions, and hence the future cost. Dynamic programming (DP) provides a natural framework for formulating dual control problems. At each step of the Bellman recursion, an optimal input minimizes the sum of the stage cost and the expected cost-to-go. We restrict attention to stage costs minimized by the CE input. However, CE may not minimize the Bellman objective because of the input-dependent expected cost-to-go. Classical no-dualeffect (NDE) conditions guarantee CE optimality in certain problem classes by requiring the conditional distribution of the estimation error to be independent of past controls. In the present model, we observe that CE can remain optimal at the level of a single Bellman recursion even when the classical NDE conditions fail, provided that the expected cost-to-go is independent of the current input. Motivated by this observation, we introduce a notion of NDE formulated directly at the level of the Bellman objective, which we call Bellman-side NDE. Under some mild regularity conditions, we show that Bellman-side NDE can be characterized by a heat equation. This characterization identifies the class of Bellman-side NDE functions, and further yields a decomposition of a generic cost-to-go function into a Bellman-side NDE component and a dual-effect component.

Related

  1. Dynamic Programming for A Linear-Gaussian Dual Control Problem
    Ying Wang, Yuchao Li, Håkan Hjalmarsson
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Tao-Travkin equivalence revisited
    Penghui Li, David Nadler, Yakov Varshavsky +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Conformal Risk-Averse Decision Making with Optimized Certainty Equivalent Risk Control
    Amirmohammad Farzaneh, Osvaldo Simeone
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Gaussian equivalence for CNN with non-Gaussian weights
    Federico Bassetti, Vassili De Palma
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  5. Gaussian Equivalence for Multi-Head Self-Attention
    Tomohiro Hayase, Ryo Karakida
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
BibTeX
@misc{wang2026dual,
  title = {{Dual Effect and Certainty Equivalence Revisited for a Linear-Gaussian Dual Control Problem}},
  author = {Ying Wang and Yue Ju and Håkan Hjalmarsson},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30034},
  eprint = {2610.30034},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30034},
}
RIS
TY  - UNPB
TI  - Dual Effect and Certainty Equivalence Revisited for a Linear-Gaussian Dual Control Problem
AU  - Ying Wang
AU  - Yue Ju
AU  - Håkan Hjalmarsson
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.30034
UR  - https://arxiv.org/abs/2610.30034
AB  - This paper revisits the relation between dual effect and certainty equivalence (CE) through a scalar linear-Gaussian model. In dual control, the current input affects not only the immediate cost but also the information available for future decisions, and hence the future cost. Dynamic programming (DP) provides a natural framework for formulating dual control problems. At each step of the Bellman recursion, an optimal input minimizes the sum of the stage cost and the expected cost-to-go. We restrict attention to stage costs minimized by the CE input. However, CE may not minimize the Bellman objective because of the input-dependent expected cost-to-go. Classical no-dualeffect (NDE) conditions guarantee CE optimality in certain problem classes by requiring the conditional distribution of the estimation error to be independent of past controls. In the present model, we observe that CE can remain optimal at the level of a single Bellman recursion even when the classical NDE conditions fail, provided that the expected cost-to-go is independent of the current input. Motivated by this observation, we introduce a notion of NDE formulated directly at the level of the Bellman objective, which we call Bellman-side NDE. Under some mild regularity conditions, we show that Bellman-side NDE can be characterized by a heat equation. This characterization identifies the class of Bellman-side NDE functions, and further yields a decomposition of a generic cost-to-go function into a Bellman-side NDE component and a dual-effect component.
ER  -