| 2025 | ICML | DeepCrossAttention: Supercharging Transformer Residual Connections. | Mike Heddes, Adel Javanmard, Kyriakos Axiotis, Gang Fu, MohammadHossein Bateni, Vahab Mirrokni |
| 2024 | ICML | Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. | Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder |
| 2023 | ICML | Gradient Descent Converges Linearly for Logistic Regression on Separable Data. | Kyriakos Axiotis, Maxim Sviridenko |
| 2023 | UAI | SubMix: Learning to Mix Graph Sampling Heuristics. | Sami Abu-El-Haija, Joshua V. Dillon, Bahare Fatemi, Kyriakos Axiotis, Neslihan Bulut, Johannes Gasteiger, Bryan Perozzi, MohammadHossein Bateni |
| 2022 | ICML | Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. | Kyriakos Axiotis, Maxim Sviridenko |
| 2021 | FOCS | Faster Sparse Minimum Cost Flow by Electrical Flow Localization. | Kyriakos Axiotis, Aleksander Madry, Adrian Vladu |
| 2021 | ICLR | Local Search Algorithms for Rank-Constrained Convex Optimization. | Kyriakos Axiotis, Maxim Sviridenko |
| 2021 | ICML | Decomposable Submodular Function Minimization via Maximum Flow. | Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu |
| 2020 | FOCS | Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. | Kyriakos Axiotis, Aleksander Madry, Adrian Vladu |
| 2020 | ICML | Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. | Kyriakos Axiotis, Maxim Sviridenko |
| 2019 | ICALP | Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. | Kyriakos Axiotis, Christos Tzamos |
| 2019 | SODA | Fast Modular Subset Sum using Linear Sketching. | Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu |
| 2016 | ICALP | On the Size and the Approximability of Minimum Temporally Connected Subgraphs. | Kyriakos Axiotis, Dimitris Fotakis |