Algorithmic Structures for Uncoordinated Communications and Statistical Inference in Exceedingly Large Spaces
Videos from BIRS Workshop
Robert Calderbank, Duke university
Monday Mar 11, 2024 09:04 - 09:44
Learning to Communicate
Yue Lu, Harvard University
Monday Mar 11, 2024 10:32 - 10:56
Equivalence Principles for Nonlinear Random Matrices
Shao-Lun Huang, Tsinghua University
Monday Mar 11, 2024 10:59 - 11:26
Feature Extractions in Distributed Parameter Estimation: A Local Information Geometric Approach
Gianluigi Liva, German Aerospace Center (DLR)
Monday Mar 11, 2024 13:00 - 13:58
Grant-Free Access in 6G Networks: An Unsourced Multiple Access Perspective
Olav Tirkkonen, Aalto University
Monday Mar 11, 2024 14:33 - 14:59
Unsourced Random Access with Binary Subspace Chirps
Eduard Jorswieck, Technical University of Braunschweig
Monday Mar 11, 2024 15:01 - 15:29
Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access
Alexander Fengler, MIT
Monday Mar 11, 2024 15:33 - 15:53
Coding Bounds for the Noisy A-channel, with Applications in Unsourced Communication and Group Testing
Wei Yu, University of Toronto
Tuesday Mar 12, 2024 08:31 - 09:20
Massive Random Access with Massive MIMO
Ya-Feng Liu, Academy of Mathematics and Systems Science/Chinese Academy of Sciences
Tuesday Mar 12, 2024 09:22 - 09:49
Covariance-Based Activity Detection in Cooperative Multi-Cell Massive MIMO: Scaling Law and Efficient Algorithms
Chandra Murthy, Indian Institute of Science
Tuesday Mar 12, 2024 09:52 - 10:14
User Activity Detection in Grant-Free Massive Random Access
Markku Juntti, Rice University
Tuesday Mar 12, 2024 10:45 - 11:22
MTC Access Design with Channel and Device Activity Correlation
Galen Reeves, Duke University
Wednesday Mar 13, 2024 08:33 - 09:19
Gaussian Approximations for AMP via Coupling
Marco Mondelli, Institute of Science and Technology Austria (ISTA)
Wednesday Mar 13, 2024 09:21 - 09:51
From Spectral Estimators to Approximate Message Passing... and Back
Brian Kurkoski, Japan Advanced Institute of Science and Technology
Wednesday Mar 13, 2024 09:56 - 10:22
Memory AMP and Recent Results on Its Implementation
Bobak Nazer, Boston University
Wednesday Mar 13, 2024 10:42 - 11:09
OpAMP: Linear Operator Approximate Message Passing
Faouzi Bellili, University of Manitoba
Wednesday Mar 13, 2024 11:13 - 11:36
Concatenated Coding-Free Massive Unsourced Random via Bilinear Vector Approximate Message Passing
Yury Polyanskiy, MIT
Thursday Mar 14, 2024 08:33 - 09:22
Data-Driven Signal Detection and Likelihood-Free Inference
George Atia, University of Central Florida
Thursday Mar 14, 2024 09:26 - 09:56
Sketch-based Community Detection
Arya Mazumdar, UCSD
Thursday Mar 14, 2024 09:57 - 10:25
Sample complexity of parameter estimation in logistic regression
Mary Wootters, Stanford University
Thursday Mar 14, 2024 10:42 - 11:13
Low-Bandwidth Computation on Top of Error Correction
Jamison Ebert, Texas A&M University
Thursday Mar 14, 2024 11:15 - 11:40
Multi-User Sparse Regression LDPC Codes
Lele Wang, University of British Columbia
Thursday Mar 14, 2024 13:00 - 13:30
Attributed Graph Alignment
Stark Draper, University of Toronto
Thursday Mar 14, 2024 13:34 - 14:02
Passive Learning of the Interference Graph of a Wireless Network
Justin Kang, The University of California
Thursday Mar 14, 2024 14:04 - 14:29
Learning to Understand: Identifying Interactions via the Mobius Transform
Ayfer Özgür, Stanford University
Thursday Mar 14, 2024 14:38 - 15:09
Training generative models from privatized data via Entropic Optimal Transport
Cynthia Rush, Columbia University
Friday Mar 15, 2024 08:33 - 09:02
Is It Easier to Count Communities Than Find Them?
Jean Barbier, International Center for Theoretical Physics
Friday Mar 15, 2024 09:09 - 09:36
Fundamental limits in structured principal component analysis and how to reach them
Ramji Venkataramanan, University of Cambridge
Friday Mar 15, 2024 10:00 - 10:35
Many-User Multiple Access with Random User Activity and Coding
Or Ordentlich, Hebrew University of Jerusalem
Friday Mar 15, 2024 10:40 - 11:13
Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator
Alexey Frolov, Skolkovo Institute of Science and Technology
Friday Mar 15, 2024 11:15 - 11:46
Energy Efficiency of Unsourced Random Access over the Gaussian and MIMO Channels
