Publications associées à Robust Differentiable SVD

Publications associées (36)

Riemannian acceleration with preconditioning for symmetric eigenvalue problems

The analysis of the acceleration behavior of gradient-based eigensolvers with preconditioning presents a substantial theoretical challenge. In this work, we present a novel framework for preconditioning on Riemannian manifolds and introduce a metric, the l ...

Springer2025

ALGORITHM-AGNOSTIC LOW-RANK APPROXIMATION OF OPERATOR MONOTONE MATRIX FUNCTIONS

Ulf David Persson

Low-rank approximation of a matrix function, f(A), is an important task in computational mathematics. Most methods require direct access to f(A), which is often considerably more expensive than accessing A. Persson and Kressner [SIAM J. Matrix Anal., 44 (2 ...

2025

Randomized Block Gram–Schmidt Process for the Solution of Linear Systems and Eigenvalue Problems

Laura Grigori

Society for Industrial & Applied Mathematics (SIAM)2025

Scalable kernel logistic regression with Nyström approximation: Theoretical analysis and application to discrete choice modelling

Michel Bierlaire

The application of kernel-based Machine Learning (ML) techniques to discrete choice modelling using large datasets often faces challenges due to memory requirements and the considerable number of parameters involved in these models. This complexity hampers ...

2025

Overcoming Distribution Shifts and Imbalance Challenges in Representation Learning for Deep Regression Models

Ismail Nejjar

Deep learning has shown remarkable potential for industrial applications, particularly in predictive maintenance and condition monitoring. A key challenge in this domain is prognostics, specifically predicting the Remaining Useful Life (RUL) of assets - a ...

EPFL2025

A data-efficient and general-purpose hand–eye calibration method for robotic systems using next best view

Sichao Liu

Calibration between robots and cameras is critical in automated robot vision systems. However, conventional manually conducted image-based calibration techniques are often limited by their accuracy sensitivity and poor adaptability to dynamic or unstructur ...

2025

Pore size estimation in axon-mimicking microfibers with diffusion-relaxation MRI

Jean-Philippe Thiran, Erick Jorge Canales Rodriguez, Muhamed Barakovic, Marco Pizzolato

Purpose: This study aims to evaluate two distinct approaches for fiber radius estimation using diffusion-relaxation MRI data acquired in biomimetic microfiber phantoms that mimic hollow axons. The methods considered are the spherical mean power-law approac ...

Wiley2024

Deep learning approach for identification of H II regions during reionization in 21-cm observations - II. Foreground contamination

Jean-Paul Richard Kneib, Emma Elizabeth Tolley, Michele Bianco, Tianyue Chen

The upcoming Square Kilometre Array Observatory will produce images of neutral hydrogen distribution during the epoch of reionization by observing the corresponding 21-cm signal. However, the 21-cm signal will be subject to instrumental limitations such as ...

Oxford Univ Press2024

Residual-based attention in physics-informed neural networks

Nikolaos Stergiopoulos, Sokratis Anagnostopoulos

Driven by the need for more efficient and seamless integration of physical models and data, physics -informed neural networks (PINNs) have seen a surge of interest in recent years. However, ensuring the reliability of their convergence and accuracy remains ...

Elsevier Science Sa2024

Aggregating Spatial and Photometric Context for Photometric Stereo

David Honzátko

Photometric stereo, a computer vision technique for estimating the 3D shape of objects through images captured under varying illumination conditions, has been a topic of research for nearly four decades. In its general formulation, photometric stereo is an ...

EPFL2024

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Colin Peter Sandon

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

Ieee-Inst Electrical Electronics Engineers Inc2024

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Daniel Kressner, Haoze He

Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD) for performing t ...

Siam Publications2024

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

Domain adaptation via alignment of operation profile for Remaining Useful Lifetime prediction

Olga Fink, Ismail Nejjar, Mengjie Zhao

Effective Prognostics and Health Management (PHM) relies on accurate prediction of the Remaining Useful Life (RUL). Data-driven RUL prediction techniques rely heavily on the representativeness of the available time-to-failure trajectories. Therefore, these ...

Elsevier2024

Randomized flexible GMRES with deflated restarting

Laura Grigori

For a high-dimensional problem, a randomized Gram-Schmidt (RGS) algorithm is beneficial in terms of both computational cost and numerical stability. We apply this dimension reduction technique by random sketching to Krylov subspace methods, e.g., to the ge ...

Springer2024

Efficient and insightful descriptors for representing molecular and material space

Alexander Jan Goscinski

Data-driven approaches have been applied to reduce the cost of accurate computational studies on materials, by using only a small number of expensive reference electronic structure calculations for a representative subset of the materials space, and using ...

EPFL2024

Randomized low-rank approximation and its applications

Ulf David Persson

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

EPFL2024

Multiplicity-free Representations of Algebraic Groups

Donna Testerman

Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional ir ...

Amer Mathematical Soc2024

The time-domain Cartesian multipole expansion of electromagnetic fields

Emanuela Radici, Farhad Rachidi-Haeri, Marcos Rubinstein, Nicolas Mora Parra, Elias Per Joachim Le Boudec

Time-domain solutions of Maxwell’s equations in homogeneous and isotropic media are paramount to studying transient or broadband phenomena. However, analytical solutions are generally unavailable for practical applications, while numerical solutions are co ...

Nature Publishing Group2024

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding

Daniel Kressner, Haoze He

It is well known that a family of n×n commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the n joint eigenvalues of the family. In this work, we consider th ...

2024