Andreas Kontogiannis

Orcid: 0000-0001-7161-5326

According to our database1, Andreas Kontogiannis authored at least 10 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback.
CoRR, May, 2026

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization.
CoRR, April, 2026

Efficient Swap Regret Minimization in Combinatorial Bandits.
CoRR, February, 2026

2025
Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

An Extended Benchmarking of Multi-Agent Reinforcement Learning Algorithms in Complex Fully Cooperative Tasks.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Enhancing Cooperative Multi-Agent Reinforcement Learning with State Modelling and Adversarial Exploration.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
The Computational Complexity of Finding Second-Order Stationary Points.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
XDQN: Inherently Interpretable DQN through Mimicking.
CoRR, 2023

Inherently Interpretable Deep Reinforcement Learning Through Online Mimicking.
Proceedings of the Explainable and Transparent AI and Multi-Agent Systems, 2023

2021
Tree-based Focused Web Crawling with Reinforcement Learning.
CoRR, 2021


  Loading...