Kyriakos Axiotis

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 29

Top Topics

Search Algorithm

Top Venues

Publications

Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. CoRR (2024)
Taisuke Yasuda, Kyriakos Axiotis, Gang Fu, MohammadHossein Bateni, Vahab Mirrokni
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization. CoRR (2024)
Sami Abu-El-Haija, Joshua V. Dillon, Bahare Fatemi, Kyriakos Axiotis, Neslihan Bulut, Johannes Gasteiger, Bryan Perozzi, MohammadHossein Bateni
SubMix: Learning to Mix Graph Sampling Heuristics. UAI (2023)
Kyriakos Axiotis, Sami Abu-El-Haija, Lin Chen, Matthew Fahrbach, Gang Fu
Greedy PIG: Adaptive Integrated Gradients. CoRR (2023)
Kyriakos Axiotis, Maxim Sviridenko
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. ICML (2023)
Kyriakos Axiotis, Taisuke Yasuda
Regularization for Sparse Convex Optimization. CoRR (2023)
Kyriakos Axiotis, Maxim Sviridenko
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. CoRR (2023)
Kyriakos Axiotis, Aleksander Madry, Adrian Vladu
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. FOCS (2022)
Kyriakos Axiotis, Maxim Sviridenko
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. ICML (2022)
Kyriakos Axiotis, Maxim Sviridenko
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. CoRR (2022)
Kyriakos Axiotis, Aleksander Madry, Adrian Vladu
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. FOCS (2021)
Kyriakos Axiotis, Maxim Sviridenko
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. J. Mach. Learn. Res. 22 (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. ICML (2021)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. SOSA (2021)
Kyriakos Axiotis, Aleksander Madry, Adrian Vladu
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. CoRR (2021)
Kyriakos Axiotis, Maxim Sviridenko
Local Search Algorithms for Rank-Constrained Convex Optimization. ICLR (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. CoRR (2021)
Kyriakos Axiotis, Maxim Sviridenko
Local Search Algorithms for Rank-Constrained Convex Optimization. CoRR (2021)
Kyriakos Axiotis, Maxim Sviridenko
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. ICML (2020)
Kyriakos Axiotis, Aleksander Madry, Adrian Vladu
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. CoRR (2020)
Kyriakos Axiotis, Maxim Sviridenko
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. CoRR (2020)
Kyriakos Axiotis, Aleksander Madry, Adrian Vladu
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. FOCS (2020)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. CoRR (2020)
Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu
Fast Modular Subset Sum using Linear Sketching. SODA (2019)
Kyriakos Axiotis, Christos Tzamos
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. ICALP (2019)
Kyriakos Axiotis, Christos Tzamos
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. CoRR (2018)
Kyriakos Axiotis, Arturs Backurs, Christos Tzamos
Fast Modular Subset Sum using Linear Sketching. CoRR (2018)
Kyriakos Axiotis, Dimitris Fotakis
On the Size and the Approximability of Minimum Temporally Connected Subgraphs. CoRR (2016)
Kyriakos Axiotis, Dimitris Fotakis
On the Size and the Approximability of Minimum Temporally Connected Subgraphs. ICALP (2016)
Ioannis Voyiatzis, Kyriakos Axiotis, Nikolaos S. Papaspyrou, Hera Antonopoulou, Costas Efstathiou
Test Set Embedding into Low-Power BIST Sequences Using Maximum Bipartite Matching. Panhellenic Conference on Informatics (2012)