This is a page with all possible (non-custom) blocks
Used to be "Covid-19 updates"
Awards
Aaron D. Wyner Distinguished Service Award
Claude E. Shannon Award
Communications Society & Information Theory Society Joint Paper Award
Goldsmith Lecturer
Information Theory Society Paper Award
Jack Keil Wolf ISIT Student Paper Award
James L. Massey Research & Teaching Award for Young Scholars
Padovani Lecturer
Thomas M. Cover Dissertation Award
Awards
Distinguished Lecturers
Conferences
Job list
Postdoctoral Scholar, California Institute of Technology
Vertex Postdoctoral Positions at USC
Postdoc in Machine Learning for Wireless Propagation at USC
15 PhD Fellowships in Computer Science at the University of Pisa
Phd and Postdoctoral Positions in Information Theory at INRIA
Postdoc Position in Wireless Networks at Northwestern University
Postdoctoral Position in Data-driven Graphical Models at ASU
Open Faculty position on Quantum Information Processing with Photons at Télécom Paris
Postdoc Positions at Northwestern and TTIChicago
Tenured Faculty Position in Cryptograph at Télécom Paris
Postdoctoral Position at the Ohio State University
Tenure-Track Position in Information and Data Science at the University of Cambridge
Post Doc in High-Throughput Coding at DTU
Research Assistant Professor in the Foundations of Data Science at the University of Illinois at Chicago
Tenure-Track Position in the Mathematics of Information and Learning at Cambridge University
Faculty positions at University of Michigan IOE Deparment
Assistant Professor position at Princeton University
Postdoctoral position at the University of Cambridge
Two-year Postdoctoral Researcher Position at Rutgers University
Pagination
Jobs Board
Postdoctoral Researcher Position on Information Theory and Coding
Immediate openings for postdocs on insertion/deletion channels and DNA storage at Bilkent…
Postdoc Positions in Wireless Communications
Department of Electrical and Computer Engineering at University of Hawaii is looking for two…
Postdoctoral Position in Econometrics and Statistics
The University of Vienna invites applications for a postdoctoral position in the field of…
News
Robert Calderbank - USC Viterbi Lecture, Thursday March 2, 2023
Robert Calderbank of Duke University will give the 2023 USC Viterbi Lecture on Thursday, March 2,…
Submission Deadline Approaching: JSAIT Issue on Role of Freshness and Semantic Measures
Call for Papers for JSAIT Issue on the Role of Freshness and Semantic Measures in the Transmission…
IEEE Information Theory Society Call for 2023 Award Nominations
Nominations are now open for paper awards as well as annual awards and recognition from the IEEE…
Aylin Yener Has Been Elected To Be the Next IEEE Division IX Director
The IT Society congratulates our Past President Aylin Yener for being elected to be the next IEEE…
News
ISIT2021 Technical Program Is Now Available
Next JSAIT Special Issue will be on Information Theoretic Foundations of Future Communication Systems
2021 North American School of Information Theory
Attention ITSoc Student Members! ISIT 2021 Four Minutes, Two Techniques Contest
ISIT Scholarships for Undergraduates from Groups Currently Underrepresented in ITSoc
ISIT 2021 Call for Recent Results
Deadline Extension: JSAIT Special Issue on Coding for Data Management and Delivery in Networks
The book "Rank Codes" by Ernst Gabidulin
ISIT 2021 Call for Recent Results
Call for Nominations for Editor-in-Chief of the IEEE Transactions on Information Theory
Call for Contributions for Society Newsletter
Yuejie Chi named the IEEE Information Theory Society 2021 Goldsmith Lecturer
Muriel Médard named the IEEE Information Theory Society 2021 Padovani Lecturer
The IEEE Information Theory Society names 2021-22 Distinguished Lecturers
CFP: IEEE JSAC Special Issue on Private Information Retrieval, Private Coded Computing over Distributed Servers, and Privacy in Distributed Learning
Reminder: Information Theory Society Call for 2021 Award Nominations
Registrations for ITW 2020
Meir Feder Wins Academy Award
Postdoctoral Position, University of Pennsylvania
Pagination
Past meeting
Test Meeting with member edited
BOG Meeting - Hybrid Meeting @ ITA 2023, San Diego, California
BOG Meeting - October 2022
BOG Meeting - Hybrid Meeting @ ISIT 2022, Espoo, Finland
BOG Meeting - March 2023
BOG Meeting - November 2021
BOG Meeting - June 2021
BOG Meeting - March 2021
BOG Meeting @ New Brunswick, NJ - 2019
BoG Meeting @ Chicago, IL 2015
BoG Meeting @ ISIT 2015, Hong Kong
BoG Meeting - GlobalMeet
BoG Meeting @ ITA 2014, San Diego, CA
BoG Meeting @ ITA 2013, San Diego, CA
BoG meeting @ ITW 2012, Lausanne
BoG meeting @ ISIT 2012, Cambridge, MA
IT BoG meeting @ ITA 2012, UCSD
BoG Meeting @ ITW 2011, Paraty, Brazil
BoG Meeting @ ISIT 2011, St. Petersburg, Russia
BoG Meeting, ISIT 2010
BoG Meeting, La Jolla, CA, 2010
BoG Meeting, ITW Taormina 2009
BoG Meeting, ISIT 2009
Research In Information Theory
Rate-Distortion-Perception Tradeoff for Gaussian Vector Sources
Quantum Sensing and Communication via Non-Gaussian States
Source Coding for Markov Sources With Partial Memoryless Side Information at the Decoder
Deviation From Maximal Entanglement for Mid-Spectrum Eigenstates of Local Hamiltonians
Generalized Autoregressive Linear Models for Discrete High-Dimensional Data
Fitting multivariate autoregressive (AR) models is fundamental for time-series data analysis in a wide range of applications. This article considers the problem of learning a $p$ -lag multivariate AR model where each time step involves a linear combination of the past $p$ states followed by a probabilistic, possibly nonlinear, mapping to the next state. The problem is to learn the linear connectivity tensor from observations of the states. We focus on the sparse setting, which arises in applications with a limited number of direct connections between variables.
Fast Variational Inference for Joint Mixed Sparse Graphical Models
Mixed graphical models are widely implemented to capture interactions among different types of variables. To simultaneously learn the topology of multiple mixed graphical models and encourage common structure, people have developed a variational maximum likelihood inference approach, which takes advantage of the log-determinant relaxation. In this article, we further improve the computational efficiency of this method by exploiting the block diagonal structure of the solution.
Generalization Bounds via Information Density and Conditional Information Density
We present a general approach, based on an exponential inequality, to derive bounds on the generalization error of randomized learning algorithms. Using this approach, we provide bounds on the average generalization error as well as bounds on its tail probability, for both the PAC-Bayesian and single-draw scenarios. Specifically, for the case of sub-Gaussian loss functions, we obtain novel bounds that depend on the information density between the training data and the output hypothesis.
Global Multiclass Classification and Dataset Construction via Heterogeneous Local Experts
In the domains of dataset construction and crowdsourcing, a notable challenge is to aggregate labels from a heterogeneous set of labelers, each of whom is potentially an expert in some subset of tasks (and less reliable in others). To reduce costs of hiring human labelers or training automated labeling systems, it is of interest to minimize the number of labelers while ensuring the reliability of the resulting dataset.
Recovering Data Permutations From Noisy Observations: The Linear Regime
This article considers a noisy data structure recovery problem. The goal is to investigate the following question: given a noisy observation of a permuted data set, according to which permutation was the original data sorted? The focus is on scenarios where data is generated according to an isotropic Gaussian distribution, and the noise is additive Gaussian with an arbitrary covariance matrix. This problem is posed within a hypothesis testing framework.
Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants
Datasets from the fields of bioinformatics, chemometrics, and face recognition are typically characterized by small samples of high-dimensional data.