Concept

Gaussian elimination

Publications associées (47)

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

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

Philadelphia2024

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

Olga Fink, Ismail Nejjar

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

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

2023

Optimal lower bounds on hitting probabilities for non-linear systems of stochastic fractional heat equations

Robert Dalang, Fei Pu

We consider a system of d non-linear stochastic fractional heat equations in spatial dimension 1 driven by multiplicative d-dimensional space-time white noise. We establish a sharp Gaussian-type upper bound on the two-point probability density function of ...

ELSEVIER2021

On Gaussian Process based Koopman Operator

Colin Neil Jones

Enabling analysis of non-linear systems in linear form, the Koopman operator has been shown to be a powerful tool for system identification and controller design. However, current data-driven methods cannot provide quantification of model uncertainty given ...

2020

Swap and Rotate: Lightweight Linear Layers for SPN-based Blockciphers

Serge Vaudenay, Francesco Regazzoni, Subhadeep Banik, Muhammed Fatih Balli

In CHES 2017, Jean et al. presented a paper on "Bit-Sliding" in which the authors proposed lightweight constructions for SPN based block ciphers like AES, PRESENT and SKINNY. The main idea behind these constructions was to reduce the length of the datapath ...

2020

Optimal lower bounds on hitting probabilities for stochastic heat equations in spatial dimension k >= 1

Robert Dalang, Fei Pu

We establish a sharp estimate on the negative moments of the smallest eigenvalue of the Malliavin matrix gamma z of Z := (u(s, y), u(t , x) - u(s, y)), where u is the solution to a system of d non-linear stochastic heat equations in spatial dimension k >= ...

UNIV WASHINGTON, DEPT MATHEMATICS2020

Shedding Light on the Basis Set Dependence of the Minnesota Functionals: Differences Between Plane Waves, Slater Functions, and Gaussians

Ursula Röthlisberger, Martin Peter Bircher, Pablo Lopez Tarifa

The Minnesota family of exchange-correlation (xc) functionals are among the most popular, accurate, and abundantly used functionals available to date. However, their use in plane-wave based first-principles MD has been limited by their sparse availability. ...

2019

Adversarially Robust Optimization with Gaussian Processes

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In this paper, we consider the problem of Gaussian process (GP) optimization with an added robustness requirement: The returned point may be perturbed by an adversary, and we require the function value to remain as high as possible even after this perturba ...

2018

Adversarially Robust Optimization with Gaussian Processes

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search