BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.33.0//EN
X-ORIGINAL-URL:https://dcn.nat.fau.eu/
X-WR-CALNAME:
X-WR-CALDESC:FAU DCN-AvH. Chair for Dynamics, Control, Machine Learning and Numerics -Alexander von Humboldt Professorship
X-WR-TIMEZONE:Europe/Berlin
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T030000
RRULE:FREQ=YEARLY;BYMONTH=03;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=4SU
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-2547399267ae0ffdef2b531c96c88a76@dcn.nat.fau.eu
DTSTART;TZID=Europe/Berlin:20210324T003000
DTEND;TZID=Europe/Berlin:20210324T133000
DTSTAMP:20211020T084130Z
CREATED:20211020
LAST-MODIFIED:20220117
PRIORITY:5
SEQUENCE:0
TRANSP:OPAQUE
SUMMARY:Optimal sampling in least-squares methods – applications in PDEs and inverse problems
DESCRIPTION:Speaker: Prof. Dr. Albert Cohen\nAffiliation: Laboratoire Jacques-Louis Lions, Sorbonne Université, France\nZoom meeting link\nMeeting ID: 927 4962 1451 | PIN code: 534277\nAbstract. Recovering an unknown function from point samples is an ubiquitous task in various applicative settings: non-parametric regression, machine learning, reduced modeling, response surfaces in computer or physical experiments, data assimilation and inverse problems. In the first part of this lecture, I shall present a theoretical setting that yield recovery bounds in the context where the user is allowed to select the measurement points, sometimes refered to as active learning. These results allow us to derive an optimal sampling point distribution when the approximation is searched in a linear space of finite dimension n and computed by weigted-least squares. Here optimal means both that the approximation is comparable to the best possible in this space, and that the sampling budget m barely exceeds n. The main involved tools are inverse Christoffel functions and matrix concentration inequalities.\nIn a second part, I shall cover some novel and ongoing developments building upon this approach. The first one addresses the setting where the approximation space is not fixed but adaptively generated with growing dimension n, which requires a particular online sampling methodology. The second discusses the setting where the measurements are not point value but more general functionals which may be\nthought as point evaluation in a transformed space, the typical applicative setting being that of inverse problems, and also of collocation methods for solving PDEs.\n
URL:https://dcn.nat.fau.eu/events/optimal-sampling-in-least-squares-methods-applications-in-pdes-and-inverse-problems/
CATEGORIES:FAU CAA Seminar
ATTACH;FMTTYPE=image/png:https://dcn.nat.fau.eu/wp-content/uploads/CAAseminar-default-wLogo-featured-1.png
END:VEVENT
END:VCALENDAR