activity
20172026
most citedAlgorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks

10 citations · 47 across the 27 of their papers we have counts for

collaborators

32 papers

cs.CL2026

AbridgeKV: Compressing Long Reasoning into the KV Cache of Learned Pause Tokens

Jack Cai, Lijie Yang, Vasilis Kontonis +2

Long chain-of-thought decoding is memory-bound: the KV cache of the generated tokens grows linearly with the test-time compute being spent. Evicting cache entries does not fix this…

cs.LG2026

Fork-and-Flush: Escaping Idea Basins in Autoresearch Agents

Ziyang Cai, Christos Ziakas, Vasilis Kontonis +5

Autoresearch agents tackle open-ended problems by repeatedly proposing candidate solutions, evaluating them, and using feedback to guide subsequent experiments. We show that indepe…

cs.LG2026

Scaling Discovery through Test-Time Communication

Jongho Park, Vasilis Kontonis, Shivam Garg +2

Science advances not in isolation but through collaboration, yet existing agentic systems capture little of this. Whether communicating agents help remains an open question with mi…

cs.AI2026

MEMENTO: Teaching LLMs to Manage Their Own Context

Vasilis Kontonis, Yuchen Zeng, Shivam Garg +7

Reasoning models think in long, unstructured streams with no mechanism for compressing or organizing their own intermediate state. We introduce MEMENTO: a method that teaches model…

cs.LG2025

Wait, Wait, Wait... Why Do Reasoning Models Loop?

Charilaos Pipis, Shivam Garg, Vasilis Kontonis +3

Reasoning models (e.g., DeepSeek-R1) generate long chains of thought to solve harder problems, but they often loop, repeating the same text at low temperatures or with greedy decod…

cs.LG2025

Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions

Jaeyeon Kim, Kulin Shah, Vasilis Kontonis +2

In recent years, masked diffusion models (MDMs) have emerged as a promising alternative approach for generative modeling over discrete domains. Compared to autoregressive models (A…