粗糙路径与路径签名理论新进展 Recent Advances in Rough Path and Signature Theory

粗糙路径与路径签名理论新进展    

Recent Advances in Rough Path and Signature Theory

日期 (Date): 2025年9月15 - 19 日 (September 15th - 19th 2025)

地点 (Venue): 上海科技大学创意与艺术学院南楼 408 室 (Room 408, South Building, School of Creativity & Arts, ShanghaiTech University)

会议主题 (Primary Purpose of Conference)

本次会议将聚焦近期粗糙路径与路径签名理论在数学层面的新进展，及其在机器学习，金融数学，数值分析与统计中的应用。

This conference will focus on mathematical issues and aspects of general rough path theory and their applications in various areas such as machine learning, mathematical finance, numerical analysis and statistics.

邀请报告人 (Invited Speakers)

Christian Bayer (WIAS Berlin)

Xin Chen (Shanghai Jiao Tong University)

Samuel Crew (National Tsing Hua University)

Joscha Diehl (Greifswald University)

Xi Geng (Melbourne University)

Paul Hager (Vienna University)

Anna Kwossek (Vienna University)

Darrick Lee (Edinburgh University)

Terry Lyons (Oxford University)Qi Meng (Chinese Academy of Sciences)

Zhongmin Qian (Oxford University)

Nikolas Tapia (WIAS Berlin)

Yue Wu (Strathclyde University)

Danyu Yang (Chongqing University)

Lingyi Yang (Oxford University)

Huilin Zhang (Shandong University)

组委会 (Organizing Committee)

Siran Li (Shanghai Jiao Tong University)

Chong Liu (ShanghaiTech University)

Hao Ni (University College London)

Shi Wang (ShanghaiTech University)

联系人 (Contact): Chong Liu (liuchong@shanghaitech.edu.cn)

Program:

Global and local regression: a signature approach with applications

Christian Bayer (WIAS Berlin)

Abstract: The path signature is a powerful tool for solving regression problems on path space, i.e., for computing conditional expectations $\mathbb{E}[Y | X]$ when the random variable $X$ is a stochastic process -- or a time-series. We provide new theoretical convergence guarantees for two different, complementary approaches to regression using signature methods. In the context of global regression, we show that linear functionals of the robust signature are universal in the $L^p$ sense in a wide class of examples. In addition, we present a local regression method based on signature semi-metrics, and show universality as well as rates of convergence. Based on joint works with Davit Gogolashvili, Luca Pelizzari, and John Schoenmakers.

Title: tbc

Xin Chen (Shanghai Jiao Tong University)

Quantum path signatures

Samuel Crew (National Tsing Hua University)

Abstract: I discuss recent work on quantum path signatures that places path signatures and associated kernels in a physical gauge-theoretic context. Specifically, I will discuss random unitary developments of smooth paths and derive governing integro-differential that generalise loop equations from random matrix theory. I will discuss a quantum circuit construction and a sparse GUE ensemble that give rise to an efficient quantum algorithm in the one clean qubit model to compute the development.

CosAttention: some non-linearity for linear-cost attention alternatives

Joscha Diehl (Greifswald University)

Abstract: Based on a trignonometric identity, we introduce CosAttention, a nonlinear, attention-like procedure with linear runtime. We show some preliminary success in the long range arena in using it to improve the accuracy of linear-cost attention alternatives (linear attention, linear SSMs). Work in progress

with Richard Krieg.

Cartan's path development, the logarithmic signature and a conjecture of Lyons-Sidorova

Xi Geng (Melbourne University)

Abstract: It is well known that the signature coefficients of a rough path decay factorially fast, hence possessing an infinite radius of convergence (R.O.C.). On the other hand, it is a highly non-trivial fact that the logarithmic signature coefficients only possess geometric decay. This was confirmed for two special classes of paths in the work of Lyons-Sidorova 2006 and they conjectured that the only BV paths whose logarithmic signature can have infinite R.O.C. are straight lines.

In this talk, we show that if the logarithmic signature of a path has infinite R.O.C., its signature coefficients must satisfy a rigid system of algebraic relations which impose strong geometric constraints on the path, and in some special situations, confirms the Lyons-Sidorova conjecture. As an application of these algebraic identities, we prove a weak version of the conjecture, which asserts that if the logarithmic signature of a BV path has infinite R.O.C. over all time intervals [s,t], the path must live on a straight line.

This is based on a recent joint work with Horatio Boedihardjo (Warwick) and my PhD student Sheng Wang.

Expected Signature Kernels of Lévy Processes

Paul Hager (Vienna University)

Abstract: The expected signature kernel arises in statistical learning tasks as a similarity measure of probability measures on path space. Computing this kernel for known classes of stochastic processes is an important problem that, in particular, can help reduce computational costs. Building on the representation of the expected signature of inhomogeneous Lévy processes as the development of a smooth path in the extended tensor algebra [F.-H.-Tapia, Forum of Mathematics: Sigma (2022), ”Unified signature cumulants and generalized Magnus expansions”], we extend the arguments developed for smooth rough paths in [Lemercier-Lyons (2024), ”A high-order solver for signature kernels”] to derive a PDE system for the expected signature of inhomogeneous Lévy processes. As a specific example, we demonstrate that the expected signature kernel of Gaussian martingales satisfies a Goursat PDE.

A rough path approach to pathwise stochastic integration à la Föllmer

Anna Kwossek (Vienna University)

Abstract: In this talk, we present a general framework for pathwise stochastic integration that extends Föllmer integration and provides pathwise analogues of Itô and Stratonovich integration. Using the concepts of quadratic variation and Lévy area of a continuous path along a sequence of partitions, we define pathwise stochastic integrals as limits of general Riemann sums and show that these coincide with suitable rough path integrals. Furthermore, we state necessary and sufficient conditions for the quadratic variation and Lévy area of a continuous path to be invariant with respect to the choice of the partition sequence. This talk is based on joint work with Purba Das and David Prömel.

The Signature of Piecewise Linear Surfaces

Darrick Lee (Edinburgh University)

Abstract: In this talk, we introduce the surface signature for piecewise linear surfaces, which satisfies a 2D Chen’s identity: it preserves horizontal and vertical concatenation of surfaces. Furthermore, we discuss the injectivity of the surface signature up to thin homotopy (analogous to tree-like equivalence of paths). Based on joint work with Francis Bischoff.

Streamed multimodal data is everywhere: applications of rough path theory

Terry Lyons (Oxford University)

Abstract: When data arrives in different channels, and the order of arrival matters, (the person arrives before or after the bus) then classical time series become a very ineffective way to record this data. Sampling needs to be frequent to capture order, but then the dimension of the feature set becomes extraordinarily high requiring huge data or ad hoc assumptions to learn patterns.

Rough path theory breaks this contradiction using group elements to represent paths over moderate intervals.

We will survey many real world applications of rough path theory to tackle practical data driven challenges.

AI for Solving SPDE

Qi Meng (Chinese Academy of Sciences)

Abstract: Stochastic Partial Differential Equations (SPDEs) driven by random noise play a central role in modelling physical processes whose spatio-temporal dynamics can be rough, such as turbulence flows, superconductors, and quantum dynamics. To efficiently model these processes and make predictions, machine learning (ML)-based surrogate models are proposed, with their network architectures incorporating the spatio-temporal roughness in their design.In this talk, I will introduce a ML-based surrogate model named DLR-Net, which is specially designed for solving SPDEs, and then, I will introduce SPDEBench, which includes typical datasets, benchmark ML models and unified evaluation for solving regular and singular SPDEs.

Conditional law duality and Feynman-Kac formula

Zhongmin Qian (Oxford University)

Abstract: There are families of probability measures on path spaces of continuous paths, the diffusion measures and their conditional laws, associated with a time-dependent elliptic operator. These infinite dimensional measures enhance the function of fundamental solutions and are very useful in the study of parabolic equations. I shall report a result on the duality of conditional laws associated with an elliptic operator of second-order, and derive new kind of Feynman-Kac formulas representing implicitly solutions of parabolic systems via diffusion measures.

Title: tbc

Nikolas Tapia (WIAS Berlin)

Randomised quadrature, stochastic sewing lemma and beyond

Yue Wu (Strathclyde University)

Abstract: The numerical error of a method used to approximate the solution of a differential equation can often be traced back to the underlying quadrature error. In settings where the driving signal is irregular in time—such as time-irregular ordinary differential equations—or where the coefficients themselves are irregular—as in stochastic differential equations—the role of quadrature becomes subtler. In these cases, randomised quadrature rules provide a natural framework, since they connect closely with the stochastic sewing lemma, which allows one to rigorously control approximations under irregularity. This framework extends beyond classical ODE and SDE solvers: the same principle can be generalized to finite element methods, where numerical errors similarly reduce to localized quadrature-type approximations, and randomised  variants can be exploited to handle irregular data or coefficients.

The Lipschitz continuity of the solution to branched rough differential equations

Danyu Yang (Chongqing University)

Abstract: Based on an isomorphism between the Grossman–Larson Hopf algebra and the tensor Hopf algebra, we apply a sub-Riemannian geometry technique to branched rough differential equations. This allows us to establish the explicit Lipschitz continuity of the solution with respect to the initial value, the vector field, and the driving rough path.

Structured Linear CDEs: trade-off between expressivity and parallelism for sequence models

Lingyi Yang (Oxford University)

Abstract: When designing the architecture of deep sequence models, we want state-transition matrices that are expressive enough to capture complex patterns while maintaining the ability to be trained at scale. In this talk, I will introduce Structured Linear Controlled Differential Equations (SLiCEs), a unifying framework that brings together existing structured approaches and introduces new ones motivated by this issue. SLiCEs show how block-diagonal, sparse, and Walsh-Hadamard transition structures can retain the full expressivity of dense models while being cheaper to compute. On benchmarks, SLiCEs solve the A5 state-tracking task with a single layer, achieve best-in-class generalisation on regular language tasks, and match state-of-the-art performance on time-series classification while cutting per-step training time by a factor of twenty.

Rough Stochastic Filtering

Huilin Zhang (Shandong University)

Abstract: In this talk, the theory of rough stochastic differential equations [Friz-Hocquet-Le '21] is applied to revisit classical problems in stochastic filtering.

We provide rough counterparts to the Kallianpur-Striebel formula and the Zakai and Kushner--Stratonovich equations, seen to coincide with classical objects upon randomization. We follow [Crisan-Pardoux '24] in doing so in a correlated diffusion setting, where classical Ito-based duality arguments break down.

Well-posedness of the (rough) filtering equation is seen to hold under dimension-independent regularity assumption, in contrast to the stochastic case.

Information on Accommodation, Traffic and Payment in Shanghai:

入住酒店 (Accommodation)

张江海科雅乐轩酒店 (Aloft Hotel Shanghai Zhangjiang Haike)

酒店网站 (website of the hotel):

中文https://www.marriott.com.cn/hotels/shaal-aloft-shanghai-zhangjiang-haike/overview/

English https://www.marriott.com/en-us/hotels/shaal-aloft-shanghai-zhangjiang-haike/overview/

参会期间的餐饮 (Meals during the conference)

Breakfast: 雅乐轩酒店/Aloft hotel

Sep. 15th

Lunch: 11:30 – 13:00, 白玉兰餐厅二楼/2th floor of Baiyulan Canteen.

Dinner （Conference Banquet）: 18:00 – 20:00,  台乡缘.台府 (张江科学城店)/Taixiang Yuan-Taifu Restaurant.

Sep. 16th

Lunch: 11:30 – 13:00, 学校西餐厅/Cafeteria in the campus.

Dinner: 17:30 – 19:30, 白玉兰餐厅二楼/2th floor of Baiyulan Canteen.

Sep. 17th

Lunch: 11:30 – 13:00, 学校西餐厅/Cafeteria in the campus.

Dinner: 外滩附近某待定饭店/A restaurant near The Bund,tbc.

Sep. 18th

Lunch: 11:30 – 13:00, 学校西餐厅/Cafeteria in the campus.

Dinner: 17:30 – 19:30, 白玉兰餐厅二楼/2th floor of Baiyulan Canteen.

Sep. 19th

Lunch: 11:30 – 13:00, 学校西餐厅/Cafeteria in the campus.

从浦东机场到酒店 (From the PVG Airport to Hotel)

● 打车 (Taxi): Around 80 - 120 RMB (10 - 15 Euro), 30 minutes out of peak time (7:00 - 9:00, 16:30 - 18:30), otherwise can be 40 - 50 minutes. Since most of taxi drivers cannot speak English very well, please just show the taxi driver the address of the hotel: 张江海科雅乐轩酒店，浦东新区张江海科路550号.

How to pay the taxi:

Payment to taxi drivers in China is nowadays almost exclusively mobile, so you have to use Alipay (支付宝) or wechat (微信) to pay the taxi fares through your mobile phone, by scanning the QR code that the taxi driver provides to you. You can find more information on how to download and use these apps (Alipay and wechat) below, see the “Payment in China” section.

If you want to use Alipay to pay, please show the following to the taxi driver:

我想用支付宝付车费。

If you want to use wechat to pay, please show the following to the taxi driver:

我想用微信付车费。

Then the taxi driver will show you a QR code, you may open the corresponding app and scan this QR code to complete the payment.

Please note that most taxis in Shanghai cannot accept credit cards.

Cash can be accepted in taxis, but usually no change (as the taxi drivers often have no cash at hand because the mobile payment is so popular here).

● 地铁 (Underground): 8 RMB and takes about 60 minutes plus 12 minutes walk.

1. 乘坐地铁二号线，从浦东机场1号2号航站楼至龙阳路站，之后换乘16号线。

Take Line 2 from Pudong Airport Terminal 1 & 2 station until Longyang Road Station, then change to Line 16.

2. 在龙阳路站乘坐地铁16号线，至华夏中路站，之后换乘13号线。

Line 16 until Middle Huaxia Road station, then change to Line 13.

3. 在华夏中路站乘坐地铁13号线，至中科路站，从5号口出站。

Line 13 until Zhongke Road station, follow exit door 5 (see the red circle in the following picture).

4. 从5号口出站后，沿金科路向北走约165米，左转进入海科路，步行450米左右即可抵达酒店。

Walk North along Jinke Road (165 meters), then Turn Left along Haike Road (450 meters) until you arrive at the hotel (see the blue circle in the following picture.

How to pay the Underground:

In principle, VISA, MASTER, Union Pay all work. But it is recommended to use an app like Alipay to pay by showing a QR code, or purchase a metro card at the station. If you have trouble in paying underground, please ask the info desk at the station (as the staff therein can speak some English).

We would like to recommend taking a taxi from the PVG airport to the hotel, as you have to change twice by taking the underground, and need to walk a lot.

从酒店到会场 (From Hotel to Conference)

The conference takes place in 上海科技大学创意与艺术学院南楼 408 室 (Room 408, South Building, School of Creativity & Arts, ShanghaiTech University). It will take 10 min from the hotel to the above building by walking.

We will pick you up at the lobby of the hotel at 8:15 AM on 15th September and then go to the conference classroom together, so that you can easily know the way from the hotel to the classroom of the conference.

如果您有中国手机号码与微信账号，请在会议开始前1-3天按照下图所示的步骤打开入校二维码，届时可以通过在闸机上扫描二维码的方式入校。

If you have a wechat account and a Chinese mobile phone number, then please follow the steps indicated in the graph below to get the access QR code to enter the campus.

If you do not have a Chinese mobile phone number, we will provide a campus card to you when we meet at the lobby of the hotel at 8:15 AM on 15th September. You can use this card to get access to the campus.

Payment in China

Payment in China is nowadays almost exclusively contactless and with mobile. It is extremely convenient, however, it means that alternative payment methods are less widespread.

● Mobile Payment: Very easy to register and use.

1. Download Alipay (支付宝) or wechat (微信) from the app store.

2. Register with your mobile phone number.

3. Add bank card.

           The overall help can be found by clicking this link: 2024052411343817647.pdf

From there you can pay anywhere by showing or scanning a QR code. You also have access to underground, taxi service, food and grocery delivery, bicycles all within the app.

● Credit Card: Visa, MASTER, Union Pay all work. But not every shop in Shanghai accepts this mode of payment.

● Cash: Though accepted in most shops and taxis, it is very difficult to pay with cash presently (often no change).

Warning: Since your wallet is your phone, you need internet connection (roaming or local sim) as well as enough power for your phone.

Warning: Since google, facebook, whatsApp cannot be used in China by using the local internet connection, if you want to use them, please prepare a VPN.