- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
High dimensional observations are pervasive in many domains such as biomedical or scientific data. Existing emthods usually conduct patch models structured encoding and feature selection all in isolation. However, existing methods typically aggreagarte observarions The central idea is to learn an input conditioned, risk aware distribution over multiple evidence compositions rather than searching for a single optimal repre- sentation The authors propose Quantized Structured Flow Represen- tation (QSFR) consisting of local patch quantisation (ii)Generative subset sampling (iii)Utility critic
Critical strengths
The problem is well motivated. The challenge of requiring evidence form contextual samples and using encoding and feature selection thorough principled pipeline is relevant and important.
Critical weaknesses
The paper suffers from weak writing and doesnt fexplaining its point clearly. The authors never discuss and often symbols remain either undefined or appear before they are introduced. Prior relevant works i.e Eq (3) is pretty much VQ VAE needs be discussed in structured representation learning. (i)In Section 3.2, the authors explicitly clarify that is "not interpreted as an identifiable estimate of epistemic or aleatoric uncertainty." Yet throughout the title, abstract, and theory, the framework is marketed as discovering "reliable evidence compositions" via "risk-aware" learning. If does not capture identifiable epistemic or aleatoric uncertainty, the formal justification for treating it as a proxy for physical "reliability" or clinical "risk" is ungrounded.
(ii)Because the critic is supervised using an observed empirical utility margin per sample, it is unclear why the spread of its output distribution should correlate with sample or feature unreliability. The authors provide no empirical validation showing that high- subsets correlate with higher held-out error, higher out-of-distribution frequency, or label noise.
(iii)Theorem 3.1 asserts a supremum bound over all subsets while relying on an average quantization distortion . Furthermore, assuming a global Lipschitz constant for the end-to-end composite map (which incorporates a deep contextual encoder ) is unrealistic for deep neural networks without explicit spectral normalization.
Questions for authors
(i) Does correlate with prediction error or out-of-distribution spectra? What are the quantitative results across Table 1 when (pure mean utility)?
(ii)How are and formally partitioned in real Raman data? Can you provide empirical validation demonstrating that and hold in practice?
(iii)What is the active codebook perplexity and utilization percentage across the cohorts? How does one manage codebook collapse in the absence of an autoencoding reconstruction objective?