Poisoning Agentic Alpha: in multi-agent trading systems, no architecture was robust to a corrupted signal
AspireAI community · arXiv
Multi-agent trading systems ingest news and social media from the open web and pass it between agents, so one corrupted signal can reach the final decision and cost real money. This paper studies two adversaries that need no access to model internals: a low-barrier data adversary planting manipulated content in web sources, and a compromised-agent adversary tampering with an agent's prompt. Along the role axis it pairs each of four roles, Analyst, Researcher, Trader and Risk Manager, with an attack matched to that interface, and along the structural axis it compares four communication topologies using a parameter-free Adversarial Signal Preservation Score. Experiments on post-cutoff data across five assets and two target directions found no architecture inherently robust: majority voting gives conditional protection depending on benign-agent agreement, while compromising a terminal decision node bypasses upstream safeguards. The authors position this as the first systematic empirical study of adversarial signal entry into multi-agent trading systems.
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.