Supervised Stochastic Gradient Algorithms for Multi-Trial Source Separation

Ronak Mehta, Mateus Piovezan Otto, Noah Stanis, Azadeh Yazdan-Shahmorad, Zaid Harchaoui
8/28/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

We develop a stochastic algorithm for independent component analysis that incorporates multi-trial supervision, which is available in many scientific contexts. The method blends a proximal gradient-type algorithm in the space of invertible matrices with joint learning of a prediction model through backpropagation. We illustrate the proposed algorithm on synthetic and real data experiments. In particular, owing to the additional supervision, we observe an increased success rate of the non-convex optimization and the improved interpretability of the independent components.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{mehta2025supervised,
  title  = {Supervised Stochastic Gradient Algorithms for Multi-Trial Source Separation},
  author = {Ronak Mehta and Mateus Piovezan Otto and Noah Stanis and Azadeh Yazdan-Shahmorad and Zaid Harchaoui},
  year   = {2025},
  eprint = {2508.20618},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.20618v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.20618.svg)](https://codeofpaper.com/paper/2508.20618)

Discussion