default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyriakos Axiotis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]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. ICML 2024- [i15]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 abs/2402.17327 (2024) - [i14]Taisuke Yasuda, Kyriakos Axiotis, Gang Fu, MohammadHossein Bateni, Vahab Mirrokni:
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization. CoRR abs/2402.17902 (2024) - 2023
- [c13]Kyriakos Axiotis, Maxim Sviridenko:
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. ICML 2023: 1302-1319 - [c12]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: 1-10 - [i13]Kyriakos Axiotis, Maxim Sviridenko:
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. CoRR abs/2306.14381 (2023) - [i12]Kyriakos Axiotis, Taisuke Yasuda:
Performance of 𝓁1 Regularization for Sparse Convex Optimization. CoRR abs/2307.07405 (2023) - [i11]Kyriakos Axiotis, Sami Abu-El-Haija, Lin Chen, Matthew Fahrbach, Gang Fu:
Greedy PIG: Adaptive Integrated Gradients. CoRR abs/2311.06192 (2023) - 2022
- [b1]Kyriakos Axiotis:
Flows, Submodularity, Sparsity, and Beyond: Continuous Optimization Insights for Discrete Problems. MIT, USA, 2022 - [c11]Kyriakos Axiotis, Maxim Sviridenko:
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. ICML 2022: 1175-1197 - [i10]Kyriakos Axiotis, Maxim Sviridenko:
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. CoRR abs/2204.08274 (2022) - 2021
- [j1]Kyriakos Axiotis, Maxim Sviridenko:
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. J. Mach. Learn. Res. 22: 122:1-122:47 (2021) - [c10]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. FOCS 2021: 528-539 - [c9]Kyriakos Axiotis, Maxim Sviridenko:
Local Search Algorithms for Rank-Constrained Convex Optimization. ICLR 2021 - [c8]Kyriakos Axiotis, Adam Karczmarz
, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. ICML 2021: 446-456 - [c7]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. SOSA 2021: 57-67 - [i9]Kyriakos Axiotis, Maxim Sviridenko:
Local Search Algorithms for Rank-Constrained Convex Optimization. CoRR abs/2101.06262 (2021) - [i8]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. CoRR abs/2103.03868 (2021) - [i7]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. CoRR abs/2111.10368 (2021) - 2020
- [c6]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. FOCS 2020: 93-104 - [c5]Kyriakos Axiotis, Maxim Sviridenko:
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. ICML 2020: 452-462 - [i6]Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. CoRR abs/2003.04863 (2020) - [i5]Kyriakos Axiotis, Maxim Sviridenko:
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. CoRR abs/2006.14571 (2020) - [i4]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020)
2010 – 2019
- 2019
- [c4]Kyriakos Axiotis, Christos Tzamos:
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. ICALP 2019: 19:1-19:13 - [c3]Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu:
Fast Modular Subset Sum using Linear Sketching. SODA 2019: 58-69 - 2018
- [i3]Kyriakos Axiotis, Christos Tzamos:
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms. CoRR abs/1802.06440 (2018) - [i2]Kyriakos Axiotis, Arturs Backurs, Christos Tzamos:
Fast Modular Subset Sum using Linear Sketching. CoRR abs/1807.04825 (2018) - 2016
- [c2]Kyriakos Axiotis, Dimitris Fotakis:
On the Size and the Approximability of Minimum Temporally Connected Subgraphs. ICALP 2016: 149:1-149:14 - [i1]Kyriakos Axiotis, Dimitris Fotakis:
On the Size and the Approximability of Minimum Temporally Connected Subgraphs. CoRR abs/1602.06411 (2016) - 2012
- [c1]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: 74-79
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
