Deep learning has entered algorithmic trading largely as data-driven pattern fitting, which markets punish when regimes change. Physics-informed neural networks offer a different discipline: they embed governing equations directly in the training loss, so the model respects the dynamics even where data are scarce. This paper applies that discipline to portfolio optimisation. The reference problem is Merton’s continuous-time allocation between a risky index and a risk-free asset, whose optimal policy solves a Hamilton-Jacobi-Bellman equation with, for constant relative risk aversion, a closed-form solution. We train a from-scratch physics-informed network to solve the reduced equation with no market data at all, only the equation, and validate that it recovers both the analytic value function, to a relative error below two times ten to the minus four, and the closed-form Merton allocation exactly. Two guarantees support the method: the closed-form policy itself, and an a-posteriori bound showing that the value-function error is controlled by the physics residual. We then backtest the allocation on a seeded simulator calibrated to plausible Indian-market parameters, net of Indian transaction costs, against buy- and-hold, a fixed mix, an unrealisable oracle, and a tradable estimation rule. The lesson is deliberately sober: the physics supplies the correct allocation rule, a constant policy on a stable long-run premium is competitive with a sensible fixed mix and far gentler on drawdown than buy-and-hold, and the value that remains is almost entirely in estimating the inputs, where an oracle would reach a Sharpe ratio of 1.10 but a naive adaptive estimator falls to 0.34 after estimation error and turnover costs. Embedding the governing equations makes the model data-efficient and explainable; it does not repeal the estimation problem, and honest system design should place its effort there. The backtest uses a market simulation, not real exchange data.
S. Satyanarayana· International Journal of Com...· 0 citations
Enterprises have no shortage of agentic AI demonstrations; what they lack is a repeatable way to turn a demonstration into a system a business can depend on. Forward Deployed Engineering closes that gap by embedding an engineer with the customer to own the path from prototype to hardened, monitored production. This paper presents the complete Forward Deployed Engineering (FDE) pipeline that the AlgoProfessor team uses to solve modern enterprise agentic AI challenges, and makes its reliability core precise and reproducible. The central obstacle is compounding error: a task of k sequential steps, each succeeding with probability p, succeeds end-to-end with probability p to the power k, which collapses as k grows. We give a taxonomy of enterprise challenges, a staged pipeline closed by a continuous improvement loop, and a reference architecture for a hardened agentic system in which every action passes verification and human oversight and observability cross-cut the whole. We prove two guarantees: verification with retry lifts the effective per-step success from p to p over one minus one minus p times the catch rate, moving the base of the exponential, and a fixed verification budget is best spent on the weakest steps. A fully reproducible simulation confirms the model: without verification, end-to-end success decays as p to the power k, collapsing to 0.12 at twenty steps, while per-step verification holds it at 0.64 and checkpoints at 0.94; greedy allocation to the weakest steps reaches 0.65 at a budget where random placement reaches only 0.31; and the improvement loop raises reliability from 0.22 toward target over successive iterations. Dependable enterprise agentic AI is engineered, not prompted, and the FDE pipeline is how that engineering is organised.
S. Satyanarayana· International Journal of Com...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.