default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGil I. Shamir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c34]Gil I. Shamir, Wojciech Szpankowski:
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. ISIT 2024: 975-980- 2023
- [i16]Le Yan, Zhen Qin, Gil I. Shamir, Dong Lin, Xuanhui Wang, Mike Bendersky:
Learning to Rank when Grades Matter. CoRR abs/2306.08650 (2023) - 2022
- [j13]Michael Drmota, Gil I. Shamir, Wojciech Szpankowski:
Sequential universal modeling for non-binary sequences with constrained distributions. Commun. Inf. Syst. 22(1): 1-38 (2022) - [j12]Mohsen Heidari
, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization. IEEE Trans. Inf. Theory 68(9): 6063-6077 (2022) - [c33]Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski:
Precise Minimax Regret for Logistic Regression. ISIT 2022: 444-449 - [c32]Kwangjun Ahn, Prateek Jain, Ziwei Ji, Satyen Kale, Praneeth Netrapalli, Gil I. Shamir:
Reproducibility in Optimization: Theoretical Framework and Limits. NeurIPS 2022 - [c31]Rohan Anil, Sandra Gadanho, Da Huang, Nijith Jacob, Zhuoshu Li, Dong Lin, Todd Phillips, Cristina Pop, Kevin Regan, Gil I. Shamir, Rakesh Shivanna, Qiqi Yan:
On the Factory Floor: ML Engineering for Industrial-Scale Ads Recommendation Models. ORSUM@RecSys 2022 - [i15]Kwangjun Ahn, Prateek Jain, Ziwei Ji, Satyen Kale, Praneeth Netrapalli, Gil I. Shamir:
Reproducibility in Optimization: Theoretical Framework and Limits. CoRR abs/2202.04598 (2022) - [i14]Gil I. Shamir, Dong Lin:
Real World Large Scale Recommendation Systems Reproducibility and Smooth Activations. CoRR abs/2202.06499 (2022) - [i13]Rohan Anil, Sandra Gadanho, Da Huang, Nijith Jacob, Zhuoshu Li, Dong Lin, Todd Phillips, Cristina Pop, Kevin Regan, Gil I. Shamir, Rakesh Shivanna, Qiqi Yan:
On the Factory Floor: ML Engineering for Industrial-Scale Ads Recommendation Models. CoRR abs/2209.05310 (2022) - 2021
- [c30]Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski:
Precise Minimax Regret for Logistic Regression with Categorical Feature Values. ALT 2021: 755-771 - [c29]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Finding Relevant Information via a Discrete Fourier Expansion. ICML 2021: 4181-4191 - [c28]Gil I. Shamir, Wojciech Szpankowski:
A Lower Bound for Regret in Logistic Regression. ISIT 2021: 2507-2512 - [c27]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Information Sufficiency via Fourier Expansion. ISIT 2021: 2774-2779 - [i12]Gil I. Shamir, Wojciech Szpankowski:
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. CoRR abs/2101.12113 (2021) - [i11]Robert R. Snapp, Gil I. Shamir:
Synthesizing Irreproducibility in Deep Networks. CoRR abs/2102.10696 (2021) - [i10]Haichao Yu, Zhe Chen, Dong Lin, Gil I. Shamir, Jie Han:
Dropout Prediction Variation Estimation Using Neuron Activation Strength. CoRR abs/2110.06435 (2021) - 2020
- [c26]Gil I. Shamir:
Logistic Regression Regret: What's the Catch? COLT 2020: 3296-3319 - [i9]Gil I. Shamir:
Logistic Regression Regret: What's the Catch? CoRR abs/2002.02950 (2020) - [i8]Michael Drmota, Gil I. Shamir, Wojciech Szpankowski:
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions. CoRR abs/2005.10320 (2020) - [i7]Gil I. Shamir, Lorenzo Coviello:
Anti-Distillation: Improving reproducibility of deep networks. CoRR abs/2010.09923 (2020) - [i6]Gil I. Shamir, Dong Lin, Lorenzo Coviello:
Smooth activations and reproducibility in deep networks. CoRR abs/2010.09931 (2020)
2010 – 2019
- 2018
- [c25]Joseph J. Boutros, Uri Erez, Johannes Van Wonterghem, Gil I. Shamir, Gilles Zémor:
Geometric shaping: low-density coding of Gaussian-like constellations. ITW 2018: 1-5 - 2015
- [c24]Gil I. Shamir:
Minimum description length (MDL) regularization for online learning. FE@NIPS 2015: 260-276 - 2013
- [j11]Gil I. Shamir:
Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions. IEEE Trans. Inf. Theory 59(11): 7194-7211 (2013)
2000 – 2009
- 2009
- [j10]Gil I. Shamir, Kai Xie:
Universal source controlled channel decoding with nonsystematic quick-look-in turbo codes. IEEE Trans. Commun. 57(4): 960-971 (2009) - 2008
- [j9]Gil I. Shamir:
Entropy of Patterns of i.i.d. Sequences - Part I: General Bounds. IEEE Trans. Inf. Theory 54(5): 2263-2277 (2008) - [c23]Gil I. Shamir, Tjalling J. Tjalkens, Frans M. J. Willems:
Low-complexity sequential probability estimation and universal compression for binary sequences with constrained distributions. ISIT 2008: 995-999 - [c22]Bertrand Ndzana Ndzana, Andrew W. Eckford, Amin Shokrollahi, Gil I. Shamir:
Fountain codes for piecewise stationary channels. ISIT 2008: 2242-2246 - 2007
- [j8]Li Wang, Gil I. Shamir:
Universal Context Based Decoding with Low-Density Parity-Check Codes. IEEE Commun. Lett. 11(9): 741-743 (2007) - [c21]Li Wang, Gil I. Shamir, Joseph Boutros:
Universal Context Based Decoding with Non-systematic Low-Density Parity-Check Codes. CISS 2007: 469-473 - [c20]Gilberto Titericz Jr., Richard Demo Souza, Javier Garcia-Frías, Gil I. Shamir:
Comparing Different Transmission Strategies Using Turbo Codes for Nonuniform Memoryless Sources. ICC 2007: 2722-2727 - [c19]Gil I. Shamir:
Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions. ISIT 2007: 1956-1960 - [i5]Gil I. Shamir:
Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions. CoRR abs/0704.0838 (2007) - [i4]Gil I. Shamir:
Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for Some Distributions. CoRR abs/0711.2102 (2007) - 2006
- [j7]Gil I. Shamir:
On the MDL principle for i.i.d. sources with large alphabets. IEEE Trans. Inf. Theory 52(5): 1939-1955 (2006) - [j6]Gil I. Shamir:
Universal Lossless Compression With Unknown Alphabets - The Average Case. IEEE Trans. Inf. Theory 52(11): 4915-4944 (2006) - [c18]Gil I. Shamir, Li Wang, Joseph Boutros:
Context Based Decoding of Split-LDPC Codes. GLOBECOM 2006 - [c17]Kai Xie, Li Wang, Gil I. Shamir, Joseph J. Boutros:
EXIT Chart Analysis for Split-LDPC Codes. ISIT 2006: 567-571 - [c16]Wufei Zhang, Daniel J. Costello Jr., Thomas E. Fuja, Gil I. Shamir, Andrew W. Eckford:
Iterative Estimation and Decoding for Gaussian Channels with Abruptly Changing Statistics. ISIT 2006: 2466-2470 - [c15]Gil I. Shamir:
On Some Distributions and Their Pattern Entropies. ISIT 2006: 2541-2545 - [i3]Gil I. Shamir:
Universal Lossless Compression with Unknown Alphabets - The Average Case. CoRR abs/cs/0603068 (2006) - [i2]Gil I. Shamir:
Patterns of i.i.d. Sequences and Their Entropy - Part I: General Bounds. CoRR abs/cs/0605046 (2006) - 2005
- [j5]Gil I. Shamir, Kai Xie:
Universal lossless source controlled channel decoding for i.i.d. sequences. IEEE Commun. Lett. 9(5): 450-452 (2005) - [c14]Li Wang, Gil I. Shamir:
BWT Based Universal Lossless Source Controlled Channel Decoding with Low Density Parity Check Codes. DCC 2005: 487 - [c13]Kai Xie, Gil I. Shamir:
Decoding of Non-Systematic Turbo Codes for Stationary Memoryless and Piecewise Stationary Memoryless Sequences. DCC 2005: 490 - [c12]En-Hui Yang, Lihua Song, Gil I. Shamir, John C. Kieffer:
On the pointwise redundancy of the LZ78 algorithm. ISIT 2005: 495-499 - [c11]Kai Xie, Gil I. Shamir:
Context and denoising based decoding of non-systematic turbo codes for redundant data. ISIT 2005: 1280-1284 - [c10]Richard Demo Souza, Gil I. Shamir, Javier Garcia-Frías, Kai Xie:
Non-systematic turbo coding with unequal energy allocation for nonuniform memoryless sources. ISIT 2005: 1893-1897 - [c9]Gil I. Shamir, Joseph J. Boutros:
Non-systematic low-density parity-check codes for nonuniform sources. ISIT 2005: 1898-1902 - [c8]Gil I. Shamir, Kai Xie:
Design of non-systematic turbo codes for universal source controlled channel decoding. ITW 2005: 197-201 - [c7]Gil I. Shamir:
Bounds on the entropy of patterns of I.I.D. sequences. ITW 2005: 202-206 - [c6]Wufei Zhang, Christian Koller, Andrew W. Eckford, Daniel J. Costello Jr., Thomas E. Fuja, Gil I. Shamir:
Estimation and decoding strategies for channels with abruptly changing statistics. ITW 2005: 277- - [i1]Gil I. Shamir:
Bounds on the Entropy of Patterns of I.I.D. Sequences. CoRR abs/cs/0504049 (2005) - 2004
- [j4]Gil I. Shamir, Daniel J. Costello Jr.:
Universal Lossless Coding for Sources With Repeating Statistics. IEEE Trans. Inf. Theory 50(8): 1620-1635 (2004) - [c5]Gil I. Shamir:
Sequential Universal Lossless Techniques for Compression of Patterns and Their Description Length. Data Compression Conference 2004: 419-428 - [c4]Gil I. Shamir:
Average case universal lossless compression with unknown alphabets. ISIT 2004: 27 - [c3]Kai Xie, Gil I. Shamir:
Universal lossless source controlled channel decoding. ISIT 2004: 163 - 2003
- [c2]Gil I. Shamir:
On strongly sequential compression of sources with abrupt changes in statistics. ICC 2003: 2924-2927 - 2001
- [j3]Gil I. Shamir, Daniel J. Costello Jr.:
On the redundancy of universal lossless coding for general piecewise stationary sources. Commun. Inf. Syst. 1(3): 305-332 (2001) - [c1]Gil I. Shamir, Daniel J. Costello Jr.:
Universal Lossless Compression of Piecewise Stationary Slowly Varying Sources. Data Compression Conference 2001: 371-380 - 2000
- [j2]Gil I. Shamir, Daniel J. Costello Jr.:
Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case. IEEE Trans. Inf. Theory 46(7): 2444-2467 (2000)
1990 – 1999
- 1999
- [j1]Gil I. Shamir, Neri Merhav:
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources. IEEE Trans. Inf. Theory 45(5): 1498-1519 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
