Learning Nonlinear Factor Models with Unknown Monotone Links from Incomplete and Noisy Data

• URL: http://arxiv.org/abs/2605.26271v1
• Date: Mon, 25 May 2026 18:57:03 GMT
• Title: Learning Nonlinear Factor Models with Unknown Monotone Links from Incomplete and Noisy Data
• Abstract summary: We block a nonlinear factor model in which observed responses depend on low-rank factors through an unknown link function.<n>The link function is assumed to lie in a monotone space recovery, enabling flexible ambiguities while preserving identifiability.
• Score: 5.256805330951789
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We study a nonlinear factor model in which observed responses depend on low-rank latent factors through an unknown monotone link function. This setting is challenging and largely underexplored due to severe nonconvexity and identifiability issues. The link function is assumed to lie in a reproducing kernel Hilbert space (RKHS), enabling flexible nonparametric modeling while preserving identifiability. We formulate the problem as the joint recovery of the low-rank factors, loadings, and the nonlinear link function from possibly incomplete and noisy observations and propose a projected block coordinate descent (BCD) algorithm with explicit regularization to address scale and rotational ambiguities. Under mild incoherence of factors and standard sampling conditions, we establish convergence guarantees in both noiseless and noisy regimes, along with sublinear regret bounds for the link-function updates. Our results extend classical linear factor models to a broad nonlinear regime and provide a principled framework for learning nonlinear latent structures. We evaluate the proposed approach using controlled synthetic experiments, indicating promising performance.

Related papers

• Learning Bidirectional Causal Interactions with Heteroscedastic Neural Networks [1.0356094515229846]
  This paper proposes SEM-DNN, a heteroscedastic neural simultaneous-equation estimator.<n>It learns reciprocal structural interactions without external instruments.<n>An application to ready-to-eat cereal scanner data illustrates how the method can study contemporaneous price-sales feedback.
  arXiv  Detail & Related papers  (2026-07-24T13:53:58Z)
• Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability [46.784084625532984]
  This paper explores unsupervised disentangled representation learning from a functional perspective.<n>We prove that this condition yields identifiability of general nonlinear generative models.
  arXiv  Detail & Related papers  (2026-06-19T12:47:07Z)
• Non-Parametric Rehearsal Learning via Conditional Mean Embeddings [88.89267783967263]
  We propose a non-parametric rehearsal learning approach for textitavoiding undesired future (AUF) problems.<n>Specifically, we use kernel machinery to reformulate the AUF objective into a unified representation that disentangles desirability modeling from action-induced distributional changes.
  arXiv  Detail & Related papers  (2026-05-09T15:30:52Z)
• SOLIS: Physics-Informed Learning of Interpretable Neural Surrogates for Nonlinear Systems [6.5745172279769255]
  textbfSOLIS models unknown dynamics via a emphstate-conditioned second-order surrogate model<n>textbfLocal Physics Hints windowed ridge-regression anchors that mitigate optimization collapse.<n>Experiments on benchmarks show accurate parameter-manifold recovery and coherent physical rollouts from sparse data, including regimes where standard inverse methods fail.
  arXiv  Detail & Related papers  (2026-04-16T11:12:36Z)
• Discovery of interaction and diffusion kernels in particle-to-mean-field multi-agent systems [41.99844472131922]
  We propose a data-driven framework to learn interaction kernels in multi-agent systems.<n>Our approach aims at identifying the functional form of nonlocal interaction and diffusion terms directly from trajectory data.
  arXiv  Detail & Related papers  (2026-03-16T21:19:25Z)
• Stability and Concentration in Nonlinear Inverse Problems with Block-Structured Parameters: Lipschitz Geometry, Identifiability, and an Application to Gaussian Splatting [0.552480439325792]
  We develop an operator-theoretic framework for stability and statistical concentration in nonlinear inverse problems with block-structured parameters.<n>Overall, the analysis characterizes operator-level limits for a broad class of high-dimensional nonlinear inverse problems arising in modern imaging and differentiable rendering.
  arXiv  Detail & Related papers  (2026-02-10T05:11:06Z)
• Towards Unsupervised Causal Representation Learning via Latent Additive Noise Model Causal Autoencoders [1.9732490977700972]
  Unsupervised representation learning seeks to recover latent generative factors.<n>Disentangling causal variables from observational data is impossible without supervision.<n>We propose the Latent Additive Noise Model Causal Autoencoder (LANCA) as a strong inductive bias for unsupervised discovery.
  arXiv  Detail & Related papers  (2025-12-15T10:52:30Z)
• Generative System Dynamics in Recurrent Neural Networks [56.958984970518564]
  We investigate the continuous time dynamics of Recurrent Neural Networks (RNNs)<n>We show that skew-symmetric weight matrices are fundamental to enable stable limit cycles in both linear and nonlinear configurations.<n> Numerical simulations showcase how nonlinear activation functions not only maintain limit cycles, but also enhance the numerical stability of the system integration process.
  arXiv  Detail & Related papers  (2025-04-16T10:39:43Z)
• Nonlinear Permuted Granger Causality [0.6526824510982799]
  Granger causal inference is a contentious but widespread method used in fields ranging from economics to neuroscience. To allow for out-of-sample comparison, a measure of functional connectivity is explicitly defined using permutations of the covariate set. Performance of the permutation method is compared to penalized variable selection, naive replacement, and omission techniques via simulation.
  arXiv  Detail & Related papers  (2023-08-11T16:44:16Z)
• Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity [39.886149789339335]
  offline reinforcement learning aims to learn to perform decision making from history data without active exploration. Due to uncertainties and variabilities of the environment, it is critical to learn a robust policy that performs well even when the deployed environment deviates from the nominal one used to collect the history dataset. We consider a distributionally robust formulation of offline RL, focusing on robust Markov decision processes with an uncertainty set specified by the Kullback-Leibler divergence in both finite-horizon and infinite-horizon settings.
  arXiv  Detail & Related papers  (2022-08-11T11:55:31Z)
• A Priori Denoising Strategies for Sparse Identification of Nonlinear Dynamical Systems: A Comparative Study [68.8204255655161]
  We investigate and compare the performance of several local and global smoothing techniques to a priori denoise the state measurements. We show that, in general, global methods, which use the entire measurement data set, outperform local methods, which employ a neighboring data subset around a local point.
  arXiv  Detail & Related papers  (2022-01-29T23:31:25Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.