Evaluating functions of positive-definite matrices using colored-noise thermostats

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.

We study the composite convex optimization problems with a quasi-self-concordant smooth component. This problem class naturally interpolates between classic self-concordant functions and functions with Lipschitz continuous Hessian. Previously, the best com ...

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

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

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

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

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

The increasing complexity of transformer models in artificial intelligence expands their computational costs, memory usage, and energy consumption. Hardware acceleration tackles the ensuing challenges by designing processors and accelerators tailored for t ...

Negative triangularity (NT) scenarios in TCV have been compared to positive triangularity (PT) scenarios using the same plasma shapes foreseen for divertor tokamak test tokamak operations. The experiments provided a NT/PT L-mode pair and a PT H-mode with d ...

The desire and ability to place AI-enabled applications on the edge has grown significantly in recent years. However, the compute-, area-, and power-constrained nature of edge devices are stressed by the needs of the AI-enabled applications, due to a gener ...

Materials for high -temperature environments are actively being investigated for deployment in aerospace and nuclear applications. This study uses computational approaches to unravel the crystallography and thermodynamics of a promising class of refractory ...

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

In this work, we study the impact of aspect ratio A = R 0 / r (the ratio of major radius R 0 to minor radius r) on the confinement benefits of negative triangularity (NT) plasma shaping. We use high-fidelity flux tube gyrokinetic GENE simulations and consi ...

This paper studies kernel ridge regression in high dimensions under covariate shifts and analyzes the role of importance re-weighting. We first derive the asymptotic expansion of high dimensional kernels under covariate shifts. By a bias-variance decomposi ...

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

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work, we propose a mix ...

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

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

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

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

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

Evaluating functions of positive-definite matrices using colored-noise thermostats

Chat with Graph Search

Minimizing Quasi-self-concordant Functions by Gradient Regularization of Newton Method

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Randomized low-rank approximation and its applications

Spectral Estimators for High-Dimensional Matrix Inference

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Accelerator-driven Data Arrangement to Minimize Transformers Run-time on Multi-core Architectures

Experiments and gyrokinetic simulations of TCV plasmas with negative triangularity in view of DTT operations

Exploring High-Performance and Energy-Efficient Architectures for Edge AI-Enabled Applications

First-principles thermodynamics of precipitation in aluminum-containing refractory alloys

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Physical insights from the aspect ratio dependence of turbulence in negative triangularity plasmas

High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularization

Preconditioning techniques for generalized Sylvester matrix equations

A mixed precision LOBPCG algorithm

Tangent functional connectomes uncover more unique phenotypic traits

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

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

Towards a nonperturbative construction of the S-matrix

Nonperturbative aspects of scattering amplitudes