Near-Optimal Noisy Group Testing via Separate Decoding of Items

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos 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 ...

Due to its high parallelism, belief propagation (BP)decoding is amenable to high-throughput applications and thusrepresents a promising solution for the ultra-high peak datarate required by future communication systems. To bridge theperformance gap compare ...

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

Within the AdS/CFT correspondence, we identify a class of CFT operators which represent diff-invariant and approximately local observables in the gravitational dual. Provided that the bulk state breaks all asymptotic symmetries, we show that these operator ...

The rapid development of wearable biomedical systems now enables real-time monitoring of electroencephalography (EEG) signals. Acquisition of these signals relies on electrodes. These systems must meet the design challenge of selecting an optimal set of el ...

The high computational costs of deep convolutional neural networks hinder their deployment in real-world applications, including pulmonary nodule detection from CT scans where large 3D image sizes amplify the issue. This paper presents a novel 3D method to ...

Providing adequate glare protection and a view to the outside through fabric shading devices is challenging because these two objectives require conflicting material properties for a fully lowered shading. In a semi -controlled office-like experiment invol ...

Most prosthetic limbs can autonomously move with dexterity, yet they are not perceived by the user as belonging to their own body. Robotic limbs can convey information about the environment with higher precision than biological limbs, but their actual perf ...

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 ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic samples. Despite the variety and importance of prior results, traditional work on group testing ha ...

Openings in flat slabs near to columns are often needed to supply the building with utilities. The presence of these openings can lead to a decrease of the punching resistance which is related to (i) the reduction of the control perimeter, (ii) the stress ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Chattez avec Graph Search

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

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Extensions of Peer Prediction Incentive Mechanisms

Holography and localization of information in quantum gravity

FETCH: A Fast and Efficient Technique for Channel Selection in EEG Wearable Systems

Efficient Lung Nodule Detection via 3D Deep Learning with Shifted Convolutions

User assessment of fabric shading devices with a low openness factor

Toward higher-performance bionic limbs for wider clinical use

Robust Collaborative Learning with Linear Gradient Overhead

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Community-Aware Group Testing

Enhancement of the punching shear verification of slabs with openings

Learning Sparse Graphons And The Generalized Kesten-Stigum Threshold

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

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

Results on Sparse Integer Programming and Geometric Independent Sets

How to Find Molecules with Long-lasting Charge Migration?

Symmetry in design and decoding of polar-like codes

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

A Functional Perspective on Information Measures