S URREAL -GAN:S EMI -S UPERVISED R EPRESENTATION L EARNING VIA GAN FOR UNCOVERING HETEROGENEOUS DISEASE - RELATED IMAGING PATTERNS
A BSTRACT
A plethora of machine learning methods have been applied to imaging data, enabling the construction of clinically relevant imaging signatures of neurological and neuropsychiatric diseases.
Oftentimes, such methods do not explicitly model the heterogeneity of disease effects, or approach it via nonlinear models that are not interpretable.
Moreover, unsupervised methods may parse heterogeneity that is driven by nuisance confounding factors that affect global brain structure or function, rather than heterogeneity relevant to a pathology of interest.
On the other hand, semi-supervised clustering methods seek to derive a pathology-related dichotomous subtypes, ignoring the truth that disease heterogeneity spatially and temporally extends along a continuum.
To address the aforementioned limitations, herein, we propose a novel method, termed Surreal-GAN ( S emi-S U pe R vised R epr E sent A tion L earning via GAN).
Using cross-sectional imaging data, Surreal-GAN dissects underlying disease-related heterogeneity under the principle of semi-supervised clustering [cluster mappings from the normal control (CN) to patient (PT) domain], proposes a continuously dimensional representation, and infers the disease severity of patients at individual level along each dimension.
The model ﬁrst learns a transformation function from the CN domain to the PT domain with latent variables controlling transformation directions.
An inverse mapping function together with regularization on function continuity, pattern orthogonality and monotonicity was also imposed to make sure that the transformation function captures necessarily meaningful imaging patterns with clinical signiﬁcance.
We ﬁrst validated the model through semi-synthetic experiments, and then demonstrated its potential in capturing biologically plausible imaging patterns in Alzheimer’s disease (AD).
I NTRODUCTION
Neuroimaging, conventional machine learning, and deep learning have offered unprecedented opportunities to understand the underlying mechanism of brain disorders over the past decades (Davatzikos (2018)), and pave the road towards individualized precision medicine (Bzdok & MeyerLindenberg (2018)).
A large body of case-control studies leverage mass univariate group comparisons to derive structural or functional neuroimaging signatures (Habeck et al.
Hampel et al.
, Ewers et al.
However, these studies suffer from under-powered statistical inferences since the heterogeneous nature of neurological diseases usually violate the assumption that each group population are pathologically homogeneous.
A developing body of methodologies aim to disentangle this heterogeneity with various machine learning methods.
Zhang et al.
(2016) used the Bayesian Latent Dirichlet Allocation (LDA) model to identify latent atrophy patterns from voxel-wise gray matter (GM) density maps.
However, due to the nature of the LDA model, the density maps need to be ﬁrst discretized, and the model hypothesized to exclusively capture brain atrophy while ignoring the potential regional enlargement.
Young et al.
(2018) proposed another method, Sustain, to uncover temporal and phenotypic heterogeneity by inferring both subtypes and stages.
However, the model only handles around 10-20 large brain regions without more detailed information.
Notably, both methods applied directly in the PT domain, confront main limitations in avoiding potential disease-unrelated brain variations.
In contrast, semi-supervised clustering methods (Varol et al.
(2016), Dong et al.
(2015), Wen et al.
Yang et al.
(2021)) were proposed to cluster patients via the patterns or transformations between the reference group (CN) and the target patient group (PT).
A recent proposed deep learning-based semi-supervised clustering method, termed Smile-GAN (Yang et al. (2021)), achieved better clustering performance by learning multiple mappings from CN to PT with an inverse clustering function for both regularization and clustering.
Albeit these methods demonstrated potential in clinical applications, they have a major limitation.
In particular, these methods model disease heterogeneity as a dichotomous process and derive a discrete output, i.e., subtype, ignoring the fact that brain disorders progress along a continuum.
Moreover, variations among subtypes were contributed by both spatial and temporal differences in disease patterns, thus confounding further clinical analysis.(Fig.
1a)
To address the aforementioned limitations, we propose a novel method, Surreal-GAN (SemiSupervised Representation Learning via GAN), for deriving heterogeneity-reﬁned imaging signatures.
Surreal-GAN is a signiﬁcant extension of Smile-GAN under the same principle of semisupervised learning by transforming data from CN domain X to PT domain Y. Herein, the key extension is to represent complex disease-related heterogeneity with low dimensional representations with each dimension indicating the severity of one relatively homogeneous imaging patterns (Fig. 1b).
We refer to these low dimensional representations as R-indices ( r i , where i represent the i th dimension) of disease pattern.
The ﬁrst key point of the method is modelling disease as a continuous process and learning inﬁnite transformation directions from CN to PT, with each direction capturing a speciﬁc combination of patterns and severity.
The idea is realized by learning one transformation function which takes both normal data and a continuous latent variable as inputs and output synthesized-PT data whose distribution is indistinguishable from that of real PT data.
The second key point is controlling the monotonicity (from light to severe with increasing index value) of disease patterns through one monotonicity loss and double sampling procedure.
The third key point is boosting the separation of captured disease patterns through one orthogonality regularization.
The fourth key point is introducing an inverse mapping function consisting of a decomposition part and a reconstruction part which further ensure that patterns synthesized through transformation are exactly captured for inferring representations of disease patterns, the R-indices.
Besides the above mentioned regularization, function continuity, transformation sparsity and inverse consistency further guide the model to capture meaningful imaging patterns.
To support our claims, we ﬁrst validated Surreal-GAN on semi-synthetic data with known ground truth of disease patterns and severity.
We compared performance of Surreal-GAN to NMF (Lee & Seung (1999)), opNMF (Sotiras et al. Discriminant-NMF (Lee et al.
, Factor Analysis and LDA (Blei et al.
models, and subsequently studied the robustness of model under various conditions.
Finally, we applied the model to one real dataset for Alzheimer’s disease (AD), and demonstrated signiﬁcant correlations between the proposed imaging signatures and clinical variables.
M ETHODS
The schematic diagram of Surreal-GAN is shown in Fig.
1d.
The model is applied on regional volume data (volumes of different graymatter (GM) and whitematter (WM) regions) derived from structural MRI.
The essential idea is to learn one transformation function f : X ∗ Z → Y which transforms CN data x to different synthesized PT data y (cid:48)
=
f ( x , z ) , with latent variable z specifying distinct combinations of patterns and severity.
Here, the Latent (LAT) domain, Z = { z : 0 ≤ z i ≤ 1 ∀ 1 ≤ i ≤ M } , is a class of vectors with dimension M (predeﬁned number of patterns).
We denote four different data distributions as x ∼ p cn ( x ) , y ∼ p pt ( y ) , y (cid:48) ∼ p
syn
( y (cid:48) )
and z ∼ p lat ( z ) , respectively, where z ∼ p lat ( z ) is sampled from a multivariate uniform distribution
U [0 , 1] M , rather than a categorical distribution as in Smile-GAN.
A continuous z variable lay the foundation for learning continuous representations.
In addition to the transformation function, an adversarial discriminator D is introduced to distinguish between real PT data y and synthesized PT data y (cid:48) , thereby ensuring that the synthesized PT data are indistinguishable from real PT data (i.e. minimizing the distance between real PT data distribution and synthesized PT data distribution).
A continuous latent variable does not necessarily lead to desired properties of CN to PT transformation (e.g. separation/monotonicity of captured patterns).
That is, there are a number of functions potentially achieving equality in distributions, thus making it hard to guarantee that the transfor- mation function learned by the model is closely related to the underlying pathology progression process.
Moreover, during the training procedure, the transformation function backboned by the neural network tends to ignore the latent variable z .
Even when the Latent variable z is emphasized through regularization, different components of z variable do not naturally lead to separate disease patterns and are not positively correlated with pattern severity.
Therefore, with the assumption that there is one true underlying function for real PT data y
=
h
( x , z ) , Surreal-GAN aims to boost the transformation function f to approximate the true underlying function h , while having the latent variable, z , contributing to recognizable imaging patterns rather than being random ”activators” of the GAN.
For this purpose, we constrain the function class of f via different types of regularization as follows: 1) encourage sparse transformations; 2) enforce Lipschitz continuity of functions; 3) introduce one inverse function g : Y → Z serving to decompose and reconstruct; 4) boost orthogonality among synthesized/captured patterns; 5) enforce monotonicity of synthesized patterns and their positive correlations with components of z .
The training procedure of Surreal-GAN is thus a adversarial learning process constrained by these regularization.
2. A DVERSARIAL L OSS
The adversarial loss (Goodfellow et al.
(2014)) is used for iterative training of discriminator D and the transformation function f , which can be written as:
[Equation]
The transformation function f attempts to transform CN data to synthesized PT data so that they follow similar distributions as real PT data.
The discriminator, providing a probability that y comes from the real data rather than transformation function, tries to identify the synthesized PT data and distinguish it from real PT data.
Therefore, the discriminator D attempts to maximize the adversarial loss function while the transformation function f attempts to minimize against it.
The training process can be denoted as:
[Equation]
2. R EGULARIZATION 2.2. S PARSE T RANSFORMATION
We assumed that disease process will not change brain anatomy dramatically and primarily only affect certain regions throughout most of disease stages, which means that the true underlying transformation only moderately changes some regions while keeping the rest mildly affected with most of z variable values.
Therefore, to control sparsity and distance of transformations, we deﬁned one change loss to be the l 1 distance between the synthesized PT data and the original CN data:
[Equation]
L IPSCHITIZ C ONTINUITY AND I NVERSE M APPING
First, by enforcing the transformation function f to be K 1 -Lipschitz continuous, we can derive that, for ﬁxed latent variable z = a and ∀ x 1 , x 2 ∈ X , || f
( x 1 , a ) − f ( x 2 , a ) || 2 ≤ K 1 || x 1 − x 2 || 2 .
Thus, by controlling the constant K 1 , we constrained the transformation function to preserve the original distances among CN data instead of scattering them into the PT domain if a same combination of disease patterns is imposed to them.
Second, to prevent latent variable z from being ignored, we introduced an inverse mapping function from PT domain to Latent domain, g : Y → Z .
By Lemma1 (section A.1), with function g being
K 2 -Lipschitz continuous and d ( · , · ) being any distance metric satisfying triangular inequality, we can derive that, ∀ z 1 , z 2 ∼ p lat ( z ) , z 1 (cid:54) =
z 2 , and ¯ x ∼ p cn ( x ) , d ( f (¯ x , z 1 ) , f (¯ x , z 2 )) is lower bounded by ( d ( z 1 , z 2 ) K− 1 K 2 ( d ( g ( f (¯ x , z 1 )) , z 1 ) + d ( g ( f (¯ x , z 2 )) , z 2 ))) .
Therefore, by minimizing the distance between sampled latent variable z and reconstructed latent variable g ( f ( x , z )) , we can control differences between synthesized patterns to be positively related to distances between latent variables, and thus to be non-trivial (i.e., same CN data is transformed to signiﬁcantly different PT data with different z variables).
Therefore, we deﬁne a reconstruction loss as the l 2 distance between g ( f ( x , z )) and z :
[Equation]
2.2. P ATTERN D ECOMPOSITION
Nevertheless, a simple function g directly reconstructing sampled z from synthesized PT y (cid:48) do not reconstruct each component
z
i completely based on changes led by z i in transformation.
We are more interested in pattern representations of real PT data than generating synthesized PT, and inverse function g will be used for inferring R-indices as introduced in section 2.4.
Thus, it is very important for the inverse function to accurately capture patterns synthesized by intensively regularized transformation function f .
For this purpose, we further separated the function g : Y → Z into g 1 : Y → R M ∗ S (where M is number of patterns and S is number of input ROIs) and g 2 : R S → R .
Decomposer g 1 serves to reconstruct changes synthesized by each component
z i in transformation process: q i = f
( x , a i ) − x , where a i is a vector with i
th component a ii =
z i and a ij = 0 , ∀ i (cid:54) =
j .
Let ˆ q f ( x,z ) =
[ q T 1 , · · · , q TM ] T be concatenation of all synthesized changes
q i , we deﬁned the decomposition loss as:
[Equation]
g 2 serves to further reconstruct each component of sampled z variable from g 1 ( f ( x , z )) independently, so that the reconstruction loss can be rewritten as:
[Equation]
where ˆ l g 2 ( g 1 ( f ( x , z )) = g ( f ( x , z )) = [ g 2 ( g 1 ( f ( x , z )) 0: S ) , · · · , g 2 ( g 1 ( f ( x , z ))
S ∗ ( M − 1): S ∗ M )] T .
Function g here can be also considered as the approximation of expectation of posterior distribution.
In this sense, minimization of l 2 distances can also be interpreted as maximization of mutual information between latent variable z and synthesized PT data y (cid:48)
=
f ( x , z ) as explained in Remark in {+section A.
+}
(Chen et al.
From this perspective, the transformation function is forced to best utilize information from latent variable z , while also keeping mutual information between synthesized PT data y (cid:48) and original CN data x by controlling transformation distances.
2.2. O RTHOGONALITY OF P ATTERNS
Inclusion of latent variable z in the transformation function does not guarantee that different components of the latent variable, z i , contributes to relatively different patterns in synthesized PT data.
Instead, during training procedure, different components, z i , are more likely to synthesize patterns in same regions and lead to accumulated severity.
Therefore, we deﬁne another orthogonal loss to encourage separation among patterns synthesized by different components.
With changes led by each component, q i deﬁned in section 2.2.3, we constructed a matrix A f ( x , z ) with the i th column
A f ( x , z ) : ,i = | q i | .
To encourage separation of changes led by different components, we boosted the matrix A f ( x , z ) to be relatively orthogonal by minimizing the following orthogonality loss:
[Equation]
2.2. M ONOTONICITY AND P OSITIVE C ORRELATION
Besides separation of synthesized patterns, a positive correlation between values of each component z i (from 0 to 1) and severity of synthesized patterns can not be acquired spontaneously either.
Regarding severity of the disease pattern, we assumed that, as a pattern is becoming more severe, absolute values of changes in regional volumes can only increase monotonically or remain constant.
In another word, there is no oscillation in regional volumes as disease pattern is becoming more severe, while more regions can be included gradually with absolute changes switched from 0 to a positive value.
To satisfy this requirement, we sampled another latent variable z (cid:48) ∼ p
sev ( z (cid:48) | z ) , conditioned on previous sampled z variable, such that z (cid:48)
i ≥
z i , ∀ 1 ≤ i ≤ M .
With these double sampled latent variables, we deﬁned the monotonicity loss to be:
[Equation]
Minimization of this monotonicity loss penalize the case that volume changes induced by z is larger than that induced by z (cid:48) , while the other direction is permitted.
To further ensure a positive correlation (small z lead to mild patterns; large z lead to severe patterns), we introduced a cn loss, which serves to more strictly constrain the distance between synthesized PT data y (cid:48) and CN data x , when latent variable z is close to 0 vector.
By letting p cn ( z ) =
U (0 , 0 . 05)
M to be a multivariate uniform distribution, the cn loss is deﬁned as:
[Equation]
2. F ULL O BJECTIVE
With the adversarial loss and all other loss functions deﬁned for regularization, we can write the full objective as:
[Equation]
with γ , κ , ζ , λ , µ and η be parameters controlling the relative importance of different loss functions.
Through training process, we want to derive parametrized functions f , g 1 and g 2 satisfying:
[Equation]
[Equation]
2. R EPRESENTATION -I NDICES I NFERENCE
With the assumption that p syn ( f ( x , z ))
≈ p pt ( y ) and f satisfying all constraints, we consider learned transformation function f
to be a good approximation of the true underlying function h , such that f ( x , z )
≈ h ( x , σ ( z )) , where σ ∈ Ω and Ω is a class of permutation functions which change orders of elements in vector z .
Since the order of indices in derived representation is not important and we can always reorder them to ﬁnd the best matching, we simply rewrite it as f ( x , z )
≈ h ( x , z ) without loss of generality.
For any real PT data, ¯ y = h
(¯ x , r ) ∼ p pt ( y ) , we can derive that the ground truth R-indices r ≈ g
( f (¯ x , r ))
≈ g ( h (¯ x , r ))
≈ g
(¯ y ) .
Therefore, reconstruction function g can be directly applied to infer R-indices of disease patterns, r , of any unseen PT data.
I MPLEMENTATION D ETAILS 3. M ODEL A RCHITECTURE
The general architecture of networks can be understood from Fig. 1c.
The transformation function f utilizes a encoding-decoding structure.
Latent variable z and CN data x are ﬁrst mapped to two vectors with dimension 34 and the element-wise multiplication of them are then decoded to construct the synthesized PT data with dimension 139.
The inverse function g ﬁrst decodes real/synthesized
PT data y / y (cid:48) to larger vector with dimension 139*M and then maps them into a vector with dimension M.
The discriminator D utilizes the encoding structure which maps y/y (cid:48) to a vector with dimension 2.
More details of model architectures can be found in Appendix Table 2 and 3.
3. L IPSCHITZ C ONTINUITY
In implementation, we performed weight clipping to ensure Lipschitz continuity of transformation function f and inverse function g (Arjovsky et al.
With Θ f and Θ g denoting the weight spaces of function f and g , the compactness of them imply the Lispchitz continuity of two functions, with Lipschitz constants K 1 and K 2 only depends on Θ f and Θ g .
The compactness of Θ f and Θ g was guaranteed by clapping weight spaces into two closed box, Θ f =
[ − c f , c f ] d and Θ g =
[ − c g , c g ] d .
In implementation, both c f and c g were set to be 0.5 and these bounds can be further relaxed.
Weight clipping was claimed not to be the most satisfactory method to ensure Lipschitz continuity because of difﬁculty in choosing the appropriate clipping bounds.
However, in our case, we performed weight clipping for function f and g rather than discriminator D for a different purpose and weight clipping contributed to good performances for deriving representations.
3. T RAINING D ETAILS
Regarding optimization procedure, ADAM optimizer(Kingma & Ba (2014)) was used with a learning rate (lr) 4 ∗ 10 − 5 for Discriminator and 2 ∗ 10 − 4 for transformation function f and clustering function g .
β 1 and β 2 are set to be 0.5 and 0.999 respectively.
For hyper-parameters, we set γ = 6 , κ = 80 , ζ = 80 , µ = 500 , η = 6 .
However, performance of model on different tasks are robust to varying hyper-parameters as shown in section B.2.
Parameter λ determines the relative importance of orthogonality loss and controls the degree of overlapping among synthesized patterns.
Without prior knowledge on overlapping degree of underlying disease patterns, we set λ to different values in the following experiments and used agreements among multiple trained models to determine the optimal one.
Moreover, for all experiments, the batch size was set to be 1/8 of the PT data sample sizes.
The model was trained for at least 100000 iterations and saved until the reconstruction loss and the monotonicity loss are smaller than 0.003 and 6 ∗ 10 − 4 respectively.
Higher lr might improve convergence speed in some cases.
Detailed training procedure is revealed by Appendix Algorithm1.
E XPERIMENTS 4. D ATA P REPROCESSING
For semi-synthetic and real data experiments, we used T1-weighted (T1w) MR imaging (MRI) and cognition from the iSAGING (Imaging-based coordinate SysTem for AGIng and NeurodeGenerative diseases) consortium for cognitive impairment and dementia.
All baseline MRIs were corrected for intensity inhomogeneities (Sled et al.
Then, 139 regions of interest (ROIs) of brain volumes were extracted using a multi-atlas label fusion method (Doshi et al.
, harmonized (Pomponio et al.
to remove site effect, and then utilized as input features for Surreal-GAN.
(Fig. 6)
4. S EMI - SYNTHETIC EXPERIMENTS
Semi-synthetic data construction To set the ground truth of disease patterns and severity a prior, we generated semi-synthetic data by imposing simulated disease-related patterns to real CN data, thereby retaining the variation from the real CN data.
Speciﬁcally, we split 1392 cognitively normal (age < 70 years) into one real CN group with 492 subjects and one Pseudo-PT group with 900 subjects.
For the i th Pseudo-PT subject, we sampled a three-dimensional vector as pattern severity from a multivariate uniform distribution, s i ∼ U [0 , 1] 3 .
Three types of atrophy patterns were introduced to 900 Pseudo-PT subjects.
Different regions were included in different patterns as shown in Appendix
Table 4.
Five different datasets were constructed for testing the robustness of model under different conditions: (1) Basic dataset : For the i th Pseudo-PT subject and the j th ROI included in pattern k , we decreased the volume v ij depending on sampled severity: v ij = v ij − v ij ∗ s ik ∗ N (1 , 0 . 05) ∗ 0 .
Each pattern consists of changes in 14 ROIs and has four of them shared with other patterns; (2)
Large overlapping dataset :
Same as the Basic dataset, except that each pattern shares 8 ROIs with others; (3) Scarce regions dataset : Each pattern consists of changes in only 4 ROIs with other parts the same as the Basic dataset; (4) Within-pattern noise dataset : Regional changes incorporated in the same pattern have larger within-pattern variances with v ij = v ij − v ij ∗ s ik ∗ N (1 , 0 . 2 ) ∗ 0 .
3 ; (5) Mild atrophy dataset : Compared to the basic case, smaller changes were imposed by letting v ij = v ij − v ij ∗ s ik ∗ N (1 , 0 . 05) ∗ 0 .
Evaluation and Agreement Metric
In our experiments, Concordance Index (c-index) was used as the evaluation metric.
Speciﬁcally, for each pattern, we calculated a c-index between the inferred
R-index and the ground truth.
The average of M derived C-indices, refereed as pattern-c-index, was used for model evaluations.
Moreover, to quantify the pair-wise agreement between two trained models, we proposed another Pattern-agr-index which equals pattern-c-index between R-indices derived by two different models.
Experiment Procedure We ﬁrst validated the relationship between model agreements and their accuracy.
On each dataset, we ran the model 10 times with parameter λ = 0 .
6 , 0 .respectively.
With each λ , the average pair-wise pattern-agr-index among 10 models was compared with their average pattern-c-indices.
Further, the λ value leading to the best agreement was considered as the best choice, and results from 10 corresponding models were reported as model performances for each task.
Moreover, we ﬁxed the optimal λ value for each task and changed other parameters to 0 to understand contributions from each regularization term (section B.3).
Lastly, we compared our model with ﬁve other models.
NMF and Factor Analysis (FA) are well-known for deriving lower-dimensional representation of complex dataset.
The variant opNMF (Sotiras et al.
(2014)) has shown promise in parsing complex brain imaging data with extra orthogonal constraint.
Discriminant-NMF (DNMF) (Lee et al.
(2012)) was proposed to learn representations which best classify subgroups.
LDA, though known for extracting topics from documents, have been recently applied to uncover heterogeneity of AD disease from neuroimaging data (Zhang et al.
Data preprocessing for these models were introduced in section B.4.
4. R EAL D ATA E XPERIMENTS
Data Selection We applied Surreal-GAN to an AD dataset.
For AD, we deﬁned the CN group (N=850) to be subjects with Mini-mental state examination (MMSE) scores above 29, and the PT group (N=2204) as subjects diagnosed as mild cognitive impairment (MCI) or AD at baseline.
Experiments Procedure All CN and PT subjects were ﬁrst residualized to rule out the covariate effects estimated in the CN group using linear regression.
Then, adjusted features were standardized with respect to CN group.
Without ground truth, we selected both the optimal number of patterns, M , and λ parameter by measuring agreements among repetitively trained models.
For each combination of M = 2 , 3 , 4 and λ = 0 . 1 , 0 . 2 , 0 . 4 , 0 . 6 , 0 . 8 , we ran the model 10 times respectively.
The M and λ values leading to the highest agreement was considered optimal.
Among the 10 corresponding models, the one having the highest mean pair-wise agreements with the other models was used to derive R-indices for all PT subjects.
To visualize patterns corresponding to the i th dimension of R-indices, r i , we grouped subjects into three different subgroups: r i < 0 .
4 <
r i < 0 .
7 and r i > 0 .
7 , with r j < 0 .
4 for all j (cid:54)
=
i .
Voxel-wise group comparisons were performed between each subgroup and the CN group via AFNI-3dttest (R.W. (1996)) and GM-tissue map (Davatzikos et al.
(2002)) which encodes the volumetric changes in GM observed during the registration.
Pattern representations, R-indices, of PT subjects were further compared with other clinical variables to test their signiﬁcance.
Details of clinical variables and statistical tests can be found in section B.9.
[Table]
R ESULTS 5. R ESULTS ON S EMI - SYNTHETIC D ATA
We ﬁrst validated that agreements among multiple trained models (Fig. 2b) are good indicators of model accuracy (Fig. 2a) for parameter selections.
Besides, from Fig.
2a, we proved the model’s ability in capturing ground truth of patterns and severity under different cases including pattern overlapping and large within-pattern noise.
However, the model experienced declining performances when each pattern includes only scarce disease-related regions, and showed even worse performances when very mild atrophies are led by disease process.
This is expected since, for the mild atrophy case, the simulated atrophy rate, 0-20% of the regional volume, is even smaller than the standard deviation of most regional volumes among the normal population.
Finally, Surreal-GAN signiﬁcantly outperformed all ﬁve methods on ﬁve data sets we constructed (Table 1).
However, none of these methods optimally utilize the CN data as a reference distribution, which is one of important limitations preventing them from precisely learning disease-speciﬁc pattern representations rather than capturing disease-unrelated confounding variations.
The family of DNMF methods capture discriminant representation by minimizing and maximizing within-class and among-class variations respectively, thus did not capture heterogeneity within the PT class accurately either.
Designed for parsing disease heterogeneity, semi-supervised methods focused on clustering patients into hard categorical subtypes (Varol et al.
(2016), Dong et al.
(2015), Wen et al.
(2021), Yang et al.
With different end points, these methods (including Smile-GAN) can not be directly compared with Surreal-GAN.
To the best of our knowledge, our model is the ﬁrst semi-supervised approach for learning disease-related representations, using a healthy reference group as a means for comparison.
Therefore, to better understand the model performance, we leveraged the simulated ground truth information (not available in real experiments), derived ”practical upper bounds” for compared unsupervised models, and also computed the gap between Surreal-GAN and supervised methods.
(section B.5 and B.6)
5. R ESULTS ON R EAL D ATA
On the AD dataset, models show highest agreement when the number of patterns M = 2 .
From voxel-based comparison results (Fig. 3), we can clearly visualize two patterns related to AD.
Each dimension of R-indices, r i , shows a clear positive correlation with the corresponding pattern severity.
Pattern1, correlated with r 1 , shows diffuse cortical atrophies (e.g., bilateral insula, orbitofrontal and frontal poles), while pattern2 reveals focal atrophy in medial temporal lobes.
Reproducibility of these two patterns were validated in section B.7.
Furthermore, the 2D R-indices were effective and interpretable signatures for disease diagnosis and prognosis, achieving similar performance in AD classiﬁcation compared to original 139 ROIs (section B.8).
Continuity and monotonicity of inferred R-indices further enable us to easily test correlation among them and other clinical variables (Table 7).
Both r 1 and r 2 are highly correlated with CSF-Abeta value and memory dysfunction measured by ADNI-MEM.
However, r 1 shows stronger correlations with white matter lesion volumes, presence of hypertension, executive function and language functioning, while r 2 is more correlated with CSF-Tau, CSF-pTau and presence of APOE-E4 alleles.
C ONCLUSION
In this study, we have proposed a novel method, Surreal-GAN, for learning representations of underlying disease-related imaging patterns.
This model has overcome limitations in previous published semi-supervised clustering methods and shown great performance on semi-synthetic data sets.
On
AD dataset, the model parse heterogeneous PT data into two concise and clinically informative indices with preserved discriminant power, further proving its huge potential in uncovering disease heterogeneity from MRI data.
A A PPENDIX : M ETHODS A. L EMMA
Let f : X ∗ Z → Y and g :
Y → X be the transformation and inverse mapping function respectively.
If g is K-Lipschitz continuous and d ( · , · ) is any distance metric satisfying triangular inequality, then for ∀
z 1 , z 2 ∈ Z , and ∀ x ∈ X , d ( f ( x , z 1 ) , f ( x , z 2 )) is lower bounded by d ( z 1 , z 2 ) K −
[Equation]
d
[Equation]
g
[Equation]
Proof: By triangular inequality, we can derive that:
[Equation]
A. R EMARK
By minimizing the reconstruction loss L recons deﬁned in section 2.2.2 and 2.2.3, we are maximizing a lower bound of the mutual information between latent variable z and synthesized PT data y (cid:48)
=
f ( x , z ) .
Considering Q ( z | y (cid:48) ) to be an approximation of distribution P ( z | f ( x , z )) and assuming that it follows a Gaussian distribution N( g ( y (cid:48) ) , Σ ), mutual information denoted by I and entropy denoted by H , we can derive that:
[Equation]
(21) and (22) follows the Lemma 5.1 in Info-GAN (Chen et al.
and law of the unconscious statistician (Lotus) Theorem respectively.
Therefore [Equation] we derive that the mutual information between the latent variable z and synthesized PT data y (cid:48) is bounded below by 1 nm (cid:80) ni =
[Equation] − 12 ( z i − f ( x j , z i ))
T Σ − 1 ( z i − f ( x j , z i ))
+ constant ) .
With a further assumption that Σ is an identity matrix, maximization of this lower bound is equivalent to minimizing the reconstruction loss L recons .
A. N ETWORK A RCHITECTURE
Table 2 and Table 3 display network architectures of transformation function f , discriminator D and reconstruction function g (consisting of g 1 and g 2 ). Layer
[Table]
Encoder from x
Linear1+Leaky-Relu
Linear2+Leaky-Relu
[Table]
Decoder from z
Linear1+Sigmoid
[Table]
Decoder to y (cid:48)
Linear1+Leaky-Relu
Linear2+Leaky-Relu
[Table]
NoNo
[Table]
[Table]
A.
[Table]
A LGORITHM
Detailed training procedure of Surreal-GAN is disclosed by Algorithm 1.
Algorithm q in section 2.2.3 and 2.2.4.
while not meeting stopping criteria or reaching max epoch do for all batches { x i } mi =1 , { y i } mi =1 do sample m latent vectors { z i } mi =1 from multivariate uniform distribution with z i ∼ U [0 , 1] M
Update weights of discriminator D : Use ADAM to update θ D with gradient: ∇ θ D 1 m (cid:80)
mi
= i
[( l c ( D ( y i ) , e 1 ) + l c ( D ( f ( x i , z i ) , e 0 )))] sample m latent vectors { z (cid:48)
i } mi =1 conditioned on previously sampled { z i } mi =1 , with each z (cid:48)
i j ∼ U ( z i j , 1] M sample another m latent vectors { z cni } mi =1 with each z cni ∼ U (0 , 0 . 05)
M
Update weights of transformation function f : Use ADAM to update θ f with gradient: ∇ θ f 1 m (cid:80) mi
= i
[ l c ( D ( f ( x i , z i ) , e 1 )))
+ γ ( || f
( x i , z i ) − x i || 1 )
+ κ
|| g 1 ( f ( x i , z i ))
− ˆ q f ( x i , z i )
||
2 + ζ ||
ˆ l g 2 ( g 1 ( f ( x i , z i ))
− z
i ||
+ λ ||
A Tf ( x i , z i )
A f ( x i , z i ) −
I || F + µ || max( | f ( x i , z i ) − x i | − | f ( x i , z (cid:48) i ) − x i | , 0 ) ||
2 + η || f
( x i , z cni ) − x i || 1 ]
Update weights of function g 1 :
Use ADAM to update θ g 1 with gradient: ∇ θ g 1 1 m (cid:80) m i
= i
[ || g 1 ( f ( x i , z i ))
− ˆ q f ( x i , z i ) || 2 ]
Update weights of function g 2 :
Use ADAM to update θ g 2 with gradient: ∇ θ g 2 1 m (cid:80) mi
= i
[ || ˆ l g 2 ( g 1 ( f ( x i , z i )) − z i ||end end
B A PPENDIX : E XPERIMENTS B. R EGIONS WITH SIMULATED ATROPHY IN SEMI - SYNTHETIC DATASETS
Regions of interest (ROI) included in three patterns (P1-P3) in different semi-synthetic datasets are revealed by Table 4.
Small overlapping case indicates the included ROIs in three different dataset as described in section 4.2: (1) Basic dataset; (4)Within-pattern noise dataset and (5)Mild atrophy dataset.
Each ROI is a combination of left and right parts of the region, so each check sign represents inclusion of 2 out of 139 regions.
[Table]
B. H YPER - PARAMETER S ELECTION
We trained the model on the basic case and the mild changes case (the easy and hard case) with varying hyper-parameters to test the model robustness to hyper-parameter selections.
Speciﬁcally, we changed each parameter from 50% to 150% of the preset value (introduced in section 3.3) while keeping other parameters ﬁxed.
With each set of parameters, we trained the model 10 times and reported average pattern-c-index and average pattern-agr-index as described in section 4.2.
From
Fig.
4a, we can see that model performances are mostly robust to different choices.
For the mild changes case, models, with different η values, do show higher variations in performances.
However, pattern-agr-indices still have good indication of the best choice, and this metric can always be used for parameter selections on different datasets.
B. C ONTRIBUTION FROM R EGULARIZATION
Similar to section B.2, we set different parameters to 0 to understand contributions from corresponding regularization terms.
Speciﬁcally, we set κ =
(no decomposition loss), λ =
(no orthogonality loss), µ =
(no monotonicity loss), ζ =
(no cn loss), µ/ζ =
(no constraint on monotonicity and positive correlation), κ/λ/µ/ζ =
(no extra regularization compared to Smile-GAN framework) respectively with other parameters ﬁxed.
With different sets of parameter values, we trained the model 10 times and report average pattern-c-indices.
From Fig.4c, we can clearly understand the importance of different regularization terms and visualize how additional regularization terms lead to improved representation performances compared to a pseudo comparable ”Smile-GAN” (Using same regularization as Smile-GAN but with continuous latent variable). [Table]
B. D ATA P REPROCESSING FOR C OMPARED M ODELS
Z-scores of ROIs with respect to the CN group were directly used as input features of FA model.
However, for NMF, OpNMF and LDA model, we need to borrow a prior knowledge that atrophy (volume decreasing) is more common in dementia-related brain diseases, and thus, reversed the sign of z-scores, kept positive z-scores, and set negative values to 0.
For LDA model, we further dis- [Table] cretized the value by ﬁrst multiplying z-scores by 10 and then mapping them to the closest integer as described in Zhang et al.
For the DNMF model, both CN and PT data and their corresponding diagnosis labels are provided as input, with ROI data ﬁrst standardized to lie in range 0-1.
B. ”P RACTICAL U PPER B OUNDS ” OF U NSUPERVISED M ETHODS
As discussed in section 5. [Table] unsupervised methods were not designed to best utilize the CN data as a reference distribution.
Thus, we derived ”practical upper bounds” for compared models on different tasks, with the assumption that these methods have some components capturing the ground truth while having other components representing non-disease related variations.
On each semisynthetic test, we ran each method with number of components, M , ranging from 3-10.
For M > 3 , we intensively searched for the combination of 3 components that best match the ground truth and calculated the pattern c-index.
The best result among M = 3 − 10 is considered as an ”practical upper bound” for the model.
As shown in Table 5, upper bounds of NMF methods are comparable to results from Surreal-GAN, while other methods still show much worse performances.
Note that these are ”practical upper bounds” derived with known ground truth.
In real cases, we are not interested in a set patterns that includes the true disease effects but want to ﬁnd disease-related patterns only.
However, it will be very hard to know what the best number of components is and which components are truly disease-related with these compared models.
In contrast, Surreal-GAN can directly and accurately output disease-speciﬁc representations without indices capturing nondisease related variations, which is one of the key advantages of the proposed method.
B. C OMPARISONS WITH S UPERVISED M ETHODS
We further compared the model with linear regression (LR) and support vector regression (SVR) with RBF kernel to understand the gap between our model and the most optimal model performances in semi-synthetic tests.
A ﬁve fold cross validation were run with three different models.
Average pattern-c-indices on both train and test sets are reported.
We can ﬁrst observe that Surreal-GAN, as an semi-supervised methods, shows almost equal performances on train and test set, proving a good ability in generalization.
On ﬁve different tasks (table6), there is a 0.04-0.07 pattern-c-indices gap between Surreal-GAN and supervised model performances.
This gap is considered reasonable but there is still space for model improvements.
B. G ENERALIZATION AND R EPRODUCIBILITY ON R EAL D ATASET
We randomly half split the real data (described in section 4.3) in train and test set, with both CN and PT data equally distributed in two sets.
Following same experiment procedure described in section 4.3, we ﬁrst trained the model on the training set, and then applied the model to derive 2dimensional R-indices for all CN and PT data in the test set.
Voxel-wise group comparisons were conducted between subgroups and CN in the test set for visualization.
From Fig.
5, we can observe that R-indices are correlated with almost same patterns shown in Fig.
3, though much smaller sample size led to relatively lower statistical signiﬁcance.
B. L OW D IMENSIONAL R EPRESENTATION FOR AD D IAGNOSIS
We used R-indices of test data introduced in section B.7, and compared their ability to classify
CN and PT with that of 139 ROI volumes.
Support vector machine (SVM) was selected as the classiﬁcation model.
20% leave-out experiments were performed 100 times with derived R-indices and 139 ROI as input features respectively.
In each run, we randomly sampled 80% of data as training set and applied trained models on the rest 20% to derive the AUC metric.
Grid search were used for parameter selection.
With 2D R-indices as features, SVM model was able to reach an average AUC, 0 .
895 ± 0 .
011 , which is only mildly lower than AUC derived with 139 ROIs as features, 0 . 929 ± 0 . 015 .
Therefore, we can conclude that, 2D R-indices, kept almost all discriminant information among PT data, while parsing the heterogeneity in a clear, concise and interpretable way.
B. A SSOCIATIONS WITH C LINICAL V ARIABLES
Each dimension of R-indices, r i , is compared with different clinical variables for AD disease.
For each clinical variable, we only selected out samples who have it available for statistical analyses.
ADNI composite scores, including ADNI-EF, ADNI-MEM and ADNI-LAN, measure subjects’ functions in executive functions, memory and language respectively.
They are only available among subjects from Alzheimer’s Disease Neuroimaging Initiative (ADNI) study.
Digit Symbol Substitution Test (DSST) measures a range of cognition operations including motor speed, attention
[Table]
and visuoperceptual.
For all mentioned clinical scores, a higher value indicates a better performance.
CSFAbeta, CSF-Tau and CSF-PTau are three very important hallmarks of AD disease corresponding to amyloid and tau hypotheses.
Since measures of these three values have great variance among different studies, only ADNI samples with CSF measures were included for analysis.
For dichotomous variables (Apoe-E4 Alleles Carrier & Hypertension), point biserial correlation with corresponding p value was derived between the variable and each pattern dimension, r i .
Pearson correlations were derived for other continuous variables.
[Table]