DOI,IST REx ID,Research Group,Title of publication
null,17086,MaMo,Mean estimation in high-dimensional binary Markov Gaussian mixture models
10.1007/s10208-021-09531-x,10211,MaMo,Optimal combination of linear and spectral estimators for generalized linear models
null,12536,MaMo,The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation?
10.1109/ISIT50566.2022.9834632,12017,MaMo,New results on AVCs with omniscient and myopic adversaries
10.1109/ISIT50566.2022.9834815,12018,MaMo,Lower bounds on list decoding capacity using error exponents
10.1109/ISIT50566.2022.9834829,12019,MaMo,List-decodable zero-rate codes for the Z-channel
10.1109/tit.2022.3167554,12273,MaMo,Quadratically constrained myopic adversarial channels
10.1109/tcomm.2022.3211101,12233,MaMo,Decoding Reed-Muller codes with successive codeword permutations
10.1109/TWC.2021.3125626,10364,MaMo,Parallelism versus latency in simplified successive-cancellation decoding of polar codes
null,12537,MaMo,Memorization and optimization in deep neural networks with minimum over-parameterization
null,11420,"MaMo,DaAl",Mean-field analysis of piecewise linear solutions for wide ReLU networks
null,13146,MaMo,Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks
10.1109/JSAIT.2021.3126474,15254,MaMo,Network coding with myopic adversaries
null,10593,MaMo,PCA initialization for approximate message passing in rotationally invariant models
null,10594,MaMo,When are solutions connected in deep networks?
null,10595,MaMo,Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks
null,10598,MaMo,Approximate message passing with spectral initialization for generalized linear models
10.1109/TIT.2020.3038806,9002,MaMo,Binary linear codes with optimal scaling: Polar codes with large kernels
10.1109/IEEECONF53345.2021.9723394,10599,MaMo,Successive syndrome-check decoding of polar codes
10.1109/isit45174.2021.9517887,10597,MaMo,Sparse multi-decoder recursive projection aggregation for Reed-Muller codes