Publication

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Publications associées (31)

The multivariate Serre conjecture ring

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Academic Press Inc Elsevier Science2023

A model for the consolidation of hybrid textiles considering air entrapment, dissolution and diffusion

Véronique Michaud, Vincent Werlen, Christian Rytka

A new model is proposed for the consolidation of hybrid textiles, in which air entrapment and dissolution are considered. One of the key parameters is tow permeability, which is described by the analytical model of Gebart and validated at very high fibre v ...

ELSEVIER SCI LTD2023

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Yannis Dirk Voet

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

ELSEVIER SCIENCE INC2023

How to Achieve Large-Area Ultra-Fast Operation of MoS 2 Monolayer Flash Memories?

Andras Kis, Aleksandra Radenovic, Yanfei Zhao, Zhenyu Wang, Guilherme Migliato Marega, Mukesh Kumar Tripathi, Hyungoo Ji, Asmund Kjellegaard Ottesen

Memory devices have returned to the spotlight due to increasing interest in using in-memory computing architectures to make data-driven algorithms more energy-efficient. One of the main advantages of this architecture is the efficient performance of vector ...

2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Nonperturbative aspects of scattering amplitudes

Miguel Alexandre Ribeiro Correia

In this thesis we study how physical principles imposed on the S-matrix, such as Lorentz invariance, unitarity, crossing symmetry and analyticity constrain quantum field theories at the nonperturbative level. We start with a pedagogical introduction to the ...

EPFL2023

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Towards a nonperturbative construction of the S-matrix

Francesco Riva, Matthew Thomas Walters, Brian Quinn Henning

We present a nonperturbative recipe for directly computing the S-matrix in strongly-coupled QFTs. The method makes use of spectral data obtained in a Hamiltonian framework and can be applied to a wide range of theories, including potentially QCD. We demons ...

Springer Nature2023

DARE-GRAM : Unsupervised Domain Adaptation Regression by Aligning Inverse Gram Matrices

Ismail Nejjar, Olga Fink

Unsupervised Domain Adaptation Regression (DAR) aims to bridge the domain gap between a labeled source dataset and an unlabelled target dataset for regression problems. Recent works mostly focus on learning a deep feature encoder by minimizing the discrepa ...

IEEE2023

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Maryam Kamgarpour, Tony Alan Wood

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

arXiv2023