Hybrid Computer Use gives agents three ways into a computer instead of forcing them through the screen
AspireAI community · arXiv
Screenshot-and-mouse interfaces bake in a human-interaction prior: the agent has to re-read the screen constantly, while the machine's semantic and programmatic capabilities stay unused. Hybrid Computer Use (HCU) is a unified interface for general agents that combines three complementary channels - programmatic interaction through code and command-line tools, semantic interaction through the accessibility (AX) tree, and visual interaction through the GUI - and lets the model choose and combine them. The AX tools return compact observations, execute actions in batches and report their effects as AX diffs so the model needs fewer round trips, and HCU guards against stale-state actions while switching channels. On OSWorld 2.0 the authors report HCU achieves the highest Partial and Binary scores among the compared systems, and that all evaluated models improve with HCU while allocating work across the channels differently and consistently beating the baselines on both efficiency and task success. The limitation is that the evidence is one benchmark and the compared systems are the authors' own choices; the paper is a preprint with no peer review noted.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.