- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies constrained tabular generation, aiming to generate rows that satisfy arbitrary column-wise constraints while matching the corresponding conditional data distribution. The paper develops a unified generator-level view of mixed-type tabular generative models. Based on this framework, the authors propose TabJump, a pure-jump generator for both numerical and categorical columns, together with a column-symmetric network core that is permutation-equivariant by construction. The paper applies Doob’s -transform to derive conditioned generators for general Markov processes, showing that conditioning modifies diffusion drifts additively and jump rates multiplicatively, while pure deterministic flows require a different treatment. Building on these results, the authors develop a conditional generator matching objective and an amortized guidance module that learns conditioning corrections on top of a frozen unconditional generator and generalizes to unseen constraint sets. Experiments evaluate both unconditional and constrained generation on eight tabular datasets.
Critical strengths
1.The generator-level treatment is elegant and provides a unified view of existing tabular models through a common Markov-generator decomposition. This is consequential because it clarifies the relationship of existing approaches and provides a clean foundation for extending.
2.The authors leverage Doob’s -transform to derive an exact conditioning method for general Markov generators. They further propose a scalable, model-agnostic learning framework with a consistency guarantee. This substantially strengthens the paper by connecting a rigorous conditioning principle with a practical framework that can be applied across multiple classes of tabular generative models.
Critical weaknesses
1.The novelty of the architecture of column symmetric cores seems limited, and there is not sufficient context compared to previous table modeling work. For example, CM2 (Ye et al, WWW 2024, Section 4.2.2) has already utilized feature level self attention without positional encoding to respect column permutation symmetry. The core proposed in Section 3.2 adopts the same basic principles. Although identifying sequential dependencies in existing table generators and adapting equivariant backbones for generation and constraint guidance is useful, this article should clarify new architectural content beyond this adaptation and discuss relevant precedents such as CM2. This concern limits the novelty of architectural components.
2.The experiential advantage of TABJUMP seems to be concentrated on C2ST-XGB, rather than being consistently proven in evaluation criteria. In Table 2, it achieved the best C2ST-XGB scores on all six datasets, but did not achieve the best trend error or DCR balance on any of them, and only obtained the best MLE results on adults. These results support the strong advantages of XGBoost based discriminator metrics, but provide more limited evidence to demonstrate their broad high fidelity and downstream utility. Further analysis of these differences will help determine which aspects of data distribution TABJUMP performs better than competitive methods.
Questions for authors
1.Can you reconcile the noise correction in equations (13) and (129) with algorithm 4, line 4, where the noise reducer update seems to require instead of , and clarify whether this will affect the implementation or reported results? Appendix E.7 and E.8 also seem to have proof errors, whether they are spelling errors or affecting the proof.
2.Is there a situation where constraints are missing or even non-existent? What is the robustness of TABKUMP for this situation?
Thank you for your response and most of my concerns are addressed. But considering the nature of ICLR and the contribution of the paper, I keep my score.