Obserwuj
Alkis Kalavasis
Tytuł
Cytowane przez
Cytowane przez
Rok
Efficient parameter estimation of truncated boolean product distributions
D Fotakis, A Kalavasis, C Tzamos
Conference on learning theory, 1586-1600, 2020
162020
Statistical indistinguishability of learning algorithms
A Kalavasis, A Karbasi, S Moran, G Velegkas
International Conference on Machine Learning 40, 2023
142023
Efficient algorithms for learning from coarse labels
D Fotakis, A Kalavasis, V Kontonis, C Tzamos
Conference on Learning Theory, 2060-2079, 2021
132021
Replicable bandits
H Esfandiari, A Kalavasis, A Karbasi, A Krause, V Mirrokni, G Velegkas
arXiv preprint arXiv:2210.01898, 2022
112022
Differentially private regression with unbounded covariates
J Milionis, A Kalavasis, D Fotakis, S Ioannidis
International Conference on Artificial Intelligence and Statistics, 3242-3273, 2022
112022
Aggregating incomplete and noisy rankings
D Fotakis, A Kalavasis, K Stavropoulos
International conference on artificial intelligence and statistics, 2278-2286, 2021
82021
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes
A Kalavasis, G Velegkas, A Karbasi
Advances in Neural Information Processing Systems 35, 2022
72022
Label ranking through nonparametric regression
D Fotakis, A Kalavasis, E Psaroudaki
International Conference on Machine Learning, 6622-6659, 2022
62022
Optimal Learners for Realizable Regression: PAC Learning and Online Learning
I Attias, S Hanneke, A Kalavasis, A Karbasi, G Velegkas
Advances in Neural Information Processing Systems 36, 2023
52023
Perfect Sampling from Pairwise Comparisons
D Fotakis, A Kalavasis, C Tzamos
Advances in Neural Information Processing Systems 35, 2022
32022
Linear Label Ranking with Bounded Noise
D Fotakis, A Kalavasis, V Kontonis, C Tzamos
Advances in Neural Information Processing Systems 35, 15642-15656, 2022
22022
Learning and Covering Sums of Independent Random Variables with Unbounded Support
A Kalavasis, K Stavropoulos, E Zampetakis
Advances in Neural Information Processing Systems 35, 25185-25197, 2022
22022
Learning Hard-Constrained Models with One Sample
A Galanis, A Kalavasis, AV Kandiros
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
12024
Transfer Learning Beyond Bounded Density Ratios
A Kalavasis, I Zadik, M Zampetakis
arXiv preprint arXiv:2403.11963, 2024
2024
Replicable Learning of Large-Margin Halfspaces
A Kalavasis, A Karbasi, KG Larsen, G Velegkas, F Zhou
arXiv preprint arXiv:2402.13857, 2024
2024
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games
I Anagnostides, A Kalavasis, T Sandholm, M Zampetakis
arXiv preprint arXiv:2311.14869, 2023
2023
On the Verification Complexity of Deterministic Nonsmooth Nonconvex Optimization
A Kalavasis, K Stavropoulos, M Zampetakis
2023
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods
C Caramanis, D Fotakis, A Kalavasis, V Kontonis, C Tzamos
Advances in Neural Information Processing Systems 36, 2023
2023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–18