Papers

Field

Top tools here

Coming with more sources: stars history

All tools

Agno4 releases this week
FastMCP6 releases this week
n8n+25% downloads · 148.3k/wk+25.0%
DeepEval+15% downloads · 769.3k/wk+14.7%
Ragas+14% downloads · 319.9k/wk+13.6%

Top tools here

Open problems in Agents

Long-horizon task execution and evidence accumulation3 papers raise it · 2 address it
Agents struggle to sustain multi-step reasoning, adapt strategies, and turn intermediate results into final deliverables in real-world tasks.
- 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
Realistic evaluation of agentic learning from experience1 paper raises it · 1 addresses it
Existing benchmarks often test reasoning with pre-existing knowledge rather than learning from novel, unfamiliar environments.
- Learn2Play Bench: How Well Do LLM Agents Learn from Experience in Unfamiliar Environments?raises · addresses
Faithful agent development from natural-language requirements1 paper raises it · 1 addresses it
Coding agents often fail to deliver agents that truly meet the specified requirements, not just appear to.
- AgentSWE: Can Coding Agents Build the Agent You Actually Want?raises · addresses
Detecting when past context matters in long conversations1 paper raises it · 0 address it
AI systems cannot reliably identify when historical context is relevant for current interactions in long-term companionship.
- RealCompanion: Benchmarking Human Understanding from Reasoning over Longitudinal Real-World Conversationsraises
Scalable and realistic GUI agent training and evaluation1 paper raises it · 2 address it
High cost and scarcity of realistic interactive environments limit progress in GUI agent training and evaluation.
- MAI-Gym: An Open All-in-One Platform for GUI Agent Evaluation and RL Training across Mobile and Computer Environmentsraises · addresses
- OpenGCUA: Toward a Fully Open Stack for Generalist Computer Useaddresses

Named by an AI from these papers' abstracts.

Open problems

Recently funded

Market

Asymptote LabsSeed · Oct 20$5.5M
GreptileSeries B+ · Oct 19$50M
VesslaPre-seed · Oct 19$3.3M
SupaHumanSeries A · Oct 19$1.5M
BoxLiteSeed · Oct 19undisclosed

Recently funded

Topics in this field

coding agents · code generation · coding agent286 papers85 this week
skills · tasks · ai308 papers64 this week
recursive self improvement · harness evolution · adaptive260 papers50 this week
tool using agents · agent systems · multi agent209 papers49 this week
ai agents · indirect prompt injection · adversarial314 papers48 this week
vision language · safety evaluations · safety alignment115 papers38 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.AIOct 19
CUA-Lite: An Open Platform for Computer Use Agents
Zhanhui Zhou, Weichen Zhang, Haoran Liu, Lingjie Chen, Tianneng Shi +4
Open resources for computer use agents (CUAs) -- environments, datasets, and models -- remain scattered: without a standard, these resources cannot be integrated and scaled; additionally, evaluation, RL, and SFT cannot share one infrastructure. We present CUA-Lite, an open platform for developing CUAs, built around three standardized abstractions: (1) Unified environment interface, under which we integrate 12 benchmarks across desktop, browser, and mobile, plus lightweight VM-free sandboxes that replicate OSWorld's desktop at much lower cost, providing over 30,000 verifiable tasks. (2) Unified supervised data format, into which we convert the major public CUA datasets, from GUI grounding and understanding to full rollouts, and record our fresh rollouts from frontier CUAs on these verifiable environments. (3) Model harnesses shared across evaluation, RL, and SFT, one per model and implemented for 14 model families. Each harness runs its model in these computer environments, producing the rollouts that evaluation and RL consume, or renders stored supervised data into the model's own training format for SFT. We release reference scores across the integrated benchmarks, and show that…
PDF arXiv
arXiv cs.PLOct 19
Blame-aware Recomposition for Secure Compilation Proofs of Low-Level Compartment Isolation
Basile Schlosser, Jérémy Thibault, Catalin Hritcu
The security guarantees of existing formally verified compilers for compartmentalized programs in unsafe languages like C stop at a rather high level, assuming a built-in protection mechanism and a block-based memory model. Verifying a concrete, low-level enforcement mechanism for compartment isolation is still a major challenge for current proof techniques. In particular, Abate et al.'s proof technique fails because one of their proof steps, recomposition, essentially requires hiding all information about the code of each compartment, which is not practically achievable at a low level. We propose an extension of their proof technique to a low-level setting where compartments can fully observe each other's code. To do so, we introduce an overlay semantics that allows us to characterize these observations as a form of undefined behaviour, and we use a novel variant of recomposition that we call blame-aware recomposition, which essentially allows recomposing executions as needed in the original high-level proof technique, even if the low-level context observes the code, because this context is ultimately going to be discarded. We apply this new proof to a compartment isolation…
PDF arXiv
arXiv cs.AIOct 19
AuDQ: Auditable Data Quality through Agentic Rule Discovery
Jacopo Biggiogera, Nicolas Colombo, Krati Saxena, Bhaskarjit Sarmah, Stefano Pasquali
High-stakes tabular pipelines rely on scattered, static quality checks that are hard to evolve and audit against policy intent. Regulated domains particularly suffer as the LLM-era automation raises expectations for traceability and accountability. We propose a vision for an ontology-grounded, repository-native data quality layer in which rules are first-class artifacts: versioned, provenance-linked to governance texts, and re-playable through immutable execution traces. As a first step toward validating this vision, we present a concrete implementation of its agentic rule-discovery core with two rule acquisition modes (Full-Agentic and Guided) and a human-in-the-loop (HITL) review interface. We define an evaluation framework and run experiments addressing whether our fully autonomous, divide-and-conquer agentic rule discovery produces rules of the same quality and diversity as those specified by a human expert, reporting preliminary results on two real world industry datasets in the finance and retail domains.
PDF arXiv
arXiv cs.AIOct 19
SPEM: Structure-Aware Procedural Memory for Efficient Skill Use in LLM Agents
Ran Zhou, Zehui Kong, Fanyu Lin, Jiaheng Liu, Zhen Zhang +1
LLM-based agents increasingly rely on reusable skills. However, scaling skill libraries makes efficient and accurate skill use difficult. Full skill loading incurs high token and runtime overhead. In contrast, flat semantic retrieval treats skills as independent text entries, ignoring dependencies, execution order, state transitions, and data flow constraints. We propose SPEM, a lightweight structure-aware procedural memory framework for efficient skill use in LLM-based agents. SPEM maintains Atomic Skill Memory for individual skills and Skill-DAG Memory for reusable compositions derived from successful executions. For a new task, SPEM reuses high-confidence Skill-DAG templates when available. Otherwise, it retrieves atomic skills and invokes Skill-GNN for state- and structure-aware skill selection. Successful executions are written back as new Skill-DAGs, allowing procedural memory to accumulate over time. Experiments on ALFWorld and SkillsBench show that SPEM achieves the best overall effectiveness--efficiency trade-off, reaching 87.1% ALFWorld success and 38.38% SkillsBench reward while reducing token and runtime costs against strong baselines.
PDF arXiv
arXiv cs.CROct 19
SPLASH: Contrastive Audit Pressure for Detecting and Localizing Security Hallucinations in Generated Code
Mirza Masfiqur Rahman, MD Ajwad Akil, Imtiaz Karim, Ashish Kundu, Ramana Kompella +1
Code generated by large language models often passes every functional test while remaining insecure. These security hallucinations are common, written with high confidence, and repeated across samples, so neither the generator's own uncertainty nor static analyzers reliably catch them. We introduce SPLASH, which is guided by a new measure called audit pressure. It contrasts teacher-forced log-probabilities for the generated program under a security review and a style review. Aggregated to statements and programs, and grounded in a probabilistic model of competing edits, audit pressure allows SPLASH to choose the secure program among a model's candidate programs and locate the vulnerable statement, with no model training, CWE-specific rules, or internal access to the generating model. On 63,684 programs generated by 12 models for 899 tasks, SPLASH picks secure code in 74% of cases, places the vulnerable statement first in 58% of insecure programs, and chooses better than a frontier LLM judge.
PDF arXiv
arXiv cs.MAOct 19
Behavioral Probes for Information Flow in LLM Swarms
Junhui Chen, Yu Zhang, Lantian Li, Dong Wang
Most existing approaches to LLM swarm optimization are utility-driven, focusing on final task utility while leaving the processing, integration, and reliance of information within individual interactions largely implicit. To address this, we study LLM swarm interactions from an information-flow-based view and introduce behavioral probes to quantify information flow patterns. Specifically, we repurpose External Context Score (ECS) and Parametric Knowledge Score (PKS)---originally designed for hallucination analysis---to measure a node's external-context dependence and parametric-knowledge dependence, respectively. Across controlled and realistic swarm settings, we observe consistent patterns: ECS increases with input relevance and distinguishes useful multi-source contributions, while PKS decreases as informative context accumulates. Building on this heuristic interpretation, we demonstrate how these probes can complement utility-driven structure optimization in two controlled applications. Probe-guided node pruning reduces redundant communication and token consumption, and probe-guided reasoning-path search accelerates convergence compared to utility-only baselines. Our empirical…
PDF arXiv

Papers

Top tools here

Coming with more sources: stars history

All tools

Agno4 releases this week
FastMCP6 releases this week
n8n+25% downloads · 148.3k/wk+25.0%
DeepEval+15% downloads · 769.3k/wk+14.7%
Ragas+14% downloads · 319.9k/wk+13.6%

Topics in this field

coding agents · code generation · coding agent286 papers85 this week
skills · tasks · ai308 papers64 this week
recursive self improvement · harness evolution · adaptive260 papers50 this week
tool using agents · agent systems · multi agent209 papers49 this week
ai agents · indirect prompt injection · adversarial314 papers48 this week
vision language · safety evaluations · safety alignment115 papers38 this week

Recently funded

Market

Asymptote LabsSeed · Oct 20$5.5M
GreptileSeries B+ · Oct 19$50M
VesslaPre-seed · Oct 19$3.3M
SupaHumanSeries A · Oct 19$1.5M
BoxLiteSeed · Oct 19undisclosed

Active contributors · 90 days

Recent papers

All in Research →

arXiv cs.AIOct 19
CUA-Lite: An Open Platform for Computer Use Agents
Zhanhui Zhou, Weichen Zhang, Haoran Liu, Lingjie Chen, Tianneng Shi +4
Open resources for computer use agents (CUAs) -- environments, datasets, and models -- remain scattered: without a standard, these resources cannot be integrated and scaled; additionally, evaluation, RL, and SFT cannot share one infrastructure. We present CUA-Lite, an open platform for developing CUAs, built around three standardized abstractions: (1) Unified environment interface, under which we integrate 12 benchmarks across desktop, browser, and mobile, plus lightweight VM-free sandboxes that replicate OSWorld's desktop at much lower cost, providing over 30,000 verifiable tasks. (2) Unified supervised data format, into which we convert the major public CUA datasets, from GUI grounding and understanding to full rollouts, and record our fresh rollouts from frontier CUAs on these verifiable environments. (3) Model harnesses shared across evaluation, RL, and SFT, one per model and implemented for 14 model families. Each harness runs its model in these computer environments, producing the rollouts that evaluation and RL consume, or renders stored supervised data into the model's own training format for SFT. We release reference scores across the integrated benchmarks, and show that…
PDF arXiv
arXiv cs.PLOct 19
Blame-aware Recomposition for Secure Compilation Proofs of Low-Level Compartment Isolation
Basile Schlosser, Jérémy Thibault, Catalin Hritcu
The security guarantees of existing formally verified compilers for compartmentalized programs in unsafe languages like C stop at a rather high level, assuming a built-in protection mechanism and a block-based memory model. Verifying a concrete, low-level enforcement mechanism for compartment isolation is still a major challenge for current proof techniques. In particular, Abate et al.'s proof technique fails because one of their proof steps, recomposition, essentially requires hiding all information about the code of each compartment, which is not practically achievable at a low level. We propose an extension of their proof technique to a low-level setting where compartments can fully observe each other's code. To do so, we introduce an overlay semantics that allows us to characterize these observations as a form of undefined behaviour, and we use a novel variant of recomposition that we call blame-aware recomposition, which essentially allows recomposing executions as needed in the original high-level proof technique, even if the low-level context observes the code, because this context is ultimately going to be discarded. We apply this new proof to a compartment isolation…
PDF arXiv
arXiv cs.AIOct 19
AuDQ: Auditable Data Quality through Agentic Rule Discovery
Jacopo Biggiogera, Nicolas Colombo, Krati Saxena, Bhaskarjit Sarmah, Stefano Pasquali
High-stakes tabular pipelines rely on scattered, static quality checks that are hard to evolve and audit against policy intent. Regulated domains particularly suffer as the LLM-era automation raises expectations for traceability and accountability. We propose a vision for an ontology-grounded, repository-native data quality layer in which rules are first-class artifacts: versioned, provenance-linked to governance texts, and re-playable through immutable execution traces. As a first step toward validating this vision, we present a concrete implementation of its agentic rule-discovery core with two rule acquisition modes (Full-Agentic and Guided) and a human-in-the-loop (HITL) review interface. We define an evaluation framework and run experiments addressing whether our fully autonomous, divide-and-conquer agentic rule discovery produces rules of the same quality and diversity as those specified by a human expert, reporting preliminary results on two real world industry datasets in the finance and retail domains.
PDF arXiv
arXiv cs.AIOct 19
SPEM: Structure-Aware Procedural Memory for Efficient Skill Use in LLM Agents
Ran Zhou, Zehui Kong, Fanyu Lin, Jiaheng Liu, Zhen Zhang +1
LLM-based agents increasingly rely on reusable skills. However, scaling skill libraries makes efficient and accurate skill use difficult. Full skill loading incurs high token and runtime overhead. In contrast, flat semantic retrieval treats skills as independent text entries, ignoring dependencies, execution order, state transitions, and data flow constraints. We propose SPEM, a lightweight structure-aware procedural memory framework for efficient skill use in LLM-based agents. SPEM maintains Atomic Skill Memory for individual skills and Skill-DAG Memory for reusable compositions derived from successful executions. For a new task, SPEM reuses high-confidence Skill-DAG templates when available. Otherwise, it retrieves atomic skills and invokes Skill-GNN for state- and structure-aware skill selection. Successful executions are written back as new Skill-DAGs, allowing procedural memory to accumulate over time. Experiments on ALFWorld and SkillsBench show that SPEM achieves the best overall effectiveness--efficiency trade-off, reaching 87.1% ALFWorld success and 38.38% SkillsBench reward while reducing token and runtime costs against strong baselines.
PDF arXiv
arXiv cs.CROct 19
SPLASH: Contrastive Audit Pressure for Detecting and Localizing Security Hallucinations in Generated Code
Mirza Masfiqur Rahman, MD Ajwad Akil, Imtiaz Karim, Ashish Kundu, Ramana Kompella +1
Code generated by large language models often passes every functional test while remaining insecure. These security hallucinations are common, written with high confidence, and repeated across samples, so neither the generator's own uncertainty nor static analyzers reliably catch them. We introduce SPLASH, which is guided by a new measure called audit pressure. It contrasts teacher-forced log-probabilities for the generated program under a security review and a style review. Aggregated to statements and programs, and grounded in a probabilistic model of competing edits, audit pressure allows SPLASH to choose the secure program among a model's candidate programs and locate the vulnerable statement, with no model training, CWE-specific rules, or internal access to the generating model. On 63,684 programs generated by 12 models for 899 tasks, SPLASH picks secure code in 74% of cases, places the vulnerable statement first in 58% of insecure programs, and chooses better than a frontier LLM judge.
PDF arXiv
arXiv cs.MAOct 19
Behavioral Probes for Information Flow in LLM Swarms
Junhui Chen, Yu Zhang, Lantian Li, Dong Wang
Most existing approaches to LLM swarm optimization are utility-driven, focusing on final task utility while leaving the processing, integration, and reliance of information within individual interactions largely implicit. To address this, we study LLM swarm interactions from an information-flow-based view and introduce behavioral probes to quantify information flow patterns. Specifically, we repurpose External Context Score (ECS) and Parametric Knowledge Score (PKS)---originally designed for hallucination analysis---to measure a node's external-context dependence and parametric-knowledge dependence, respectively. Across controlled and realistic swarm settings, we observe consistent patterns: ECS increases with input relevance and distinguishes useful multi-source contributions, while PKS decreases as informative context accumulates. Building on this heuristic interpretation, we demonstrate how these probes can complement utility-driven structure optimization in two controlled applications. Probe-guided node pruning reduces redundant communication and token consumption, and probe-guided reasoning-path search accelerates convergence compared to utility-only baselines. Our empirical…
PDF arXiv

Activity · 12 weeks

Coming with more sources: repos

Fields · AI · updated 39m ago

Agents

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

552papers this week+7.6% vs last week

All papers · 2.5k With code · 113

Newest Most relevant

2.4k papers this month

Open problems in Agents

Long-horizon task execution and evidence accumulation3 papers raise it · 2 address it
Agents struggle to sustain multi-step reasoning, adapt strategies, and turn intermediate results into final deliverables in real-world tasks.
- 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
Realistic evaluation of agentic learning from experience1 paper raises it · 1 addresses it
Existing benchmarks often test reasoning with pre-existing knowledge rather than learning from novel, unfamiliar environments.
- Learn2Play Bench: How Well Do LLM Agents Learn from Experience in Unfamiliar Environments?raises · addresses
Faithful agent development from natural-language requirements1 paper raises it · 1 addresses it
Coding agents often fail to deliver agents that truly meet the specified requirements, not just appear to.
- AgentSWE: Can Coding Agents Build the Agent You Actually Want?raises · addresses
Detecting when past context matters in long conversations1 paper raises it · 0 address it
AI systems cannot reliably identify when historical context is relevant for current interactions in long-term companionship.
- RealCompanion: Benchmarking Human Understanding from Reasoning over Longitudinal Real-World Conversationsraises
Scalable and realistic GUI agent training and evaluation1 paper raises it · 2 address it
High cost and scarcity of realistic interactive environments limit progress in GUI agent training and evaluation.
- MAI-Gym: An Open All-in-One Platform for GUI Agent Evaluation and RL Training across Mobile and Computer Environmentsraises · addresses
- OpenGCUA: Toward a Fully Open Stack for Generalist Computer Useaddresses

Named by an AI from these papers' abstracts.