- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper addresses supervised learning across datasets with varying feature dimensions without requiring cross-dimensional sample correspondences. The authors propose a dimension-conditioned encoder followed by latent transport to a common reference distribution, enabling a shared predictor across both training and unseen dimensions. The transport is formulated using a soft-constrained multi-marginal Schrödinger bridge and approximated through conditional flow matching with Sinkhorn-based penalties. The paper provides theoretical results on prediction-score approximation, dimension coverage, and convergence of the idealized bridge formulation. Experiments on synthetic regression and PBMC3k classification demonstrate the feasibility of shared prediction and show that staged optimization performs better than the evaluated joint-alignment alternatives, although dimension-specific models remain stronger.
Critical strengths
-
The paper addresses an interesting problem of learning across variable input dimensions without paired observations. The proposed framework combines dimension-conditioned representations, latent transport, and a shared task head, providing a coherent approach that can also be evaluated at unseen feature dimensions.
-
The PBMC3k experiments demonstrate that stronger distributional alignment does not necessarily improve classification performance and that staged optimization provides better stability and predictive performance than the evaluated joint-alignment variants. The authors also clearly distinguish the scope of their theoretical guarantees from the practical neural implementation.
Critical weaknesses
-
Although several training configurations are compared, the experiments do not sufficiently isolate the contribution of conditional latent transport. A direct comparison with a dimension-conditioned encoder and shared classifier without transport, under comparable model capacity and training budgets, would better establish the benefit of the proposed approach. The performance gap relative to dimension-specific predictors, particularly in macro-F1, also indicates room for improvement.
-
The theoretical results rely on assumptions that are not established for the proposed learning algorithm. In particular, Theorem 5.5 assumes smooth variation of population risk across feature dimensions, while Theorem 5.7 concerns the idealized Schrödinger bridge rather than its flow-matching approximation. Although these limitations are acknowledged by the authors, a stronger connection between the theoretical analysis and empirical generalization would improve the contribution.
Questions for authors
-
Can the authors provide an ablation comparing the full method against a dimension-conditioned encoder with a shared task head but without conditional transport, using comparable training budgets?
-
How closely does the flow-matching objective in Equations (10)–(13) approximate the ideal Schrödinger bridge in Equation (9)? Is there evidence that this formulation offers advantages over standard conditional flow matching?
-
How sensitive is performance to the distance between training and held-out feature dimensions? Can the authors provide empirical support for the dimension-regularity assumption used in Theorem 5.5?
Final Assessment
Thanks for authors' detailed response. I was initially between 1 and 2. After reading the authors' response, I settled on 2. The authors explain why nested feature sets have a natural order and show that the combined method helps in some settings. My main concern is that the contribution is largely an engineering effort to combine existing methods. I came away with little new understanding of when or why this combination helps with learning across feature dimensions.