Concept

Sparse matrix

Related publications (226)

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first

k

eigenvectors of the similarity matrix' Laplacian, whose computati ...

Ieee2016

ALS Scheme using Extent-based Constraints for the Analysis of Chemical Reaction Systems

Dominique Bonvin, Julien Léo Billeter, Michael Amrhein

Multivariate curve resolution via alternating least squares (ALS) is used to resolve the concentration profiles C and the pure component spectra E of S species from the multivariate absorbance data A, assuming the bilinear model ...

2016

Estimation Error of the Constrained Lasso

Volkan Cevher, Yen-Huan Li, Ya-Ping Hsieh, Nissim Zerbib

This paper presents a non-asymptotic upper bound for the estimation error of the constrained lasso, under the high-dimensional (

n \ll p

) setting. In contrast to existing results, the error bound in this paper is sharp, is valid when the parameter to be e ...

2016

pyIAST: Ideal adsorbed solution theory (IAST) Python package

Berend Smit, Cory Matthew Simon

Ideal adsorbed solution theory (LAST) is a widely-used thermodynamic framework to readily predict mixed-gas adsorption isotherms from a set of pure-component adsorption isotherms. We present an open-source, user-friendly Python package, pyIAST, to perform ...

Elsevier2016

Low-rank methods for parameter-dependent eigenvalue problems and matrix equations

Petar Sirkovic

The focus of this thesis is on developing efficient algorithms for two important problems arising in model reduction, estimation of the smallest eigenvalue for a parameter-dependent Hermitian matrix and solving large-scale linear matrix equations, by extra ...

EPFL2016

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta

We present a theoretical analysis and comparison of the effect of

ℓ _{ 1 }

versus

ℓ _{ 2 }

regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the s ...

IEEE2016

Effect of hydrostatic pressure on flow and deformation in highly reinforced particulate composites

Andreas Mortensen, Ludger Weber, Maria Gabriella Tarantino

Infiltrated particle reinforced composites combine a dense matrix with particles that are in mutual contact and can therefore transfer compressive stress directly from one particle to the next. As a result, these composites may combine characteristics of t ...

Elsevier2016

Sparse Modeling of Neural Network Posterior Probabilities for Exemplar-based Speech Recognition

Hervé Bourlard, Afsaneh Asaei, Pranay Dighe

In this paper, a compressive sensing (CS) perspective to exemplar-based speech processing is proposed. Relying on an analytical relationship between CS formulation and statistical speech recognition (Hidden Markov Models HMM), the automatic speech recognit ...

2016

Subspace Detection of DNN Posterior Probabilities via Sparse Representation for Query by Example Spoken Term Detection

Hervé Bourlard, Afsaneh Asaei, Dhananjay Ram

We cast the query by example spoken term detection (QbE-STD) problem as subspace detection where query and background subspaces are modeled as union of low-dimensional subspaces. The speech exemplars used for subspace modeling are class-conditional posteri ...

Idiap2016

Sparse Subspace Modeling for Query by Example Spoken Term Detection

Hervé Bourlard, Afsaneh Asaei, Dhananjay Ram

We cast the problem of query by example spoken term detection (QbE-STD) as subspace detection where query and background are modeled as a union of low-dimensional subspaces. The speech exemplars used for subspace modeling consist of class-conditional poste ...

Idiap2016

Graph Chatbot

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.

Accelerated Spectral Clustering Using Graph Filtering of Random Signals

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first

k

eigenvectors of the similarity matrix' Laplacian, whose computati ...

Ieee2016

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta

We present a theoretical analysis and comparison of the effect of

ℓ _{ 1 }

versus

ℓ _{ 2 }

regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the s ...

IEEE2016

Estimation Error of the Constrained Lasso

Volkan Cevher, Yen-Huan Li, Ya-Ping Hsieh, Nissim Zerbib

This paper presents a non-asymptotic upper bound for the estimation error of the constrained lasso, under the high-dimensional (

n \ll p

) setting. In contrast to existing results, the error bound in this paper is sharp, is valid when the parameter to be e ...

2016