| Low-complexity sequential lossless coding for piecewise-stationary memoryless sources GI Shamir, N Merhav IEEE transactions on information theory 45 (5), 1498-1519, 1999 | 109 | 1999 |
| Regularization of machine learning models G Shamir US Patent 10,600,000, 2020 | 74 | 2020 |
| Universal lossless compression with unknown alphabets—the average case GI Shamir IEEE Transactions on Information Theory 52 (11), 4915-4944, 2006 | 50 | 2006 |
| Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I. The regular case GI Shamir, DJ Costello IEEE Transactions on Information Theory 46 (7), 2444-2467, 2000 | 49 | 2000 |
| On the MDL principle for iid sources with large alphabets GI Shamir IEEE transactions on information theory 52 (5), 1939-1955, 2006 | 38 | 2006 |
| Providing online content G Shamir, A Prakash, X Bao, K Huang, S Ponnekanti US Patent App. 13/486,900, 2013 | 29 | 2013 |
| Non-systematic low-density parity-check codes for nonuniform sources GI Shamir, JJ Boutros Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005 | 27 | 2005 |
| On the entropy of patterns of iid sequences GI Shamir, L Song PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND …, 2003 | 25 | 2003 |
| On the factory floor: ML engineering for industrial-scale ads recommendation models R Anil, S Gadanho, D Huang, N Jacob, Z Li, D Lin, T Phillips, C Pop, ... arXiv preprint arXiv:2209.05310, 2022 | 23 | 2022 |
| Logistic regression regret: What’s the catch? GI Shamir Conference on Learning Theory, 3296-3319, 2020 | 19 | 2020 |
| Sequence-patterns entropy and infinite alphabets GI Shamir Proceedings of the 42nd Annual Allerton Conference on Communication, Control …, 2004 | 17 | 2004 |
| Anti-distillation: Improving reproducibility of deep networks GI Shamir, L Coviello arXiv preprint arXiv:2010.09923, 2020 | 16 | 2020 |
| Sequential universal lossless techniques for compression of patterns and their description length GI Shamir Data Compression Conference, 2004. Proceedings. DCC 2004, 419-428, 2004 | 16 | 2004 |
| A new redundancy bound for universal lossless compression of unknown alphabets GI Shamir Proceedings of The 38th Annual Conference on Information Sciences and …, 2004 | 16 | 2004 |
| Non-systematic LDPC codes via scrambling and splitting A Alloum, JJ Boutros, GI Shamir, L Wang Proc. Allerton Conference, 28-30, 2005 | 15 | 2005 |
| On the redundancy of universal lossless coding for general piecewise stationary sources GI Shamir, DJ Costello 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060 …, 2000 | 15 | 2000 |
| Precise minimax regret for logistic regression with categorical feature values P Jacquet, G Shamir, W Szpankowski Algorithmic Learning Theory, 755-771, 2021 | 14 | 2021 |
| Smooth activations and reproducibility in deep networks GI Shamir, D Lin, L Coviello arXiv preprint arXiv:2010.09931, 2020 | 14 | 2020 |
| Context decoding of low density parity check codes GI Shamir, L Wang Proceedings of the 2005 Conference on Information Sciences and Systems 62 …, 2005 | 14 | 2005 |
| Reproducibility in optimization: Theoretical framework and limits K Ahn, P Jain, Z Ji, S Kale, P Netrapalli, GI Shamir Advances in Neural Information Processing Systems 35, 18022-18033, 2022 | 13 | 2022 |
