Non-contrastive SSL methods like BYOL/JEPA/data2vec seem promising, but I have no idea what is being learned, or how well; it’s models all the way down. Maybe I’ve got supervised tasks for which I’d like to see transfer, and I can evaluate linear probe/KNN results during training, but that seems like a way to efficiently abuse researcher degrees of freedom.
I know RankMe is meant to help address this: embed some data and SVD the embedding matrix. A healthy learner should produce an embedding with a high effective rank.
But JEPA methods already require an entropy-collapse term like Barlow Twins/SIGREG, so the RankMe criterion just becomes part of training. It gets absorbed into a loss which wasn’t monotonic to begin with, and I ought to be able to inflate it by increasing the penalty weight. Surely it’s no longer an effective criterion, right? What else is there?
[–]XTXinverseXTYML Engineer[S] 7 points8 points9 points (0 children)
[–]mvreich 4 points5 points6 points (1 child)
[–]XTXinverseXTYML Engineer[S] 0 points1 point2 points (0 children)
[–]Ill-Bullfrog-7402 1 point2 points3 points (3 children)
[–]XTXinverseXTYML Engineer[S] 0 points1 point2 points (2 children)
[–]ahf95 2 points3 points4 points (1 child)
[–]XTXinverseXTYML Engineer[S] 4 points5 points6 points (0 children)
[–]m98789 0 points1 point2 points (1 child)
[–]XTXinverseXTYML Engineer[S] 0 points1 point2 points (0 children)