Papers with TPA
SpiderFlow: Efficient Topology-Aware Scheduling for LLM Training Across Decentralized GPU Clusters (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to training large language models lack topologyaware task scheduling mechanisms and model parallelization strategies. |
| Approach: | They propose a topology-aware scheduling system specifically designed for decentralized GPU clusters . they propose heuristic methods at the inter-cluster level with ILP-based optimization within clusters. |
| Outcome: | The proposed system reduces job completion time by 1.2-1.3 and improves throughput by 1.12-1.25 . it also reduces scheduling overhead by 20-90 on average compared to state-of-the-art scheduling systems. |
TPA: Next Token Probability Attribution for Detecting Hallucinations in RAG (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches attribute hallucinations to a binary conflict between internal knowledge stored in FFNs and the retrieved context. |
| Approach: | They propose a framework which mathematically attributes each next-token probability to seven distinct sources and aggregates source attributions by POS tags to quantify contribution of each model component to the generation of specific linguistic categories within a response. |
| Outcome: | Extensive experiments show that the proposed framework achieves state-of-the-art performance. |