Revisiting semi-supervised training objectives for differentiable particle filters
Differentiable particle filters combine the flexibility of neural networks with the probabilistic nature of sequential Monte Carlo methods. However, traditional approaches rely on the availability of labelled data, i.e., the ground truth latent state information, which is often difficult to obtain in real-world applications. This paper compares the effectiveness of two semi-supervised training objectives for differentiable particle filters. We present results in two simulated environments where labelled data are scarce.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Supercm: Revisiting Clustering for Semi-Supervised Learning
The development of semi-supervised learning (SSL) has in recent years largely focused on the development of new consistency regularization or entropy minimization approaches, often resulting in models with complex traini…
ClusteringRevisiting Embedding Features for Simple Semi-supervised Learning
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our method uses a convex program whose objective function is not everywhere differentiable. We exploit the non-uniqueness of the optim…
Revisiting Tri-training of Dependency Parsers
We compare two orthogonal semi-supervised learning techniques, namely tri-training and pretrained word embeddings, in the task of dependency parsing. We explore language-specific FastText and ELMo embeddings and multilin…
Dependency ParsingWord EmbeddingsRevisiting Pretraining for Semi-Supervised Learning in the Low-Label Regime
Semi-supervised learning (SSL) addresses the lack of labeled data by exploiting large unlabeled data through pseudolabeling. However, in the extremely low-label regime, pseudo labels could be incorrect, a.k.a. the confir…