Sign inGet started
Paper · arXiv

Deep kernel hedging

We introduce a deep kernel hedging framework that combines the flexibility of deep learning with the structural inductive bias of kernel methods. The hedging functional is restricted to a reproducing kernel Hilbert space whose kernel is parameterized through a neural network embedding of the input features. The framework minimizes a regularized empirical risk under convex loss functions and can accommodate path-dependent information through truncated time-augmented signature features. We derive a generalized representer theorem for the joint hedging problem, reducing the empirical optimization to a finite-dimensional problem. To further reduce the computational cost associated with large ...

AuthorsJean-Loup Dupret, Donatien Hainaut, Edouard Motte
Primary categorycs.LG
Published28 September 2026
Last updated at source14 October 2026
cs.LGmath.FAq-fin.CPq-fin.RM
Embed this entry
<iframe src="https://silytics.si/embed/item/d01f6ea9-a45b-4257-a1c6-868e1e3a6181" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.