Grigoris Velegkas

Orcid: 0000-0001-7148-0548

According to our database1, Grigoris Velegkas authored at least 30 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On Union-Closedness of Language Generation.
CoRR, June, 2025

(Im)possibility of Automated Hallucination Detection in Large Language Models.
CoRR, April, 2025

On Agnostic PAC Learning in the Small Error Regime.
CoRR, February, 2025

On the Limits of Language Generation: Trade-Offs between Hallucination and Mode-Collapse.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Understanding Aggregations of Proper Learners in Multiclass Classification.
Proceedings of the International Conference on Algorithmic Learning Theory, 2025

2024
Characterizations of Language Generation With Breadth.
CoRR, 2024

Procurement Auctions via Approximately Optimal Submodular Optimization.
CoRR, 2024

Injecting Undetectable Backdoors in Deep Learning and Language Models.
CoRR, 2024

Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis.
CoRR, 2024

User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization.
Proceedings of the ACM on Web Conference 2024, 2024

On the Computational Landscape of Replicable Learning.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Universal Rates for Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Randomized Truthful Auctions with Learning Agents.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Replicable Learning of Large-Margin Halfspaces.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Universal Rates for Regression: Separations between Cut-Off and Absolute Loss.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Replicability in Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Replicable Clustering.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimal Learners for Realizable Regression: PAC Learning and Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Statistical Indistinguishability of Learning Algorithms.
Proceedings of the International Conference on Machine Learning, 2023

Replicable Bandits.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Reproducible Bandits.
CoRR, 2022

The Best of Both Worlds: Reinforcement Learning with Logarithmic Regret and Policy Switches.
CoRR, 2022

Is Selling Complete Information (Approximately) Optimal?
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Reinforcement Learning with Logarithmic Regret and Policy Switches.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Universal Rates for Interactive Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
An Efficient <i>∊</i>-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

How to Sell Information Optimally: An Algorithmic Study.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2019
An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization.
CoRR, 2019


  Loading...