Related papers: Higher-order interaction model from geometric meas…
Finding minima of a real valued non-convex function over a high dimensional space is a major challenge in science. We provide evidence that some such functions that are defined on high dimensional domains have a narrow band of values whose…
Real-world data with underlying structure, such as pictures of faces, are hypothesized to lie on a low-dimensional manifold. This manifold hypothesis has motivated state-of-the-art generative algorithms that learn low-dimensional data…
We analyse and improve the volume-penalty method, a simple and versatile way to model objects in fluid flows. The volume-penalty method is a kind of fictitious-domain method that approximates no-slip boundary conditions with rapid linear…
In this paper a new multiscale modeling technique is proposed. It relies on a recently introduced measure-theoretic approach, which allows to manage the microscopic and the macroscopic scale under a unique framework. In the resulting…
Deep neural networks have achieved remarkable success in various challenging tasks. However, the black-box nature of such networks is not acceptable to critical applications, such as healthcare. In particular, the existence of adversarial…
A variant of consensus based distributed gradient descent (\textbf{DGD}) is studied for finite sums of smooth but possibly non-convex functions. In particular, the local gradient term in the fixed step-size iteration of each agent is…
We introduce the Neural Collaborative Subspace Clustering, a neural model that discovers clusters of data points drawn from a union of low-dimensional subspaces. In contrast to previous attempts, our model runs without the aid of spectral…
In this paper, we consider minimizing a sum of local convex objective functions in a distributed setting, where the cost of communication and/or computation can be expensive. We extend and generalize the analysis for a class of nested…
In fluid mechanics, dimensionless numbers like the Reynolds number help classify flows. We argue that such a classification is also relevant for crowd flows by putting forward the dimensionless Intrusion and Avoidance numbers.Using an…
Particulate Stokesian flows describe the hydrodynamics of rigid or deformable particles in Stokes flows. Due to highly nonlinear fluid-structure interaction dynamics, moving interfaces, and multiple scales, numerical simulations of such…
We propose a modeling framework to develop a continuum description of opinion dynamics on networks as an alternative to other models, like the ones based on graphons. In a nutshell, the continuum model that we propose aims at approximating…
The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…
In this article, we propose a new approach, optimize then agree for minimizing a sum $ f = \sum_{i=1}^n f_i(x)$ of convex objective functions over a directed graph. The optimize then agree approach decouples the optimization step and the…
Surface-subsurface flow models for hydrological applications solve a coupled multiphysics problem. This usually consists of some form of the Richards and shallow water equations. A typical setup couples these two nonlinear partial…
This work establishes the concept of commonsense scene composition, with a focus on extending Belief Scene Graphs by estimating the spatial distribution of unseen objects. Specifically, the commonsense scene composition capability refers to…
This paper addresses the one-bit consensus of controllable linear multi-agent systems (MASs) with communication noises. A consensus algorithm consisting of a communication protocol and a consensus controller is designed. The communication…
We study the possibility of using multilevel algorithms for the computation of correlation functions of gradient flow observables. For each point in the correlation function an approximate flow is defined which depends only on links in a…
Generally, reduced order models of fluid flows are obtained by projecting the Navier-Stokes equations onto a reduced subspace spanned by vector functions that carry the meaningful information of the dynamics. A common method to generate…
The pedestrian flow is one of the most complex systems, involving large populations of interacting agents. Models at microscopic and macroscopic scales offer different advantages for studying related problems. In general, microscopic models…
Linear dimensionality reduction methods are a cornerstone of analyzing high dimensional data, due to their simple geometric interpretations and typically attractive computational properties. These methods capture many data features of…