Large language model agents increasingly rely on execution traces to master complex interactive tasks. However, current paradigms are bottlenecked by shallow trajectory retrieval and flat skill summarization, fundamentally ignoring the temporal dependencies and outcome-conditioned topology of agent behavior. We introduce Trace2Tower, a transition-aware EigenTrace framework that distills raw trajectories into a robust skill hierarchy. Trace2Tower abstracts step-level interactions into canonical events, constructing a unified graph governed by semantic compatibility, transition dynamics, and outcome evidence. Through a novel contrastive spectral decomposition, it isolates stable, success-aligned behavioral modes while rigorously suppressing failure-prone shortcuts. These modes organically populate a dynamic skill tower of action templates, procedural routines, and overarching task strategies, continuously refined via verifier-guided feedback. On ALFWorld, Trace2Tower achieves 87.31% success requiring only 10.35 steps and 0.26 invalid actions; on WebShop, it reaches 50.67% exact success. Across both benchmarks, Trace2Tower significantly outperforms existing baselines in task mastery and context-efficient experience reuse.
Figures & tables
Figure 1: From experience reuse to behavioral structure induction. Existing methods transform trajectories into reusable insights or skills, but the underlying behavioral relations remain implicit. Trace2Tower recovers success-aligned behavioral structures through semantic, transition, and outcome-aware EigenTrace induction.
Figure 2: Event-level abstraction from raw agent trajectories. Trace2Tower converts successful and failed step-level executions into ordered canonical event sequences for subsequent behavioral structure induction.
Figure 3: Construction of the transition-aware EigenTrace graph. The outcome-conditioned edge affinities Auv± geometrically integrate semantic compatibility suv , transition dependency tuv± , and outcome compatibility ouv± , which are further gated by an edge mask Muv and scaled by evidence strength ωuv to yield robust behavioral topologies.
Figure 4: From success-aligned EigenTrace decomposition to hierarchical skill tower induction.
Method
ALFWorld
WebShop
Success % ↑
Steps ↓
Invalid ↓
Input Tokens ↓
Skill Context Chars ↓
Exact Success % ↑
Reward ↑
Invalid ↓
No-Skill
46.27±5.83
15.58
0.58
49,052
0
40.67±0.58
0.6776±0.0044
0.68±0.03
Expert-Crafted
71.39±4.11
12.01
0.38
41,502
3,286
48.00±0.00
0.7183±0.0000
0.07±0.02
Trace2Skill +Combined
61.44±2.15
13.91
0.28
67,186
9,508
40.67±0.58
0.5580±0.0084
2.39±0.07
Trace2Skill +Error
61.19±1.29
14.19
0.37
73,447
11,447
44.00±0.00
0.5892±0.0055
1.81±0.02
SkillX
78.61±3.53
12.06
0.40
64,229
10,039
49.33±2.08
0.6922±0.0102
0.32±0.04
Table 1: Overall performance and inference efficiency on ALFWorld and WebShop across three independent runs. Bold and underline denote the best and second-best automatic methods.
Figure 5: ALFWorld success rates (%) by task family and method. Outlined columns denote the two Trace2Tower deployment policies.
Figure 6: Structural ablation on ALFWorld: (a) success rate and (b) induced procedure and strategy skills.
Figure 7: Success–cost trade-offs on ALFWorld and WebShop over three runs.
Experience
Skill User
DeepSeek-V4 Flash
DeepSeek-V4 Pro
No-Skill
52.99
66.42
GPT-5.4 Tower
88.06
85.82
DeepSeek-V4 Flash Tower
65.67
79.10
Table 2: ALFWorld success (%) by experience condition and Skill User.
Figure 8: Deployment success and observed range over two held-out ALFWorld sets.
Figure 9: Hierarchy organization: (a) supporting event segments per procedure, (b) strategy-path reuse per procedure, and (c) procedures per strategy path.
Appendix figures & tables6 assets
Supplementary material from the paper’s appendix.
Appendix
Stage
Input
Main operation
Output
Event abstraction
Raw trajectory
Segment and canonicalize
E
Graph induction
Canonical events
Semantic + transition + outcome evidence
A+,A−
Contrastive graph
A+,A−
Failure-aware transformation
Aˉ
Procedure induction
Aˉ
Component-wise spectral clustering
S(2)
Strategy induction
Procedure sequences
Directed graph + SCC paths
S(3)
Deployment
Skill tower
High plan + optional Mid support
Retrieved context
Appendix
Table 3: Trace2Tower representations and their roles.
Stage
Time
Working memory
Event abstraction
O(S)
O(n)
Embedding / quotienting
O(nd)
O(nd)
Graph statistics
O(n+ed)
O(m+e)
Component eigensystems
O(∑cmc3)
O(maxcmc2)
Procedure clustering
O(∑cmcrc2)
O(maxcmcrc)
Strategy graph / SCCs
O(P+ERd+R+ER)
O(Rd+ER)
Appendix
Table 4: Dominant time and working-memory costs of the reported pipeline.
Benchmark
Train tasks
Rollouts/task
Trajectories
Test tasks
ALFWorld
310
4
1,240
134
WebShop
100
4
400
100
Appendix
Table 5: Construction and evaluation pools. Both benchmarks use a 20-step interaction horizon.
Setting
Value
Outcome pseudo-counts
1 success + 1 failure
Minimum nontrivial component
3 nodes
Zero-degree tolerance
10−12
K -means initializations
20
K -means maximum iterations
300
Random seed
42
Appendix
Table 6: Essential graph-induction and deployment settings.
Variant
Retained signals
Mid/High
Success
Full
S+T+O+C
39/118
87.31±0.75
No Transition
S+O+C
19/76
70.15
No Outcome
S+T+C
39/106
73.88
No Contrastive
S+T+O
10/44
73.88
Appendix
Table 7: ALFWorld structural ablations. S, T, O, and C denote semantic, transition, outcome, and contrastive evidence. Each ablation is one 134-task evaluation; Full is the three-run mean.
Edit
Target
Structural effect
Split
Heterogeneous procedure
Creates evidence-specific children while retaining the parent
Merge
Compatible procedures
Contracts evidence and supported relations into one procedure
Promote
Supported Mid path
Adds a reusable strategy motif
Downweight
Harmful High skill
Adds a reversible retrieval penalty without deleting the skill