StrEBM: A Structured Latent Energy-Based Model for Blind Source Separation

• URL: http://arxiv.org/abs/2604.17381v1
• Date: Sun, 19 Apr 2026 11:11:38 GMT
• Title: StrEBM: A Structured Latent Energy-Based Model for Blind Source Separation
• Abstract summary: StrEBM is a structured latent energy-based model for source-wise structured representation learning.<n>The framework is motivated by a broader goal of promoting identifiable and decoupled latent organization.<n>Experiments on synthetic multichannel signals under linear and nonlinear mixing settings show that the proposed model can recover source components effectively.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper proposes StrEBM, a structured latent energy-based model for source-wise structured representation learning. The framework is motivated by a broader goal of promoting identifiable and decoupled latent organization by assigning different latent dimensions their own learnable structural biases, rather than constraining the entire latent representation with a single shared energy. In this sense, blind source separation is adopted here as a concrete and verifiable testbed, through which the evolution of latent dimensions toward distinct underlying components can be directly examined. In the proposed framework, latent trajectories are optimized directly together with an observation-generation map and source-wise structural parameters. Each latent dimension is associated with its own energy-based formulation, allowing different latent components to gradually evolve toward distinct source-like roles during training. In the present study, this source-wise energy design is instantiated using Gaussian-process-inspired energies with learnable length-scales, but the framework itself is not restricted to Gaussian processes and is intended as a more general structured latent EBM formulation. Experiments on synthetic multichannel signals under linear and nonlinear mixing settings show that the proposed model can recover source components effectively, providing an initial empirical validation of the framework. At the same time, the study reveals important optimization characteristics, including slow late-stage convergence and reduced stability under nonlinear observation mappings. These findings not only clarify the practical behavior of the current GP-based instantiation, but also establish a basis for future investigation of richer source-wise energy families and more robust nonlinear optimization strategies.

Related papers

• Structured Nonparametric Variational Inference for Dependent Latent Modeling [11.146941243243248]
  Variational inference (VI) is a core engine of modern AI, enabling scalable learning and uncertainty-aware training of large probabilistic and generative models.<n>We propose Structured Non Variational Inference (SN-VI), a novel framework for modeling complex dependencies among latent variables in posterior approximation.<n> SN-VI preserves intricate latent variable dependencies, providing a flexible and accurate approximation of posterior boundeds with arbitrary shapes.
  arXiv  Detail & Related papers  (2026-06-13T20:29:04Z)
• Large Vision-Language Models Get Lost in Attention [51.851592109135716]
  We propose a unified framework grounded in information theory and geometry to quantify the geometric and entropic nature of residual updates.<n>Applying this unified framework reveals a fundamental functional decoupling: Attention acts as a subspace-language operator focused on reconfiguration, whereas FFNs serve as subspace-language operators driving semantic innovation.
  arXiv  Detail & Related papers  (2026-05-07T04:45:52Z)
• StrADiff: A Structured Source-Wise Adaptive Diffusion Framework for Linear and Nonlinear Blind Source Separation [0.0]
  This paper presents a Structured Source-Wise Adaptive Diffusion Framework for linear and nonlinear blind source separation.<n>The framework interprets each latent dimension as a source component and assigns to it an individual adaptive diffusion mechanism.<n>It learns source recovery and the mixing/reconstruction process jointly within a unified end-to-end objective.
  arXiv  Detail & Related papers  (2026-04-04T14:47:06Z)
• USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation [28.47018372381707]
  SF-GDA is pivotal for privacy-preserving knowledge transfer across graph datasets.<n>We propose the Universal Structural Basis Distillation, a framework that shifts the paradigm from adapting a biased model to learning a universal structural basis for SF-GDA.
  arXiv  Detail & Related papers  (2026-02-09T09:39:07Z)
• Reasoning Palette: Modulating Reasoning via Latent Contextualization for Controllable Exploration for (V)LMs [49.66344956133349]
  Reasoning capacity shapes both inference-time performance and reinforcement learning (RL) training for large (vision-) language models.<n>This paper proposes Reasoning Palette, a novel latent-modulation framework that endows the model with a latent variable for strategic contextualization.
  arXiv  Detail & Related papers  (2025-12-19T03:32:53Z)
• ERIS: An Energy-Guided Feature Disentanglement Framework for Out-of-Distribution Time Series Classification [51.07970070817353]
  An ideal time series classification (TSC) should be able to capture invariant representations.<n>Current methods are largely unguided, lacking the semantic direction required to isolate truly universal features.<n>We propose an end-to-end Energy-Regularized Information for Shift-Robustness framework to enable guided and reliable feature disentanglement.
  arXiv  Detail & Related papers  (2025-08-19T12:13:41Z)
• CTRLS: Chain-of-Thought Reasoning via Latent State-Transition [57.51370433303236]
  Chain-of-thought (CoT) reasoning enables large language models to break down complex problems into interpretable intermediate steps.<n>We introduce groundingS, a framework that formulates CoT reasoning as a Markov decision process (MDP) with latent state transitions.<n>We show improvements in reasoning accuracy, diversity, and exploration efficiency across benchmark reasoning tasks.
  arXiv  Detail & Related papers  (2025-07-10T21:32:18Z)
• Toward Explainable Offline RL: Analyzing Representations in Intrinsically Motivated Decision Transformers [0.0]
  Elastic Decision Transformers (EDTs) have proved to be particularly successful in offline reinforcement learning.<n>Recent research has shown that incorporating intrinsic motivation mechanisms into EDTs improves performance across exploration tasks.<n>We introduce a systematic post-hoc explainability framework to analyze how intrinsic motivation shapes learned embeddings in EDTs.
  arXiv  Detail & Related papers  (2025-06-16T20:01:24Z)
• Latent Variable Representation for Reinforcement Learning [131.03944557979725]
  It remains unclear theoretically and empirically how latent variable models may facilitate learning, planning, and exploration to improve the sample efficiency of model-based reinforcement learning. We provide a representation view of the latent variable models for state-action value functions, which allows both tractable variational learning algorithm and effective implementation of the optimism/pessimism principle. In particular, we propose a computationally efficient planning algorithm with UCB exploration by incorporating kernel embeddings of latent variable models.
  arXiv  Detail & Related papers  (2022-12-17T00:26:31Z)
• Revisiting GANs by Best-Response Constraint: Perspective, Methodology, and Application [49.66088514485446]
  Best-Response Constraint (BRC) is a general learning framework to explicitly formulate the potential dependency of the generator on the discriminator. We show that even with different motivations and formulations, a variety of existing GANs ALL can be uniformly improved by our flexible BRC methodology.
  arXiv  Detail & Related papers  (2022-05-20T12:42:41Z)
• Inference-InfoGAN: Inference Independence via Embedding Orthogonal Basis Expansion [2.198430261120653]
  Disentanglement learning aims to construct independent and interpretable latent variables in which generative models are a popular strategy. We propose a novel GAN-based disentanglement framework via embedding Orthogonal Basis Expansion (OBE) into InfoGAN network. Our Inference-InfoGAN achieves higher disentanglement score in terms of FactorVAE, Separated ferenceAttribute Predictability (SAP), Mutual Information Gap (MIG) and Variation Predictability (VP) metrics without model fine-tuning.
  arXiv  Detail & Related papers  (2021-10-02T11:54:23Z)
• Generalization Properties of Optimal Transport GANs with Latent Distribution Learning [52.25145141639159]
  We study how the interplay between the latent distribution and the complexity of the pushforward map affects performance. Motivated by our analysis, we advocate learning the latent distribution as well as the pushforward map within the GAN paradigm.
  arXiv  Detail & Related papers  (2020-07-29T07:31:33Z)

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.