Kyriakos Axiotis

According to our database1, Kyriakos Axiotis authored at least 18 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization.
CoRR, 2024

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.
CoRR, 2024

2023
Greedy PIG: Adaptive Integrated Gradients.
CoRR, 2023

Performance of 𝓁<sub>1</sub> Regularization for Sparse Convex Optimization.
CoRR, 2023

SubMix: Learning to Mix Graph Sampling Heuristics.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Gradient Descent Converges Linearly for Logistic Regression on Separable Data.
Proceedings of the International Conference on Machine Learning, 2023

2022
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime.
Proceedings of the International Conference on Machine Learning, 2022

2021
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding.
J. Mach. Learn. Res., 2021

Fast and Simple Modular Subset Sum.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Decomposable Submodular Function Minimization via Maximum Flow.
Proceedings of the 38th International Conference on Machine Learning, 2021

Local Search Algorithms for Rank-Constrained Convex Optimization.
Proceedings of the 9th International Conference on Learning Representations, 2021

Faster Sparse Minimum Cost Flow by Electrical Flow Localization.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Fast Modular Subset Sum using Linear Sketching.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Fast Modular Subset Sum using Linear Sketching.
CoRR, 2018

2016
On the Size and the Approximability of Minimum Temporally Connected Subgraphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2012
Test Set Embedding into Low-Power BIST Sequences Using Maximum Bipartite Matching.
Proceedings of the 16th Panhellenic Conference on Informatics, PCI 2012, 2012


  Loading...