Equivariant Representation Learning

Overview

Equivariant representation learning studies how to encode data so that transformations such as rotation or translation produce corresponding, predictable changes in a model’s features. Group-equivariant convolutions, irrep-based graph networks, and equivariant transformers encode these rules directly; data augmentation and self-supervised consistency objectives can encourage them from examples, and some methods learn the transformations themselves. These representations are useful in vision, molecular and physical prediction, robotics, and audio, where they can support data efficiency and generalization across viewpoints or configurations. A central tension is balancing exact symmetry guarantees with flexibility, computational cost, and task accuracy: exact equivariance ensures consistent behavior across transformations but does not guarantee strong predictions, while softer or learned symmetry may be easier to scale but can miss important constraints.

Latest papers

64 papers9 papers in the last four weeks, down 25% on the four weeks before. 0.1% of all new papers.

Jan 7, 2026

An Algebraic Representation Theorem for Linear GENEOs in Machine Learning

Geometric and Topological Deep Learning enhance machine learning by exploiting geometric and topological structures in data. In this context, Group Equivariant Non-Expansive Operators (GENEOs) provide a principled framework for encoding symmetries and designing efficient, interpretable neural architectures. Originally introduced in Topological Data Analysis and later adopted in Deep Learning, GENEOs unify geometric and topological approaches and include, as a special case, the operator computing persistence diagrams. Their theoretical foundations rely on group actions, equivariance, and compactness properties of operator spaces. GENEOs are defined between data spaces endowed with transformation groups, referred to as perception pairs. While previous representation results characterized linear GENEOs acting on identical perception pairs, many applications require operators between heterogeneous ones. In this work, we introduce and prove a new algebraic representation theorem for linear GENEOs acting between different perception pairs. Under mild assumptions on data domains and group actions, this result provides a complete characterization of such operators and implicitly yields a computational method to generate all linear GENEOs between two perception pairs. The proof combines tools from the theory of stochastic matrices, group actions, and invariant measures. In our paper, we also show that the space of linear GENEOs is compact and convex, making easier their use for learning and optimization. Our new theorem enlarges the applicability of GENEOs, and allows for their composition with a broader class of current architectures. We show this with an application in image reconstruction.
Jul 31, 2025

L-GTA: Latent Generative Modeling for Time Series Augmentation

Data augmentation is becoming increasingly important across various areas of time series analysis, including forecasting, classification, and anomaly detection. We introduce the Latent Generative Temporal Augmentation (L-GTA) model, a generative approach based on a Variational Autoencoder with a Bi-LSTM backbone and temporal self-attention. The model learns a latent representation for each timestep and applies controlled perturbations such as jittering, magnitude warping, or drift. We define an equivariance objective to further encourage consistency between latent space and data space transformations. As a result, the augmented samples show predictable and interpretable transformation signatures. We evaluate L-GTA on several real-world datasets against SOTA generative methods, including TimeGAN, TimeVAE, and Diffusion-TS, as well as direct transformation approaches. Across experiments on downstream forecasting, distribution fidelity, and controllability of transformation intensity, L-GTA consistently outperforms competing approaches. In downstream forecasting, it reduces prediction error by up to 26% compared to the strongest generative method and 27% relative to using the original data without augmentation.
May 26, 2025

Representation Learning for Equivariant Inference with Guarantees

In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency. While geometric deep learning has made empirical advances by incorporating symmetry and geometry priors, less attention has been given to statistical learning guarantees. In this paper, we introduce an equivariant representation learning framework that simultaneously addresses regression, conditional probability estimation, and uncertainty quantification while providing first-of-its-kind non-asymptotic statistical learning guarantees. Grounded in operator and group representation theory, our framework approximates the spectral decomposition of the conditional expectation operator, building representations that are both equivariant and disentangled along independent symmetry quotient groups. Empirical evaluations on synthetic datasets and real-world robotics applications confirm the potential of our approach, matching or outperforming existing equivariant baselines in regression while providing well-calibrated uncertainty estimates.
Mar 13, 2023

NeuSE: Neural SE(3)-Equivariant Embedding for Long-Term Object-Based Simultaneous Localization and Mapping

We present NeuSE, a novel Neural SE(3)-Equivariant Embedding for objects, and illustrate how it supports object-based Simultaneous Localization and Mapping (SLAM) for consistent spatial understanding with long-term scene changes. NeuSE is a set of latent object embeddings created from partial object observations. It serves as a compact point cloud surrogate for complete object models, encoding the full shape, scale, and transform information about an object. In addition, the inferred latent code is both SE(3) and scale equivariant, enabling strong generalization to objects of both unseen sizes and different SE(3) poses. This makes NeuSE particularly effective in real-world scenarios where objects may vary in size or spatial configuration. With NeuSE, relative frame transforms can be directly derived from inferred latent codes. Our proposed SLAM paradigm, using NeuSE for object shape, size, and pose characterization, can operate independently or in conjunction with typical SLAM systems. It directly infers SE(3) camera pose constraints that are compatible with general SLAM pose graph optimization, while maintaining a lightweight, object-centric map that adapts to real-world changes. Our evaluation is conducted on synthetic and real-world sequences with changes in both controlled and uncontrolled settings, featuring multi-category objects of various shapes and sizes. Our approach demonstrates improved localization capability and change-aware mapping consistency when working either independently or as a complement to common SLAM pipelines. Additional results are presented in the supplementary video: https://youtu.be/fZ4_2P1fQBQ