aspireai.
PUBLIC EDITION

The deepfake checkpoint with the best validation score was the one most likely to break on real photos, and averaging the training trajectory fixed it

AspireAI community · arXiv (PairCLIP-SWA)
Deepfake detectors ship as a single checkpoint chosen by validation score, and PairCLIP-SWA shows how fragile that choice is. It adapts an OpenCLIP ViT-L/14 visual tower by progressive block unfreezing on a class-balanced corpus built with CLIP-similarity-guided subsampling, then averages the fine-tuning trajectory in weight space. On the IEEE SP Cup 2025 DF-Wild-Cup benchmark it reaches 97.04% accuracy, 98.64% AU-ROC and a 4.07% equal error rate against 94.46%, 97.60% and 5.00% for the strongest published three-backbone ensemble. The sharper finding is the misranking: on an OpenForensics-derived benchmark the checkpoint validation picks scores 98.43% but only 88.85% on a disjoint 10,905-image test partition, rejecting 21.1% of genuine photographs, while the terminal average, ranked last on validation, scores 94.76%. The authors recommend per-class selection criteria measured off the early-stopping split. Code is at github.com/DarkJ0Y/PairCLIP-SWA.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.