Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

In order to extract maximum surplus from a heterogeneous customer base it is common practice for firms to offer a portfolio of differentiated products, from which consumers of different preferences can select their favorite items. The standard model of pro ...

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 ...

Motivated by the omnipresence of hierarchical structures in many real-world applications, this study delves into the intricate realm of bi-level games, with a specific focus on exploring local Stackelberg equilibria as a solution concept. While existing li ...

Sharing data across institutions for genome-wide association studies (GWAS) would enhance the discovery of genetic variation linked to health and disease1,2. However, existing data-sharing regulations limit the scope of such collaborations3. Although crypt ...

The evolution of airborne mapping witnesses the introduction of hybrid lidar-camera systems to enhance data collection, i.e. to obtain simultaneously high-density point-cloud and texture. Yet, the common adjustment of both optical data streams is a nontriv ...

The formulation of inverse problems in the continuum eliminates discretization errors and allows for the exact incorporation of priors. In this paper, we formulate a continuous-domain inverse problem over a search space of continuous and piecewise-linear f ...

In algorithms for solving optimization problems constrained to a smooth manifold, retractions are a well-established tool to ensure that the iterates stay on the manifold. More recently, it has been demonstrated that retractions are a useful concept for ot ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

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 ...

Bayesian Optimization (BO) is typically used to optimize an unknown function f that is noisy and costly to evaluate, by exploiting an acquisition function that must be maximized at each optimization step. Even if provably asymptotically optimal BO algorith ...

In this work, we analyze space-time reduced basis methods for the efficient numerical simulation of haemodynamics in arteries. The classical formulation of the reduced basis (RB) method features dimensionality reduction in space, while finite difference sc ...

Predicting the evolution of systems with spatio-temporal dynamics in response to external stimuli is essential for scientific progress. Traditional equations-based approaches leverage first principles through the numerical approximation of differential equ ...

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...

A method for optimizing at least one of a geometry, an implantation procedure, and/or stimulation protocol of one or more electrodes for an electrical stimulation of a target structure in a nervous system of a living being by a computer device, the method ...

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

Chat with Graph Search

Riemannian acceleration with preconditioning for symmetric eigenvalue problems

Robust Optimization for Product Line Design

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

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

On decentralized computation of the leader's strategy in bi-level games

Secure and federated genome-wide association studies for biobank-scale datasets

On the Perspectives of Image-to-Lidar Constraints in Dynamic Network Optimisation

A Box-Spline Framework for Inverse Problems With Continuous-Domain Sparsity Constraints

From low-rank retractions to dynamical low-rank approximation and back

Scalable constrained optimization

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Perturbed Utility Stochastic Traffic Assignment

A ride time-oriented scheduling algorithm for dial-a-ride problems

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Randomized flexible GMRES with deflated restarting

Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization

SPACE-TIME REDUCED BASIS METHODS FOR PARAMETRIZED UNSTEADY STOKES EQUATIONS

Learning the intrinsic dynamics of spatio-temporal processes through Latent Dynamics Networks

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

A method and system for optimizing design, implantation, and stimulation protocols of electrodes stimulating the nervous system