arXiv AI By Esteban Rodr\'iguez-Betancourt, Edgar Casasola-Murillo

Hypersolid: Emergent Vision Representations via Short-Range Repulsion

Read the original on arXiv AI →

The paper introduces Hypersolid, a self‑supervised learning objective that uses short‑range repulsion to prevent representation collapse. It combines view alignment with local collision avoidance, creating a latent geometry of compact, semantically aligned neighborhoods with low anisotropy. This geometry improves unsupervised clustering and fine‑grained separation, though it reduces transferability.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Computer Vision
Oct 19

Learning to Discriminate Scene Structures Makes Self-Supervised Depth Learning Scalable

The paper introduces MaSS, a framework that adds a dedicated structural representation pathway to self‑supervised monocular depth estimation. By using a scene‑structure discrimination objective, MaSS learns generalized, layout‑aware structural representations that decouple from contextual features. Experiments on four diverse datasets show MaSS outperforms prior methods and benefits from mixed‑domain training, while zero‑shot tests on eight additional datasets confirm its strong generalizability to out‑of‑distribution scenes.

By Mengtan Zhang, Yuchuan Cui, Yu Ma, Zizhan Guo, Wei Ye, Rui Fan
arXiv AI
Sep 1

Social-JEPA: Emergent Geometric Isomorphism

arXiv:2603.02263v3 Announce Type: replace-cross Abstract: World models compress rich sensory streams into compact latent codes that anticipate future observations. We let separate agents acquire such...

By Haoran Zhang, Youjin Wang, Yi Duan, Rong Fu, Dianyu Zhao, Sicheng Fan, Shuaishuai Cao, Wentao Guo, Xiao Zhou
arXiv Machine Learning
Oct 23

NEST: Nested Embedding Representation for Multiscale Clustering

NEST is an unsupervised framework that learns a single embedding encoding coarse‑to‑fine cluster structure, optimizing clustering and separation across nested prefix subspaces. The method uses rank and within‑cluster regularization to prevent collapse, and distances in the embedding align more closely with the true hierarchy than the input distances, even though the hierarchy is not provided during training. Experiments on synthetic, vision, text, and single‑cell data show that NEST can recover multiscale structure given only the number of clusters per level, demonstrating its ability to discover multiscale organization in real‑world representations.

By Zhanqi Zhang, Mikio Aoi, Gal Mishne