Search arXivSearch

arXiv · 2507.23600

EB-gMCR: Energy-Based Generative Modeling for Signal Unmixing and Multivariate Curve Resolution

Abstract

A single measurement of a chemical mixture, a reaction mixture, a natural extract, or a tissue, records the sum of the profiles of the few components it contains, each weighted by its concentration. Recovering the components and their concentrations from a collection of such samples is multivariate curve resolution (MCR). Classical MCR factorizes the data matrix, takes the component count as input, and leaves a rotational ambiguity that constraints narrow. This paper keeps the forward direction and models how a sample is made: each sample activates a few components from a pool of candidate components and is observed as their linear superposition plus noise. Under this model the continuous ambiguity of factorization collapses to the numbering of the components, and among all decompositions that reproduce the data, the one with the fewest component occurrences across samples is the true one. We prove three results. Under a spark condition, minimal usage identifies the true supports. A decomposition that reconstructs every sample within a tolerance set by the noise, with no more usage than the truth, is the truth up to the numbering of the components, and the recovered pool then decodes new samples on its own. As samples accumulate, what is recovered almost surely is the process itself, the pool and the component count; the decoding of any single sample stays limited by the noise, for every method. The solver EB-gMCR selects components per sample with an energy-based gate under a usage penalty. It recovers the component count on synthetic mixtures of up to 256 components and on two public spectroscopy datasets without being told the count, and a frozen model decodes unseen mixtures at the noise floor. Code: https://github.com/b05611038/ebgmcr_solver.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu-Tang Chang, Shih-Fang Chen. 2026-09-11. EB-gMCR: Energy-Based Generative Modeling for Signal Unmixing and Multivariate Curve Resolution. https://arxiv.org/abs/2507.23600

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG