Home

Publication

Model-based Sketching and Recovery with Expanders

About
Privacy
Disclaimer

Graph Chatbot

Related publications (37)

Page 2 of 2

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Thomas Jean Debarre

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

EPFL2022

Attention-based domain adaptation for single-stage detectors

Mathieu Salzmann, Vidit Vidit

While domain adaptation has been used to improve the performance of object detectors when the training and test data follow different distributions, previous work has mostly focused on two-stage detectors. This is because their use of region proposals make ...

SPRINGER2022

Dynamic Model Pruning with Feedback

Martin Jaggi, Sebastian Urban Stich, Tao Lin, Luis Felipe Barba Flores

Deep neural networks often have millions of parameters. This can hinder their deployment to low-end devices, not only due to high memory requirements but also because of increased latency at inference. We propose a novel model compression method that gener ...

2020

Leveraging topology, geometry, and symmetries for efficient Machine Learning

Michaël Defferrard

When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...

EPFL2022

Approximating Relu Networks By Single-Spike Computation

Wulfram Gerstner, Stanislaw Andrzej Wozniak, Angeliki Pantazi, Ana Stanojevic

Developing energy-saving neural network models is a topic of rapidly increasing interest in the artificial intelligence community. Spiking neural networks (SNNs) are biologically inspired models that strive to leverage the energy efficiency stemming from a ...

IEEE2022

Dictionary Learning for Two-Dimensional Kendall Shapes

Michaël Unser, Julien René Fageot, Virginie Sophie Uhlmann

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...

SIAM PUBLICATIONS2020

Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update

Efstratios Panteleimon Skoulakis

In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...

2022

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Amir Zandieh

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

EPFL2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

From Undercomplete to Sparse Overcomplete Autoencoders to Improve LF-MMI Speech Recognition

Hervé Bourlard, Selen Hande Kabil

Starting from a strong Lattice-Free Maximum Mutual Information (LF-MMI) baseline system, we explore different autoencoder configurations to enhance Mel-Frequency Cepstral Coefficients (MFCC) features. Autoencoders are expected to generate new MFCC features ...

ISCA-INT SPEECH COMMUNICATION ASSOC2022

Sub-Matrix Factorization for Real-Time Vote Prediction

Patrick Thiran, Matthias Grossglauser, Victor Kristof

We address the problem of predicting aggregate vote outcomes (e.g., national) from partial outcomes (e.g., regional) that are revealed sequentially. We combine matrix factorization techniques and generalized linear models (GLMs) to obtain a flexible, effic ...

2020

Sparse and Parametric Modeling with Applications to Acoustics and Audio

Helena Peic Tukuljac

Recent advances in signal processing, machine learning and deep learning with sparse intrinsic structure of data have paved the path for solving inverse problems in acoustics and audio. The main task of this thesis was to bridge the gap between the powerfu ...

EPFL2020

A deep learning framework for matching of SAR and optical imagery

Devis Tuia, Lloyd Haydn Hughes

SAR and optical imagery provide highly complementary information about observed scenes. A combined use of these two modalities is thus desirable in many data fusion scenarios. However, any data fusion task requires measurements to be accurately aligned. Wh ...

2020

Good Vibrations and Unknown Excitations

Dalia Salem Hassan Fahmy El Badawy

Inspired by the human ability to localize sounds, even with only one ear, as well as to recognize objects using active echolocation, we investigate the role of sound scattering and prior knowledge in regularizing ill-posed inverse problems in acoustics. In ...

EPFL2020

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Kathryn Dianne Lund, Daniel Kressner, Stefano Massei

Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...

2020

Joint Sparsity with Partially Known Support and Application to Ultrasound Imaging

Jean-Philippe Thiran, Yves Wiaux, Adrien Georges Jean Besson, Dimitris Perdios

We investigate the benefits of known partial support for the recovery of joint-sparse signals and demonstrate that it is advantageous in terms of recovery performance for both rank-blind and rank-aware algorithms. We suggest extensions of several joint-spa ...

IEEE Institute of Electrical and Electronics Engineers2019