_id,doi,title
12015,10.1109/ISIT50566.2022.9834443,Lower bounds for multiple packing
12016,10.1109/ISIT50566.2022.9834712,Polar coded computing: The role of the scaling exponent
12017,10.1109/ISIT50566.2022.9834632,New results on AVCs with omniscient and myopic adversaries
12018,10.1109/ISIT50566.2022.9834815,Lower bounds on list decoding capacity using error exponents
12019,10.1109/ISIT50566.2022.9834829,List-decodable zero-rate codes for the Z-channel
12233,10.1109/tcomm.2022.3211101,Decoding Reed-Muller codes with successive codeword permutations
12273,10.1109/tit.2022.3167554,Quadratically constrained myopic adversarial channels
12480,10.1088/1742-5468/ac9828,Approximate message passing with spectral initialization for generalized linear models
12536,10.48550/arXiv.2205.10009,The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation?
12537,,Memorization and optimization in deep neural networks with minimum over-parameterization
12538,10.1109/ITW54588.2022.9965870,Sharp asymptotics on the compression of two-layer neural networks
12540,,Estimation in rotationally invariant generalized linear models via approximate message passing
12860,10.48550/arXiv.2203.16701,Towards differential relational privacy and its use in question answering
13146,,Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks
9002,10.1109/TIT.2020.3038806,Binary linear codes with optimal scaling: Polar codes with large kernels
9047,10.1109/TWC.2020.3022922,Sublinear latency for simplified successive cancellation decoding of polar codes
10053,10.1109/ISIT45174.2021.9518153,Parallelism versus latency in simplified successive-cancellation decoding of polar codes
10211,10.1007/s10208-021-09531-x,Optimal combination of linear and spectral estimators for generalized linear models
10593,,PCA initialization for approximate message passing in rotationally invariant models
10594,,When are solutions connected in deep networks?