An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization Y Cai, A Oikonomou, G Velegkas, M Zhao Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 27* | 2021 |
Statistical indistinguishability of learning algorithms A Kalavasis, A Karbasi, S Moran, G Velegkas International Conference on Machine Learning, 15586-15622, 2023 | 19 | 2023 |
Replicable bandits H Esfandiari, A Kalavasis, A Karbasi, A Krause, V Mirrokni, G Velegkas arXiv preprint arXiv:2210.01898, 2022 | 17 | 2022 |
Replicable clustering H Esfandiari, A Karbasi, V Mirrokni, G Velegkas, F Zhou Advances in Neural Information Processing Systems 36, 2024 | 12 | 2024 |
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 | 11 | 2023 |
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, 20809-20822, 2022 | 9 | 2022 |
Is Selling Complete Information (Approximately) Optimal? D Bergemann, Y Cai, G Velegkas, M Zhao Proceedings of the 23rd ACM Conference on Economics and Computation, 608-663, 2022 | 9 | 2022 |
How to sell information optimally: An algorithmic study Y Cai, G Velegkas arXiv preprint arXiv:2011.14570, 2020 | 9 | 2020 |
Replicability in reinforcement learning A Karbasi, G Velegkas, L Yang, F Zhou Advances in Neural Information Processing Systems 36, 74702-74735, 2023 | 7 | 2023 |
Reinforcement learning with logarithmic regret and policy switches G Velegkas, Z Yang, A Karbasi Advances in Neural Information Processing Systems 35, 36040-36053, 2022 | 4* | 2022 |
Replicable learning of large-margin halfspaces A Kalavasis, A Karbasi, KG Larsen, G Velegkas, F Zhou arXiv preprint arXiv:2402.13857, 2024 | 3 | 2024 |
Universal rates for interactive learning S Hanneke, A Karbasi, S Moran, G Velegkas Advances in Neural Information Processing Systems 35, 28657-28669, 2022 | 3 | 2022 |
Injecting Undetectable Backdoors in Deep Learning and Language Models A Kalavasis, A Karbasi, A Oikonomou, K Sotiraki, G Velegkas, ... arXiv preprint arXiv:2406.05660, 2024 | 1 | 2024 |
On the Computational Landscape of Replicable Learning A Kalavasis, A Karbasi, G Velegkas, F Zhou arXiv preprint arXiv:2405.15599, 2024 | 1 | 2024 |
Universal Rates for Regression: Separations between Cut-Off and Absolute Loss I Attias, S Hanneke, A Kalavasis, A Karbasi, G Velegkas The Thirty Seventh Annual Conference on Learning Theory, 359-405, 2024 | | 2024 |
Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis QC Liu, G Velegkas, Y Yoshida, F Zhou arXiv preprint arXiv:2405.08938, 2024 | | 2024 |
User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization Y Cai, Z Feng, C Liaw, A Mehta, G Velegkas Proceedings of the ACM on Web Conference 2024, 111-122, 2024 | | 2024 |