- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a temporal-graph learning (TGL) controller, which uses a lightweight graph model to determine when an proactive agent invokes an action and what context should it read. This method achieves better performance than LLM triggers even when used for shorter durations. It is an interesting and highly efficient Graph4LLM approach. The authors elegantly demonstrate how structured information can benefit both models and agents, leading to performance gains.
Critical strengths
With a shorter runtime, the TGL method proposed in this paper achieved better results than directly invoking an LLM on the trigger of proactive agent, runnable on a consumer laptop.
More importantly, what this paper attracts me most is that it shows an elegant method to leverage structured graph information in an agent task, achieving both improvement in performance and decreasement in latency.
Critical weaknesses
I think the main issue with this paper lies in how the graphs are constructed. For two different benchmarks, the authors chose two entirely different graph-construction approaches, resulting in two distinct graph systems. This approach limits the method’s generalizability: for each similar task across different domains, the method requires the construction of a new graph-building workflow and a new graph system. While this validates the effectiveness of the graph-building paradigm for proactive agent, it leaves its generalizability open to question.
The two benchmarks do not actually evaluate the same capability. ProactiveAgent focuses on whether to intervene and which entities to focus on, while Fingertip-20k focuses on intent prediction and candidate retrieval. They use different graph structures, prediction heads, and downstream processes to evaluate different tasks. This also affects the generalizability of the methodology.
Questions for authors
What factors shaped the design approaches for the (two different) graph systems?
In ProactiveAgent, how effective are entity deduplication? Is there a way to quantify this using certain metrics?
3 comments
Q2. Entity deduplication. Applications are normalized through a fixed alias map. Other identities combine entity type with a normalized surface string. Equal identities are reused within each graph. Separate graphs have separate node states. This directly links repeated references to the same named artifact or category.
We quantify deduplication on the desktop test sessions with three structural measures over entity and category nodes:
| Measure | Value |
|---|---|
| Node reduction relative to one node per mention | 65.9% |
| Nodes that recur within their session | 44.6% |
| Nodes linking events more than three steps apart | 38.0% |
Shared nodes give the encoder long-range connections. Through temporal edges alone, the three-layer encoder reaches at most three preceding events. A shared entity node links any two events that mention it within two hops, and 85% of recurring nodes create such links beyond the temporal reach. Persistent identities also enable embedding reuse during streaming inference: recurring entities keep their cached text embeddings, so each update encodes only the current event and newly encountered entities (Sec. 4.1 and App. F.10).
The representation also supports new artifact instances: 100% of test query, file and URL identities are unseen in the controller's training graphs. Their text and type features are processed with shared model parameters, so graph construction naturally accommodates new names.
Thank you for the detailed responses. The clarifications on the shared graph design and the quantitative analysis of entity deduplication have addressed my main concerns. While some questions about cross-task generalizability remain open, I find the responses satisfactory and will maintain my original assessment.
Thank you for recognizing the value of a compact graph model for proactive control. We clarify the common graph design and quantify entity reuse below.
Q1. Platform adaptation and shared graph design. The two benchmarks originate from different device platforms: desktop activity in ProactiveAgent and smartphone usage in FingerTip. Each provides records collected and processed by its own authors, with different data formats, available fields and supervision. We construct one pipeline for each dataset to map its released records into the same activity–entity graph design (Apps. B.1–B.2).
The on-device nature of proactive assistance makes the platform's activity interface central to this mapping. Evaluating across desktop and mobile environments therefore requires adapting to their respective interfaces, much as an application needs platform-specific integration when distributed through different app ecosystems. Within a platform, the construction rules are fixed and reused across sessions.
The table separates the design shared by both pipelines from the parts set by each platform's records and benchmark target (App. B).
Desktop supervision supplies task suggestions and acceptance information, which support wake-up and artifact-selection targets. FingerTip supplies the next-intent target and categorical usage fields, so its current-episode representation predicts an intent embedding for retrieval. These choices apply the common activity–entity representation to each benchmark's available records and target. FingerTip tests the portability of the graph-encoding design to mobile intent prediction. Desktop intervention timing is evaluated on ProactiveAgent.
The desktop mapping uses deterministic rules for the fields represented by its graph (App. B.1, Table 3):
App. E.3 (Table 11) reports sensitivity to these node groups and feature channels, with the controller trained on each variant.
This construction reflects our broader design principle: represent the platform's available entities with a fixed schema and use conventional components throughout, including TGL itself. Our focus is what a small, standard GNN can achieve as a joint trigger and entity router for frozen language agents (Sec. 4.1 and App. F.2–F.6).