Tim Rudner, Yann Lecun, Erik Learned-Miller, Randall Balestriero, Yilun Kuang, Deep Chakraborty, Yash Dagade
We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| YilunKuang/RadialVCReg | — | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| RadialVCRegLoss | Ran | YilunKuang/RadialVCReg/synthetic_experiments/train_xdist.py code served (permissive licence) · get_code("b92fd279d57c3360") |
| embedding_sparsity_metric | Ran | YilunKuang/RadialVCReg/synthetic_experiments/train_xdist.py code served (permissive licence) · get_code("4bda68cfe484890c") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Self-supervised learning aims to learn maximally informative representations, but explicit information maximization is hindered by the curse of dimensionality. Existing methods like VCReg address this by regularizing first and second-order feature statistics, which cannot fully achieve maximum entropy. We propose Radial-VCReg, which augments VCReg with a radial Gaussianization loss that aligns feature norms with the Chi distribution-a defining property of high-dimensional Gaussians. We prove that Radial-VCReg transforms a broader class of distributions towards normality compared to VCReg and show on synthetic and real-world datasets that it consistently improves performance by reducing higher-order dependencies and promoting more diverse and informative representations.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2602.14272")
get_code_for_paper("2602.14272")
have("2602.14272")
Connect an agent — have() is free.