Backend
Equivariant Modeling with Polynomial Features via Minimal Homogeneous Generators
arXiv stat.ML0 views
arXiv:2611.24896v1 Announce Type: cross Abstract: We present a general framework for modeling and learning equivariant functions between finite dimensional semisimple real group representations, unifying constructions developed across many application areas. Our model is a linear combination of equivariant polynomial features whose coefficients are arbitrary learnable functions of invariant polynomial features. We take as features minimal homogeneous generators for the invariant algebra and the covariant module over the invariant algebra, up to prescribed degrees. We provide a Python package that automatically computes these features and fits the resulting models to training data. The algorithm for feature computation requires explicit isotypic decompositions of the input and output representations, along with explicit Clebsch-Gordan decompositions of the tensor product of irreducible representations, and achieves speedups over alternative methods in computational algebra. Numerical experiments in scientific modeling demonstrate the full learning pipeline and yield accurate predictors with few trainable parameters, using the model both for end-to-end prediction and within layers of larger architectures.
Source:https://arxiv.org/abs/2611.24896PreviousCounterfactual World Models: JEPAs That Reason About "What If"NextWhen Features Beat Noise: A Noise-Driven Hypothesis Testing Method for Feature Selection
Related posts
Signal #138: Java4Shell Hits AVX-512 JDKs; GPT-6.2 Astra and Sol Ship
0dev.to

Check Support Emails Before the LLM: Wolf Defender in Apache Camel
0dev.to

The Librarian, the Missing Book, and the AI with a Master Key. Sentinel IR MCP
0dev.to
On C++: Coroutines
0dev.to
Azure DevOps Server Matches Need Project, Collection, and Administration Boundaries
0dev.to
My Rank Check Was Accurate. For the Wrong Country.
0dev.to