mlsanityData to 13 Oct 2026

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

arXiv 2507.23600 ↗First posted 31 Jul 2025cs.LG cs.CEcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 6 of its 35 references that are in the map. First posted on arXiv 31 Jul 2025.

Builds on

6 of 35 references.

References · 6

  1. 2017Neural Discrete Representation Learningcited by 4,680
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,726
  3. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,142
  4. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 529
  5. 2013k-Sparse Autoencoderscited by 214
  6. 2019Variational Bayes for high-dimensional linear regression with sparse priorscited by 44

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Bayesian Signal Component Decomposition via Diffusion-within-Gibbs Sampling
  2. 2025MSF: Efficient Diffusion Model Via Multi-Scale Latent Factorize
  3. 2026Learning Normalized Energy Models for Linear Inverse Problems
  4. 2026Annealed Langevin Posterior Sampling (ALPS): A Rapid Algorithm for Image Restoration with Multiscale Energy Models
  5. 2022Dimensionality-Varying Diffusion Process
  6. 2022Subspace Diffusion Generative Models
  7. 2023Resolution Chromatography of Diffusion Models
  8. 2024Computationally efficient reductions between some statistical models