One-Bit Measurements With Adaptive Thresholds

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.

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

Whereas the ability of deep networks to produce useful predictions on many kinds of data has been amply demonstrated, estimating the reliability of these predictions remains challenging. Sampling approaches such as MC-Dropout and Deep Ensembles have emerge ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

The theory underlying robust distributed learning algorithms, designed to resist adversarial machines, matches empirical observations when data is homogeneous. Under data heterogeneity however, which is the norm in practical scenarios, established lower bo ...

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

We present a statistical framework to benchmark the performance of reconstruction algorithms for linear inverse problems, in particular, neural-network-based methods that require large quantities of training data. We generate synthetic signals as realizati ...

The use of point clouds as an imaging modality has been rapidly growing, motivating research on compression methods to enable efficient transmission and storage for many applications. While compression standards relying on conven- tional techniques such as ...

In this paper, we present an exact (i. e. non-approximated) and linear measurement model for hybrid AC/DC microgrids for recursive state estimation (SE). More specifically, an exact linear model of a voltage source converter (VSC) is proposed. It relies on ...

A logconcave likelihood is as important to proper statistical inference as a convex cost function is important to variational optimization. Quantization is often disregarded when writing likelihood models, ignoring the limitations of the physical detectors ...

In this paper, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained form ...

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

In this paper, we present an exact (i.e. non-approximated) and linear measurement model for hybrid AC/DC micro-grids for recursive state estimation (SE). More specifically, an exact linear model of a voltage source converter (VSC) is proposed. It relies on ...

This thesis focuses on two kinds of statistical inference problems in signal processing and data science. The first problem is the estimation of a structured informative tensor from the observation of a noisy tensor in which it is buried. The structure com ...

This paper analyzes the implementation of least-mean-squares (LMS)-based, adaptive diffusion algorithms over networks in the frequency-domain (FD). We focus on a scenario of noisy links and include a moving-average step for denoising after self-learning to ...

Motivated by the recent successes of neural networks that have the ability to fit the data perfectly \emph{and} generalize well, we study the noiseless model in the fundamental least-squares setup. We assume that an optimum predictor fits perfectly inputs ...

The proliferation of phasor measurement units (PMUs) presents new challenges in archiving and processing large amounts of synchrophasor data which necessitates advanced data compression methods. This paper proposes a singular value decomposition (SVD)-base ...

This work focuses on the security of critical infrastructures against time-synchronization attacks (TSA). A TSA can impact any network that relies on the dynamic analysis of data, by altering the time synchronization between its nodes. Such attacked networ ...

In this paper, we focus on the localization of a passive source from time difference of arrival (TDOA) measurements. TDOA values are computed with respect to pairs of fixed sensors that are required to be accurately time-synchronized. This constitutes a we ...

Surprise-based learning allows agents to rapidly adapt to nonstationary stochastic environments characterized by sudden changes. We show that exact Bayesian inference in a hierarchical model gives rise to a surprise-modulated trade-off between forgetting o ...

Least squares estimators, when trained on a few target domain samples, may predict poorly. Supervised domain adaptation aims to improve the predictive accuracy by exploiting additional labeled training samples from a source distribution that is close to th ...

One-Bit Measurements With Adaptive Thresholds

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

ZigZag: Universal Sampling-free Uncertainty Estimation Through Two-Step Inference

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity

Quantization for Decentralized Learning Under Subspace Constraints

A Statistical Framework to Investigate the Optimality of Signal-Reconstruction Methods

Evaluating the effect of sparse convolutions on point cloud compression

Linear Recursive State Estimation of Hybrid and Unbalanced AC/DC Micro-Grids using Synchronized Measurements

Convex Quantization Preserves Logconcavity

Finite Bit Quantization For Decentralized Learning Under Subspace Constraints

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

Linear Recursive State Estimation of Hybrid and Unbalanced AC/DC Micro-Grids using Synchronized Measurements

Statistical limits of high-dimensional inference problems

Frequency-Domain Diffusion Adaptation Over Networks

Last iterate convergence of SGD for Least-Squares in the Interpolation regime

A Real-time Synchrophasor Data Compression Method Using Singular Value Decomposition

Time-Synchronization Attacks against Critical Infrastructures and their Mitigation

TDOA Source-Localization Technique Robust to Time-Synchronization Attacks

Learning in Volatile Environments With the Bayes Factor Surprise

Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts