Date/Time : 09 Oct 2026 15:00
Venue : S17 #04-05 (Seminar Room 2)
Speaker : Suren Jayasuriya , Arizona State University

Long-range imaging ( >0.5km) can be challenging due to the presence of atmospheric turbulence which causes optical distortion and blur. These effects are caused by changing meteorological conditions and the chaotic fluid motion of air which causes spatiotemporal changes in the refractive index of the media, resulting in the bending of light rays as they propagate. In this talk, I will discuss the challenges of imaging and computer vision at long-ranges through atmospheric turbulence, and present physics-based computer vision, graphics and machine learning to estimate turbulent conditions, simulate turbulent images optically, and finally develop algorithms to mitigate the effects of turbulence for improved imaging and computer vision. I will conclude by outlining remaining challenges in the field and potential future avenues of research.

Add to calendar :

Date/Time : 02 Oct 2026 16:00
Venue : S17 #04-06 (Seminar Room 1)
Speaker : Deng, Liangjian, University of Electronic Science and Technology of China

This talk primarily explores how to embed deep learning priors and traditional variational optimization model into a general modelling framework, which can effectively enhance the accuracy, generalizability, and interpretability of current intelligence methods. The talk mainly covers two aspects: 1) introducing the general embedded modelling framework, which bridges traditional variational optimization models and deep learning models; 2) giving some examples of the general embedded modelling framework, which are successfully applied to some representative data fusion tasks, also analyzing the relationship between these techniques and current mainstream deep learning approaches.

Add to calendar :

Date/Time : 08 Jul 2026 15:00
Venue : S17 #04-04 (Seminar Room 3)
Speaker : Jean-Bernard Lasserre, LAAS-CNRS

Anomaly detection plays a critical role in identifying unusual patterns across domains such as fraud detection, network intrusion, and system fault diagnosis. Relatively recently, Christoffel Function (CF) based methods have emerged as powerful and easy-to-use tools for support inference and outlier (or anomaly) detection in data mining.  However in their original form, their suffer from a scalability issue even for moderate data dimension. In this talk we describe two ways of addressing this challenge.

In a first direction we briefly describe how to construct a Christoffel-like rational function when $\mu satisfies a correlative sparsity pattern associated with a graphical model. Its computational complexity is parametrized by the tree-width of the associated graph. In a second direction we consider the general cas with no assumption on the underlying measure $\mu$ associated with the data cloud. One introduces the mapping $y\mapsto g_x(y):=norm(x-y)^2$ and the CF associated the univariate pushforward $\nu_x$ of $\mu$ by $g_x$. The score function is now the CF of $\nu_x$ evaluated at $z=0$ (and so must be recomputed when $x$ changes). We describe its remarkable properties for support inference and density approximation, and Its efficiency on a large set of benchmarks.

Add to calendar :

Date/Time : 24 Jun 2026 11:00
Venue : S17 #06-11 (Seminar Room 6)
Speaker : Cheng Xiuyuan, Duke University

Wasserstein regularization has become a common tool in learning problems over distributions, while its practical computation remains challenging, especially in high dimensions. This talk presents a framework for Wasserstein-regularized learning based on directly parameterizing transport maps with neural networks. Rather than working with dual potentials or entropic relaxations, we explicitly model the transport map, which enables principled optimization in Wasserstein space as well as scalable out-of-sample evaluation. One example is the implementation of Wasserstein-2 proximal steps via flow networks that realize the Jordan–Kinderlehrer–Otto (JKO) scheme, yielding a variational interpretation of flow-based generative models. The talk will also discuss a minimax regime motivated by distributionally robust optimization (DRO), where transport is chosen adversarially. In this setting, neural transport maps provide a practical framework for studying Wasserstein minimax problems and representing worst-case distributions. Together, these examples highlight the flexibility of transport-map formulations for incorporating Wasserstein geometry into learning problems over distributions.

Add to calendar :

Date/Time : 17 Jun 2026 15:00
Venue : S17 #04-04 (Seminar Room 3)
Speaker : Guo Weihong, Case Western Reserve University

Variational model based and deep learning data-based approaches are distinct tools for image analysis and computer vision, each with its own strengths and limitations. Variational models minimize energy functionals which encode desired properties like smoothness, boundary sharpness, etc. The models provide a clear interpretation and control over image features by picking one or multiple regularization terms. Instead of relying on handcrafted features, deep learning models learn image features from data during the training process. These models can directly map input images to desired outputs, making the process highly automated and efficient. DL methods lack interpretability in terms of how exactly the model is making its decisions. Without enough data or proper regularization, models may overfit to training data and the results miss regularity. In this talk, we present our recent research done in fusing the strength of variational models and deep learning models for image segmentation methods that have better mathematical interpretability, less overfitting and better regularity.

Add to calendar :

Date/Time : 12 Jun 2026 16:00
Venue : S17 #04-05 (Seminar Room 2)
Speaker : Shuai Cheng Li, City University of Hong Kong

Breakage-fusion-bridge (BFB) is a complex rearrangement that leads to tumor malignancy. Existing models for detecting BFBs rely on the ideal BFB hypothesis, ruling out the possibility of BFBs entangled with other structural variations, that is, complex BFBs. We propose an algorithm, Ambigram, to identify complex BFB and reconstruct the rearranged structure of the local genome during the cancer subclone evolution process. Ambigram handles data from short, linked, long, and single-cell sequences, and optical mapping technologies. Ambigram successfully deciphers the gold- or silver-standard complex BFBs against the state-of-the-art in multiple cancers. Ambigram dissects the intratumor heterogeneity of complex BFB events with single-cell reads from melanoma and gastric cancer. Furthermore, applying Ambigram to liver and cervical cancer data suggests that the BFB mechanism may mediate oncovirus integrations. BFB also exists in noncancer genomics.
Investigating the complete human genome reference with Ambigram suggests that the BFB mechanism may be involved in two genome reorganizations of Homo Sapiens during evolution. Moreover, Ambigram discovers the signals of recurrent foldback inversions and complex BFBs in whole genome data from the 1000 Genome Project, and congenital heart diseases, respectively.

Add to calendar :

Date/Time : 29 May 2026 16:00
Venue : S17 #04-05 (Seminar Room 2)
Speaker : Yufeng Wu, University of Connecticut

Single cell sequencing technologies are generating DNA sequences for individual cells of an organism. Such data enables novel study of single cell evolution. Cell lineage tree is an evolutionary model for single cells, where the leaves of the tree are the extant cells and the internal nodes are the progenitor cells. Reconstructing cell lineage tree from single cell data has been actively studied recently. The main computational challenges for cell lineage tree inference are the inherent noises in single cell data and also the size of the data. In this talk, I will first introduce perfect phylogeny, a simple evolutionary tree model that has been used extensively in cancer and single cell evolution. Then I will present my own work ScisTree, a probabilistic cell lineage tree inference method based on the perfect phylogeny model. Then, I will focus on presenting ScisTree2, a state-of-the-art cell lineage tree inference method that is orders of magnitude faster than ScisTree. I will show some results of ScisTree2 on simulated and biological data.

Add to calendar :

Date/Time : 17 Mar 2026 15:00
Venue : IMS Executive Seminar Room (S17 Level 3)
Speaker : Mihai Anitescu, Argonne National Laboratory and University of Chicago

Since 2018, with several co-authors, we have pursued a research program to explain a phenomenon first observed in long-horizon optimal control problems. That is when the data of the problem is perturbed at a certain temporal index, the effect of the perturbation on the solution at a different temporal index decays exponentially fast with respect to the distance between the two. We have shown, that, under uniform second order and linear independence constraint qualifications this phenomenon holds and we extended this proof for spatially-indexed, and more generally, graph-indexed problems. In turn, this allows proving that Schwarz-type decompositions with overlap used as either preconditioners or as solution schemes improve convergence exponentially fast with the size of the overlap. We discuss the consequences of this observation for design of efficient parallel algorithms and decentralized optimization schemes and present a few of their applications.

Add to calendar :

Date/Time : 10 Feb 2026 16:00
Venue : S17 #04-06 (Seminar Room 1)
Speaker : Jean Lasserre, Laboratory for Analysis and Architecture of Systems, CNRS, France

In this talk we propose and describe a hierarchy of semidefinite relaxations that approximate as closely as desired the total variation distance between two given measures $\mu$ and $\nu$, from the sole knowledge of their respective moments. We only assume that both satisfy Carleman’s condition (hence with possibly non-compact support). We obtain a sequence of pseudo-moments that converges to moments of the Hahn-Jordan decomposition of $\mu-\nu$. We then apply this technique to the problem of computing mixtures of Gaussians that minimize the TV-distance to a given measure.

Add to calendar :