Skip to content
AI News HubLIVE
Original source3 min read

Transformation Categorization Based on Group Decomposition Theory Using Parameter Division

Summary

This paper proposes an unsupervised method for categorizing transformations between pairs of inputs using parameter division. By splitting a single transformation's parameter into components and imposing homomorphism constraints, the method identifies normal subgroups without auxiliary assumptions. Evaluations on rotation, translation, and scale image pairs show that group-decomposition constraints drive appropriate categorization.

SourcearXiv Machine LearningAuthor: Takayuki Komatsu, Yoshiyuki Ohmura, Yasuo Kuniyoshi
Transformation Categorization Based on Group Decomposition Theory Using Parameter Division
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.04056] Transformation Categorization Based on Group Decomposition Theory Using Parameter Division

Skip to main content

Learn about arXiv becoming an independent nonprofit.

We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate

> cs > arXiv:2605.04056

Help | Advanced Search

All fields Title Author Abstract Comments Journal reference ACM classification MSC classification Report number arXiv identifier DOI ORCID arXiv author ID Help pages Full text

Search

GO

quick links

Login

Help Pages

About

-->

Computer Science > Machine Learning

arXiv:2605.04056 (cs)

[Submitted on 10 Apr 2026]

Title:Transformation Categorization Based on Group Decomposition Theory Using Parameter Division

Authors:Takayuki Komatsu, Yoshiyuki Ohmura, Yasuo Kuniyoshi

View a PDF of the paper titled Transformation Categorization Based on Group Decomposition Theory Using Parameter Division, by Takayuki Komatsu and 2 other authors

View PDF HTML (experimental)

Abstract:Representation learning seeks meaningful sensory representations without supervision and can model aspects of human development. Although many neural networks empirically learn useful features, a principled account of what makes a representation "good" remains elusive. We study unsupervised categorization of transformations between pairs of inputs under algebraic constraints. Classical disentanglement favors mutually independent factors and fails when factors are coupled. Our prior Galois-theoretic approach decomposes a group via normal subgroups by learning a product of two transformations with one factor constrained to a normal subgroup, covering both commutative and non-commutative cases. That method, however, relied on auxiliary assumptions (e.g., motion and isometry restrictions) not required by decomposition theory, and ablations did not separate theory-based from auxiliary effects. We propose parameter division for a single transformation: we split its parameter into components, impose homomorphism constraints mapping the full transformation to one component, and identify the normal subgroup as the set of transformations when that component is fixed to the identity. This formulation drops the previous auxiliary assumptions and applies more broadly. We evaluate on image pairs involving rotation, translation, and scale; ablations show that group-decomposition constraints drive appropriate categorization.

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

Cite as: arXiv:2605.04056 [cs.LG]

(or arXiv:2605.04056v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2605.04056

Focus to learn more

arXiv-issued DOI via DataCite

Submission history

From: Takayuki Komatsu [view email] [v1] Fri, 10 Apr 2026 03:35:37 UTC (606 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Transformation Categorization Based on Group Decomposition Theory Using Parameter Division, by Takayuki Komatsu and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-05

Change to browse by:

cs cs.AI

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

export BibTeX citation Loading...

BibTeX formatted citation

×

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

About

Help

contact arXivClick here to contact arXiv Contact

subscribe to arXiv mailingsClick here to subscribe Subscribe

Copyright

Privacy Policy

Web Accessibility Assistance

arXiv Operational Status

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Parameter division and homomorphism constraints enable unsupervised transformation categorization
  • Eliminates auxiliary assumptions like motion and isometry restrictions
  • Evaluated on rotation, translation, and scale transformations
  • Ablation studies confirm that group-decomposition constraints are essential for correct categorization

Highlights and analysis are generated automatically and may contain errors. Check the original source.