Publication

Optimal Sampling Rates in Infinite-Dimensional Compressed Sensing

Publications associées (30)

Sampling-Based AQP in Modern Analytical Engines

As the data volume grows, reducing the query execution times remains an elusive goal. While approximate query processing (AQP) techniques present a principled method to trade off accuracy for faster queries in analytics, the sample creation is often consid ...

ACM2022

Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions

Andreas Loukas, Nikolaos Karalias

Integrating functions on discrete domains into neural networks is key to developing their capability to reason about discrete objects. But, discrete domains are (I) not naturally amenable to gradient-based optimization, and (II) incompatible with deep lear ...

2022

Virtual metrology applied to milling process

Paul Arthur Adrien Pierre Dreyfus

Production quality and process efficiency are the two main drivers that lead any industrial strategy. To ensure product quality, a duality historically existed between two approaches, namely batch sampling and systematic sampling. In batch sampling, the ba ...

EPFL2022

Conjugate heat transfer in isolated granular clusters with interstitial fluid using lattice Boltzmann method

Mehrdad Kiani Oshtorjani

The conjugate heat transfer in mixtures of a fluid and single granular clusters is studied in this paper using a novel lattice Boltzmann method (LBM) programmed for parallel computation on the graphics processing unit (GPU). The LBM is validated for heat c ...

PERGAMON-ELSEVIER SCIENCE LTD2022

Single-Trace Clustering Power Analysis of the Point-Swapping Procedure in the Three Point Ladder of Cortex-M4 SIKE

Aymeric Genet, Novak Kaluderovic

In this paper, the recommended implementation of the post-quantum key exchange SIKE for Cortex-M4 is attacked through power analysis with a single trace by clustering with the k-means algorithm the power samples of all the invocations of the elliptic curve ...

Springer, Cham2022

Generalised Implicit Neural Representations

Pierre Vandergheynst

We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal e ...

2022

Asynchrony Increases Efficiency: Time Encoding of Videos and Low-Rank Signals

Martin Vetterli, Adam James Scholefield, Karen Adam

In event-based sensing, many sensors independently and asynchronously emit events when there is a change in their input. Event-based sensing can present significant improvements in power efficiency when compared to traditional sampling, because (1) the out ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

On Generalizations of Some Distance Based Classifiers for HDLSS Data

Soham Sarkar

In high dimension, low sample size (HDLSS) settings, classifiers based on Euclidean distances like the nearest neighbor classifier and the average distance classifier perform quite poorly if differences between locations of the underlying populations get m ...

Microtome Publishing2022

Graph signal processing tailored for subgraph focus and community structure

Miljan Petrovic

Community structure in graph-modeled data appears in a range of disciplines that comprise network science. Its importance relies on the influence it bears on other properties of graphs such as resilience, or prediction of missing connections. Nevertheless, ...

EPFL2022

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Florent Gérard Krzakala, Lenka Zdeborová, Bruno Loureiro, Luca Pesce, Bruno Loureiro

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

2022