Identification with finite environments for nonparametric representation-level invariance
Determine whether identification in representation-level invariance learning is possible with any finite number of environments when the representation map Φ: ℝ^d → ℝ^r is allowed to be nonparametric. Specifically, prove or refute the conjecture that identification is impossible for all finite |E| when Φ belongs to a nonparametric function class, in contrast to the linear case where at least r environments are necessary even under sufficient heterogeneity and known r.
References
We conjecture that any finite number of environments |E|<∞ may be impossible for identification if Φ lies in some nonparametric function class.
A central open problem in representation learning is identifiability: whether the data determine the learned representation uniquely, up to simple transformations such as permutation and element-wise reparameterization, so that it recovers the factors that generated the data rather than one of many equally predictive alternatives.