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
Interference Alignment for Cellular Networks2008
Interference channels with correlated receiver side information2008
Landmark-based position and movement detection of wireless sensor network devices2008
Large deviations for many server networks with long range dependent and batch arrivals2008
Large on the capacity of indecomposable finite-state channels with feedback2008
Learning low rank matrices from O(n) entries2008
Learning sparse doubly-selective channels2008
Local dynamics for network formation games2008
Local interference can accelerate gossip algorithms2008
Low-density linear IED schemes for lossless source coding with decoder only side information2008
Lower bound and optimality in switched networks2008
Many-sources large deviations for max-weight scheduling2008
Modeling node capture attacks in wireless sensor networks2008
Multiuser scheduling in a Markov-modeled downlink environment2008
Networking sensors using belief propagation2008
N-player Bertrand-Cournot games in queues: Existence of equilibrium2008
Oblivious equilibrium for stochastic games with concave utility2008
On a class of optimal rateless codes2008
On ergodic sum capacity of fading cognitive multiple-access channel2008
On the capacity of MIMO interference channels2008
On the delay performance of in-network aggregation in lossy wireless sensor networks2008
On the information capacity of Gaussian channels under small peak power constraints2008
On the performance of multiple choice hash tables with moves on deletes and inserts2008
Opportunistic multi-antenna downlink transmission with finite-rate feedback2008
Optimality and large deviations of queues under the pseudo-Log rule opportunistic scheduling2008
Optimal resource allocation for MIMO ad hoc cognitive radio networks2008
Optimal sensor density for remote estimation over Wireless Sensor Networks2008
Overcoming SNR walls through macroscale features2008
P2P streaming capacity for heterogeneous users with degree bounds2008
Practical near-optimal sparse recovery in the L1 norm2008
Precoding methods for multi-user TDD MIMO systems2008
Privacy-security tradeoffs in biometric security systems2008
Query-level learning to rank using isotonic regression2008
Range-based geolocation in fading environments2008
Rate-achievability strategies for two-hop interference flows2008
Rate regions for the separated two-way relay channel2008
Rates of convergence for greedy gossip with eavesdropping2008
Robust dimensionality reduction for high-dimension data2008
Sample complexity of determining structures of graphical models2008
Secure broadcasting : The secrecy rate region2008
Secure wireless communications via cooperation2008
Security games for vehicular networks2008
Security investment games of interdependent organizations2008
Single-user MIMO vs. Multiuser MIMO in the broadcast channel with CSIT constraints2008
Sparse algorithms are not stable: A no-free-lunch theorem2008
Spectral clustering in high-dimensions: Necessary and sufficient conditions for dense and sparse mixtures2008
Spectum sharing as congestion games2008
Stability of supply function equilibrium in electricity markets under piecewise linear function perturbations2008
Stochastic analysis of power-aware scheduling2008
System level optimization in wireless networks with uncertain customer arrival rates2008

« prev Page 23/24 next »