Gil I. Shamir

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Learning to Rank when Grades Matter.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Real World Large Scale Recommendation Systems Reproducibility and Smooth Activations.

[BibT_eX]

[DOI]

Dong Lin

CoRR, 2022

Sequential universal modeling for non-binary sequences with constrained distributions.

[BibT_eX]

[DOI]

Michael Drmota

Commun. Inf. Syst., 2022

On the Factory Floor: ML Engineering for Industrial-Scale Ads Recommendation Models.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Online Recommender Systems and User Modeling co-located with the 16th ACM Conference on Recommender Systems, 2022

Reproducibility in Optimization: Theoretical Framework and Limits.

[BibT_eX]

[DOI]

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

Precise Minimax Regret for Logistic Regression.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Dropout Prediction Variation Estimation Using Neuron Activation Strength.

[BibT_eX]

[DOI]

CoRR, 2021

Synthesizing Irreproducibility in Deep Networks.

[BibT_eX]

[DOI]

Robert R. Snapp

CoRR, 2021

A Lower Bound for Regret in Logistic Regression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Information Sufficiency via Fourier Expansion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Finding Relevant Information via a Discrete Fourier Expansion.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Precise Minimax Regret for Logistic Regression with Categorical Feature Values.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the Algorithmic Learning Theory, 2021

2020

Smooth activations and reproducibility in deep networks.

[BibT_eX]

[DOI]

Dong Lin

Lorenzo Coviello

CoRR, 2020

Anti-Distillation: Improving reproducibility of deep networks.

[BibT_eX]

[DOI]

Lorenzo Coviello

CoRR, 2020

Logistic Regression Regret: What's the Catch?

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

2018

Geometric shaping: low-density coding of Gaussian-like constellations.

[BibT_eX]

[DOI]

Joseph J. Boutros

Uri Erez

Johannes Van Wonterghem

Gilles Zémor

Proceedings of the IEEE Information Theory Workshop, 2018

2015

Minimum description length (MDL) regularization for online learning.

[BibT_eX]

[DOI]

Proceedings of the 1st Workshop on Feature Extraction: Modern Questions and Challenges, 2015

2013

Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2009

Universal source controlled channel decoding with nonsystematic quick-look-in turbo codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2009

2008

Entropy of Patterns of i.i.d. Sequences - Part I: General Bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Low-complexity sequential probability estimation and universal compression for binary sequences with constrained distributions.

[BibT_eX]

[DOI]

Tjalling J. Tjalkens

Frans M. J. Willems

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

Fountain codes for piecewise stationary channels.

[BibT_eX]

[DOI]

Bertrand Ndzana Ndzana

Andrew W. Eckford

Amin Shokrollahi

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

2007

Universal Context Based Decoding with Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2007

Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions

[BibT_eX]

[DOI]

CoRR, 2007

Comparing Different Transmission Strategies Using Turbo Codes for Nonuniform Memoryless Sources.

[BibT_eX]

[DOI]

Gilberto Titericz Jr.

Richard Demo Souza

Javier Garcia-Frías

Proceedings of IEEE International Conference on Communications, 2007

Universal Context Based Decoding with Non-systematic Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Joseph Boutros

Proceedings of the 41st Annual Conference on Information Sciences and Systems, 2007

2006

Universal Lossless Compression With Unknown Alphabets - The Average Case.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On the MDL principle for i.i.d. sources with large alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Patterns of i.i.d. Sequences and Their Entropy - Part I: General Bounds

[BibT_eX]

[DOI]

CoRR, 2006

Iterative Estimation and Decoding for Gaussian Channels with Abruptly Changing Statistics.

[BibT_eX]

[DOI]

Wufei Zhang

Thomas E. Fuja

Andrew W. Eckford

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

EXIT Chart Analysis for Split-LDPC Codes.

[BibT_eX]

[DOI]

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

On Some Distributions and Their Pattern Entropies.

[BibT_eX]

[DOI]

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

Context Based Decoding of Split-LDPC Codes.

[BibT_eX]

[DOI]

Joseph Boutros

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005

Universal lossless source controlled channel decoding for i.i.d. sequences.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2005

Estimation and decoding strategies for channels with abruptly changing statistics.

[BibT_eX]

[DOI]

Wufei Zhang

Christian Koller

Andrew W. Eckford

Thomas E. Fuja

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Design of non-systematic turbo codes for universal source controlled channel decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Bounds on the entropy of patterns of I.I.D. sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

On the pointwise redundancy of the LZ78 algorithm.

[BibT_eX]

[DOI]

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

Context and denoising based decoding of non-systematic turbo codes for redundant data.

[BibT_eX]

[DOI]

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

Non-systematic turbo coding with unequal energy allocation for nonuniform memoryless sources.

[BibT_eX]

[DOI]

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

Non-systematic low-density parity-check codes for nonuniform sources.

[BibT_eX]

[DOI]

Joseph J. Boutros

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

Decoding of Non-Systematic Turbo Codes for Stationary Memoryless and Piecewise Stationary Memoryless Sequences.

[BibT_eX]

[DOI]

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

BWT Based Universal Lossless Source Controlled Channel Decoding with Low Density Parity Check Codes.

[BibT_eX]

[DOI]

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

2004

Universal Lossless Coding for Sources With Repeating Statistics.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Universal lossless source controlled channel decoding.

[BibT_eX]

[DOI]

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

Average case universal lossless compression with unknown alphabets.

[BibT_eX]

[DOI]

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

Sequential Universal Lossless Techniques for Compression of Patterns and Their Description Length.

[BibT_eX]

[DOI]

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

2003

On strongly sequential compression of sources with abrupt changes in statistics.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2003

2001

On the redundancy of universal lossless coding for general piecewise stationary sources.

[BibT_eX]

[DOI]

Commun. Inf. Syst., 2001

Universal Lossless Compression of Piecewise Stationary Slowly Varying Sources.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

2000

Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1999

Low-complexity sequential lossless coding for piecewise-stationary memoryless sources.

[BibT_eX]

[DOI]