Learned Factor Graphs for Inference from Stationary Time Sequences
Nir Shlezinger, Nariman Farsad, Yonina C. Eldar, and Andrea J., Goldsmith

TL;DR
This paper introduces a hybrid approach combining model-based algorithms and machine learning to perform inference on stationary time sequences, enabling accurate, adaptable analysis with small training sets.
Contribution
It proposes a novel framework for learning factor graphs using neural networks that exploit stationarity, improving inference flexibility and efficiency.
Findings
Effective inference on sleep stage detection with small training data.
Accurate symbol detection in digital communications with unknown channels.
Applicable to sequences of varying lengths.
Abstract
The design of methods for inference from time sequences has traditionally relied on statistical models that describe the relation between a latent desired sequence and the observed one. A broad family of model-based algorithms have been derived to carry out inference at controllable complexity using recursive computations over the factor graph representing the underlying distribution. An alternative model-agnostic approach utilizes machine learning (ML) methods. Here we propose a framework that combines model-based algorithms and data-driven ML tools for stationary time sequences. In the proposed approach, neural networks are developed to separately learn specific components of a factor graph describing the distribution of the time sequence, rather than the complete inference task. By exploiting stationary properties of this distribution, the resulting approach can be applied to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
