Alkis Kalavasis

Orcid: 0000-0002-1479-5268

According to our database1, Alkis Kalavasis authored at least 27 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computational Lower Bounds for Regret Minimization in Normal-Form Games.
CoRR, 2024

Barriers to Welfare Maximization with No-Regret Learning.
CoRR, 2024

Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening.
CoRR, 2024

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

On the Computational Landscape of Replicable Learning.
CoRR, 2024

Transfer Learning Beyond Bounded Density Ratios.
CoRR, 2024

Learning Hard-Constrained Models with One Sample.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

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

Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening (Extended Abstract).
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 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

On Sampling from Ising Models with Spectral Constraints.
Proceedings of the Approximation, 2024

2023
Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods.
CoRR, 2023

Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method.
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

Efficient Parameter Estimation of Truncated Boolean Product Distributions.
Algorithmica, 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

Learning and Covering Sums of Independent Random Variables with Unbounded Support.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Perfect Sampling from Pairwise Comparisons.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Linear Label Ranking with Bounded Noise.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Label Ranking through Nonparametric Regression.
Proceedings of the International Conference on Machine Learning, 2022

Differentially Private Regression with Unbounded Covariates.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Efficient Algorithms for Learning from Coarse Labels.
Proceedings of the Conference on Learning Theory, 2021

Aggregating Incomplete and Noisy Rankings.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021


  Loading...