Provable Subspace Identification Under Post-Nonlinear Mixtures
Abstract
Unsupervised mixture learning (UML) aims at identifying linearly or nonlinearly mixed latent components in a blind manner.
UML is known to be challenging:
Even learning linear mixtures requires highly nontrivial analytical tools, e.g., independent component analysis or nonnegative matrix factorization.
In this work, the post-nonlinear (PNL) mixture model—where unknown element-wise nonlinear functions are imposed onto a linear mixture—is revisited.
The PNL model is widely employed in different fields ranging from brain signal classification, speech separation, remote sensing, to causal discovery.
To identify and remove the unknown nonlinear functions, existing works often assume different properties on the latent components (e.g., statistical independence or probability-simplex structures).
This work shows that under a carefully designed UML criterion, the existence of a nontrivial null space associated with the underlying mixing system suffices to guarantee identification/removal of the unknown nonlinearity.
Compared to prior works, our finding largely relaxes the conditions of attaining PNL identifiability, and thus may benefit applications where no strong structural information on the latent components is known.
A finite-sample analysis is offered to characterize the performance of the proposed approach under realistic settings.
To implement the proposed learning criterion, a block coordinate descent algorithm is proposed.
A series of numerical experiments corroborate our theoretical claims.
Introduction
Unsupervised mixture learning (UML) has been broadly used in machine learning tasks, e g., for recovering mixed latent components or extracting informative data representations.
Central to understanding UML is the concept of identifiability .
The identifiability of UML is concerned with whether the latent components can be identified (up to certain to inconsequential ambiguities) with guarantees—without using any label or training data.
This is a challenging problem due to the unsupervised nature.
To address the identifiability challenge, linear mixture learning problems were tackled via exploiting properties of the latent components, e.g., statistical independence [1], nonnegativity [2–4], quasi-stationarity [5,6], and boundedness [7].
This leads to a cohort of blind source separation (BSS) methods.
However, linear mixture models (LMMs) oftentimes fail to perform well on real-world data, due to the unknown nonlinear distortions arising in data generation and acquisition.
In the past two decades, nonlinear mixture models (NMMs) have attracted unprecedentedly more attention [8–14].
Nonetheless, the identifiability of the latent components is much harder to establish under NMMs.
It was shown in [15] that the NMMs are in general not identifiable, even with strong assumptions, e.g., statistical independence among the latent components.
To establish NMM identifability, a line of work exploited observable auxiliary variables or specific priors (i.e., extra information about the data or the latent components on top of statistical independence); see, e.g., [13,14,16,17].
Another line of methods took an alternative route via utilizing the structures of the nonlinear distortions.
In particular, the post-nonlinear mixture (PNL) model [8, 9, 18–20] is a reasonable extension of the classical
LMM by assuming unknown nonlinear transformations individually imposed onto the outputs of a underlying linear mixture.
This kind of “structured NMM” is used in a wide range of applications, e.g. hyperspectral imaging [19,21], brain data classification [20,22–24], and causal discovery [12,25,26].
In order to identify the generative model/latent components under the PNL model, a key step is to remove the nonlinear distortions in an unsupervised manner.
To this end, the existing methods often explicitly rely on some properties of the latent components, e.g., statistical independence [8,9,18], availability of multiview data [20] and the sum-to-one and nonnegativity (or probability-simplex) structure of the latent components [19,27].
These structures stem from specific applications, and thus are meaningful—yet not always available.
A natural question is whether the nonlinear distortions are still removable if the widely used structural assumptions (e.g., those in [8,9,18–20,27]) do not hold?
In this work, we offer a positive answer to the above inquiry—and build a new learning algorithm based on our analyses.
Our detailed contributions are as follows.
Subspace-Based PNL Model Identification.
We propose a new nonlinearity identification and removal criterion under the PNL model.
We show that, as long as the underlying unknown linear mixing system of the PNL model admits a nontrivial orthogonal complement (or, its transpose has a nontrivial null space), the unknown nonlinear transformations are identifiable and removable, under mild conditions.
Notably, our approach does not use any specific structural assumptions of the latent components.
Our finding presents a fairly different result compared to existing nonlinear mixture learning techniques.
The latter often heavily rely on the properties of the latent components.
Hence, our result may offer new insights and a useful alternative to this long-standing challenge.
An immediate consequence is that our method can work with various types of latent components, including those not covered by existing PNL model identification approaches in [8,9,18–20,27].
Performance Analysis Under Realistic Settings.
The model identification analysis is conducted under the population case where unlimited data is available, with the assumption that a universal function learner can be used to cancel any nonlinear distortion.
To advance the understanding under more realistic settings, we also consider the realistic scenario where one only has access to finite samples and non-universal function learners.
The analysis is a combination or statistical generalization theory and numerical differentiation, which is reminiscent of the recently developed framework in [20,28,29]—with nontrivial additional efforts to accommodate our learning criterion.
Optimization Algorithm Design.
Based on the theoretical analysis, we formulate the identification problem as a constrained optimization criterion.
The optimization problem is challenging, as it involves learning unknown nonlinear functions [represented by neural networks (NNs)] under nonconvex constraints.
We propose a block coordinate descent (BCD) algorithm that alternates between two subproblems, namely, null space basis learning and nonlinear function learning.
This way, the latter is disentangled with constraints, and thus off-the-shelf NN training techniques (e.g.,
Adam [30]) can be readily employed to handle the subproblem.
A series of experiments are conducted for validating our theoretical claims.
Notations.
x, x , and X represent a scalar, a vector, and a matrix, respectively; ∥ x ∥ 0 ,
∥ x ∥ 1 , and ∥ x
∥ 2 denote the ℓ 0 function, the ℓ 1 norm, and the Euclidean norm, respectively; ⊙ and ⊛ denote the Khatri-Rao product and the Hadamard product, respectively; f is used to denote a function f ( · ) :
R → R ; f ′ , f ′′ and f ( n ) denote the first-order, the second-order, and the n th order derivatives of the function f , respectively; f ◦ g denotes the function composition; R ( X ) and N ( X ) mean the range space and the null space of X , respectively.
Background 2.1 UML and Model Identification
In UML, the classical LMM is defined as follows [31]:
[Equation]
where x ℓ ∈ R M is the ℓ th observation sample, s ℓ ∈ R K contains the K latent components, and
A ∈ R M × K is the mixing system.
The latent components in (1) are generally not identifiable, if A is not known [31].
As a remedy, information about A and/or s ℓ is often used to establish identifiability.
For instance, statistical independence among [ s ℓ ] i ’s is used in independent component analysis (ICA) [1], and the nonnegativity of A ∈ R M × K + and S =
[ s 1 , · · · , s N ] ∈ R K × N + are used in nonnegative matrix factorization (NMF)
[3,4]; also see [5–7,32–34] for more conditions that can assist LMM identification.
The LMM in (1) is often over-simplified for modeling the data generation/acquisition processes in real-world applications—where nonlinear effects are widely observed.
In many cases, the NMMs are of more interest.
A typical NMM is as follows [35]:
[Equation]
where g : R K → R M is a nonlinear “mixing system”.
Compared to the LMM, the NMM in (2) can represent much more complex data generation/acquisition processes.
However, it was shown in [35] that the model in (2) is not identifiable, even if the latent components satisfy some fairly strong assumptions, e.g., statistical independence.
A workaround is to use more information of or additional conditions on the latent components, e.g., the availability of auxiliary variables [13,14,16].
Another approach is by exploiting structural assumptions of the nonlinear mixing process.
This leads to the suite of PNL model learning works (see, e.g., [8,9,18–20,27,36]), which will be our focus.
2.2 Post-Nonlinear Mixture Model
The PNL model is a natural extension to the LMM, which is expressed as follows [8,9,18,20,27,36]:
[Equation]
where g =
[ g 1 ( · ) , · · · , g M ( · )] ⊤ with each g m ( · ) :
R → R being an invertible nonlinear function.
We assume s ℓ ∼ p ( s ) and the support of p ( s ) is a continuous and open domain S .
The PNL model has a myriad of of applications across different fields, e.g., causal discovery [12,25, 26], hyperspectral imaging [21] and brain data classification [22–24].
It is considered as an appropriate model when the unknown nonlinear distortions happen at the sensor end in data acquisition.
It also offers a valuable generalization to the linear mixture generative models in data analytics, e.g., those used in NMF and data clustering [37,38].
An important remark is that the challenge of UML under the PNL model boils down to identifying and removing g ( · ) , as this will lead to a well-understood LMM as in (1).
Then, any LMM identification approach, e.g., those in [3,6,7,31,32,34,39], can be applied to identify the latent components s ℓ for ℓ = 1 , . . .
, N .
Existing works tackle the g -identification and removal problem from various angles.
In [8,18], the statistical independent among the latent components (i.e., [ s ℓ ] k for k = 1 , . .
, K ) is used.
Recently, [19,27] proposed to identify the PNL model with latent components satisfying the probability simplex constraint (i.e., 1 ⊤ s ℓ = 1 , s ℓ ≥ 0 ) that often arises in soft clustering problems.
The work in [20] shows that g ( · ) can be provably removed if multiple views of data exist.
These methods offered insightful and useful approaches to remove g ( · ) , but the use of specific structural assumptions on the latent components make their applicability relatively narrow.
We propose to identify and remove the nonlinear distortions via exploiting an underlying subspace that often naturally exists under PNL models, instead of resorting to structural assumptions of s ℓ as in prior works.
Our method starts with the following observation: If the mixing system A is a tall matrix, N ( A ⊤ ) is a nontrivial subspace.
This implies that if only the linear mixture part is considered (i.e., if g ( · ) can be removed completely), there exist vectors v such that
[Equation]
where the nonzero v is any vector from N ( A ⊤ ) .
In the next section, we will show how this simple equation in (4) allows for constructing a provable g -identification and removal criterion.
Proposed Approach
In this section, we propose a learning criterion to identify/remove the nonlinear transformations g ( · ) .
We first consider the population case where infinite data points are available; that is, all x ℓ ∼ p ( x ) over the continuous support X are available.
Then, we will move forward to consider the finite-sample case in Sec. 3.2.
Under the infinite-data assumption, our g -identification formulation is as follows: find Q , f ( · ) =
[ f 1 ( · ) , · · · , f M ( · )] ⊤ (5a)
[Equation]
where Q ∈ R M × D , D is the dimension of the null space (i.e., N ( A ⊤ ) ), in which D ≥ 1 and D < M .
The ℓ 0 function constraint in (5d) means that Q is constrained to be a dense matrix, which will prove important for establishing identifiability; this will become clearer in Sec. 3.1.
In the formulation, f m ( · ) is a nonlinear invertible function that we look for.
Ideally, we hope to learn f m ( · ) =
g − 1 m ( · ) which cancels the nonlinear transformation.
Then, Q forms a basis of N ( A ⊤ ) .
Note that under the orthogonality constraint in (5d), the trivial solution, i.e., Q = 0 , is avoided.
Besides, the invertibility constraint in 5c is used to prevent other degenerate solutions, e.g., f ( x ℓ )
=
c for all ℓ with a constant c , from happening.
3.1 Provable Nonlinearity Removal
We will show that solving (5) guarantees that the nonlinear transformation g ( · ) is removed from the
PNL model.
To this end, we first introduce the following condition:
Definition 1 (Locally Free Components) Consider real-valued random vector v =
[ v 1 , . . .
, v d ] ⊤ ∈
R d , where v i resides in a continuous and open set V i ⊆ R .
Assume that the following holds for all j p ( v j | v − j ) > 0 , with continuous support V j | v − j given any v − j , where v − j denotes the vector with all entries but v j .
Then, the components in v are all locally free components.
Note that the definition above means that each v j has the “freedom” to change (at least locally) no matter what value the v − j part takes.
As a special case, statistically independent random variables clearly satisfy the definition.
However, statistical independence is a much stronger condition.
Dependent variables could also be locally free components.
For instance, vectors from the probability simplex, i.e.,
[Equation]
also satisfy Definition 1—that is, any K − 1 of the K components in v are locally free components.
Generally, if v 1 , . .
. , v d are not completely dependent, the locally free condition is not hard to meet.
Simply speaking, with v i and v j being free variables, we could observe any possible value of v j given a fixed ¯ v i .
Using this notion, consider the functional equation q ⊤ h ( Av ) = 0 that holds for all v .
Then, we can always observe
[Equation]
with any fixed ¯ v − j , where v j is from the continuous support of p ( v j | ¯ v − j ) > 0 .
Taking derivative of (7) w.r.t.
v j leads to the following:
[Equation]
as all the terms ∂ ¯ v i / ∂v j = 0 for any
i ̸ = j .
This property will help us show the following main result:
Theorem 1 (Nonlinearity Identification and Removal)
Under the model in (3) , assume that the criterion (5) is solved.
In addition, assume that A ∈ R M × K is drawn from any joint absolutely continuous distribution, that (cid:101) K of the K components of s are locally free components (cf.
Def. 1), and that the learned (cid:98) h m = (cid:98) f m ◦ g m is twice differentiable for all m ∈ [ M ] .
Suppose that
[Equation] [Equation]
Then, almost surely, any (cid:98) f ( · ) that is a solution of (5) satisfies (cid:98)
[Equation]
∀ m ∈
[ M ] , where c m ̸ = 0 and d m is a constant, at the limit of infinite data.
Theorem 1 indicates that if any solution (cid:98) f ( · ) of (5) is found, then the composition (cid:98) h m = (cid:98) f m ◦ g m is an affine function for all m .
Notably, the theorem does not require all the K latent components to be locally free components, as long as the condition (cid:101) K ( (cid:101) K +1) / 2 ≥ M is satisfied—which means that some components are even allowed to be completely dependent.
Intuitively, if (cid:101) K is too small then it means that the remaining K − (cid:101) K components do not provide useful information, while a larger (cid:101) K implies that there is more diversity among the latent components to assist nonlinearity removal.
Note that the premise here is that the null space N ( A ⊤ ) must exist, i.e., M > K should hold as rank( A )
=
min { M, K } with probability one for any A that is drawn from a joint continuous distribution.
Otherwise, one may fail to learn a nonzero Q .
On the other hand, if M is overly large, i.e., M > (cid:101) K ( (cid:101) K +1) / 2 , the model is not identifiable as there is a lack of information (i.e., the number of locally free components is not large enough) to pin down
all the g i ( · ) ’s with i = 1 , · · · , M .
We show the proof as follows:
Proof : By solving (5), we have the following equation for all s ℓ ∈ S
[Equation]
where h
= f ◦ g is the function composition.
For simplicity, we drop the subscript “ ℓ ” as the equation holds for any s ∈ S .
First, we show the existence of solution to (5).
It is obvious that one can let f = g − 1 (i.e., f m =
g − 1 m for all m ) and make the columns of Q to be an orthogonal basis of N ( A ⊤ ) .
In addition, such a Q can always be made dense.
This is because A follows a joint continuous distribution, which indicates that the probability of N ( A ⊤ ) being orthogonal to any axis is zero.
Next, we show that such a solution is unique up to only affine ambiguities.
By the assumptions, there are (cid:101) K out of the K components of s that are locally free.
Thus, by taking the second-order (cross) derivatives of Eq.
10 w.r.t.
each of the (cid:101) K variables, as shown in (8), we have the following:
[Equation]
where a k is the k th column of A .
Without loss of generality, we have assumed that the first (cid:101) K variables of s are locally free components.
Note that if one can show (cid:98) h ′′ m ([ As ] m ) = 0 for any m over any s , then it indicates that (cid:98) h m ( · ) is an affine function for all m over S .
To this end, we show that Q ⊤ ⊙ B has full column rank, where the sizes of the matrices involved are Q ∈ R M × D and B ∈ R (cid:102) K
( (cid:102) K +
[Equation]
× M .
By Lemma 1 of [40], for matrices U ∈ R a × m and V ∈ R b × m , U ⊙ V has full column rank if krank( U ) + krank( V ) ≥ m + 1 with krank( U ) and krank( V ) being the Kruskal rank of U and V , respectively.
The Kruskal rank of matrix U is defined as the largest number τ such that every set of τ columns of U is linearly independent.
For Q ⊤ ⊙ B , we do not have control over
Q since it is an optimization variable.
But the Kruskal rank k Q ⊤ is at least 1 since we have the constraint ∥ Q ∥ 0 = MD .
In terms of B , we can show that the matrix B has full Kruskal rank min (cid:0) (cid:101) K ( (cid:101) K +1) / 2 , M (cid:1) , almost surely.
The detailed explanation can be found in Appendix B.
To derive the conditions required for model identification (i.e., rank( Q ⊤ ⊙ B ) =
M ), we consider the following two cases:
a) For the case of krank ( B ) = (cid:101) K
( (cid:101) K +1)
, rank( Q ⊤ ⊙ B ) =
M with probability one when the following conditions are met: M ≥ (cid:101) K ( (cid:101) K + 1) and 1 + (cid:101) K ( (cid:101) K + 1) ≥ M + 1 , which holds if M = (cid:101) K ( (cid:101) K + 1).
b) For the case of krank ( B ) =
M , rank( Q ⊤ ⊙ B )
=
M with probability one when the following conditions are met:
[Equation]
The two cases imply that if (cid:101) K (
[Equation]
≥ M is satisfied, then the nonlinear functions g m ( · ) ’s can be removed almost surely.
■
3.2 Finite-Sample Identifiability Analysis
The identifiability analysis in Sec.
3.1 is based on the assumption that (uncountably) infinite samples are available.
However, one always has to work with finite samples in practice.
In addition, the proof of Theorem 1 assumed that the f m ( · ) ’s are universal function approximators.
Nonetheless, in practice, the function learners, e.g., neural networks, may have nontrivial approximation errors for modeling nonlinear functions.
In this section, we provide analysis under more realistic conditions.
To begin with, note that when only N i.i.d.
samples are available, one could rewrite the finite-sample version of (5) as follows
[Equation]
where F : R → R is an invertible function class used for modeling the inverse of function g m ( · ) .
In the population case (i.e., N = ∞ ), (12) and (5) have the same solutions.
To characterize the finite sample performance of (12) under f ( · ) that has limited expressive power, we will use the following definition and assumptions:
Definition 2 (Function Class and Inverse)
The function g ∈ G is an invertible continuous nonlinear function.
We define its inverse class G − 1 as a function class that contains all the u ’s satisfying u ◦ g ( y ) =
αy + β with α ̸ = 0 , ∀ g ∈ G .
Assumption 1 (Realization Gap) For any u ∈
G − 1 , there exists f ∈
F such that sup x ∈X | f ( x m ) − u ( x m ) | ≤ ν, ∀ m ∈
[ M ] .
Assumption 2 (Boundedness)
The 4th-order derivatives of f m ∈ F and g m ∈ G exist.
In addition, | f ( n ) m ( · ) | and | g ( n ) m ( · ) | are bounded for all n ∈ [4] and m ∈ [ M ] .
Any 4th-order derivative of q ⊤ k h ( As ℓ ) with k =
[ D ] is bounded by C d .
In addition, A has bounded elements.
Assumption 3 (Neural Network Structure)
The function f m ( · ) is parameterized by a one-hiddenlayer neural network with R neurons and 1 -Lipschitz nonlinear activation function ζ ( · ) :
R → R with ζ (0) = 0 1 .
[Equation]
13) where ζ ( y ) =
[ ζ ( y 1 ) , . . .
, ζ ( y R )] ⊤ , w i ∈ R R for i = 1 , 2 .
Next, we show the finite-sample identifiability result for the case where the above neural network class is used.
Our analysis can be readily generalized to cover more complex neural networks such as deep convolutional neural network (CNN) and ResNet.
However, we use this simple neural network as a showcase, since our goal is to reveal insights other than covering complex neural structures.
Using the neural networks from Assumption 3, we have the following lemma:
Lemma 1 Assume that F is the function class defined in Assumption 3 and the input x is bounded by | x m | ≤ C x for all m .
Then, the loss function (cid:13)(cid:13)
Q ⊤ f ( x ℓ )
[Equation]
2 2 has the following Rademacher complexity
[Equation]
The proof can be found in Appendix D. Note that Lemma 1 indicates that the complexity of the function class is proportional to the width of the neural network R and inversely proportional to the sample size N .
With Lemma 1, we have the following theorem:
Theorem 2 (Finite-Sample Identifiability)
Under the generative model (3) , assume that Assumptions 1, 2 and 3 hold.
Suppose that x ℓ for ℓ ∈ [ N ] are i.i.d.
samples from X according to a certain distribution D .
Denote any solution of (12) as (cid:98) f
= [ (cid:98) f 1 , . .
, (cid:98) f M ] ⊤ and (cid:98)
h m = (cid:98) f m ◦ g m for m ∈ [ M ] .
Then, with probability of at least 1 − δ , the following holds:
[Equation]
where σ 2min ( Q ⊤ ⊙ B ) denotes the smallest singular value of the matrix Q ⊤ ⊙ B , which is defined in the linear system (11) .
The detailed proof is relegated to Appendix D.
The proof consists of three steps: 1) treat the loss function as a supervised regression problem and estimate the “generalization error” using the empirical error and Rademacher complexity; 2) approximate the linear system in (11) using the generalization error and numerical differentiation; and 3) bound and characterize the second-order derivatives based on the approximated linear system.
Theorem 2 implies that the second-order derivatives of (cid:98) h m ( · ) ’s approach zero with sufficiently large sample size N .
However, the ν term is not determined by N and it only decreases to zero when F is a universal function approximator (which could be attained if R is large enough).
Therefore, there is always a trade-off between the complexity (encoded by key parameters like depth and width) of the neural network and the effectiveness of model identification given fixed sample size N .
According to Theorem 2, one hopes to employ an expressive enough neural network for canceling g m ( · ) , but excessively increasing the expressiveness would hurt the performance under a given N —this is consistent with our experience in many neural network learning problems.
Optimization Design
In this section, we will design an optimization scheme to implement the criterion in (12) Specifically, we propose to the following formulation:
[Equation]
Note that the formulation in (16) does not ensure a dense Q .
Nonetheless, if Q is initialized randomly using any continuous distribution, iterative optimizers would never return a Q that contains zeros, if the iterative algorithm can be approximated by a continuous transformation.
We use the neural network structure defined in Assumption 3 to approximate f m ( · ) .
Note that with sufficiently large
R , the function f m ( · ) is a universal approximator [42,43].
In addition, to promote invertibility, we introduce another neural network r ( · ) , with the same structure as that of f ( · ) , to make sure that f ( x ℓ ) can be converted back to x ℓ .
This idea is from autoencoder [44].
The problem is then recast as follows:
[Equation]
where the hyperparameter λ ≥ 0 is used for balancing the energy between the loss and the regularizer term.
In addition, we define L =
L 1 + λ L 2 .
The problem can be handled by a block coordinate descent (BCD) algorithm as shown in Algorithm 1.
Note that any stochastic optimizer designed for neural network training (e.g., [30]) can be used here for the f ( · ) and r ( · ) updates.
We use θ f and θ r to denote the parameters of the corresponding neural networks.
Besides, we denote (cid:98) L and (cid:98) L i for i = 1 , 2 as estimates of L and L i over a random batch
B , respectively.
For example, (cid:98) L 1 = 1 |B| (cid:80) ℓ ∈B ∥ Q ⊤ f ( x ℓ ) ∥ 22 , and (cid:98) L 2 is defined in an identical way.
The term ∇ θ r (cid:98) L 2 denotes the derivative of (cid:98) L 2 taken w.r.t.
θ r .
The other derivative terms are defined follwoing the same manner.
We refer to the algorithm as post-nonlinear subspace identification .
This is because Theorem 1 indicates that the method identifies range( S ⊤ ) where S =
[ s 1 , . . .
, s N ] for N ≥ K after removing the nonlinear distortions (technically, this needs d m = 0 for all m (cf.
Theorem 1)—which automatically holds if our norm minimization term in the objective becomes zero).
[Table]
do Q ← U
[: , M −
[Table]
M ] where UDV ⊤ =
SVD (
[Table]
) with F =
[ f ( x 1 ) ,
[Table] [Table]
N )]
[Table]
while
[Table]
do Draw a random batch
[Table]
[Equation] [Equation]
Numerical Experiments 5.1 Synthetic Data
We generate data following the model in (3).
For the neural networks representing f m ( · ) and r m ( · ) , we use R = 256 with ReLU activations.
We use the Adam optimizer [30] with the initial learning rate being 2 e − 4 for the network optimization part.
For the hyperparameters, we set λ = 1 e − 4 .
The nonlinear functions g m ( · ) ’s are selected to be variants of e x , sigmoid( x ) and tanh(x) to guarantee invertibility.
The source code can be found online 2 .
Independent Latent Components.
In this simulation, we make K = 3 and M = 5 .
Each element of s ℓ is drawn independently from the uniform distribution U [ − 1 , 1] with N = 10000 , and the mixing matrix A is drawn from the normal distribution.
Under this setting, it is obvious that Q ∈ R 5 × 2 .
Fig.
1 shows the composition (cid:98) h m ( · ) =
(cid:98) f m ◦ g m ( · ) .
One can see that all the five compositions are visually affine, which means that the algorithm has successfully identified and removed g ( · ) .
Prior works on post-nonlinear ICA oftentimes involve computation and sample-size demanding implementations.
For example, in [8], a nonparameteric density estimation step of the learned components needs to be involved in every iteration in order to measure and promote statistical independence.
In comparison, the proposed approach is much more straightforward and easier to implement, as it does not rely on statistical independence.
Dependent Latent Components.
In this case, we consider the latent components drawn from the probability simplex as in (6).
The mixing matrix A is the same as before.
Note that the latent components are dependent.
Consequently the dimension of the null space is M − K + 1 because there are only (cid:101) K
= K − 1 free variables in s ℓ .
For this simulation, we set N = 10 , 000 , K = 3 , and
M = 5 .
Accordingly, the dimension of N ( A ⊤ ) is M − K + 1 = 3 which makes Q a 5 × 3 matrix.
7.5 5.0 2.5 0.0 2.5 5.0 7.5 input26 o u t p u t f 1 g 1 g15 10 5 0 5 10 15 input26 o u t p u t f 2 g 2 g1.0 0.5 0.0 0.5 1.0 input26 o u t p u t f 3 g 3 g   2 input26 o u t p u t f 4 g 4 g7.5 5.0 2.5 0.0 2.5 5.0 input26 o u t p u t f 5 g 5 g
15 input26 o u t p u t f 1 g 1 g15 10 55 input26 o u t p u t f 2 g 2 g0.5 0.0 0.5 1.0 1.5 input26 o u t p u t f 3 g 3 g3 2 1 0 1 2 3 input26 o u t p u t f 4 g 4 g2.5 0.0 2.5 5.0 7.5 input26 o u t p u t f 5 g 5 g
Fig.
2 shows the results.
It is obvious that the nonlinear distortions are successfully removed.
Readers might have noticed that in this case the condition in (9) is actually violated since (cid:101) K ( (cid:101) K +1) / 2 = 3 < 5 .
Interestingly, the method still works.
This is likely because in this numerical example Q ⊤ tends to have full Kruskal rank while in our proof we only used that krank( Q ⊤ )
= 1 .
It turns out that the identifiability condition could actually be much improved if Q ⊤ has full Kruskal rank.
We refer interested readers to further discussions in Appendix A.
Validating Theorem 2.
In this part, we demonstrate the impact of R (i.e., the width of the employed neural network) on the performance of nonlinearity removal, as stated in Theorem 2.
To be specific, we measure the subspace distance (see the definition in [20]) between the estimated range( (cid:98) S ⊤ ) and the ground truth range( S ⊤ ) , where S =
[ s 1 , · · · , s N ] .
This value is within [0,1] with 0 being the best.
The setting is the same as that of the independent case.
Table 1 shows the results, which are averaged over 5 random trials.
One can see that when f m ( · ) is not expressive enough, i.e., when R = 8 , the performance is far from satisfactory.
This is because the term ν dominates in the bound (15).
As the number of neurons increases, the subspace distance keeps decreasing, which indicates that the latent subspace is well identified.
However, if the function is overly complex ( R = 1024 ), the performance starts to deteriorate since in this case the R becomes dominant on the right hand side of (15).
In addition, one can see that larger N leads to a better performance in general, which also validates our claim in (15).
5.2 Real Data
Dataset.
We use the human face electroencephalogram (EEG) dataset 3 .
The EEG signals were collected when a subject was shown with pictures of real human faces or scrambled faces.
The scrambled face images were generated from the real faces with Fourier transformation by random phase permutations [45]).
At every sample, the EEG signal is a 130 -dimensional vector x ℓ , which are measured through 130 sensors (channels) all over the subject’s scalp.
The task is to use x ℓ for ℓ = 1 , . . .
, N as the training data to learn a classifier.
The classifier aims to determine whether the subject sees a real face image or scrambled ones when a new x ℓ is collected.
Metric.
We use a number of unsupervised representation learning (URL) method to extract lowdimensional embeddings of x ℓ ’s. Then, these embeddings are used to train classifiers based on support vector machines (SVM) and logistic regression (LR).
We have N = 27 , 692 samples of x ℓ , which are split as training, validation and test sets with 24794, 1449, and 1449 samples, respectively.
We use the classification error to serve as an indirect measure of the performance.
We follow the hypothesis in [45].
There, the model is x ℓ ≈ g
( As ℓ ) with a PNL structure, where s ℓ are the brain generated “clean” electronic signals, and A and g ( · ) represent the propagation, mixing, and distortions on the sensor end, respectively [23].
Hence, we use our method to remove g ( · ) and then reduce the dimension of As ℓ to K ′ via PCA.
Our belief is that if the PNL learning method can remove g ( · ) , then the extracted undistorted signals will benefit training linear classifiers such as SVM
[Table] [Table]
and LR.
We include PCA (applied onto the raw data), autoencoder
[Table]
and nonlinear ICA (nICA) based approaches [9,16] as baselines
[Table]
Results.
Table 2 shows the classification error.
The results are averaged over 5 random trials.
For all methods, the reduced dimension K ′ (for our method, we have D =
M − K ′ ) is selected over { 10 , 30 , 50 , 70 } using the validation set.
We use fully connected networks that have two hidden layers and 256 neurons on each layer.
The same network structure is used for the autoencoder baseline.
The activation functions are all ReLU.
We use Adam [30] optimizer for neural network updates, where the initial learning rate is 1 e − 4 .
One can see that our method has the lowest classification error, compared to other baselines.
Note that brain signal classification problem is quite challenging, and thus using the raw data only outputs an accuracy that is slightly better than random guesses.
Using our method, the average classification errors are reduced by 6% and 7% from the those using the raw data for SVM and LR, respectively, which is substantial.
This also shows the usefulness of the PNL model for EEG data.
The PCA is a linear method that does not capture the nonlinearity of the data, and thus the result under PCA is less promising.
The autoencoder can be understood as a nonlinearity removal method, but it does not ensure provable g ( · ) removal.
The nICA variants also exhibit higher error rates relative to the proposed method.
This may be because the ICA frameworks hinge on structural assumptions on the latent components, which may not always be available in practice.
Conclusion
In this work, we revisited the PNL model from a model identification perspective.
We proposed a new framework to identify and remove the unknown nonlinear distortions in the data generating/acquisition process.
Compared to existing works, the proposed approach does not require the latent components to satisfy specific structural assumptions, e.g., statistical independence.
Consequently, our new result offers a PNL model identification tool to a much wider spectrum of applications.
In addition, we provided analysis of the cases where only finite samples and non-universal function learners are available.
We designed a constrained optimization scheme to implement the proposed learning criterion.
Our theoretical claims were supported by experiment results.
There are a number of limitations.
First, the PNL model would incur high computational cost when the data feature dimension M is large, since each dimension induces an individual neural network.
Second, there are meaningful applications where the A matrix may not have a nontrivial orthogonal complement (e.g., in PNL-based causal direction estimation [12]), yet this current framework does not guarantee nonlinearity removal in those cases.
Third, the PNL problem’s learning criterion is a nonconvex optimization problem.
The proposed algorithm does not guarantee to solve the formulated learning criterion, which creates a gap between the identifiable results (by assuming optimization optimality) and the attainable results in practice.
Acknowledgement : This work was supported by the National Science Foundation (NSF) CAREER
Award under Project ECCS-2144889.
Checklist
For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?
[Yes] (b) Did you describe the limitations of your work?
[Yes] (c) Did you discuss any potential negative societal impacts of your work?
[N/A] (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
[Yes] 2.
If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
[Yes] (b) Did you include complete proofs of all theoretical results?
[Yes] 3.
If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
[Yes] (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?
[Yes] (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?
[Yes] (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?
[Yes] 4.
If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
[N/A] (b) Did you mention the license of the assets?
[N/A] (c) Did you include any new assets either in the supplemental material or as a URL?
[N/A] (d) Did you discuss whether
and how consent was obtained from people whose data you’re using/curating?
[N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content?
[N/A]
If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
[N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?
[N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
[N/A]
Supplementary Material A When Does Exact Equivalence Between (16) and (5) Hold?
It is interesting to discuss when using the formulation in (16) can exactly approximate (5).
To answer this question, it is worth noting
that if Q is a random matrix drawn from any jointly continuous distribution, with Q ⊤ Q = I , then, ∥ Q ∥ 0 = MD holds with probability one—as the probability of any continuous random variable being zero is zero.
Note that according to (16), the optimal solution of Q is given by
[Equation]
The solution Q of the above consists of the eigenvectors of the covariance matrix of f ( x ) corresponding to the D smallest eigenvalues.
Assume that p ( x ) is a continuous joint PDF, and that f ( · ) is continuous and invertible.
Then, Q is a continuous function of E (cid:2) f
( x ) f ( x ) ⊤ (cid:3) (which is also a continuous function of x by composition).
It is known that, when E (cid:2) f ( x ) f ( x ) ⊤ (cid:3) ’s eigenvalues are all distinct, then Q is a continuous function of E (cid:2)
f ( x ) f ( x ) ⊤ (cid:3) [46], thereby a continuous function of x —which means Q is a continuous random matrix.
A special case is that when f ( x ) is a normal random vector, the columns of Q are uniformly distributed on a unit ball [47].
We should remark that some conditions mentioned above (e.g., distinct eigenvalues) for the exact equivalence of (16) and (5) are not easy to check or meet.
Nonetheless, these are only sufficient conditions—violating them does not mean a dense Q cannot be attained.
As we mentioned, our approximation in (16) for (5) works quite well—and dense Q ’s were always observed in our experiments.
B Full Kruskal Rank of The Left Matrix in (11) of Theorem
In this section, we show that the matrix B as defined in (11) has full Kruskal rank with probability one in different cases.
First, consider the case that B is a tall matrix, i.e., (cid:101) K ( (cid:101) K +1) ≥ M .
We only need to show that
the
B matrix is full column rank.
This can be obtained by showing that there exists a particular case such that an M × M submatrix of B has full column rank.
The reason is that the determinant of any
M × M submatrix of B is a polynomial of A , and a polynomial is nonzero almost everywhere if it is nonzero somewhere [48, Lemma 2].
Consider a special case where A is a Vandermonde matrix, i.e., a k = [1 , z k , z 2 k , . .
z M − 1 k ] ⊤ , and z i ̸ =
z j .
Hence, the corresponding B has the following form
[Equation]
[Equation]
Note that one can always construct such a sequence—e.g., z 1 = 1 , z 2 = 1 . 1 , z 3 = 1 . 11 , . . .
such that any M rows of the matrix in (18) is full rank.
This means that the linear combination of this second order homogeneous polynomials is not identically zero, which implies that it is non-zero almost everywhere; see a similar argument in [19,20].
Thus, it further implies that the matrix B has a Kruskal rank of M almost surely when (cid:101)
[Table]
≥ M .
On the other hand, when (cid:101) K ( (cid:101) K +1) <
M , for any (cid:101) K
[Equation]
K
[Equation]
1) columns we have the following form
[Equation]
 
[Equation]
where the columns are reordered from 1 to (cid:101) K (
[Equation]
K +1) .
Then, the same proof technique may apply here.
Thus, by combining the two cases, it is clear that B has the following Kruskal rank with probability one:
[Equation]
C Proof of Lemma
By the definition of F in Assumption 3, we have
[Equation]
where the last inequality is because f m (0) = 0 .
Besides, the Rademacher complexity of the function class F is bounded by [49]
[Equation]
The invertible function class subset is also upper bounded by this complexity.
Note that the function class that we are interested in is
[Equation]
which has the following Rademacher complexity
[Equation]
(cid:13)(cid:13)
[Equation]
(cid:35)
[Equation] [Equation]
N
[Equation]
ℓ =
D (cid:88)
j = σ ℓ (cid:0) q ⊤ j f ( x ℓ ) (cid:1) 
[Equation]
[Equation] [Equation]
f M ( · ) ∈F
N (cid:88) ℓ =
D (cid:88)
j = σ ℓ ∥ q j ∥ 22 ∥
f
( x ℓ ) ∥ 
[Equation]
sup f 1 ( · ) , ··· ,f
[Equation]
( · ) ∈F
N (cid:88) ℓ = σ ℓ ∥ f ( x ℓ ) ∥(cid:35) ( since ∥ q j ∥ 22 = 1)
[Equation]
sup f
[Equation] [Equation]
··· ,f
[Equation]
( · ) ∈F
N (cid:88) ℓ =
M (cid:88) m
[Equation]
[Equation]
ℓ | f m ( x ℓ,m ) |(cid:35)
[Equation]
where the last inequality is because of the Lipschitz composition property of the Rademacher complexity [50].
Besides, we also have (cid:13)(cid:13) Q ⊤ f
( x ℓ ) (cid:13)(cid:13) 2 2 ≤ DB 4 C 2 x .
D Proof of Theorem
Our proof uses the proof technique from [19, 28, 29] that considered the simplex-structured and multiview nonlinear models, with nontrivial modifications to accommodate our generative model.
To perform finite-sample analysis, consider the finite-sample version formulation
[Equation]
where Q ∈ R M × D , f m ’s are the nonlinear functions that we aim to learn.
The overall idea of proof is to use the empirical error on (19a) to bound the true error.
Then use the numerical differentiation to estimate the second-order derivatives of h ′′ m .
The framework is similar to that of [19,28].
The problem can be regarded as a regression problem with data tuples { x ℓ , 0 D } Nℓ =1 .
According to [50,51], we have
[Equation]
4 /δ )
N , since (cid:13)(cid:13) Q ⊤ u ( x ℓ ) (cid:13)(cid:13) 2 = 0 holds for all ℓ , where (a) is by triangle inequality and (b) is by both triangle inequality and Assumption 1.
Next, we estimate the second order derivative given the solution of (12).
Suppose for any sample x ℓ we have
[Equation]
where ε ℓ ≥ 0 such that E [ ε ℓ ] ≤ ε .
Consider each column of Q separately.
For each column q k with k = 1 , · · · , D , we have
[Equation]
20) where ε ℓ = (cid:80)
Dk =1 ε ℓ,k with each ε ℓ,k ≥ 0 .
In the following part, we will estimate the second-order derivative ∂ 2 ϕ k ( s ) ∂s
i and the cross second-order derivative ∂ 2 ϕ k ( s ) ∂s
i s j , respectively.
D.1 Estimating the Second-Order Derivatives
Define ∆ s i = [0 , . .
. , ∆ s i , . .
. , 0] ⊤ for i = 1 , . . .
, (cid:101) K , and s (cid:98) ℓ = s ℓ + ∆ s i and s (cid:101) ℓ = s ℓ − ∆ s i .
Therefore, we have
[Equation]
(21) where E [ ε (cid:98) ℓ,k ]
=
E [ ε (cid:101) ℓ,k ] ≤ εD .
For any continuous function ω ( z ) that admits non-vanishing 4th order derivatives, the second order derivative at z can be estimated as follows [52]
[Equation]
where ξ ∈ ( z − ∆ z, z + ∆ z ) .
Following this definition, one can see that
[Equation]
where ξ i ∈ ( s (cid:101) ℓ , s (cid:98) ℓ ) .
Consequently, we have the following inequalities
[Equation]
By taking expectation
[Equation]
we have the following holds with probability at least 1 − δ
[Equation]
where the second inequality is by the Jensen’s inequality
[Equation]
which holds by the concavity of √ x when x ≥ 0 .
We are interested in finding the best upper bound,
i
[Equation]
e.,
[Equation]
This is an convex problem with ∆ s i ∈ (0 , ∞ ) which can be solved to global optimal.
By taking derivative w.r
[Equation]
t. ∆ s i , we have the minimizer
[Equation]
which gives the optimal
[Equation]
Thus we have
[Equation]
Given that N is fixed
[Equation]
one may pick ε =
[Equation]
which gives us
[Equation]
D.2 Estimating the Cross Derivatives
To show the bound for cross-derivatives, we define
[Equation]
with ∆ s i > 0 and ∆ s j > 0 for any i, j ∈
[ K ] with i < j .
Define s (cid:98) ℓ = s ℓ + ∆ s ++ ij , s (cid:101) ℓ = s ℓ + ∆ s + − ij , s ℓ = s ℓ + ∆ s − + ij , and s ℓ ′ =
s ℓ + ∆ s −− ij .
Then, similarly we have
[Equation]
where E [ ε ℓ,k ] ≤ εD for any ℓ .
By Lemma 6 in [19], the cross derivative of a continuous function ψ ( x, y ) is estimated as ∂ 2 ψ ( x, y ) ∂x∂y
[Equation]
∂y(cid:19)
[Equation]
where ξ 1 i ∈ ( x − ∆ x, x + ∆ x ) and ξ 2 i ∈ ( y − ∆ y, y + ∆ y ) for i ∈ { 1 , · · · , 8 } .
Then, we have ∂
[Equation]
ϕ
[Equation]
∂ 4 ϕ ( ξ (4) ij ) ∂s
[Equation]
i (cid:33) − ∆ s
[Equation]
(cid:32)
[Equation]
ξ
[Equation] [Equation]
) ∂s
[Equation]
∂s
[Equation]
j − ∂ 4 ϕ ( ξ (6) ij ) ∂s 2 i ∂s
[Equation]
j (cid:33) − ∆ s 3 j 48∆
s i (cid:32) ∂
4 ϕ ( ξ (7) ij ) ∂s 4 j − ∂ 4 ϕ ( ξ (8) ij ) ∂s 4 j (cid:33) , where ξ ( t ) ij satisfies ξ
[Equation]
=
[Equation]
+
[Equation]
) s ℓ ′ , t ∈ { 1 , · · · , 8 } , with θ ( t ) ∈ (0 , 1) , is a vector such that [ ξ ( t ) ij ] i ∈
( s i,ℓ − ∆ s i , s i,ℓ + ∆ s i ) and [ ξ ( t ) ij ] j ∈ ( s j,ℓ − ∆ s j , s j,ℓ + ∆ s j ) .
Consequently, we have the following
[Equation] [Equation]
[Table]
Taking expectation and by Jensen’s inequality, we have
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
(cid:12)(cid:12)(cid:12)(cid:12)(cid:12) [Table] [Equation] [Table]
[Equation]
[Table]
[Equation]
) ∂s
[Equation]
(cid:12)(cid:12)(cid:12)(cid:12)(cid:12)(cid:33) + ∆ s i ∆ s j
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
(cid:12)(cid:12)(cid:12)(cid:12)(cid:12)
[Equation]
(cid:12)(cid:12)(cid:12)(cid:12)(cid:12)
[Equation]
[Table]
∂s
[Table]
(cid:12)(cid:12)(cid:12)(cid:12)(cid:12)(cid:33) .
Without loss of generality, we assume that ∆ s = ∆ s i =
∆ s j .
Then, we have inf
[Table]
s
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
By defining
[Equation]
, we have the following form of (26)
[Equation]
By taking derivative w.r.t.
∆ s , we have the minimizer
[Equation]
which gives the optimal
[Equation]
Therefore, we have
[Equation]
since τ ≤ 32 C d .
By setting ε = DMν
[Equation]
, we have (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) E (cid:34) M (cid:88) m =
[Equation]
[Table]
[Equation]
D.3 Combining the Results
Now we put together the estimation in (24) and (30).
Since the ℓ 2 norm is upper bounded by ℓ 1 norm, we have the following
[Equation]
due to the fact that √ a + b ≤ √ a + √ b for a
[Equation]
b ≥ 0 .
The above can be further written as
[Equation]
which completes the proof
[Equation]