Concept

Topological tensor product

Publications associées (12)

Positive Definite Completions and Continuous Graphical Models

This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...

EPFL2023

On complete reducibility of tensor products of simple modules over simple algebraic groups

Jonathan Gruber

Let G be a simply connected simple algebraic group over an al- gebraically closed ﬁeld k of characteristic p > 0. The category of rationalG-modules is not semisimple. We consider the question of when the tensorproduct of two simple G-modules L(λ) and L(μ) ...

2021

Spin Caloritronics, origin and outlook

Jean-Philippe Ansermet, Sylvain Bréchet, Haiming Yu

Spin caloritronics refers to research efforts in spintronics when a heat current plays a role. In this review, we start out by reviewing the predictions that can be drawn from the thermodynamics of irreversible processes. This serves as a conceptual framew ...

Elsevier2016

Low-rank tensor completion by Riemannian optimization

Daniel Kressner, Michael Maximilian Steinlechner

In tensor completion, the goal is to fill in missing entries of a partially known tensor under a low-rank constraint. We propose a new algorithm that performs Riemannian optimization techniques on the manifold of tensors of fixed multilinear rank. More spe ...

Springer2014

A convex optimization approach for image recovery from nonlinear measurements in optical interferometry

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Anna Auria Rasclosa

Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...

2013

Sparse projections onto the simplex

Volkan Cevher, Christoph Koch, Anastasios Kyrillidis

Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the`1-norm. However, several important learning applications cannot benet from this approach as they feature these convex no ...

JMLR W&CP2013

Stochastic spectral Galerkin and collocation methods for PDEs with random coefficients: a numerical comparison

Fabio Nobile, Lorenzo Tamellini

Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochastic Collocation (SC) methods for uncertainty quantification. An open and relevant research topic is the comparison of these two methods. By introducing a sui ...

Springer2011

A note on topological amenability

Nicolas Monod

A simple characterisation of topological amenability in terms of bounded cohomology is proved, following Johnson's formulation of amenability. The connection to injective Banach modules is established. ...

Oxford University Press2010

A natural-norm Successive Constraint Method for inf-sup lower bounds

Jan Sickmann Hesthaven, Yixing Chen

We present a new approach for the construction of lower bounds for the inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. We combine the ``linearized' ...

Elsevier2010

Construction of Hilbert Transform Pairs of Wavelet Bases and Gabor-Like Transforms

Michaël Unser, Kunal Narayan Chaudhury

We propose a novel method for constructing Hilbert transform (HT) pairs of wavelet bases based on a fundamental approximation-theoretic characterization of scaling functions-the B-spline factorization theorem. In particular, starting from well-localized sc ...

IEEE2009

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