Ilias Zadik - RankMe

71 papers A* 19B 4Misc 1Journal 45Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Stable Algorithms Lower Bounds for Estimation. CoRR Xifan Yu, Ilias Zadik
2026	J	`jnl`	The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds. CoRR Konstantinos Tsirkas, Leda Wang, Ilias Zadik
2025	J	`jnl`	A Bayesian Proof of the Spread Lemma. Random Struct. Algorithms Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik
2025	J	`jnl`	Almost-Linear Planted Cliques Elude the Metropolis Process. Random Struct. Algorithms Zongchen Chen, Elchanan Mossel, Ilias Zadik
2025	J	`jnl`	Almost-Optimal Local-Search Methods for Sparse Tensor PCA. CoRR Maxwell Lovig, Conor Sheehan, Konstantinos Tsirkas, Ilias Zadik
2025	J	`jnl`	An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds. CoRR Siyu Chen, Theodor Misiakiewicz, Ilias Zadik, Peiyuan Zhang
2025	B	`conf`	On the Hardness of Learning One Hidden Layer Neural Networks. ALT Shuchen Li, Ilias Zadik, Manolis Zampetakis
2025	J	`jnl`	Stationary Points of a Shallow Neural Network with Quadratic Activations and the Global Optimality of the Gradient Descent Algorithm. Math. Oper. Res. David Gamarnik, Eren C. Kizildag, Ilias Zadik
2025	A*	`conf`	The Fundamental Limits of Recovering Planted Subgraphs (extended abstract). COLT Daniel Lee, Francisco Pernice, Amit Rajaraman, Ilias Zadik
2025	J	`jnl`	The Fundamental Limits of Recovering Planted Subgraphs. CoRR Daniel Lee, Francisco Pernice, Amit Rajaraman, Ilias Zadik
2024	J	`jnl`	Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph. CoRR Xifan Yu, Ilias Zadik, Peiyuan Zhang
2024	A*	`conf`	Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph: Extended Abstract. COLT Xifan Yu, Ilias Zadik, Peiyuan Zhang
2024	—	`conf`	Low-Degree Security of the Planted Random Subgraph Problem. TCC (2) Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik
2024	J	`jnl`	Low-degree Security of the Planted Random Subgraph Problem. CoRR Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik
2024	J	`jnl`	Low-degree Security of the Planted Random Subgraph Problem. IACR Cryptol. ePrint Arch. Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik
2024	J	`jnl`	On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem. CoRR Maxwell Lovig, Ilias Zadik
2024	J	`jnl`	On the Hardness of Learning One Hidden Layer Neural Networks. CoRR Shuchen Li, Ilias Zadik, Manolis Zampetakis
2024	J	`jnl`	On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule. CoRR Zongchen Chen, Conor Sheehan, Ilias Zadik
2024	J	`jnl`	Shapes and recession cones in mixed-integer convex representability. Math. Program. Ilias Zadik, Miles Lubin, Juan Pablo Vielma
2024	J	`jnl`	Transfer Learning Beyond Bounded Density Ratios. CoRR Alkis Kalavasis, Ilias Zadik, Manolis Zampetakis
2023	A*	`conf`	Almost-Linear Planted Cliques Elude the Metropolis Process. SODA Zongchen Chen, Elchanan Mossel, Ilias Zadik
2023	J	`jnl`	It Was "All" for "Nothing": Sharp Phase Transitions for Noiseless Discrete Channels. IEEE Trans. Inf. Theory Jonathan Niles-Weed, Ilias Zadik
2023	J	`jnl`	Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique. CoRR David Gamarnik, Elchanan Mossel, Ilias Zadik
2023	A*	`conf`	Sharp thresholds in inference of planted subgraphs. COLT Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik
2023	J	`jnl`	Sharp thresholds in inference of planted subgraphs. CoRR Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik
2022	J	`jnl`	A second moment proof of the spread lemma. CoRR Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik
2022	J	`jnl`	Almost-Linear Planted Cliques Elude the Metropolis Process. CoRR Zongchen Chen, Elchanan Mossel, Ilias Zadik
2022	A*	`conf`	Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions. NeurIPS Omri Ben-Eliezer, Dan Mikulincer, Ilias Zadik
2022	J	`jnl`	Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions. CoRR Omri Ben-Eliezer, Dan Mikulincer, Ilias Zadik
2022	A*	`conf`	Lattice-Based Methods Surpass Sum-of-Squares in Clustering. COLT Ilias Zadik, Min Jae Song, Alexander S. Wein, Joan Bruna
2022	J	`jnl`	Mixed-Integer Convex Representability. Math. Oper. Res. Miles Lubin, Juan Pablo Vielma, Ilias Zadik
2022	J	`jnl`	On the Second Kahn-Kalai Conjecture. CoRR Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik
2022	J	`jnl`	Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks. IEEE Trans. Signal Process. David Gamarnik, Eren C. Kizildag, Ilias Zadik
2022	A*	`conf`	Statistical and Computational Phase Transitions in Group Testing. COLT Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik
2022	J	`jnl`	Statistical and Computational Phase Transitions in Group Testing. CoRR Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik
2022	A*	`conf`	The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. NeurIPS Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
2022	J	`jnl`	The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. CoRR Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
2021	A*	`conf`	Group testing and local search: is there a computational-statistical gap? COLT Fotis Iliopoulos, Ilias Zadik
2021	J	`jnl`	Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection. IEEE Trans. Inf. Theory David Gamarnik, Eren C. Kizildag, Ilias Zadik
2021	A*	`conf`	It was "all" for "nothing": sharp phase transitions for noiseless discrete channels. COLT Jonathan Niles-Weed, Ilias Zadik
2021	J	`jnl`	It was "all" for "nothing": sharp phase transitions for noiseless discrete channels. CoRR Jonathan Niles-Weed, Ilias Zadik
2021	J	`jnl`	Lattice-Based Methods Surpass Sum-of-Squares in Clustering. CoRR Ilias Zadik, Min Jae Song, Alexander S. Wein, Joan Bruna
2021	A*	`conf`	On the Cryptographic Hardness of Learning Single Periodic Neurons. NeurIPS Min Jae Song, Ilias Zadik, Joan Bruna
2021	J	`jnl`	On the Cryptographic Hardness of Learning Single Periodic Neurons. CoRR Min Jae Song, Ilias Zadik, Joan Bruna
2021	J	`jnl`	Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks. CoRR David Gamarnik, Eren C. Kizildag, Ilias Zadik
2021	B	`conf`	Self-Regularity of Output Weights for Overparameterized Two-Layer Neural Networks. ISIT David Gamarnik, Eren C. Kizildag, Ilias Zadik
2020	A*	`conf`	Free Energy Wells and Overlap Gap Property in Sparse PCA. COLT Gérard Ben Arous, Alexander S. Wein, Ilias Zadik
2020	J	`jnl`	Free Energy Wells and Overlap Gap Property in Sparse PCA. CoRR Gérard Ben Arous, Alexander S. Wein, Ilias Zadik
2020	J	`jnl`	Group testing and local search: is there a computational-statistical gap? CoRR Fotis Iliopoulos, Ilias Zadik
2020	J	`jnl`	Neural Networks and Polynomial Regression. Demystifying the Overparametrization Phenomena. CoRR Matt Emschwiller, David Gamarnik, Eren C. Kizildag, Ilias Zadik
2020	A*	`conf`	Optimal Private Median Estimation under Minimal Distributional Assumptions. NeurIPS Christos Tzamos, Emmanouil V. Vlatakis-Gkaragkounis, Ilias Zadik
2020	J	`jnl`	Optimal Private Median Estimation under Minimal Distributional Assumptions. CoRR Christos Tzamos, Emmanouil V. Vlatakis-Gkaragkounis, Ilias Zadik
2020	A*	`conf`	The All-or-Nothing Phenomenon in Sparse Tensor PCA. NeurIPS Jonathan Niles-Weed, Ilias Zadik
2020	J	`jnl`	The All-or-Nothing Phenomenon in Sparse Tensor PCA. CoRR Jonathan Niles-Weed, Ilias Zadik
2019	Misc	`conf`	A Simple Bound on the BER of the Map Decoder for Massive MIMO Systems. ICASSP Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy
2019	J	`jnl`	A simple bound on the BER of the MAP decoder for massive MIMO systems. CoRR Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy
2019	—	`conf`	All-or-Nothing Phenomena: From Single-Letter to High Dimensions. CAMSAP Galen Reeves, Jiaming Xu, Ilias Zadik
2019	J	`jnl`	All-or-Nothing Phenomena: From Single-Letter to High Dimensions. CoRR Galen Reeves, Jiaming Xu, Ilias Zadik
2019	B	`conf`	Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities. ISIT Ilias Zadik, Yury Polyanskiy, Christos Thrampoulidis
2019	J	`jnl`	Stationary Points of Shallow Neural Networks with Quadratic Activation Function. CoRR David Gamarnik, Eren C. Kizildag, Ilias Zadik
2019	A*	`conf`	The All-or-Nothing Phenomenon in Sparse Linear Regression. COLT Galen Reeves, Jiaming Xu, Ilias Zadik
2019	J	`jnl`	The All-or-Nothing Phenomenon in Sparse Linear Regression. CoRR Galen Reeves, Jiaming Xu, Ilias Zadik
2019	J	`jnl`	The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property. CoRR David Gamarnik, Ilias Zadik
2018	A*	`conf`	High Dimensional Linear Regression using Lattice Basis Reduction. NeurIPS Ilias Zadik, David Gamarnik
2018	A*	`conf`	Orthogonal Machine Learning: Power and Limitations. ICML Ilias Zadik, Lester W. Mackey, Vasilis Syrgkanis
2018	J	`jnl`	Private Algorithms Can Always Be Extended. CoRR Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik
2018	A*	`conf`	Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. FOCS Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik
2018	J	`jnl`	Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. CoRR Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik
2017	A*	`conf`	High Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transtition. COLT David Gamarnik, Ilias Zadik
2017	B	`conf`	Mixed-Integer Convex Representability. IPCO Miles Lubin, Ilias Zadik, Juan Pablo Vielma
2017	J	`jnl`	Orthogonal Machine Learning: Power and Limitations. CoRR Lester W. Mackey, Vasilis Syrgkanis, Ilias Zadik