Near-Optimal Noisy Group Testing via Separate Decoding of Items

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.

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

This study explores the differences in performance and results by various versions of the ISORROPIA thermodynamic module implemented within the ECHAM/MESSy Atmospheric Chemistry (EMAC) model. Three different versions of the module were used, ISORROPIA II v ...

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the re-cent years in sparser regimes. Yet, the current techniques still require diverg-ing degrees in order to succe ...

Under certain conditions, the ionization of a molecule may create a superposition of electronic states, leading to ultrafast electron dynamics. If controlled, this motion could be used in attochemistry applications, but it has been shown that the decoheren ...

Key-Value Stores (KVS) are foundational infrastructure components for online services. Due to their latency-critical nature, today’s best-performing KVS contain a plethora of full-stack optimizations commonly targeting read-mostly, popularity-skewed worklo ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

Context. A novel high-performance exact pair-counting toolkit called fast correlation function calculator (FCFC) is presented.Aims. With the rapid growth of modern cosmological datasets, the evaluation of correlation functions with observational and simula ...

We consider the problem of nonparametric estimation of the drift and diffusion coefficients of a Stochastic Differential Equation (SDE), based on n independent replicates {Xi(t) : t is an element of [0 , 1]}13 d B(t), where alpha is an element of {0 , 1} a ...

We consider the problem of learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights. We consider the asymptotic limit where the number of samples, the input dimension and the network width ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

This thesis focuses on two selected learning problems: 1) statistical inference on graphs models, and, 2) gradient descent on neural networks, with the common objective of defining and analysing the measures that characterize the fundamental limits. In th ...

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

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 beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...

The present invention proposes a method for detecting anomalous or out-of-distribution images in a machine learning system (1) comprising a pre-training network with a first encoder, and an anomaly detection network with a second encoder. The system is fir ...

The aim of this paper is to define a nonlinear least squares estimator for the spectral parameters of a spherical autoregressive process of order 1 in a parametric setting. Furthermore, we investigate on its asymptotic properties, such as weak consistency ...

It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...

There has been a recent surge of interest in the study of asymptotic reconstruction performance in various cases of generalized linear estimation problems in the teacher-student setting, especially for the case of i.i.d standard normal matrices. Here, we g ...

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Implementation of the ISORROPIA-lite aerosol thermodynamics model into the EMAC chemistry climate model (based on MESSy v2.55): implications for aerosol composition and acidity

Robust Collaborative Learning with Linear Gradient Overhead

Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold

How to Find Molecules with Long-lasting Charge Migration?

Cooperative Concurrency Control for Write-Intensive Key-Value Workloads

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Fast correlation function calculator A high-performance pair-counting toolkit

Nonparametric estimation for SDE with sparsely sampled paths: An FDA perspective

Bayes-optimal Learning of Deep Random Networks of Extensive-width

Results on Sparse Integer Programming and Geometric Independent Sets

Fundamental Limits in Statistical Learning Problems: Block Models and Neural Networks

Bayesian reconstruction of memories stored in neural networks from their connectivity

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

Symmetry in design and decoding of polar-like codes

List Ordered Statistics Decoders for Polar Codes

Annotation-efficient image anomaly detection

Parametric Estimation For Functional Autoregressive Processes On The Sphere

Practical Compilation of Quantum Programs

Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)