EPFL

Even though most of us tie our shoelaces "wrongly," knots in ropes and filaments have been used as functional structures for millennia, from sailing and climbing to dewing and surgery. However, knowledge of the mechanics of physical knots is largely empirical, and there is much need for physics-based predictive models. Tight knots exhibit highly nonlinear and coupled behavior due to their intricate 3D geometry, large deformations, self-contact, friction, and even elasto-plasticity. Additionally, tight knots do not show separation of the relevant length scales, preventing the use of centerline-based rod models. In this talk, I will present an overview of recent work from our research group, combining precision experiments, Finite Element simulations, and theoretical analyses. First, we study the mechanics of two elastic fibers in frictional contact. Second, we explore several different knotted structures, including the overhand, figure-8, clove-hitch, and bowline knots. These knots serve various functions in practical settings, from shoelaces to climbing and sailing. Lastly, we focus on surgical knots, with a particularly high risk of failure in clinical settings, including complications such as massive bleeding or the unraveling of high-tension closures. Our research reveals a striking and robust power law, with a general exponent, between the mechanical strength of surgical knots, the applied pre-tension, and the number of throws, providing new insights into their operational and safety limits. These findings could have potential applications in the training of surgeons and enhanced control of robotic-assisted surgical devices.

At the intersection of Topological Data Analysis and machine learning, the field of cellular signal processing has advanced rapidly in recent years. In this context, each signal on the cells of a complex is processed using the combinatorial Laplacian and the resulting Hodge decomposition. Meanwhile, discrete Morse theory has been widely used to speed up computations by reducing the size of complexes while preserving their global topological properties. In this talk, we introduce an approach to signal compression and reconstruction on complexes that leverages the tools of discrete Morse theory. The main goal is to reduce and reconstruct a cell complex together with a set of signals on its cells while preserving their global topological structure as much as possible. This is joint work with Stefania Ebli and Kelly Maggs.

The path signature is a characterization of paths that originated in Chen's iterated integral cochain model for path spaces and loop spaces. More recently, it has been used to form the foundations of rough paths in stochastic analysis, and provides an effective feature map for sequential data in machine learning. In this talk, we return to the topological foundations in Chen's construction to develop generalizations of the signature.

The Hutchinson’s trace estimator approximates the trace of a large-scale matrix A by computing the average of some quadratic forms involving A and some random vectors. Hutch++ is a more efficient trace estimation algorithm that combines this with the randomized singular value decomposition, which obtains a low-rank approximation of A by multiplying the matrix with some random vectors. In this talk, we present an improved version of Hutch++ which aims at minimizing the computational cost - that is, the number of matrix-vector multiplications with A - needed to achieve a trace estimate with a target accuracy. This is joint work with David Persson and Daniel Kressner.

I will give an overview of audio identification methods on spectral representations of songs. I will outline the persistent homology-based approaches that I propose and their shortcomings. I hope that the review of previous work will help spark a discussion on new possible representations and filtrations.

Elastic gridshells arise from the buckling of an initially planar grid of rods. Architectural elastic gridshells first appeared in the 1970’s. However, to date, only a limited number of examples have been constructed around the world, primarily due to the challenges involved in their structural design. Yet, elastic gridshells are highly appealing: they can cover wide spans with low self-weight, they allow for aesthetically pleasing shapes and their construction is typically simple and rapid. A more mundane example is the classic pasta strainer, which, with its remarkably simple design, is a must-have in every kitchen.

This talk will focus on the geometry-driven nature of elastic gridshells. We use a geometric model based on the theory of discrete Chebyshev nets (originally developed for woven fabric) to rationalize their actuated shapes. Validation is provided by precision experiments and rod-based simulations. We also investigate the linear mechanical response (rigidity) and the non-local behavior of these discrete shells under point-load indentation. Combining experiments, simulations, and scaling analysis leads to a master curve that relates the structural rigidity to the underlying geometric and material properties. Our results indicate that the mechanical response of elastic gridshells, and their underlying characteristic forces, are dictated by Euler's elastica rather than by shell-related quantities. The prominence of geometry that we identify in elastic gridshells should allow for our results to transfer across length scales: from architectural structures to micro/nano–1-df mechanical actuators and self-assembly systems.

[[{"fid":"51243","view_mode":"small_image_100px_h","fields":{"format":"small_image_100px_h","field_file_image_alt_text[und][0][value]":"","field_file_image_title_text[und][0][value]":""},"type":"media","attributes":{"class":"media-element file-small-image-100px-h"}}]]

Bayesian optimization (BO) is a powerful tool for sequentially optimizing black-box functions that are expensive to evaluate, and has extensive applications including automatic hyperparameter tuning, environmental monitoring, and robotics. The problem of level-set estimation (LSE) with Gaussian processes is closely related; instead of performing optimization, one seeks to classify the whole domain according to whether the function lies above or below a given threshold, which is also of direct interest in applications.

In this talk, we present a new algorithm, truncated variance reduction (TruVaR) that addresses Bayesian optimization and level-set estimation in a unified fashion. The algorithm greedily shrinks a sum of truncated variances within a set of potential maximizers (BO) or unclassified points (LSE), which is updated based on confidence bounds. TruVaR is effective in several important settings that are typically non-trivial to incorporate into myopic algorithms, including pointwise costs, non-uniform noise, and multi-task settings. We provide a general theoretical guarantee for TruVaR covering these phenomena, and use it to obtain regret bounds for several specific settings. We demonstrate the effectiveness of the algorithm on both synthetic and real-world data sets.

We know since almost a century that a ball can be decomposed into five pieces and these pieces rearranged so as to produce two balls of the same size as the original. This apparent paradox has led von Neumann to the notion of amenability which is now much studied in many areas of mathematics. However, the initial paradox has remained tied down to an elementary property of free groups of rotations for most of the 20th century. I will describe recent progress leading to new paradoxical groups.