← heapsort-ai

representation learning

23 items

ARTICLEDEV.to AI·4/11/2026

Sparse Federated Representation Learning for deep-sea exploration habitat design for low-power autonomous deployments

The author explores federated learning to overcome latency challenges in voluminous sensor data from multi-robotic autonomous vehicles, optimizing processing in low-bandwidth environments. This approach seeks a distributed alternative to centralized data synchronization through distributed model updates.

29
RESEARCHarXiv CS.AI·27d ago

Don't Look at the Numbers: Visual Anchoring Bias and Layer-wise Representation in VLMs

This research paper demonstrates that embedded numeric anchors on images systematically bias Vision-Language Model quality judgments across multiple VLMs. Layer-wise probing reveals that optimal layers for quality prediction are deeper than where anchor classification saturates, establishing a causal account of visual anchoring bias.

29
RESEARCHarXiv CS.LG·4/21/2026

SetFlow: Generating Structured Sets of Representations for Multiple Instance Learning

This work introduces SetFlow, a generative architecture that models entire Multiple Instance Learning (MIL) bags directly in the representation space. It leverages the flow matching paradigm and a Set Transformer-inspired design to capture intra-bag dependencies and generate coherent, semantically consistent representations.

27
RESEARCHarXiv CS.LG·5/8/2026

Data-Driven Variational Basis Learning Beyond Neural Networks: A Non-Neural Framework for Adaptive Basis Discovery

This manuscript introduces Data Driven Variational Basis Learning (DVBL), a novel non-neural framework for learning data-adaptive basis functions directly from high-dimensional data. It provides an explicit, interpretable, and mathematically transparent alternative to neural networks for representation learning, addressing their limitations in control and transparency.

27
RESEARCHarXiv CS.LG·4/13/2026

Distilling Genomic Models for Efficient mRNA Representation Learning via Embedding Matching

This paper introduces a distillation framework to make large genomic foundation models for mRNA representation learning more efficient, reducing model size by 200-fold. By using embedding-level distillation, the smaller model achieves state-of-the-art performance on mRNA-related tasks, demonstrating an effective strategy for scalable biological AI.

27
RESEARCHarXiv CS.CL·5/5/2026

H-Probes: Extracting Hierarchical Structures From Latent Representations of Language Models

This paper introduces H-probes, linear probes designed to extract hierarchical structure, specifically depth and pairwise distance, from the latent representations of large language models. The research shows these probes robustly find low-dimensional subspaces crucial for performance in synthetic tree traversal tasks, generalizing well both within and out-of-domain.

27
RESEARCHarXiv CS.LG·4/16/2026

The Long Delay to Arithmetic Generalization: When Learned Representations Outrun Behavior

This research investigates the 'grokking' phenomenon in transformers, finding that the long delay to generalization in arithmetic models stems from a decoder bottleneck. The encoder acquires relevant structural knowledge early, but the decoder struggles to access it, a hypothesis supported by causal interventions like transplanting encoders.

27
RESEARCHarXiv CS.LG·25d ago

A Unified Geometric Framework for Weighted Contrastive Learning

Contrastive learning aims to preserve relational structure in sample representations by reflecting a similarity graph. This paper interprets weighted InfoNCE objectives as Distance Geometry Problems, providing a unified geometric framework and exact characterizations of optimal embeddings, revealing how class imbalance affects inter-class similarities in SupCon.

27
RESEARCHarXiv CS.LG·5/7/2026

Transformation Categorization Based on Group Decomposition Theory Using Parameter Division

This research explores unsupervised categorization of transformations between input pairs using algebraic constraints, aiming for a principled understanding of good representations. It introduces parameter division to refine prior Galois-theoretic methods, addressing their reliance on auxiliary assumptions and improving the decomposition of groups.

27