BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20260120T140000
DTEND;TZID=Europe/Helsinki:20260120T150000
DTSTAMP:20260709T225102
CREATED:20260109T100232Z
LAST-MODIFIED:20260115T092736Z
UID:18710-1768917600-1768921200@crest.science
SUMMARY:Nicolas BARADEL (Inria) "Constrained deep learning for pricing and hedging European options: towards reinforcement learning extensions."
DESCRIPTION:Finance-Insurance\nTime: 14.00 am\nDate:20h of January 2025\nRoom 3049 \nNicolas BARADEL (Inria) “Constrained deep learning for pricing and hedging European options: towards reinforcement learning extensions.” \nAbstract : In incomplete financial markets\, pricing and hedging European options lack a unique no-arbitrage solution due to unhedgeable risks. We introduce a constrained deep learning framework to determine option prices and hedging strategies that minimize the Profit and Loss (P&L) distribution around zero. We employ a single neural network to represent the option price function\, with its gradient serving as the hedging strategy\, optimized via a loss function that enforces the self-financing portfolio condition. A major difficulty stems from the non-smooth nature of option payoffs (e.g.\, vanilla calls are non-differentiable at-the-money\, digital options are discontinuous)\, which conflicts with the intrinsic smoothness of standard neural networks. To overcome this\, we compare unconstrained architectures with constrained networks that explicitly incorporate the terminal payoff condition\, drawing inspiration from PDE boundary embedding techniques. We further explore an extension of this framework by integrating Howard’s policy iteration algorithm within a reinforcement learning perspective. This direction aims to leverage the efficiency of policy iteration while preserving the terminal payoff constraint through the constrained network architecture. \n  \nOrganizers:  Jean-David FERMANIAN \n  \n
URL:https://crest.science/event/arnaud-germain-univ-catholique-de-louvain-cluster-aggregating-application-to-early-warning-system-for-non-performing-clients-2/
CATEGORIES:Finance-Insurance,Seminars
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR