Papers

Field

Top tools here

Coming with more sources: stars history

All tools

Agno+17% downloads · 519.1k/wk+16.8%
n8n+25% downloads · 148.3k/wk+25.0%
LangGraph7 releases this week
DeepEval+15% downloads · 769.3k/wk+14.7%
OpenAI Python SDK7 releases this week

Top tools here

Open problems in Agents

Evaluating long-horizon agentic behavior in real-world tasks4 papers raise it · 3 address it
Current benchmarks often simplify or omit the exploration, strategy adjustment, and verification needed for sustained autonomous work.
- Scaling Agentic Data for Long-Horizon Terminal Intelligenceraises · addresses
- FDE-Gym: The Last Mile of AI Deliveryraises · addresses
- AgentSWE: Can Coding Agents Build the Agent You Actually Want?raises · addresses
- Into the Unknown: Benchmarking AI agents on open scientific research problemsraises
Faithful agent development from natural-language requirements1 paper raises it · 1 addresses it
Agents often fail to deliver systems that truly meet the specified requirements, not just appear to.
- AgentSWE: Can Coding Agents Build the Agent You Actually Want?raises · addresses
Learning from experience in unfamiliar environments1 paper raises it · 1 addresses it
Agents struggle to acquire and retain new knowledge through interaction rather than relying on pretrained knowledge.
- Learn2Play Bench: How Well Do LLM Agents Learn from Experience in Unfamiliar Environments?raises · addresses
Detecting when past context matters in long conversations1 paper raises it · 0 address it
AI systems cannot reliably identify when historical information is relevant to the current interaction.
- RealCompanion: Benchmarking Human Understanding from Reasoning over Longitudinal Real-World Conversationsraises
Open and reproducible agent stacks for computer use1 paper raises it · 2 address it
Frontier computer-use agents are often closed, limiting systematic study and community collaboration.
- OpenGCUA: Toward a Fully Open Stack for Generalist Computer Useraises · addresses
- MAI-Gym: An Open All-in-One Platform for GUI Agent Evaluation and RL Training across Mobile and Computer Environmentsaddresses

Named by an AI from these papers' abstracts.

Open problems

Recently funded

Market

GreptileSeries B+ · Oct 19$50M
VesslaPre-seed · Oct 19$3.3M
SupaHumanSeries A · Oct 19$1.5M
BoxLiteSeed · Oct 19undisclosed
RapidCanvasSeries B+ · Oct 16$29M

Recently funded

Topics in this field

coding agents · code generation · coding agent270 papers79 this week
skills · tasks · ai297 papers61 this week
recursive self improvement · harness evolution · adaptive252 papers48 this week
tool using agents · agent systems · multi agent198 papers45 this week
ai agents · indirect prompt injection · adversarial300 papers42 this week
agent · agentic · llm agents155 papers33 this week

Topics in this field

Active contributors · 90 days

Active contributors

Activity · 12 weeks

Coming with more sources: repos

Activity

Recent papers

All in Research →

arXiv cs.CROct 19
Game of Phones: Harnessing Game Theory and LLMs in 'Bot Wars' to Counteract Phone Scams
Nardine Basta, Robin Carpentier, Benjamin Zi Hao Zhao, Dali Kaafar
Phone scams impose substantial and growing costs on individuals and financial systems worldwide, yet existing countermeasures impose no resource cost on perpetrators. Strategic scam-baiting, in which automated agents engage scammers to deplete their operational capacity, offers a proactive alternative but requires dynamic strategy adaptation that static systems cannot provide. We introduce a game-theoretic framework enabling LLMs to learn effective counter-strategies through in-context experience without fine-tuning. The framework models scammer-baiter interactions as a two-player game with empirically grounded strategies and utility functions, using Nash equilibrium as a formal benchmark for evaluating learned behaviour. Across 300 simulated dialogues and three LLM architectures, adaptive strategy selection achieves 28.9-79.7% closer alignment to Nash equilibrium than non-adaptive baselines. The code and an annotated dataset of 300 dialogues with turn-level strategy labels and utility scores are released at https://github.com/nardinebasta/GameofPhones_/ .
PDF arXiv
arXiv cs.LGOct 19
Topological Sheaves of Irreducibility: A Theoretical Framework for Multi-Agent Task Obstructions
Steven Motta, Davide Mambelli, Alessandro Rozza
Multi-agent systems can differ under identical agents and communication budgets when they support different forms of joint interaction. We introduce Topological Sheaves of Irreducibility (TSI), a sheaf-theoretic framework separating task-level compatibility obstructions from system capability. A task is represented by an interaction complex $K$ and a capacity sheaf $\mathcal{F}$; nonzero $H^n(K;\mathcal{F})$ defines a structural signature, while registered interventions test capability. For cocycle data, cochain realization is solvable exactly when the represented cohomology class vanishes. Examples show that the signature is sheaf-relative, and the degree-1 reduction yields cycle-space witnesses and observation requirements. We evaluate two finite one-round models. Across 15,625 degree-1 inputs, an all-agent additive primitive solves decision and repair exactly; the optimal pairwise system reaches 88.80% on decision, one input above the 88.79% majority-class baseline, and 26.63% on repair. On a degree-2 tetrahedral-boundary task over 531,441 inputs, the same-2-skeleton system retains all four three-agent primitives yet matches the pairwise-only optimum throughout the registered…
PDF arXiv
arXiv cs.LGCodeOct 19▲ 25
HarnessPro: Recursive Harness Self-Improvement with Pareto Optimization for Performance-Cost Trade-offs
Zhuoshi Pan, ZhiYuan Feng, Yukuo Cen, Honglin Lin, Junru Lu +4
Harness development plays a crucial role in building capable AI agents. Recent approaches improve harnesses through recursive self-improvement (RSI), but their performance gains often come with higher execution costs. We introduce HarnessPro, a label-free method for evolving harnesses to improve task performance while reducing execution cost. In this setting, candidate harnesses are evaluated using LLM-generated tests without access to ground-truth solutions or official tests. Specialized agents diagnose execution trajectories, plan updates with different performance-cost priorities, and implement them as candidate harnesses. Rather than returning a single harness, HarnessPro uses normalized weighted squared-distance selection to provide cost-focused (lite), balanced (medium), and performance-focused (heavy) harnesses for different deployment budgets. Selected harnesses enter the next iteration, where execution feedback guides further updates. Our experiments cover Terminal-Bench 2, SWE-Bench Pro, and ProgramBench, using GPT-5.5 with Codex and GLM-5.2 with Claude Code. Across these benchmarks using GPT-5.5 with Codex, the heavy mode of HarnessPro achieves an average pass-rate…
PDF arXiv Code
arXiv cs.AIOct 19
Towards Robust Model Organisms for Eliciting Latent Knowledge
Lennart Finke, Hardik Bhatnagar, Euodia Dodd, Francis Rhys Ward, Yves-Alexandre de Montjoye +2
A key problem in AI safety is eliciting latent knowledge (ELK), extracting information from a model that is misaligned and more knowledgeable than its overseer. For example, a misaligned model used to scan code for vulnerabilities may want to withhold its findings, i.e., sandbag, in order to exploit them later. To study ELK empirically, we need model organisms that mirror this setting. Existing model organisms fall short in several respects. In this work, we train model organisms to withhold solutions in a vulnerability detection task. We combine transcript distillation with counter-prompting and tamper-resistance training to instill three properties that we argue are critical for a useful ELK testbed: 1) Selectivity, the model sandbags when it thinks the overseer doesn't know the answer and complies otherwise, 2) Robustness, the model resists elicitation, and 3) Retention, the model retains a knowledge advantage over the overseer, as opposed to losing the relevant capability. We train a sequence of model organisms and show that our strongest model substantially outperforms prior models on robustness while keeping the other two properties intact. We hope that our model organisms…
PDF arXiv
arXiv cs.AIOct 19
StepBench: Diagnosing Real-World Procedural Understanding in AI Agents
Hossein A. Rahmani, Bin Wu, Chaeeun Lee, Fanghua Ye, Sahan Bulathwela +4
Evaluating an agent's planning ability remains challenging for open-domain tasks, where verifying procedures through execution is often impractical. Existing evaluations typically assess only the final plan and do not distinguish procedural errors such as missing, incorrect, or misordered actions. We introduce STEPBENCH, a benchmark of 6,885 verified procedures crawled from wikiHow across 81 open-domain categories. From each procedure, we derive 5 diagnostic tasks: four with deterministic answers involving withheld, incorrect, or shuffled steps, and one requiring next-step generation. We additionally evaluate full-plan generation to examine how diagnostic performance correlates with end-to-end plan validity. Using the same procedures across tasks lets us directly compare different planning capabilities. For generation, STEPEVAL identifies critical failures that prevent goal completion. Across 14 configurations of 12 models, we find substantial differences across planning capabilities, with step ordering proving the most difficult: the strongest model correctly orders only 63.0% of procedures, dropping to 33.1% for those with nine or more steps. Incorrect-step detection also…
PDF arXiv
arXiv cs.LGOct 19
Which Model for Which Role? Cost-Efficient Pareto Recommendation for LLM Agentic Workflows
Qian Xie, Wenyue Hua, Yueli He, Sripad Karne, Armaan Agrawal +5
LLM agentic workflows increasingly employ different models for specialized roles. Users may prefer different trade-offs between task quality and deployment cost, sometimes also considering latency. Finding good assignments incurs a separate search cost from evaluating multiple candidates. We introduce Cost-Coupled Gittins (CC-Gittins), a multi-objective extension of single-objective cost-aware Gittins search for Pareto recommendation. It exploits the coupling between evaluation and deployment costs: assignments that cost more to deploy also cost more to evaluate. The search alternates between seeking higher quality and lower deployment cost, reusing each evaluation to inform both searches. After each batch, CC-Gittins recommends assignments that are nondominated under uncertainty-adjusted estimates of quality and deployment cost. We evaluate CC-Gittins on eight quality--cost matrices from workflows with two to five roles and up to 1,681 candidate assignments. We also evaluate the method with latency as a third objective. Across the eight benchmarks, CC-Gittins recovers a substantial fraction of the true Pareto frontier at roughly 10% of the exhaustive-evaluation cost, and…
PDF arXiv

Papers

Top tools here

Coming with more sources: stars history

All tools

Agno+17% downloads · 519.1k/wk+16.8%
n8n+25% downloads · 148.3k/wk+25.0%
LangGraph7 releases this week
DeepEval+15% downloads · 769.3k/wk+14.7%
OpenAI Python SDK7 releases this week

Recently funded

Market

GreptileSeries B+ · Oct 19$50M
VesslaPre-seed · Oct 19$3.3M
SupaHumanSeries A · Oct 19$1.5M
BoxLiteSeed · Oct 19undisclosed
RapidCanvasSeries B+ · Oct 16$29M

Topics in this field

coding agents · code generation · coding agent270 papers79 this week
skills · tasks · ai297 papers61 this week
recursive self improvement · harness evolution · adaptive252 papers48 this week
tool using agents · agent systems · multi agent198 papers45 this week
ai agents · indirect prompt injection · adversarial300 papers42 this week
agent · agentic · llm agents155 papers33 this week

Active contributors · 90 days

Activity · 12 weeks

Coming with more sources: repos

Recent papers

All in Research →

arXiv cs.CROct 19
Game of Phones: Harnessing Game Theory and LLMs in 'Bot Wars' to Counteract Phone Scams
Nardine Basta, Robin Carpentier, Benjamin Zi Hao Zhao, Dali Kaafar
Phone scams impose substantial and growing costs on individuals and financial systems worldwide, yet existing countermeasures impose no resource cost on perpetrators. Strategic scam-baiting, in which automated agents engage scammers to deplete their operational capacity, offers a proactive alternative but requires dynamic strategy adaptation that static systems cannot provide. We introduce a game-theoretic framework enabling LLMs to learn effective counter-strategies through in-context experience without fine-tuning. The framework models scammer-baiter interactions as a two-player game with empirically grounded strategies and utility functions, using Nash equilibrium as a formal benchmark for evaluating learned behaviour. Across 300 simulated dialogues and three LLM architectures, adaptive strategy selection achieves 28.9-79.7% closer alignment to Nash equilibrium than non-adaptive baselines. The code and an annotated dataset of 300 dialogues with turn-level strategy labels and utility scores are released at https://github.com/nardinebasta/GameofPhones_/ .
PDF arXiv
arXiv cs.LGOct 19
Topological Sheaves of Irreducibility: A Theoretical Framework for Multi-Agent Task Obstructions
Steven Motta, Davide Mambelli, Alessandro Rozza
Multi-agent systems can differ under identical agents and communication budgets when they support different forms of joint interaction. We introduce Topological Sheaves of Irreducibility (TSI), a sheaf-theoretic framework separating task-level compatibility obstructions from system capability. A task is represented by an interaction complex $K$ and a capacity sheaf $\mathcal{F}$; nonzero $H^n(K;\mathcal{F})$ defines a structural signature, while registered interventions test capability. For cocycle data, cochain realization is solvable exactly when the represented cohomology class vanishes. Examples show that the signature is sheaf-relative, and the degree-1 reduction yields cycle-space witnesses and observation requirements. We evaluate two finite one-round models. Across 15,625 degree-1 inputs, an all-agent additive primitive solves decision and repair exactly; the optimal pairwise system reaches 88.80% on decision, one input above the 88.79% majority-class baseline, and 26.63% on repair. On a degree-2 tetrahedral-boundary task over 531,441 inputs, the same-2-skeleton system retains all four three-agent primitives yet matches the pairwise-only optimum throughout the registered…
PDF arXiv
arXiv cs.LGCodeOct 19▲ 25
HarnessPro: Recursive Harness Self-Improvement with Pareto Optimization for Performance-Cost Trade-offs
Zhuoshi Pan, ZhiYuan Feng, Yukuo Cen, Honglin Lin, Junru Lu +4
Harness development plays a crucial role in building capable AI agents. Recent approaches improve harnesses through recursive self-improvement (RSI), but their performance gains often come with higher execution costs. We introduce HarnessPro, a label-free method for evolving harnesses to improve task performance while reducing execution cost. In this setting, candidate harnesses are evaluated using LLM-generated tests without access to ground-truth solutions or official tests. Specialized agents diagnose execution trajectories, plan updates with different performance-cost priorities, and implement them as candidate harnesses. Rather than returning a single harness, HarnessPro uses normalized weighted squared-distance selection to provide cost-focused (lite), balanced (medium), and performance-focused (heavy) harnesses for different deployment budgets. Selected harnesses enter the next iteration, where execution feedback guides further updates. Our experiments cover Terminal-Bench 2, SWE-Bench Pro, and ProgramBench, using GPT-5.5 with Codex and GLM-5.2 with Claude Code. Across these benchmarks using GPT-5.5 with Codex, the heavy mode of HarnessPro achieves an average pass-rate…
PDF arXiv Code
arXiv cs.AIOct 19
Towards Robust Model Organisms for Eliciting Latent Knowledge
Lennart Finke, Hardik Bhatnagar, Euodia Dodd, Francis Rhys Ward, Yves-Alexandre de Montjoye +2
A key problem in AI safety is eliciting latent knowledge (ELK), extracting information from a model that is misaligned and more knowledgeable than its overseer. For example, a misaligned model used to scan code for vulnerabilities may want to withhold its findings, i.e., sandbag, in order to exploit them later. To study ELK empirically, we need model organisms that mirror this setting. Existing model organisms fall short in several respects. In this work, we train model organisms to withhold solutions in a vulnerability detection task. We combine transcript distillation with counter-prompting and tamper-resistance training to instill three properties that we argue are critical for a useful ELK testbed: 1) Selectivity, the model sandbags when it thinks the overseer doesn't know the answer and complies otherwise, 2) Robustness, the model resists elicitation, and 3) Retention, the model retains a knowledge advantage over the overseer, as opposed to losing the relevant capability. We train a sequence of model organisms and show that our strongest model substantially outperforms prior models on robustness while keeping the other two properties intact. We hope that our model organisms…
PDF arXiv
arXiv cs.AIOct 19
StepBench: Diagnosing Real-World Procedural Understanding in AI Agents
Hossein A. Rahmani, Bin Wu, Chaeeun Lee, Fanghua Ye, Sahan Bulathwela +4
Evaluating an agent's planning ability remains challenging for open-domain tasks, where verifying procedures through execution is often impractical. Existing evaluations typically assess only the final plan and do not distinguish procedural errors such as missing, incorrect, or misordered actions. We introduce STEPBENCH, a benchmark of 6,885 verified procedures crawled from wikiHow across 81 open-domain categories. From each procedure, we derive 5 diagnostic tasks: four with deterministic answers involving withheld, incorrect, or shuffled steps, and one requiring next-step generation. We additionally evaluate full-plan generation to examine how diagnostic performance correlates with end-to-end plan validity. Using the same procedures across tasks lets us directly compare different planning capabilities. For generation, STEPEVAL identifies critical failures that prevent goal completion. Across 14 configurations of 12 models, we find substantial differences across planning capabilities, with step ordering proving the most difficult: the strongest model correctly orders only 63.0% of procedures, dropping to 33.1% for those with nine or more steps. Incorrect-step detection also…
PDF arXiv
arXiv cs.LGOct 19
Which Model for Which Role? Cost-Efficient Pareto Recommendation for LLM Agentic Workflows
Qian Xie, Wenyue Hua, Yueli He, Sripad Karne, Armaan Agrawal +5
LLM agentic workflows increasingly employ different models for specialized roles. Users may prefer different trade-offs between task quality and deployment cost, sometimes also considering latency. Finding good assignments incurs a separate search cost from evaluating multiple candidates. We introduce Cost-Coupled Gittins (CC-Gittins), a multi-objective extension of single-objective cost-aware Gittins search for Pareto recommendation. It exploits the coupling between evaluation and deployment costs: assignments that cost more to deploy also cost more to evaluate. The search alternates between seeking higher quality and lower deployment cost, reusing each evaluation to inform both searches. After each batch, CC-Gittins recommends assignments that are nondominated under uncertainty-adjusted estimates of quality and deployment cost. We evaluate CC-Gittins on eight quality--cost matrices from workflows with two to five roles and up to 1,681 candidate assignments. We also evaluate the method with latency as a third objective. Across the eight benchmarks, CC-Gittins recovers a substantial fraction of the true Pareto frontier at roughly 10% of the exhaustive-evaluation cost, and…
PDF arXiv

Open problems in Agents

Evaluating long-horizon agentic behavior in real-world tasks4 papers raise it · 3 address it
Current benchmarks often simplify or omit the exploration, strategy adjustment, and verification needed for sustained autonomous work.
- Scaling Agentic Data for Long-Horizon Terminal Intelligenceraises · addresses
- FDE-Gym: The Last Mile of AI Deliveryraises · addresses
- AgentSWE: Can Coding Agents Build the Agent You Actually Want?raises · addresses
- Into the Unknown: Benchmarking AI agents on open scientific research problemsraises
Faithful agent development from natural-language requirements1 paper raises it · 1 addresses it
Agents often fail to deliver systems that truly meet the specified requirements, not just appear to.
- AgentSWE: Can Coding Agents Build the Agent You Actually Want?raises · addresses
Learning from experience in unfamiliar environments1 paper raises it · 1 addresses it
Agents struggle to acquire and retain new knowledge through interaction rather than relying on pretrained knowledge.
- Learn2Play Bench: How Well Do LLM Agents Learn from Experience in Unfamiliar Environments?raises · addresses
Detecting when past context matters in long conversations1 paper raises it · 0 address it
AI systems cannot reliably identify when historical information is relevant to the current interaction.
- RealCompanion: Benchmarking Human Understanding from Reasoning over Longitudinal Real-World Conversationsraises
Open and reproducible agent stacks for computer use1 paper raises it · 2 address it
Frontier computer-use agents are often closed, limiting systematic study and community collaboration.
- OpenGCUA: Toward a Fully Open Stack for Generalist Computer Useraises · addresses
- MAI-Gym: An Open All-in-One Platform for GUI Agent Evaluation and RL Training across Mobile and Computer Environmentsaddresses

Named by an AI from these papers' abstracts.

Fields · AI · updated 55m ago

Agents

LLM agents: planning, tool use, multi-agent systems, computer/web agents and agent benchmarks.

503papers this week−0.4% vs last week

All papers · 2.4k With code · 109

Newest Most relevant

2.3k papers this month