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
Solving low-rank matrix completion problems efficiently2009
Sparse and low-rank matrix decompositions2009
Sparse signal recovery with exponential-family noise2009
Spectral analysis of dynamically evolving networks with linear preferential attachment2009
Supermodular network games2009
TCP with feed-forward source coding for wireless downlink networks2009
The compound capacity of polar codes2009
The feedback capacity region of ElGamal-Costa deterministic interference channel2009
Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamics2009
Violating the Ingleton inequality with finite groups2009
When do only sources need to compute? On functional compression in tree networks2009
A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks2008
A Bayesian network approach to control of networked Markov decision processes2008
A characterization of the error exponent for the Byzantine CEO problem2008
Achievable rates and optimal schedules for half duplex multiple-relay networks2008
A layered lattice coding scheme for a class of three user Gaussian interference channels2008
Analyzing brain signals by combinatorial optimization2008
A new upper bound on the capacity of a class of primitive relay channels2008
A partial order approach to decentralized control of spatially invariant systems2008
Approximate capacity of the two-way relay channel: A deterministic approach2008
A Stieltjes transform approach for analyzing the RLS adaptive Filter2008
Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resources2008
Cayley's hyperdeterminant, the principal minors of a symmetric matrix and the entropy region of 4 Gaussian random variables2008
Combining geometry and combinatorics: A unified approach to sparse signal recovery2008
Compound Gaussian multiple access channels with noisy feedback2008
Compound multiple access channels with conferencing decoders2008
Compressed sensing over the Grassmann manifold: A unified analytical framework2008
Continuous-model communication complexity with application in distributed resource allocation in wireless Ad hoc networks2008
Convergence analysis of distributed subgradient methods over random networks2008
Counter Braids: Asymptotic optimality of the message passing decoding algorithm2008
Crime and Punishment for Cognitive Radios2008
Data center transport mechanisms: Congestion control theory and IEEE standardization2008
Design and analysis of ISP-friendly file distribution protocols2008
Designing floating codes for expected performance2008
Distributed sensor localization in Euclidean spaces: Dynamic environments2008
Diversity-multiplexing tradeoff of the half-duplex relay channel2008
Efficient global optimization for exponential family PCA and low-rank matrix factorization2008
Encoding against an interferer's codebook2008
Entropy coding using equiprobable partitioning2008
Equivalence of two inner bounds on the capacity region of the broadcast channel2008
Ergodic two-user interference channels: Is separability optimal?2008
Exact low-rank matrix completion via convex optimization2008
Fading broadcast channels with state information at the receivers2008
Finding the K largest metrics in a noisy broadcast network2008
Gaussian interference channels with multiple receive antennas: Capacity and generalized degrees of freedom2008
Generalized binary search2008
Generalized quantity competition for multiple products and loss of efficiency2008
Guaranteed bounds for traffic flow parameters estimation using mixed Lagrangian-Eulerian sensing2008
Identifying tractable decentralized control problems on the basis of information structure2008
Incentivizing anonymous "peer-to-peer" reviews2008

« prev Page 22/24 next »