- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CoClusterPFN, a Prior-data Fitted Network that, in one forward pass, predicts the posterior similarity matrix (PSM) of a tabular dataset, i.e., the probability that each pair of observations shares a cluster, with the number of clusters either supplied or marginalized out. Predicting pairwise probabilities avoids label switching, and the same PSM can be decoded into hard partitions with different decision rules (MaxPEAR, MinVI-LB, Binder). On 2D Gaussian mixtures, a version retrained for that prior closely matches MCMC PSMs while being orders of magnitude faster. Directly predicting the PSM gives higher decoded ARI than predicting cluster responsibilities, and on 60 CLUBench datasets it has the best average rank for ARI, NMI and Binder loss and second for VI, with or without . An Iris case study illustrates how the PSM exposes uncertain pairs.
Critical strengths
- Principled, label-invariant target with supporting evidence. The PSM is invariant to cluster relabeling, and the population minimizer of its binary cross-entropy loss is the posterior co-clustering probability, so one model supports several decision rules and both known and unknown .
- Careful and transparent evaluation. The prior and decoders were fixed without using CLUBench, and gains are tested with paired bootstrap intervals and Holm-corrected Wilcoxon tests. The paper also openly reports where the method falls short, e.g., poor cluster-count recovery, transitivity violations and quadratic cost.
Critical weaknesses
- Limited novelty. Pairwise same-cluster prediction with attention and BCE already exists in ABC (Coward et al., 2020), "a close architectural predecessor". The paper itself describes the method as combining "direct pairwise prediction with the PFN framework", on top of a pretrained TabICL encoder. Neither ABC nor the closest PFN, ClusterPFN, is compared. Although the method is motivated as a fast alternative to Bayesian clustering, no Bayesian clustering method is a baseline.
- Posterior fidelity is checked only on toy data. The MCMC agreement is for a separate model retrained on 2D Gaussian mixtures with . The main tabular model is evaluated only against "sampled binary co-membership labels rather than exact posterior probabilities". On CLUBench, 18.23% of triples violate PSM transitivity with supplied, versus 1.29% on the training prior.
- Quadratic cost limits it to small tables. Attention, the pairwise head and the PSM all scale as , and the authors state "it remains unclear how to move beyond originating from the PSM". Already at , inference is 7.67× slower than TabClustPFN, and the model is trained only up to , and , with capped by design.
- Narrow benchmark close to the training prior. CLUBench is reduced to the 60 of 103 datasets "matching the cluster-count and dimensionality ranges of the training prior", and 19 are subsampled to 2,000 observations. Of these, 28 have , and the reference "clusters" are class labels, which need not reflect cluster structure. So, no method exceeds a mean ARI of 0.39.
Questions for authors
- Can you compare against ABC, ClusterPFN and a Bayesian clustering baseline (e.g., a Bayesian GMM or Dirichlet-process mixture fit by MCMC or variational inference) on CLUBench, in both accuracy and runtime, and does the gain over the Responsibility-PFN hold across training seeds?
- Can you validate the primary tabular model against a posterior reference, e.g., MCMC on its clean Gaussian-mixture branch or on low-dimensional real datasets, and explain why transitivity violations rise to 18.23% on CLUBench with supplied?
- For scalability concerns, can you report runtime and memory for well beyond 2,000 (e.g., –), and discuss possible approximations that avoid cost?
- How does CoClusterPFN perform on the 43 excluded datasets, on full datasets without subsampling, and on benchmarks where labels are known to reflect cluster structure?
5 comments
Response to Reviewer hAyQ (2/2)
Response to Q3 — Scalability
For scalability concerns, can you report runtime and memory for well beyond 2,000 (e.g., –), and discuss possible approximations that avoid quadratic cost?
We address this question in General Comments, Section 5, “Scalability: runtime, memory, and possible approximations,” including the measured scaling results, explicitly labeled larger- projections, and potential approximations.
Response to Q4 — Excluded datasets, full datasets, and label–cluster alignment
We thank the reviewer for raising concerns about the benchmark scope. We evaluated the 43 excluded CLUBench datasets, repeated the original benchmark without the row cap, and examined datasets with stronger label–cluster alignment.
On the 38 excluded datasets within our supported cluster-count range, CoClusterPFN achieves higher mean ARI than native-input TabClustPFN, although the differences are not statistically conclusive. Removing the row cap slightly reduces overall mean ARI. Finally, both models perform substantially better on datasets with stronger label–cluster alignment, where CoClusterPFN maintains the lead in both count settings.
(1) The 43 excluded datasets
The evaluation of all 43 excluded datasets is presented in General Comments, Section 6, “Evaluation on the 43 excluded CLUBench datasets.” Below, we address the remaining questions about full datasets and label–cluster alignment.
(2) Full datasets without subsampling
We evaluated the 19 previously capped datasets using all valid observations in their available CLUBench source files, with dataset sizes ranging from 2,001 to 10,000. The remaining 41 datasets already used all available source rows.
We also evaluated TabClustPFN on the same 19 datasets to examine whether CoClusterPFN's advantage persists without subsampling.
Mean ARI on the 19 previously capped datasets:
| Method | Supplied : capped | Supplied : full | Unspecified : capped | Unspecified : full |
|---|---|---|---|---|
| CoClusterPFN | 0.3777 | 0.3303 | 0.2462 | 0.2365 |
| TabClustPFN | 0.3244 | 0.3131 | 0.1666 | 0.2163 |
CoClusterPFN maintains higher mean ARI in both count modes when using all observations, although the gaps over TabClustPFN become smaller and their paired 95% bootstrap intervals include zero. Across all 60 datasets, CoClusterPFN's mean ARI changes from 0.3838 to 0.3688 with supplied and from 0.3258 to 0.3228 with unspecified .
The full-data results and evaluation protocols are provided in Appendix C.10.
(3) Datasets whose labels align with cluster structure
We examined cluster-label matching (CLM) using the adjusted Silhouette metric of Jeon et al. (2025). The metric compares distances between observations within the same reference class to distances between different classes. Higher scores indicate that the reference labels better reflect the cluster structure in feature space.
A threshold of identifies 26 datasets where reference labels align more strongly with cluster structure. The same subset is used for both models, independently of their predictions.
Mean ARI by cluster-label alignment:
| Setting | Method | All 60 | CLM (26) | CLM (34) |
|---|---|---|---|---|
| Supplied | CoClusterPFN | 0.3895 | 0.7235 | 0.1342 |
| Supplied | TabClustPFN | 0.3443 | 0.6310 | 0.1250 |
| Unspecified | CoClusterPFN | 0.3259 | 0.6262 | 0.0963 |
| Unspecified | TabClustPFN | 0.2802 | 0.5093 | 0.1050 |
Both models achieve substantially higher ARI when the reference labels align more strongly with cluster structure. On the 26 datasets with , CoClusterPFN achieves higher mean ARI in both count settings.
We keep all 60 datasets in the main benchmark and use CLM only as a supplementary analysis.
The excluded-dataset results, full-data evaluations, and CLM analysis are now included in Appendices C.9, C.10, and C.11 of the revised manuscript, respectively, together with the experimental protocols and per-dataset results.
Thanks for the great effort on the detailed experiments and the response. However, it is still unclear what the main contributions and advantages of the proposed methods are compared with existing methods, despite the reported gains in ARI and accuracy. The gain here is better might due to the prior designed by the authors for training. I’d read the result as a combination of a useful prior and a changed output design. So, I will maintain my score.
Response to Reviewer hAyQ (1/2)
Regarding novelty and comparisons with ClusterPFN and ABC, please see the general comment.
Response to Q1 — Additional baselines and training-seed robustness
We thank the reviewer for suggesting these experiments.
Additional baselines
Can you compare against ABC, ClusterPFN and a Bayesian clustering baseline (e.g., a Bayesian GMM or Dirichlet-process mixture fit by MCMC or variational inference) on CLUBench, in both accuracy and runtime?The requested comparisons with ABC, ClusterPFN, and variational Bayesian mixtures are discussed in our General Comments. We have also added runtime comparisons in Appendix C.7 of the revised manuscript, covering neural inference, PSM decoding, and complete clustering pipelines where applicable. In the runtime comparisons, ABC+TabICL's matrix inference was approximately 13.4 times faster than CoClusterPFN's on an NVIDIA A40. On the nine compatible CLUBench datasets, ClusterPFN's complete CPU pipeline was approximately 71/37 times faster with supplied/unspecified K, respectively.Training-seed robustness
... and does the gain over the Responsibility-PFN hold across training seeds?We extended the Responsibility-PFN comparison in Section 4.2 from one to three training seeds, matching the prior, training schedule and evaluation protocol. Direct PSM prediction achieved higher decoded ARI in every seed under all three decision rules, on both CLUBench and matched-prior synthetic tasks.
Supplied-K CLUBench MaxPEAR ARI:
The paired dataset-bootstrap 95% interval for the seed-averaged improvement is [0.0139, 0.0654].
All six models were evaluated in the same CPU FP32 environment. The revised Appendix C.2 documents the full results and differences from the original GPU evaluation.
Response to Q2 — Posterior reference and transitivity violations
Posterior reference
Can you validate the primary tabular model against a posterior reference, e.g., MCMC on its clean Gaussian-mixture branch or on low-dimensional real datasets?A matched MCMC reference for the primary tabular model is difficult to obtain because its training prior combines several generative branches and latent mechanisms. Running MCMC only on the clean Gaussian branch would not provide a direct comparison with our primary model, which was trained on the full prior rather than that branch alone. Similarly, fitting a conventional Bayesian GMM to low-dimensional real data would provide a posterior for that GMM, rather than for our full tabular prior. Such comparisons would not directly validate the posterior induced by our full training prior.
This motivated our matched-prior NIW–GMM experiment (Section 4.1 and Appendix F), where we can directly compare CoClusterPFN's predicted probabilities with those estimated by MCMC. Against matched MCMC references, the model achieves PSM MAE of 0.0187/0.0302 and correlations of 0.980/0.971, with K known/unknown.
These results validate the approach under the matched NIW–GMM prior. They do not establish posterior fidelity for the primary heterogeneous tabular model. We have explicitly acknowledged this limitation in Section 5 of the revised manuscript.
Transitivity violations
Our additional analysis shows that dataset characteristics explain part of the higher violation rate on CLUBench. A substantial gap remains.
We evaluated all triples on the 60 CLUBench datasets and compared the results with synthetic datasets matched in observation count, feature count, and cluster count (N,D,K).
With K supplied, the CLUBench violation rate had a mean of 18.22% but a median of 5.63%, indicating that datasets with particularly high violation rates raise the mean.
Matching N,D,K increased the synthetic violation rate from 2.23% to 5.62%, suggesting that these dataset characteristics explain part of the difference. The 2.23% figure comes from a new synthetic evaluation, separate from the 1.29% reported in the original submission. Even after matching, the CLUBench rate remained 12.60 percentage points higher, with a paired 95% bootstrap interval of [7.8, 17.7] percentage points.
The synthetic and real predictions had similar average pairwise probabilities, proportions of probabilities above 0.9, and entropy. These similarities do not explain the remaining gap, whose causes are still unclear.
We have added these experiments, the per-dataset results, and further analysis to Appendix C.4 of the revised manuscript.