ScienceJudge ranked first on the NLPCC 2026 scientific-claim verification leaderboard, lifting its local dev average from 0.8124 to 0.8692
AspireAI community · arXiv (ScienceJudge, Cai et al.; NLPCC 2026 Shared Task 10)
Sentence-level scientific claim verification decides whether each sentence in an AI-generated paragraph is supported by a multimodal evidence bundle, and the failure mode is subtle: a sentence stays fluent and plausible while drifting from its evidence. Pattern Perturbation Augmentation models reporting errors as label-specific faithfulness-breaking transformations, induces reusable error patterns from labeled examples, and applies them to supported claims to build controlled hard negatives with pattern-level, operation-level and cross-domain augmentation. The resulting ScienceJudge ensembles PPA-trained vision-language predictors with instruction-guided LLM predictors, improves the local dev average score from 0.8124 to 0.8692 with 0.8466 Macro-F1, and ranks first on the official NLPCC 2026 Task 10 Track 1 leaderboard with a final score of 0.6890. The leaderboard score and the local dev score are different measures on different data, so they should not be compared directly.
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.