Grigoris Velegkas

Orcid: 0000-0001-7148-0548

According to our database1, Grigoris Velegkas authored at least 15 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Replicable Learning of Large-Margin Halfspaces.
CoRR, 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...