default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrigoris Velegkas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c19]Julian Asilis, Mikael Møller Høgsgaard, Grigoris Velegkas:
Understanding Aggregations of Proper Learners in Multiclass Classification. ALT 2025: 89-111- [i20]Julian Asilis, Mikael Møller Høgsgaard, Grigoris Velegkas:
On Agnostic PAC Learning in the Small Error Regime. CoRR abs/2502.09496 (2025) - 2024
- [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, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. ICML 2024 - [c16]Gagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris Velegkas:
Randomized Truthful Auctions with Learning Agents. NeurIPS 2024 - [c15]Steve Hanneke, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Universal Rates for Active Learning. NeurIPS 2024 - [c14]Alkis Kalavasis, Amin Karbasi, Argyris Oikonomou, Katerina Sotiraki, Grigoris Velegkas, Manolis Zampetakis:
Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models. NeurIPS 2024 - [c13]Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas, Felix Zhou:
On the Computational Landscape of Replicable Learning. NeurIPS 2024 - [c12]Yang Cai
, Zhe Feng, Christopher Liaw, Aranyak Mehta, Grigoris Velegkas:
User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization. WWW 2024: 111-122 - [i19]Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. CoRR abs/2402.13857 (2024) - [i18]Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida, Felix Zhou:
Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis. CoRR abs/2405.08938 (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]Julian Asilis, Mikael Møller Høgsgaard, Grigoris Velegkas:
Understanding Aggregations of Proper Learners in Multiclass Classification. CoRR abs/2410.22749 (2024) - [i14]Gagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris Velegkas:
Randomized Truthful Auctions with Learning Agents. CoRR abs/2411.09517 (2024) - [i13]Alkis Kalavasis, Anay Mehrotra, Grigoris Velegkas:
On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse. CoRR abs/2411.09642 (2024) - [i12]Yuan Deng, Amin Karbasi, Vahab Mirrokni, Renato Paes Leme, Grigoris Velegkas, Song Zuo:
Procurement Auctions via Approximately Optimal Submodular Optimization. CoRR abs/2411.13513 (2024) - [i11]Alkis Kalavasis, Anay Mehrotra, Grigoris Velegkas:
Characterizations of Language Generation With Breadth. CoRR abs/2412.18530 (2024) - 2023
- [c11]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Replicable Bandits. ICLR 2023 - [c10]Alkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Statistical Indistinguishability of Learning Algorithms. ICML 2023: 15586-15622 - [c9]Idan Attias, Steve Hanneke, Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas:
Optimal Learners for Realizable Regression: PAC Learning and Online Learning. NeurIPS 2023 - [c8]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. NeurIPS 2023 - [c7]Amin Karbasi, Grigoris Velegkas, Lin Yang, Felix Zhou:
Replicability in Reinforcement Learning. NeurIPS 2023 - [i10]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. CoRR abs/2302.10359 (2023) - [i9]Alkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Statistical Indistinguishability of Learning Algorithms. CoRR abs/2305.14311 (2023) - [i8]Amin Karbasi, Grigoris Velegkas, Lin F. Yang, Felix Zhou:
Replicability in Reinforcement Learning. CoRR abs/2305.19562 (2023) - [i7]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) - 2022
- [c6]Steve Hanneke, Amin Karbasi, Shay Moran, Grigoris Velegkas:
Universal Rates for Interactive Learning. NeurIPS 2022 - [c5]Alkis Kalavasis, Grigoris Velegkas, Amin Karbasi:
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes. NeurIPS 2022 - [c4]Grigoris Velegkas, Zhuoran Yang, Amin Karbasi:
Reinforcement Learning with Logarithmic Regret and Policy Switches. NeurIPS 2022 - [c3]Dirk Bergemann, Yang Cai, Grigoris Velegkas, Mingfei Zhao:
Is Selling Complete Information (Approximately) Optimal? EC 2022: 608-663 - [i6]Dirk Bergemann, Yang Cai, Grigoris Velegkas, Mingfei Zhao:
Is Selling Complete Information (Approximately) Optimal? CoRR abs/2202.09013 (2022) - [i5]Grigoris Velegkas, Zhuoran Yang, Amin Karbasi:
The Best of Both Worlds: Reinforcement Learning with Logarithmic Regret and Policy Switches. CoRR abs/2203.01491 (2022) - [i4]Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas:
Reproducible Bandits. CoRR abs/2210.01898 (2022) - [i3]Alkis Kalavasis, Grigoris Velegkas, Amin Karbasi:
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes. CoRR abs/2210.02297 (2022) - 2021
- [c2]Yang Cai, Grigoris Velegkas:
How to Sell Information Optimally: An Algorithmic Study. ITCS 2021: 81:1-81:20 - [c1]Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. SODA 2021: 1337-1356 - 2020
- [i2]Yang Cai, Grigoris Velegkas:
How to Sell Information Optimally: an Algorithmic Study. CoRR abs/2011.14570 (2020)
2010 – 2019
- 2019
- [i1]Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. CoRR abs/1911.10172 (2019)
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 2025-03-14 17:49 CET 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:
