Allerton

1,172 papers445 directions
Allerton is a research venue that has been active since 1987, focusing on the intersection of communication, control, and computing. With a corpus of over 1,200 papers, it serves as a forum for technical research into the theoretical foundations of information systems and signal processing. The venue is characterized by its focus on statistical-to-computational gaps in high-dimensional inference, topology-aware decentralized optimization, and scaling laws for both content delivery and covert communication. The research published at Allerton spans a variety of disciplines, including queueing theory for non-stationary traffic, redundancy strategies for distributed systems, and resource-aware control for networked systems. In recent years, the venue has increasingly incorporated machine learning and artificial intelligence topics, such as mitigating backdoor threats in large language models, graph convolutional network (GCN) sampling, and metric clustering. This evolution reflects a broader trend of applying information-theoretic principles to contemporary AI challenges, including neural population communication and state obfuscation in Gaussian channels. The community associated with Allerton includes prolific contributors such as H. Vincent Poor, Lizhong Zheng, Kannan Ramchandran, and Vaneet Aggarwal. These researchers and their peers contribute to a body of work that emphasizes mathematical rigor in addressing problems like load balancing for heavy-tailed workloads and social learning in interacting filters. By maintaining a focus on the fundamental limits of computation and transmission, the venue provides a consistent framework for analyzing complex networked and automated systems.

Papers by Year

2024 20
2023 36
2022 36
2019 71
2018 92
2017 94
2016 114
2015 116
2014 89
2013 106
2011 102
2010 109
2009 82
2008 97
2007 3
2006 4
2005 4
2001 1
2000 1
1987 1

Top Research Directions

Research directions most represented by papers from this venue.

How Network Topology Governs Decentralized Learning Convergence 8
The Statistical Computational Gap in High Dimensions 7
Quantifying Privacy Leakage with Information Theory 5
Semidefinite Relaxation for Non-Convex Engineering Optimization 5
Overcoming the Limitations of Linear Codes 4
The Linear Deterministic Approach to Wireless Networks 4
Balancing Data Privacy and System Utility 4
The Real World Validation Gap of Synthetic Data 4
Modeling Network Connectivity via Intersected Random Graphs 3
Concentration Inequalities for High Dimensional Systems 3
Distributed Optimization over Directed Networks 3
Zero One Laws for Random Graph Connectivity 3
Communication with Asymmetric Channel State Information 3
From Non-Constructive Existence to Explicit Code Constructions 3
Robust Communication Under Transmitter Side Channel Uncertainty 3

Top Authors

AuthorPapers
Vijay G Subramanian14
Vaneet Aggarwal13
Mingyan Liu12
Pablo Piantanida12
Anant Sahai11
Atilla Eryilmaz11
H. Vincent Poor11
Kannan Ramchandran11
Tsachy Weissman11
Yingbin Liang11
Arya Mazumdar10
George K. Atia10
Jorge Cortes10
Lifeng Lai10
Ness Shroff10
Shuguang Cui10
Venkatesh Saligrama10
Ayfer Ozgur9
Babak Hassibi9
Constantine Caramanis9

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Distributed MIMO network optimization based on duality and local message passing2009
Distributed strategies for making a digraph weight-balanced2009
Distributed universally optimal strategies for interference channels with partial message passing2009
Enhanced CDMA communications using compressed-sensing reconstruction methods2009
Explicit construction of optimal exact regenerating codes for distributed storage2009
Fading cognitive multiple-access channels with confidential messages2009
Generalizing Kronecker graphs in order to model searchable networks2009
How do the structure and the parameters of Gaussian tree models affect structure learning?2009
Implementing utility-optimal CSMA2009
Information complexity of black-box convex optimization: A new look via feedback information theory2009
Information theoretic adaptive tracking of epidemics in complex networks2009
Information Theoretic Adaptive Tracking of Epidemics in Complex Networks.2009
Interactive encoding and decoding based on syndrome accumulation over binary LDPC ensembles: Universality and rate-adaptivity2009
Interference alignment at finite SNR: General message sets2009
Interference networks with local view: A distributed optimization approach2009
Is it enough to drain the heaviest bottlenecks?2009
Iterative maximum likelihood on networks2009
K-user fading interference channels: The ergodic very strong case2009
LDGM-based codes for successive refinement2009
Limits of performance of real-time DNA microarrays2009
Limits on the robustness of MIMO joint source-channel codes2009
Loss of continuity in cellular networks under stabilizing transmit power control2009
Low-rank matrix completion with noisy observations: A quantitative comparison2009
Maximum throughput of clandestine relay2009
Mechanism design and implementation theoretic perspective of interference coupled wireless systems2009
Minimal error certificates for detection of faulty sensors using convex optimization2009
Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsity2009
Minimum energy per bit for Gaussian broadcast channels with common message and cooperating receivers2009
Model-based compressive sensing for signal ensembles2009
Multi-channel opportunistic access: A case of restless bandits with multiple plays2009
Multiclass support vector machines for adaptation in MIMO-OFDM wireless systems2009
Multiple description coding of discrete ergodic sources2009
Network error correction with unequal link capacities2009
Noisy group testing: An information theoretic perspective2009
Nonlinear network coding is necessary to combat general Byzantine attacks2009
On scheduling in multi-channel wireless downlink networks with limited feedback2009
On the existence of triangles in random key graphs2009
On the relationship between the multi-antenna secrecy communications and cognitive radio communications2009
Optimal feedback allocation algorithms for multi-user uplink2009
Optimization and analysis of distributed averaging with memory2009
Outlier detection via localized p-value estimation2009
P2P streaming capacity: Survey and recent results2009
Pricing, competition, and routing in relay networks2009
Random channel coding and blind deconvolution2009
Reaching consensus in wireless networks with probabilistic broadcast2009
Robust detection of random variables using sparse measurements2009
Secure relaying: Can publicly transferred keys increase degrees of freedom?2009
Secure source coding with a helper2009
Sequential Sparse Matching Pursuit2009
Sequential team form and its simplification using graphical models2009

« prev Page 21/24 next »