Task structure is identifiable across time steps and task-relevant representations are identifiable within steps in a nonparametric setting under sparsity regularization.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LG 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
A representation learning approach for multi-source domain adaptation achieves identifiability by partitioning the label's Markov blanket into parents, children, and spouses.
Diverse dictionary learning identifies intersections, complements, and dependency structures of latent variables from data X = g(Z) up to indeterminacies, and full identifiability when structural diversity is sufficient.
citing papers explorer
-
From Generalist to Specialist Representation
Task structure is identifiable across time steps and task-relevant representations are identifiable within steps in a nonparametric setting under sparsity regularization.
-
A General Representation-Based Approach to Multi-Source Domain Adaptation
A representation learning approach for multi-source domain adaptation achieves identifiability by partitioning the label's Markov blanket into parents, children, and spouses.
-
Diverse Dictionary Learning
Diverse dictionary learning identifies intersections, complements, and dependency structures of latent variables from data X = g(Z) up to indeterminacies, and full identifiability when structural diversity is sufficient.