MétaCan
Menu
Back to cohort
Record W2714011371 · doi:10.1109/icassp.2017.7952810

Massive device activity detection by approximate message passing

2017· article· en· W2714011371 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceFadingFalse alarmMessage passingChannel (broadcasting)DetectorWirelessPath (computing)AlgorithmActivity detectionReal-time computingComputer networkArtificial intelligenceTelecommunicationsDistributed computing

Abstract

fetched live from OpenAlex

User activity detection is a central problem in massive device communication scenarios in which an access point needs to detect active devices among large number of potential devices each transmitting sporadically. By exploiting sparsity in user activity, the detection problem can be formulated as a compressed sensing problem, thereby allowing the use of computationally efficient approximate message passing (AMP) algorithm for activity detection. This paper proposes an AMP-based user activity detector that accounts for the statistics of device geographic locations in a cellular network. The proposed scheme is based on a minimum mean squared error (MMSE) denoiser designed for specific wireless channel fading and path-loss distributions. This paper further provides an analytic characterization of the false alarm versus missed detection probabilities using state evolution for AMP. Simulation results show significantly improved detection threshold for the channel-aware denoiser as compared to standard soft threshold based AMP.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.599
Threshold uncertainty score0.461

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.019
GPT teacher head0.248
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations47
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207