- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper addresses conditional density estimation when observations cover only a small subset of a structured conditioning domain, such as a temporal sequence or a two-dimensional image grid. Existing approaches, including kernel CDE and Gaussian-process-based methods, encode cross-condition relationships through predefined similarity or covariance functions, which may be poorly matched to the underlying data.
The authors propose Joint-Domain Implicit Conditional Density Estimation (JICDE), which generates a stochastic response field over the entire conditioning domain. It combines random noise with Fourier positional encodings and employs shared deconvolutional transformations to model dependencies between neighboring conditions. The model is trained using the Continuous Ranked Probability Score (CRPS), encouraging its generated samples to match the observed conditional distributions.
Critical strengths
(1) Sparse conditioning coverage is a meaningful challenge for CDE. The paper appropriately emphasizes that estimating an entire predictive distribution at poorly observed locations requires effective information sharing across conditions, rather than merely accurate point prediction.
(2) A coherent joint-domain formulation. Representing the family of conditional distributions as location-wise marginals of a shared stochastic generator offers a unified perspective on structured CDE. It avoids treating every conditioning location as an independent estimation problem.
(3) The temporal CDE experiments and image-completion experiments demonstrate that the same general modeling principle can be applied to different structured geometries. This strengthens the case that the approach is not limited to a single data format.
Critical weaknesses
(1) The methodological novelty relative to existing convolutional generative models is insufficiently established. The central contribution is to represent conditional distributions jointly over a structured domain and use shared deconvolutional transformations to learn cross-condition interactions. However, convolutional neural processes (ConvNP, ConvCNP), convolutional generative models, and DDN already exploit convolutional structure and shared transformations to model spatially organized outputs. The paper explains how JICDE differs conceptually from these approaches, but does not sufficiently isolate the genuinely new methodological component. In particular, it is unclear whether the main contribution is the joint-domain probabilistic formulation, the use of a stochastic decoder over the conditioning domain, or simply applying a convolutional generator to sparse CDE.
(2) The claimed adaptive cross-condition sharing mechanism is not directly validated. A central motivation is that JICDE learns its sharing rule from data, whereas kernel CDE and GP-based methods prescribe relationships through kernels or covariance functions. However, the experiments primarily report prediction metrics and qualitative reconstructions. Better performance alone does not establish that the learned interaction mechanism actually adapts to different structural regimes as claimed. For example, the paper does not directly examine the learned effective receptive fields, sensitivity to neighboring conditions, or how information propagates across locations in the Gaussian, Markov, and multimodal settings.
(3) The lack of ablation studies makes the source of the performance gains unclear. JICDE combines several components: stochastic noise embeddings, Fourier positional encodings, a global latent representation, a hierarchical deconvolutional decoder, and CRPS-based training. The paper does not sufficiently establish the individual contribution of each component.
(4) Insufficient comparison with modern conditional generative models. The proposed JICDE employs a stochastic generator with shared deconvolutional layers to estimate conditional distributions over sparsely observed structured domains. However, the relationship between this formulation and modern conditional diffusion or flow-matching models is not sufficiently discussed or empirically investigated. These generative frameworks can also model distributions conditioned on sparse observations, while incorporating spatial or temporal inductive biases through their architectures. It is therefore unclear whether the reported improvements arise from the proposed structured-domain formulation, the shared convolutional architecture, or the choice of a direct stochastic generator trained with CRPS. Comparisons with appropriately adapted conditional diffusion and flow-matching baselines, or at least a clearer discussion of their relative advantages in modeling quality, sampling cost, and cross-location dependencies, would help establish the methodological novelty and practical benefits of JICDE.
Questions for authors
See weaknesses.
6 comments
Response to Weakness 2: Analysis of cross-condition information sharing
Thank you for requesting a more direct examination of cross-condition sharing. We agree that predictive performance alone does not fully characterize how information is shared across locations. We therefore combine the existing distribution visualizations with additional analyses of receptive fields and the influence of training observations.
First, the original synthetic visualizations provide qualitative evidence of distributional flexibility. On Gaussian, Markov, and Double Sine data, JICDE produces Gaussian-like predictive shapes, discrete-valued structure, and bimodal branches, respectively. Visualizing learned distributions also has precedents in related distribution-learning studies, such as OPT-GAN (Lu et al., 2023) and OPT-VAE (Zhang et al., 2026), which examine how the learned distributions evolve over complex problem landscapes. We use these visualizations to qualitatively assess how the same modeling framework accommodates different distributional structures. We will extend this analysis with additional visualization experiments, including sharply peaked distributions.
Second, we have added a convolutional kernel-size analysis and effective receptive field (ERF) diagnostics. The kernel-size analysis examines the effect of the architectural interaction range, with a kernel size of 7 performing well overall among the tested configurations. The ERF analysis further shows that output sensitivity is concentrated around the corresponding local neighborhood in the intermediate feature representation. Together, these analyses characterize the architectural range and the feature-level sensitivity of the decoder.
Third, we conducted observation-deletion interventions to examine how training observations affect predictions at unobserved locations. Starting from the same original sparse training set on a 200-point sequence, we separately removed three random predefined groups: {25,38,80}, {90,100,101}, and {142,147,154}, using zero-based indices. We refitted the model with paired initializations and matched training settings, and measured the Wasserstein-1 (W1) distance between the resulting predictive distributions and those of the reference model fitted to the original sparse training set. All comparisons use the same originally unobserved evaluation locations. The table reports the average W1 changes on the Gaussian and Markov datasets. In addition to these aggregate values, we have plotted location-wise W1 response curves to show the spatial distribution of the changes. Stronger responses occur primarily in unobserved regions near the deleted observations, and the main response regions shift as the deleted groups move from the earlier to the middle and later parts of the sequence. These results provide empirical evidence of cross-location influence and its locality through interventions on the training data.
W1 measures prediction changes after deletion, not prediction error. Values are reported as mean±SD; indices are zero-based.
| Deletion | Removed indices | Gaussian data | Markov data |
|---|---|---|---|
| 1 | 25,38,80 | 0.26±0.07 | 0.17±0.06 |
| 2 | 90,100,101 | 0.11±0.02 | 0.06±0.03 |
| 3 | 142,147,154 | 0.05±0.02 | 0.09±0.03 |
Response to Weakness 3: Component contributions and ablation studies
Thank you for pointing out that the contributions of individual components were not sufficiently clear. The original submission already included approximately parameter-matched MLP, Transformer, and FIXED LOCAL decoder ablations in Appendix B.6, where they were placed due to space constraints. We apologize for not highlighting these analyses sufficiently in the main text. We agree that their coverage was incomplete and have therefore added ablations of the noise embedding encoder, Fourier positional encoding, and training objective. We will present the key findings together in the revised main text.
-
Noise embedding encoder. Freezing the encoder parameters while retaining latent resampling during both training and testing increases mean CRPS from 0.86, 0.54, and 1.10 to 0.95, 0.60, and 1.69 on BIA, PDB, and ETT, respectively. Mean NLL and MAE also worsen on all three datasets. This supports the utility of learning the noise embedding within the proposed architecture.
-
Fourier positional encoding. Removing the Fourier positional encoding worsens mean MAE and CRPS on all three datasets. Mean NLL also worsens on BIA and PDB, although it improves slightly on ETT. These results support the value of explicit positional features in the tested sparse-observation settings.
-
Local decoder structure and learnable spatial mixing. In the approximately parameter-matched comparisons in Appendix B.6, the MLP variant performs consistently worse. FIXED LOCAL retains the local structure and learnable channel transformations but replaces learnable spatial mixing with a fixed Gaussian operator. It performs best on the Gaussian benchmark, whereas JICDE performs better on Markov, PDB, and ETT. These results support the selected decoder structure and the value of learnable spatial mixing, while also showing that a fixed smoothing prior can be effective when well matched to the data.
-
CRPS training objective. Compared with the MSE-trained variant, the full model achieves lower mean CRPS and NLL on all three datasets, while the MSE variant achieves lower MAE. This observed trade-off between point and distributional prediction supports the use of CRPS for the intended distribution-estimation objective.
We appreciate the reviewer's constructive feedback, which has helped us make the component analysis more systematic and the evidence supporting our design choices clearer.
Additional component ablations
| Dataset | BIA | BIA | BIA | PDB | PDB | PDB | ETT | ETT | ETT |
|---|---|---|---|---|---|---|---|---|---|
| Variant | NLL | MAE | CRPS | NLL | MAE | CRPS | NLL | MAE | CRPS |
| MSE | 2.43±0.64 | 1.55±0.28 | 0.94±0.14 | 2.17±0.81 | 1.01±0.15 | 0.62±0.07 | 4.64±0.88 | 1.62±0.11 | 1.23±0.11 |
| No PE | 2.07±0.09 | 2.67±0.17 | 1.11±0.13 | 1.64±0.10 | 1.53±0.10 | 0.62±0.06 | 2.25±0.12 | 2.74±0.13 | 1.23±0.10 |
| Frozen encoder | 2.17±0.51 | 1.86±0.51 | 0.95±0.27 | 1.59±0.26 | 1.21±0.13 | 0.60±0.08 | 6.18±0.89 | 2.08±0.39 | 1.69±0.34 |
| JICDE | 1.84±0.21 | 1.81±0.36 | 0.86±0.12 | 1.39±0.11 | 1.16±0.15 | 0.54±0.07 | 2.33±0.22 | 1.99±0.13 | 1.10±0.10 |
Response to Weakness 1: Methodological novelty and relation to convolutional models
Thank you for pointing out that the boundary of our methodological contribution was insufficiently clear. We agree that convolutional architectures, stochastic decoders, and parameter sharing across locations are established ideas. Our contribution concerns the parameterization and fitting scheme for conditional distribution estimation on sparsely observed structured domains; the original manuscript did not sufficiently distinguish this contribution from its architectural components.
We consider a predefined conditioning domain with sparse response observations from a single instance and seek predictive distributions at unobserved locations. Without repeated observations at individual locations, these distributions cannot be freely fitted in isolation, motivating their joint estimation through shared structural constraints. ConvCNP and ConvNP already exploit convolutional structure and shared transformations for spatially organized prediction. The original ConvNP framework learns an amortized predictor across task instances. Our setting instead provides only sparse observations from the current instance. Repeated context–target splits can construct training tasks, but do not supply the additional information available from observing other instances, which may limit the performance. This motivates directly fitting the location-wise distribution family on the current domain, without learning a prediction mapping intended for reuse across instances. JICDE combines noise and positional embeddings with shared local deconvolutional transformations along the conditioning domain. Resampling latent variables produces response fields whose location-wise marginals represent the predictive distributions, and the shared parameters are optimized using marginal CRPS at observed locations. Under our data conditions and training configuration, JICDE outperforms the evaluated ConvNP baseline, providing empirical support for this instance-specific estimation scheme.
The distinction from DDN concerns the domain over which deconvolution operates. DDN constructs a density representation over discretized response-space bins and applies deconvolution to that representation. JICDE instead organizes local transformations along conditioning locations, jointly constraining neighboring location-wise distributions through shared transformations. Thus, the deconvolutional structure serves different roles in the two estimation schemes. Convolutional single-instance fitting has precedents in DIP (Ulyanov et al., 2018) and its Bayesian extensions. DIP fits a convolutional network to a single degraded image to obtain a reconstruction, while Bayesian DIP variants based on weight-posterior inference quantify reconstruction uncertainty through approximate inference over network weights. JICDE directly fits a stochastic generator using marginal CRPS at observed locations. After fitting, network parameters remain fixed while latent variables are resampled, yielding location-wise predictive distributions as the marginals of generated response fields. The distinction therefore concerns the probabilistic representation and training objective, rather than convolutional architecture or single-instance optimization alone. We have also added a Bayesian DIP baseline to the image-completion experiments, with competitive results reported in our response to Weakness 4.
Our contribution is therefore the combination of a structured stochastic parameterization over the conditioning domain and direct marginal-score fitting for single-instance, sparse fixed-domain CDE. We will make this contribution explicit in the revised manuscript and distinguish it from the established convolutional architectures and stochastic generation mechanisms on which it builds. We thank the reviewer for this constructive feedback, which has helped us articulate our methodological contribution more precisely and better position the work within the existing literature.