default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlkis Kalavasis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
On Sampling from Ising Models with Spectral Constraints. APPROX/RANDOM 2024: 70:1-70:14- [c18]Idan Attias, Steve Hanneke, Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas:
Universal Rates for Regression: Separations between Cut-Off and Absolute Loss. COLT 2024: 359-405 - [c17]Alkis Kalavasis, Anay Mehrotra, Manolis Zampetakis:
Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening (Extended Abstract). COLT 2024: 2767 - [c16]Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. ICML 2024 - [c15]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS 2024: 5:1-5:24 - [c14]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
Learning Hard-Constrained Models with One Sample. SODA 2024: 3184-3196 - [i19]Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. CoRR abs/2402.13857 (2024) - [i18]Alkis Kalavasis, Ilias Zadik, Manolis Zampetakis:
Transfer Learning Beyond Bounded Density Ratios. CoRR abs/2403.11963 (2024) - [i17]Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas, Felix Zhou:
On the Computational Landscape of Replicable Learning. CoRR abs/2405.15599 (2024) - [i16]Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou, Katerina Sotiraki, Grigoris Velegkas, Manolis Zampetakis:
Injecting Undetectable Backdoors in Deep Learning and Language Models. CoRR abs/2406.05660 (2024) - [i15]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
On Sampling from Ising Models with Spectral Constraints. CoRR abs/2407.07645 (2024) - 2023
- [c13]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Replicable Bandits. ICLR 2023 - [c12]Alkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Statistical Indistinguishability of Learning Algorithms. ICML 2023: 15586-15622 - [c11]Idan Attias, Steve Hanneke, Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas:
Optimal Learners for Realizable Regression: PAC Learning and Online Learning. NeurIPS 2023 - [c10]Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method. NeurIPS 2023 - [i14]Alkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Statistical Indistinguishability of Learning Algorithms. CoRR abs/2305.14311 (2023) - [i13]Idan Attias, Steve Hanneke, Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas:
Optimal Learners for Realizable Regression: PAC Learning and Online Learning. CoRR abs/2307.03848 (2023) - [i12]Constantine Caramanis, Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods. CoRR abs/2310.05309 (2023) - [i11]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
Learning Hard-Constrained Models with One Sample. CoRR abs/2311.03332 (2023) - [i10]Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis:
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR abs/2311.14869 (2023) - 2022
- [j1]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. Algorithmica 84(8): 2186-2221 (2022) - [c9]Jason Milionis, Alkis Kalavasis, Dimitris A. Fotakis, Stratis Ioannidis:
Differentially Private Regression with Unbounded Covariates. AISTATS 2022: 3242-3273 - [c8]Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki:
Label Ranking through Nonparametric Regression. ICML 2022: 6622-6659 - [c7]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Linear Label Ranking with Bounded Noise. NeurIPS 2022 - [c6]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Perfect Sampling from Pairwise Comparisons. NeurIPS 2022 - [c5]Alkis Kalavasis, Konstantinos Stavropoulos, Emmanouil Zampetakis:
Learning and Covering Sums of Independent Random Variables with Unbounded Support. NeurIPS 2022 - [c4]Alkis Kalavasis, Grigoris Velegkas, Amin Karbasi:
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes. NeurIPS 2022 - [i9]Jason Milionis, Alkis Kalavasis, Dimitris Fotakis, Stratis Ioannidis:
Differentially Private Regression with Unbounded Covariates. CoRR abs/2202.11199 (2022) - [i8]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Reproducible Bandits. CoRR abs/2210.01898 (2022) - [i7]Alkis Kalavasis, Grigoris Velegkas, Amin Karbasi:
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes. CoRR abs/2210.02297 (2022) - [i6]Alkis Kalavasis, Konstantinos Stavropoulos, Manolis Zampetakis:
Learning and Covering Sums of Independent Random Variables with Unbounded Support. CoRR abs/2210.13313 (2022) - [i5]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Perfect Sampling from Pairwise Comparisons. CoRR abs/2211.12868 (2022) - 2021
- [c3]Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos:
Aggregating Incomplete and Noisy Rankings. AISTATS 2021: 2278-2286 - [c2]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Efficient Algorithms for Learning from Coarse Labels. COLT 2021: 2060-2079 - [i4]Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos:
Efficient Algorithms for Learning from Coarse Labels. CoRR abs/2108.09805 (2021) - [i3]Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki:
Label Ranking through Nonparametric Regression. CoRR abs/2111.02749 (2021) - 2020
- [c1]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. COLT 2020: 1586-1600 - [i2]Dimitris Fotakis, Alkis Kalavasis, Christos Tzamos:
Efficient Parameter Estimation of Truncated Boolean Product Distributions. CoRR abs/2007.02392 (2020) - [i1]Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos:
Aggregating Incomplete and Noisy Rankings. CoRR abs/2011.00810 (2020)
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-18 00:09 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:
