Humanity's Last Exam
Paper
•
2501.14249
•
Published
•
76
Asankhaya Sharma PRO
codelion
AI & ML interests
Creator of OptiLLM, OpenEvolve, Adaptive Classifier, and PTS. Pioneering a new category in AI infrastructure: inference-time compute for LLMs.
Recent Activity
liked
a model
5 minutes ago
google/gemma-3-1b-it
reacted
to
their
post
with ❤️
3 days ago
New Research: Theoretical Foundations for In-Context Learning in Transformers
I'm excited to share our latest theoretical work that formally proves an interesting property of large language models: base transformer models can approximate fine-tuned capabilities using only inference-time techniques like in-context learning.
The core question we investigated: Can specialized behaviors typically acquired through expensive supervised fine-tuning be elicited from base models without any parameter updates?
Our theoretical contribution: We provide a formal proof, grounded in the Turing completeness of transformers, showing that this is indeed possible under certain assumptions. The work establishes mathematical bounds on the minimal dataset sizes needed for approximation.
Key theoretical results:
- For text generation tasks: O(mV/ε²) examples suffice (where m = number of contexts, V = vocabulary size, ε = error tolerance)
- For linear classification: O(d/ε) examples (where d = input dimension)
- Extensions to finite context scenarios with practical bounds
This work helps explain why techniques like few-shot prompting, retrieval-augmented generation, and in-context learning work so effectively in practice. It bridges formal computer science theory with empirical observations about modern language models.
While the assumptions are idealized (unbounded computational resources, full dataset access), the results provide mathematical foundations for understanding inference-time adaptation strategies that are increasingly important in AI deployment.
Paper: https://huggingface.co/papers/2506.08060
reacted
to
their
post
with ➕
3 days ago
New Research: Theoretical Foundations for In-Context Learning in Transformers
I'm excited to share our latest theoretical work that formally proves an interesting property of large language models: base transformer models can approximate fine-tuned capabilities using only inference-time techniques like in-context learning.
The core question we investigated: Can specialized behaviors typically acquired through expensive supervised fine-tuning be elicited from base models without any parameter updates?
Our theoretical contribution: We provide a formal proof, grounded in the Turing completeness of transformers, showing that this is indeed possible under certain assumptions. The work establishes mathematical bounds on the minimal dataset sizes needed for approximation.
Key theoretical results:
- For text generation tasks: O(mV/ε²) examples suffice (where m = number of contexts, V = vocabulary size, ε = error tolerance)
- For linear classification: O(d/ε) examples (where d = input dimension)
- Extensions to finite context scenarios with practical bounds
This work helps explain why techniques like few-shot prompting, retrieval-augmented generation, and in-context learning work so effectively in practice. It bridges formal computer science theory with empirical observations about modern language models.
While the assumptions are idealized (unbounded computational resources, full dataset access), the results provide mathematical foundations for understanding inference-time adaptation strategies that are increasingly important in AI deployment.
Paper: https://huggingface.co/papers/2506.08060
Organizations
codelion's activity
upvoted
a
paper
3 days ago
upvoted
3
papers
5 days ago
upvoted
2
papers
10 days ago
upvoted
a
paper
11 days ago
upvoted
a
paper
12 days ago
upvoted
a
paper
13 days ago
upvoted
an
article
13 days ago
Article
System Prompt Learning: Teaching LLMs to Learn Problem-Solving Strategies from Experience
By
•
•
12
upvoted
a
paper
19 days ago
upvoted
an
article
19 days ago
Article
AutoThink: Adaptive Reasoning for Large Language Models
By
•
•
4
upvoted
a
paper
26 days ago
upvoted
an
article
26 days ago
Article
OpenEvolve: An Open Source Implementation of Google DeepMind's AlphaEvolve
By
•
•
22
upvoted
an
article
29 days ago
Article
Introducing Pivotal Token Search (PTS): Targeting Critical Decision Points in LLM Training
By
•
•
5
upvoted
a
paper
about 1 month ago
upvoted
a
collection
about 1 month ago
upvoted
3
papers
about 1 month ago