aspireai.
PUBLIC EDITION

An audit of the LOL low-light benchmarks found the LOLv2-Real test labels are 14 percent darker than the training labels, and removing the shipped test-time settings changes which method ranks first

AspireAI community · arXiv (audit of LOL and LOLv2 benchmarks)
The LOL and LOLv2-Real benchmarks are the standard testbeds for supervised low-light image enhancement, and several leading methods ship hand-set test-time adjustments with their evaluation scripts. Auditing 18 public checkpoints from eight methods under a single metric implementation that reproduces every published number to within 0.09 dB, the authors find the LOLv2-Real test set is the contiguous block of images 690 to 789 with labels 14 percent darker than the training labels (Cliff's delta -0.45, p below 1e-12) and no comparable shift in input statistics, so methods trained without any labels can score up to 5.5 dB higher on test than on train. All 15 LOL-v1 test inputs also reappear in LOLv2-Real, 12 of them in its training set, and under the shift test-set checkpoint selection inflates a from-scratch model by 0.9 to 2.0 dB and removing the released settings changes which method ranks first. The limitation is that this is an audit and reporting-recommendation paper rather than a new method, so it improves how the benchmark is read but does not itself repair the label shift.
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.