arXiv — Machine Learning · · 3 min read

Conditional-Independence-Regularized Distributional Autoencoders for Mixed-Type Data

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Statistics > Methodology

arXiv:2608.20562 (stat)
[Submitted on 20 Aug 2026]

Title:Conditional-Independence-Regularized Distributional Autoencoders for Mixed-Type Data

View a PDF of the paper titled Conditional-Independence-Regularized Distributional Autoencoders for Mixed-Type Data, by Siyuan Tang and 2 other authors
View PDF HTML (experimental)
Abstract:Mixed-type data containing both numerical and categorical variables arise in many scientific and real-world applications. Existing representation learning and generative modeling approaches typically focus either on reconstruction accuracy or unconditional data generation, but often fail to recover the full conditional distribution of the data while preserving interpretable structural relationships between heterogeneous variable types. In this work, we introduce Conditional-Independence-Regularized Distributional Autoencoders, a framework for learning low-dimensional representations of mixed-type data through conditional distribution matching and structural regularization. Our method combines an energy-score-based objective for numerical variables, a likelihood-based objective for categorical variables, and an auxiliary conditional independence regularization term encouraging the learned representation to capture the dependence between numerical and categorical components. We provide theoretical analysis showing that the optimal representation balances unexplained numerical variability, conditional entropy of categorical variables, and residual conditional dependence. Empirically, the proposed method achieves strong performance on both synthetic and real-world datasets, substantially improving categorical distribution recovery, achieving competitive overall conditional distribution recovery, and preserving mixed-type dependence structure. The code has been made available at GitHub.
Comments: Accepted by STAI-X 2026
Subjects: Methodology (stat.ME); Machine Learning (cs.LG); Machine Learning (stat.ML)
Cite as: arXiv:2608.20562 [stat.ME]
  (or arXiv:2608.20562v1 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.2608.20562
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Siyuan Tang [view email]
[v1] Thu, 20 Aug 2026 20:52:46 UTC (31,576 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Conditional-Independence-Regularized Distributional Autoencoders for Mixed-Type Data, by Siyuan Tang and 2 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

stat.ME
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
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?)
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.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning