Metraipolis › archive › dc_a7cde2cd0b3e

Classical methods for modern applications: synthetic tabular data generation using lightweight discrete response continuous latent variable model — arXiv:2610.21674

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21674
License (as archived)
CC0-1.0
Archived
2026-10-16T10:22:40.983Z
SHA-256 of the archived text
299b0da1458b4beb4320938be5cc76ffefe30ca118de9827d9ec7dd81a4c1c8a
Stable URL of this page
https://metraipolis.com/documento/dc_a7cde2cd0b3e

How to cite

Classical methods for modern applications: synthetic tabular data generation using lightweight discrete response continuous latent variable model — arXiv:2610.21674 — arXiv (en), https://arxiv.org/abs/2610.21674 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a7cde2cd0b3e (Metraipolis archive dc_a7cde2cd0b3e, sha256 299b0da1458b4beb4320938be5cc76ffefe30ca118de9827d9ec7dd81a4c1c8a)
BibTeX
@misc{dca7cde2cd0b3e,
  title = {Classical methods for modern applications: synthetic tabular data generation using lightweight discrete response continuous latent variable model — arXiv:2610.21674},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21674},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a7cde2cd0b3e; sha256 299b0da1458b4beb4320938be5cc76ffefe30ca118de9827d9ec7dd81a4c1c8a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21674. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we present a lightweight algorithm for modelling tabular data containing both continuous and discrete variables. The method uses empirical marginal distributions and a selected quantile function to transform the data into a continuous latent space, where a distribution of choice, e.g. a multivariate Gaussian, can be efficiently estimated and applied. While this approach is closely related to classical well-established machine learning methods, we present a novel adaptation that fits well within the contemporary computational ecosystem. Unlike in the case of deep architectures, it results in a simple implementation with few dependencies, robust training/estimation, as well as efficient sampling. The transformation preserves complex marginal distributions and correlations, providing high-fidelity models, especially for data with unimodal distributions. One of the key characteristics of the proposed approach is its continuous representation of discrete variables. While highly desirable, this introduces a significant challenge, since a single observation corresponds to a region rather than a point in the latent space. We show that this ambiguity naturally leads to a Monte Carlo expectation-maximisation (MCEM) formulation, whose auxiliary objective can be expressed as a weighted latent-space likelihood. This, in turn, allows conventional maximum-likelihood estimators to be used within an efficient and robust optimisation procedure.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.21674 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:48:02.744Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).