Tsachy Weissman

IEEE Trans. Inf. Theory, July, 2024

A Family of LZ78-based Universal Sequential Probability Assignments.

[BibT_eX]

[DOI]

Naomi Sagan

CoRR, 2024

Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs.

[BibT_eX]

[DOI]

CoRR, 2024

Semantic Image Compression Using Textual Transforms.

[BibT_eX]

[DOI]

Lara Arikan

Proceedings of the IEEE International Symposium on Information Theory, 2024

Adaptive Compression in Federated Learning via Side Information.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Neural Network Compression for Noisy Storage Devices.

[BibT_eX]

[DOI]

ACM Trans. Embed. Comput. Syst., 2023

Txt2Vid: Ultra-Low Bitrate Compression of Talking-Head Videos via Text.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2023

Communication-Efficient Federated Learning through Importance Sampling.

[BibT_eX]

[DOI]

CoRR, 2023

Toward Textual Transform Coding.

[BibT_eX]

[DOI]

CoRR, 2023

Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Sparse Random Networks for Communication-Efficient Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Txt2Vid-Web: Web-based, Text-to-Video, Video Conferencing Pipeline.

[BibT_eX]

[DOI]

Sahasrajit Sarmasarkar

Pulkit Tandon

Proceedings of the Data Compression Conference, 2023

2022

Lossy Compression of Noisy Data for Private and Data-Efficient Learning.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, December, 2022

Editorial Modern Compression.

[BibT_eX]

[DOI]

Meir Feder

IEEE J. Sel. Areas Inf. Theory, December, 2022

KmerKeys: a web resource for searching indexed genome assemblies and variants.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2022

Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel.

[BibT_eX]

[DOI]

Francisco Pernice

CoRR, 2022

An Interactive Annotation Tool for Perceptual Video Compression.

[BibT_eX]

[DOI]

Alexander G. Anderson

Proceedings of the 14th International Conference on Quality of Multimedia Experience, 2022

Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning under Storage and Privacy Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

AI-Generated Characters: Putting Deepfakes to Good Use.

[BibT_eX]

[DOI]

Proceedings of the CHI '22: CHI Conference on Human Factors in Computing Systems, New Orleans, LA, USA, 29 April 2022, 2022

An Information-Theoretic Justification for Model Pruning.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints.

[BibT_eX]

[DOI]

Ayfer Özgür

IEEE Trans. Inf. Theory, 2021

Successive Pruning for Model Compression via Rate Distortion Theory.

[BibT_eX]

[DOI]

CoRR, 2021

Impact of lossy compression of nanopore raw signal data on basecalling and consensus accuracy.

[BibT_eX]

[DOI]

Bioinform., 2021

MEOW: A Space-Efficient Nonparametric Bid Shading Algorithm.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Reducing latency and bandwidth for video streaming using keypoint extraction and digital puppetry.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

2020

Minimax Estimation of Divergences Between Discrete Distributions.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2020

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions.

[BibT_eX]

[DOI]

CoRR, 2020

Optimal No-regret Learning in Repeated First-price Auctions.

[BibT_eX]

[DOI]

Zhengyuan Zhou

CoRR, 2020

Overcoming High Nanopore Basecaller Error Rates for DNA Storage via Basecaller-Decoder Integration and Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

LFZip: Lossy Compression of Multivariate Floating-Point Time Series Data via Improved Prediction.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

2019

Estimating the Fundamental Limits is Easier Than Achieving the Fundamental Limits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Approximate Profile Maximum Likelihood.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2019

Minimum Power to Maintain a Nonequilibrium Distribution of a Markov Chain.

[BibT_eX]

[DOI]

Yihui Quek

CoRR, 2019

Optimal Communication Rates for Zero-Error Distributed Simulation under Blackboard Communication Protocols.

[BibT_eX]

[DOI]

CoRR, 2019

SPRING: a next-generation compressor for FASTQ data.

[BibT_eX]

[DOI]

Bioinform., 2019

Neural Joint Source-Channel Coding.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Humans are Still the Best Lossy Image Compressors.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2019

Improved read/write cost tradeoff in DNA-based data storage using LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018

Mutual Information, Relative Entropy and Estimation Error in Semi-Martingale Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Minimax Estimation of the L1 Distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

NECST: Neural Joint Source-Channel Coding.

[BibT_eX]

[DOI]

CoRR, 2018

Concentration Inequalities for the Empirical Distribution.

[BibT_eX]

[DOI]

CoRR, 2018

QVZ: lossy compression of quality values.

[BibT_eX]

[DOI]

Bioinform., 2018

Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis.

[BibT_eX]

[DOI]

Shubham Chandak

Kedar Tatwawadi

Bioinform., 2018

Entropy Rate Estimation for Markov Chains with Large State Space.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Minimax Redundancy for Markov Chains with Large State Space.

[BibT_eX]

[DOI]

Kedar Tatwawadi

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

On Universal Compression with Constant Random Access.

[BibT_eX]

[DOI]

Kedar Tatwawadi

Shirin Saeedi Bidokhti

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Distributed Statistical Estimation of High-Dimensional and Nonparametric Distributions.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

2017

When is Noisy State Information at the Encoder as Useless as No Information or as Good as Noise-Free State?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Relations Between Information and Estimation in Discrete-Time Lévy Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Maximum Likelihood Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Principles and Applications of Science of Information.

[BibT_eX]

[DOI]

Proc. IEEE, 2017

Optimal rates of entropy estimation over Lipschitz balls.

[BibT_eX]

[DOI]

CoRR, 2017

On Estimation of L{r}-Norms in Gaussian White Noise Models.

[BibT_eX]

[DOI]

CoRR, 2017

Bias Correction with Jackknife, Bootstrap, and Taylor Series.

[BibT_eX]

[DOI]

CoRR, 2017

Minimax Estimation of the $L_1$ Distance.

[BibT_eX]

[DOI]

CoRR, 2017

Effect of lossy compression of quality scores on variant calling.

[BibT_eX]

[DOI]

Briefings Bioinform., 2017

Dependence measures bounding the exploration bias for general measurements.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Compressing Tabular Data via Pairwise Dependencies.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

GeneComp, a New Reference-Based Compressor for SAM Files.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

2016

Information, Estimation, and Lookahead in the Gaussian Channel.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2016

Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Rateless Lossy Compression via the Extremes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Secure Source Coding With a Public Helper.

[BibT_eX]

[DOI]

Kittipong Kittichokechai

IEEE Trans. Inf. Theory, 2016

Distortion Rate Function of Sub-Nyquist Sampled Gaussian Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Demystifying ResNet.

[BibT_eX]

[DOI]

CoRR, 2016

Minimax Estimation of KL Divergence between Discrete Distributions.

[BibT_eX]

[DOI]

CoRR, 2016

smallWig: parallel compression of RNA-seq WIG files.

[BibT_eX]

[DOI]

Zhiying Wang

Olgica Milenkovic

Bioinform., 2016

GTRAC: fast retrieval from compressed collections of genomic variants.

[BibT_eX]

[DOI]

Bioinform., 2016

Comment on: 'ERGC: an efficient referential genome compression algorithm'.

[BibT_eX]

[DOI]

Bioinform., 2016

CROMqs: an infinitesimal successive refinement lossy compressor for the quality scores.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Minimax rate-optimal estimation of KL divergence between discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Chained Kullback-Leibler divergences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Minimax estimation of the L1 distance.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Denoising of Quality Scores for Boosted Inference and Reduced Storage.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

A Cluster-Based Approach to Compression of Quality Scores.

[BibT_eX]

[DOI]

Mikel Hernaez

Proceedings of the 2016 Data Compression Conference, 2016

Beyond maximum likelihood: Boosting the Chow-Liu algorithm for large alphabets.

[BibT_eX]

[DOI]

Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015

Minimax Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Justification of Logarithmic Loss via the Benefit of Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Compression for Quadratic Similarity Queries.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Minimax Estimation of Discrete Distributions Under ℓ1 Loss.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs.

[BibT_eX]

[DOI]

Yair Carmon

Shlomo Shamai

IEEE Trans. Inf. Theory, 2015

Network Compression: Worst Case Analysis.

[BibT_eX]

[DOI]

Ilan Shomorony

Amir Salman Avestimehr

IEEE Trans. Inf. Theory, 2015

DUDE-Seq: Fast Universal Denoising of Nucleotide Sequences.

[BibT_eX]

[DOI]

CoRR, 2015

iDoComp: a compression scheme for assembled genomes.

[BibT_eX]

[DOI]

Mikel Hernaez

Bioinform., 2015

Universality of logarithmic loss in lossy compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Minimax estimation of information measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Maximum Likelihood Estimation of information measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Minimax estimation of discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Adaptive estimation of Shannon entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Does dirichlet prior smoothing solve the Shannon entropy estimation problem?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Compression for Similarity Identification: Computing the Error Exponent.

[BibT_eX]

[DOI]

Proceedings of the 2015 Data Compression Conference, 2015

2014

Compression With Actions.

[BibT_eX]

[DOI]

Lei Zhao

IEEE Trans. Inf. Theory, 2014

Capacity of a POST Channel With and Without Feedback.

[BibT_eX]

[DOI]

Haim Henri Permuter

IEEE Trans. Inf. Theory, 2014

Minimax Filtering Regret via Relations Between Information and Estimation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

The Porosity of Additive Noise Channels.

[BibT_eX]

[DOI]

Vinith Misra

IEEE Trans. Inf. Theory, 2014

Information Measures: The Curious Case of the Binary Alphabet.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Multiterminal Source Coding Under Logarithmic Loss.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

To Feed or Not to Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Aligned genomic data compression via improved modeling.

[BibT_eX]

[DOI]

Mikel Hernaez

J. Bioinform. Comput. Biol., 2014

Maximum Likelihood Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

CoRR, 2014

Order-Optimal Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

CoRR, 2014

Beyond Maximum Likelihood: from Theory to Practice.

[BibT_eX]

[DOI]

CoRR, 2014

Strong successive refinability: Sufficient conditions.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Relations between information and estimation in scalar Lévy channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Information divergences and the curious case of the binary alphabet.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Compression for similarity identification: Fundamental limits.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Compression for quadratic similarity queries via shape-gain quantizers.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Compression Schemes for Similarity Queries.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

2013

Directed Information, Causal Estimation, and Communication in Continuous Time.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Achievable Error Exponents in the Gaussian Channel With Rate-Limited Feedback.

[BibT_eX]

[DOI]

Reza Mirghaderi

IEEE Trans. Inf. Theory, 2013

Universal Estimation of Directed Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Estimation With a Helper Who Knows the Interference.

[BibT_eX]

[DOI]

Rajiv Soundararajan

IEEE Trans. Inf. Theory, 2013

Multiterminal Source Coding With Action-Dependent Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Real-Time Coding With Limited Lookahead.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Successive Refinement With Decoder Cooperation and Its Channel Coding Duals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

The Minimal Compression Rate for Similarity Identification.

[BibT_eX]

[DOI]

CoRR, 2013

QualComp: a new lossy compressor for quality scores based on rate distortion theory.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

The human genome contracts again.

[BibT_eX]

[DOI]

Golan Yona

Bioinform., 2013

Operational extremality of Gaussianity in network compression, communication, and coding.

[BibT_eX]

[DOI]

Ilan Shomorony

Amir Salman Avestimehr

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The role of lookahead in estimation under Gaussian noise.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Unsupervised learning and universal communication.

[BibT_eX]

[DOI]

Vinith Misra

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Pointwise relations between information and estimation in the Poisson channel.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Compression for exact match identification.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Reliable uncoded communication in the SIMO MAC via low-complexity decoding.

[BibT_eX]

[DOI]

Mainak Chowdhury

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Quadratic Similarity Queries on Compressed Data.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

Efficient similarity queries via lossy compression.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Complexity and rate-distortion tradeoff via successive refinement.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Distortion rate function of sub-Nyquist sampled Gaussian sources corrupted by noise.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Reliable uncoded communication in the underdetermined SIMO MAC with low-complexity decoding.

[BibT_eX]

[DOI]

Mainak Chowdhury

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Denoising via MCMC-Based Lossy Compression.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2012

An MCMC Approach to Universal Lossy Compression of Analog Sources.

[BibT_eX]

[DOI]

Dror Baron

IEEE Trans. Signal Process., 2012

Pointwise Relations Between Information and Estimation in Gaussian Noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Cascade and Triangular Source Coding With Side Information at the First Two Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Lossy Compression of Discrete Sources via the Viterbi Algorithm.

[BibT_eX]

[DOI]

Andrea Montanari

IEEE Trans. Inf. Theory, 2012

Cascade, Triangular, and Two-Way Source Coding With Degraded Side Information at the Second User.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Mutual Information, Relative Entropy, and Estimation in the Poisson Channel.

[BibT_eX]

[DOI]

Rami Atar

IEEE Trans. Inf. Theory, 2012

Block and Sliding-Block Lossy Compression via MCMC.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2012

Achievable complexity-performance tradeoffs in lossy compression.

[BibT_eX]

[DOI]

Ankit Gupta

Probl. Inf. Transm., 2012

Lossy Compression of Quality Values via Rate Distortion Theory

[BibT_eX]

[DOI]

CoRR, 2012

Worst-case source for distributed compression with quadratic distortion.

[BibT_eX]

[DOI]

Ilan Shomorony

Amir Salman Avestimehr

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Reference based genome compression.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

The degraded broadcast channel with action-dependent states.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Joint source-channel coding of one random variable over the Poisson channel.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

The porosity of additive noise sequences.

[BibT_eX]

[DOI]

Vinith Misra

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Universal estimation of directed information via sequential probability assignments.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Successive refinement with cribbing decoders and its channel coding duals.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On information, estimation and lookahead.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Uncoded transmission in MAC channels achieves arbitrarily small error probability.

[BibT_eX]

[DOI]

Mainak Chowdhury

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Source Coding With a Side Information "Vending Machine".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Interpretations of Directed Information in Portfolio Theory, Data Compression, and Hypothesis Testing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Error Exponents for the Gaussian Channel With Active Noisy Feedback.

[BibT_eX]

[DOI]

Amos Lapidoth

IEEE Trans. Inf. Theory, 2011

Probing Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Pointwise Relations between Information and Estimation

[BibT_eX]

[DOI]

CoRR, 2011

Continuous-time directed information and its role in communication.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Discrete denoising of heterogeneous two-dimensional data.

[BibT_eX]

[DOI]

Jae-Young Kim

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Cascade and Triangular source coding with causal side information.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Multi-terminal source coding with action dependent side information.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

To feed or not to feed back.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Capacity of Channels With Action-Dependent States.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

The relationship between causal and noncausal mismatched estimation in continuous-time AWGN channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Two-way source coding with a helper.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

A universal scheme for Wyner-Ziv coding of discrete sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Universal reinforcement learning.

[BibT_eX]

[DOI]

Vivek F. Farias

Ciamac Cyrus Moallemi

Benjamin Van Roy

IEEE Trans. Inf. Theory, 2010

Tighter bounds on the capacity of finite-state channels via Markov set-chains.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Discrete denoising of heterogenous two-dimensional data

[BibT_eX]

[DOI]

Jae-Young Kim

CoRR, 2010

Universal estimation of directed information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Universal lossless compression-based denoising.

[BibT_eX]

[DOI]

Han-I Su

Proceedings of the IEEE International Symposium on Information Theory, 2010

An MCMC Approach to Lossy Compression of Continuous Sources.

[BibT_eX]

[DOI]

Dror Baron

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

To observe or not to observe the channel state.

[BibT_eX]

[DOI]

Kamakshi Sivaramakrishnan

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

A context quantization approach to universal denoising.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2009

Universal FIR MMSE Filtering.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2009

Finite State Channels With Time-Invariant Deterministic Feedback.

[BibT_eX]

[DOI]

Andrea J. Goldsmith

IEEE Trans. Inf. Theory, 2009

Capacity region of the finite-state multiple-access channel with and without feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Discrete denoising with shifts.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Where is the action in information theory.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Modeling and Optimization in Mobile, 2009

Problems we can solve with a helper.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

An iterative scheme for near optimal and universal lossy compression.

[BibT_eX]

[DOI]

Andrea Montanari

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Two-way source coding with a common helper.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Source coding with a side information 'vending machine' at the decoder.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Directed information and causal estimation in continuous time.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

An outer bound for side-information scalable source coding with partially cooperating decoders.

[BibT_eX]

[DOI]

Shraga I. Bross

Proceedings of the IEEE International Symposium on Information Theory, 2009

An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources.

[BibT_eX]

[DOI]

Andrea Montanari

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

Multiple description coding of discrete ergodic sources.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

How to Filter an "Individual Sequence With Feedback".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

The Information Lost in Erasures.

[BibT_eX]

[DOI]

Kamakshi Sivaramakrishnan

IEEE Trans. Inf. Theory, 2008

Universal Denoising of Discrete-Time Continuous-Amplitude Signals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Capacity of the Trapdoor Channel With Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Universal Filtering Via Hidden Markov Modeling.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise.

[BibT_eX]

[DOI]

Nuno C. Martins

IEEE Trans. Inf. Theory, 2008

Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Rate-Distortion with a Limited-Rate Helper to the Encoder and Decoder

[BibT_eX]

[DOI]

Yossi Steinberg

CoRR, 2008

New bounds for the capacity region of the Finite-State Multiple Access Channel.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On directed information and gambling.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Rate-distortion via Markov chain Monte Carlo.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Rate-distortion in near-linear time.

[BibT_eX]

[DOI]

Ankit Gupta

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On the capacity of finite-state channels.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On successive refinement for the Wyner-Ziv problem with partially cooperating decoders.

[BibT_eX]

[DOI]

Shraga I. Bross

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007

Universal Filtering Via Prediction.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

IEEE Trans. Inf. Theory, 2007

Denoising and Filtering Under the Probability of Excess Loss Criterion.

[BibT_eX]

[DOI]

Stephanie Pereira

IEEE Trans. Inf. Theory, 2007

Scanning and Sequential Decision Making for Multidimensional Data-Part I: The Noiseless Case.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Capacity Region of the Finite-State Multiple Access Channel with and without Feedback

[BibT_eX]

[DOI]

CoRR, 2007

Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case

[BibT_eX]

[DOI]

CoRR, 2007

Capacity and Zero-Error Capacity of the Chemical Channel with Feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Competitive On-line Linear FIR MMSE Filtering.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

New Bounds on the Rate-Distortion Function of a Binary Markov Source.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

A Universal Wyner-Ziv Scheme for Discrete Sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Scanning, Filtering and Prediction for Random Fields Corrupted by Gaussian Noise.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

The Gaussian Channel with Noisy Feedback.

[BibT_eX]

[DOI]

Amos Lapidoth

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Algorithms for discrete denoising under channel uncertainty.

[BibT_eX]

[DOI]

Styrmir Sigurjonsson

IEEE Trans. Signal Process., 2006

Source Coding With Limited-Look-Ahead Side Information at the Decoder.

[BibT_eX]

[DOI]

Abbas El Gamal

IEEE Trans. Inf. Theory, 2006

On the optimality of symbol-by-symbol filtering and denoising.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Coding for the Feedback Gel'fand-Pinsker Channel and the Feedforward Wyner-Ziv Source.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Universal Zero-Delay Joint Source-Channel Coding.

[BibT_eX]

[DOI]

Shahriyar Matloub

IEEE Trans. Inf. Theory, 2006

On the Entropy Rate of Pattern Processes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Universal Minimax Discrete Denoising Under Channel Uncertainty.

[BibT_eX]

[DOI]

Styrmir Sigurjonsson

IEEE Trans. Inf. Theory, 2006

Coding for Additive White Noise Channels with Feedback Corrupted by Uniform Quantization or Bounded Noise

[BibT_eX]

[DOI]

Nuno C. Martins

CoRR, 2006

Scanning and Sequential Decision Making for Multi-Dimensional Data - Part I: the Noiseless Case

[BibT_eX]

[DOI]

CoRR, 2006

Compound Sequential Decisions Against the Well-Informed Antagonist.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Erasure Entropy.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Capacity of Finite-State Channels with Time-Invariant Deterministic Feedback.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Source Coding with Limited Side Information Lookahead at the Decoder.

[BibT_eX]

[DOI]

Abbas El Gamal

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Universal Scanning and Sequential Decision Making for Multidimensional Data.

[BibT_eX]

[DOI]

Kamakshi Sivaramakrishnan

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Universal Denoising of Continuous Amplitude Signals with Applications to Images.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Image Processing, 2006

2005

Universal discrete denoising: known channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

The empirical distribution of rate-constrained source codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On causal source codes with side information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Universal denoising for the finite-input general-output channel.

[BibT_eX]

[DOI]

Amir Dembo

IEEE Trans. Inf. Theory, 2005

Discrete denoising for channels with memory.

[BibT_eX]

[DOI]

Rui Zhang

Commun. Inf. Syst., 2005

Multi-directional context sets with applications to universal denoising and compression.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Approximations for the entropy rate of a hidden Markov process.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime.

[BibT_eX]

[DOI]

Chandra Nair

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Discrete universal filtering via hidden Markov modelling.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the relationship between process and pattern entropy rate.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

A universal scheme for learning.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Universally Attainable Error Exponents for Rate-Distortion Coding of Noisy Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Efficient pruning of bi-directional context trees with applications to universal denoising and compression.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

New bounds on the entropy rate of hidden Markov processes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Channel decoding of systematically encoded unknown redundant sources.

[BibT_eX]

[DOI]

Gadiel Seroussi

Krishnamurthy Viswanathan

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Universal minimax binary image denoising under channel uncertainty.

[BibT_eX]

[DOI]

Styrmir Sigurjonsson

Proceedings of the 2004 International Conference on Image Processing, 2004

Discrete Universal Filtering Through Incremental Parsing.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

On competitive prediction and its relation to rate-distortion theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Scanning and prediction in multidimensional data arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

The minimax distortion redundancy in noisy source coding.

[BibT_eX]

[DOI]

Amir Dembo

IEEE Trans. Inf. Theory, 2003

A discrete universal denoiser and its application to binary images.

[BibT_eX]

[DOI]

Gadiel Seroussi

Proceedings of the 2003 International Conference on Image Processing, 2003

2002

On limited-delay lossy coding and filtering of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Universal discrete denoising.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001

Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence.

[BibT_eX]

[DOI]

Anelia Somekh-Baruch

IEEE Trans. Inf. Theory, 2001

Universal prediction of individual binary sequences in the presence of noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

1999

On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise.

[BibT_eX]

[DOI]