Ikuti
Manolis Zampetakis
Manolis Zampetakis
Yale University
Email yang diverifikasi di yale.edu - Beranda
Judul
Dikutip oleh
Dikutip oleh
Tahun
The complexity of constrained min-max optimization
C Daskalakis, S Skoulakis, M Zampetakis
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
1792021
Tree of attacks: Jailbreaking black-box llms automatically
A Mehrotra, M Zampetakis, P Kassianik, B Nelson, H Anderson, Y Singer, ...
arXiv preprint arXiv:2312.02119, 2023
1592023
Ten steps of EM suffice for mixtures of two Gaussians
C Daskalakis, C Tzamos, M Zampetakis
Conference on Learning Theory, 2017, 2016
1502016
Efficient statistics, in high dimensions, from truncated samples
C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
682018
Estimation and inference with trees and forests in high dimensions
V Syrgkanis, M Zampetakis
Conference on learning theory, 3453-3454, 2020
472020
A converse to Banach's fixed point theorem and its CLS-completeness
C Daskalakis, C Tzamos, M Zampetakis
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
442018
Computationally and statistically efficient truncated regression
C Daskalakis, T Gouleakis, C Tzamos, M Zampetakis
Conference on learning theory, 955-960, 2019
402019
Deterministic nonsmooth nonconvex optimization
M Jordan, G Kornowski, T Lin, O Shamir, M Zampetakis
The Thirty Sixth Annual Conference on Learning Theory, 4570-4597, 2023
38*2023
PPP-completeness with connections to cryptography
K Sotiraki, M Zampetakis, G Zirdelis
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
372018
Efficient truncated statistics with unknown truncation
V Kontonis, C Tzamos, M Zampetakis
2019 ieee 60th annual symposium on foundations of computer science (focs …, 2019
352019
Consensus-halving: Does it ever get easier?
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
Proceedings of the 21st ACM Conference on Economics and Computation, 381-399, 2020
322020
Optimal learning of mallows block model
R Busa-Fekete, D Fotakis, B Szörényi, M Zampetakis
Conference on learning theory, 529-532, 2019
262019
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
222021
Last-Iterate Convergence of Saddle-Point Optimizers via High-Resolution Differential Equations
T Chavdarova, MI Jordan, M Zampetakis
arXiv preprint arXiv:2112.13826, 2021
212021
More revenue from two samples via factor revealing sdps
C Daskalakis, M Zampetakis
Proceedings of the 21st ACM Conference on Economics and Computation, 257-272, 2020
202020
Constant-expansion suffices for compressed sensing with generative priors
C Daskalakis, D Rohatgi, E Zampetakis
Advances in Neural Information Processing Systems 33, 13917-13926, 2020
202020
Truthfulness flooded domains and the power of verification for mechanism design
D Fotakis, E Zampetakis
ACM Transactions on Economics and Computation (TEAC) 3 (4), 1-29, 2015
202015
A theoretical and practical framework for regression and classification from truncated samples
A Ilyas, E Zampetakis, C Daskalakis
International conference on artificial intelligence and statistics, 4463-4473, 2020
182020
First-order algorithms for nonlinear generalized Nash equilibrium problems
MI Jordan, T Lin, M Zampetakis
Journal of Machine Learning Research 24 (38), 1-46, 2023
172023
On the complexity of modulo-q arguments and the Chevalley-Warning theorem
M Göös, P Kamath, K Sotiraki, M Zampetakis
arXiv preprint arXiv:1912.04467, 2019
162019
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–20