Counting coherent sheaves on Calabi--Yau fourfolds is a subject in its infancy. An evidence of this is given by how little is known about perhaps the simplest case - counting ideal sheaves of length $n$. On the other hand, the parallel story for surfaces while with many open questions has seen many new results, especially in the direction of understanding virtual integrals over Quot-schemes. Motivated by the conjectures of Cao--Kool and Nekrasov, we study virtual integrals over Hilbert schemes of points of top Chern classes $c_n(L^{[n]})$ and their K-theoretic refinements. Unlike lower-dimensional sheaf-counting theories, one also needs to pay attention to orientations. In this, we rely on the conjectural wall-crossing framework of Joyce. The same methods can be used for Quot-schemes of surfaces and we obtain a generalization of the work of Arbesfeld--Johnson--Lim--Oprea--Pandharipande for a trivial curve class. As a result, there is a correspondence between invariants for surfaces and fourfolds in terms of a universal transformation.

In my talk, I will introduce a family of human-machine interaction (HMI) models in optimal portfolio construction (robo-advising). Modeling difficulties stem from the limited ability to quantify the human’s risk preferences and describe their evolution, but also from the fact that the stochastic environment, in which the machine optimizes, adapts to real-time incoming information that is exogenous to the human. Furthermore, the human’s risk preferences and the machine’s states may evolve at different scales. This interaction creates an adaptive cooperative game with both asymmetric and incomplete information exchange between the two parties.

As a result, challenging questions arise on, among others, how frequently the two parties should communicate, what information can the machine accurately detect, infer and predict, how the human reacts to exogenous events, how to improve the inter-linked reliability between the human and the machine, and others. Such HMI models give rise to new, non-standard optimization problems that combine adaptive stochastic control, stochastic differential games, optimal stopping, multi-scales and learning.

We introduce a new method for high-dimensional, online changepoint detection in settings where a $p$-variate Gaussian data stream may undergo a change in mean. The procedure works by performing likelihood ratio tests against simple alternatives of different scales in each coordinate, and then aggregating test statistics across scales and coordinates. The algorithm is online in the sense that both its storage requirements and worst-case computational complexity per new observation are independent of the number of previous observations. We prove that the patience, or average run length under the null, of our procedure is at least at the desired nominal level, and provide guarantees on its response delay under the alternative that depend on the sparsity of the vector of mean change. Simulations confirm the practical effectiveness of our proposal, which is implemented in the R package 'ocd', and we also demonstrate its utility on a seismology data set.

In its simplest instance, kinetic Brownian in R^d is a C¹ random path (m_t, v_t) with unit velocity v_t a Brownian motion on the unit sphere run at speed a > 0. Properly time rescaled as a function of the parameter a, its position process converges to a Brownian motion in R^d as a tends to infinity. On the other side the motion converges to the straight line motion (= geodesic motion) when a goes to 0. Kinetic Brownian motion provides thus an interpolation between geodesic and Brownian flows in this setting. Think now about changing R^d for the diffeomorphism group of a fluid domain, with a velocity vector now a vector field on the domain. I will explain how one can prove in this setting an interpolation result similar to the previous one, giving an interpolation between Euler’s equations of incompressible flows and a Brownian-like flow on the diffeomorphism group.