Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
This addresses a few-shot query-by-example retrieval problem in Natural Language Processing, offering an incremental improvement over existing methods.
The paper tackles the problem of finding similar fragments in long temporal sequences using only a few query examples, without averaging them, and shows that the method either outperforms baselines or achieves comparable results with few examples.
The paper presents a novel method of finding a fragment in a long temporal sequence similar to the set of shorter sequences. We are the first to propose an algorithm for such a search that does not rely on computing the average sequence from query examples. Instead, we use query examples as is, utilizing all of them simultaneously. The introduced method based on the Dynamic Time Warping (DTW) technique is suited explicitly for few-shot query-by-example retrieval tasks. We evaluate it on two different few-shot problems from the field of Natural Language Processing. The results show it either outperforms baselines and previous approaches or achieves comparable results when a low number of examples is available.