Publication

Low-Rank Matrix Completion By Riemannian Optimization

Related publications (32)

A geometric optimal control approach for imitation and generalization of manipulation skills

Sylvain Calinon, Amirreza Razmjoo Fard, Jie Zhao

Daily manipulation tasks are characterized by regular features associated with the task structure, which can be described by multiple geometric primitives related to actions and object shapes. Only using Cartesian coordinate systems cannot fully represent ...

Elsevier2023

RMAML: Riemannian meta-learning with orthogonality constraints

Soumava Kumar Roy

Meta-learning is the core capability that enables intelligent systems to rapidly generalize their prior ex-perience to learn new tasks. In general, the optimization-based methods formalize the meta-learning as a bi-level optimization problem, that is a nes ...

ELSEVIER SCI LTD2023

Retraction-based numerical methods for continuation, interpolation and time integration on manifolds

Axel Elie Joseph Séguin

The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...

EPFL2023

Preconditioning techniques for generalized Sylvester matrix equations

Yannis Dirk Voet

Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they now arise in an increasingly large number of applications. In this work, we consider algebraic parame ...

2023

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

David Atienza Alonso, Giovanni Ansaloni, Marco Antonio Rios, Grégoire Axel Eggermann

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

New York2023

Duality and bicrystals on infinite binary matrices

Thomas Gerber

The set of finite binary matrices of a given size is known to carry a finite type AA bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and one-dimensional sums t ...

2023

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

Tangent functional connectomes uncover more unique phenotypic traits

Mingkui Wang, Enrico Amico

Functional connectomes (FCs) containing pairwise estimations of functional couplings between pairs of brain regions are commonly represented by correlation matrices. As symmetric positive definite matrices, FCs can be transformed via tangent space projecti ...

CELL PRESS2023

Post-Moore's Law Fusion: High-Bandwidth Memory, Accelerators, and Native Half-Precision Processing for CPU-Local Analytics

Anastasia Ailamaki, Viktor Sanca

Modern data management systems aim to provide both cutting-edge functionality and hardware efficiency. With the advent of AI-driven data processing and the post-Moore Law era, traditional memory-bound scale-up data management operations face scalability ch ...

2023

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

A unified framework for Simplicial Kuramoto models

Alexis Arnaudon

Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three ...

2024

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