Anastasis Kratsios
2 papers · Latest:
Statistical Machine Learning
Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
Feedforward neural networks definable in o-minimal structures, including MLPs, CNNs, and transformers, possess finite PAC sample complexity.
2605.07097
Machine LearningAdaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning
This paper shows how representational constraints, like ReLU networks, profoundly alter the benefits of adaptive learning over fixed-query methods.
2605.04995
📬 Weekly AI Paper Digest
Get the top 10 AI/ML arXiv papers from the week — summarized, scored, and delivered to your inbox every Monday.