Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

2.9%5.9%8.8%11.8% · May 202619922001200920182026
48 results for DTW template matching

CNN-DTW system improves keyword spotting in under-resourced languages.

problem Keyword spotting in nearly zero-resource languages.
method Multilingual bottleneck features, CNN-DTW, DTW template matching, convolutional neural network.
result Multilingual BNFs improve CNN-DTW by 10.9%.

End-to-end neural network improves QbE-STD in multilingual speech search.

problem Query by example spoken term detection in zero-resource scenarios.
method Use of multilingual bottleneck features and CNN for pattern matching, integrated into a fully neural network framework.
result CNN-based matching outperforms DTW-based matching using bottleneck features.

A new framework for averaging spatio-temporal signals using optimal transport and soft alignments.

problem Averaging complex datasets with time and spatial components.
method Inspired by DTW, OT, and UOT, a new loss function is proposed to address shifts in time, space, and population size.
result The proposed loss function can be used to compute spatio-temporal barycenters efficiently.

Cellular Electron CryoTomography (CECT) is a 3D imaging technique that captures information about the structure and spatial organization of macromolecular complexes within single cells, in near-native state and at sub-molecular resolution. Although template matching is often used to locate macromolecules in a CECT imag…

2018-05-12abs ↗pdf ↗

Hopfield networks improve reaction template prediction for few/zero-shot scenarios.

problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.

Improved binning technique boosts nUV measure performance.

problem Improving the performance of the nUV measure in real applications.
method Introduced the nUV measure, provided theoretical optimal binning techniques, and proposed algorithms for approximate solutions.
result Approximate binning techniques show 4-13% increase in AUC scores with statistical significance.

We propose in this paper a differentiable learning loss between time series, building upon the celebrated dynamic time warping (DTW) discrepancy. Unlike the Euclidean distance, DTW can compare time series of variable size and is robust to shifts or dilatations across the time dimension. To compute DTW, one typically so…

2017-03-05abs ↗pdf ↗

New tighter lower bounds for DTW improve NN-DTW classification efficiency.

problem Efficient nearest neighbor search for DTW distances in time series.
method Developed new lower bounds leveraging DTW constraints for tighter and faster pruning.
result New lower bounds provide better balance between computation time and tightness.

Two supervised methods classify single-molecule patterns from X-ray imaging.

problem Classifying high-quality patterns from noisy, stochastic XFEL data.
method Supervised template-based learning methods: Eigen-Image and Log-Likelihood classifiers.
result Classifiers can find best-matched templates within milliseconds and parallelize for XFEL repetition rate.

G2Gs transforms target molecules into reactants without templates, improving accuracy.

problem Predicting retrosynthesis from target molecules efficiently and accurately.
method Transforming target molecular graphs into reactant graphs via variational graph translation.
result G2Gs achieves top-1 accuracy close to state-of-the-art template-based methods.

New method discovers time series motifs under DTW, significantly reducing computations.

problem Discovering time series motifs under DTW is computationally challenging.
method Exact scalable method using novel lower bounds hierarchy.
result Prunes up to 99.99% of DTW computations under realistic settings.

Efficiently identifies users from walking activity data using kernel-based DTW.

problem Identifying users from walking activity data streams.
method Learning a kernel to approximate DTW for efficient analysis of streaming data from wearable sensors.
result The proposed approach reduces computational burden compared to traditional DTW.

Valid inference method for DTW distance for abnormal time-series detection.

problem Statistical inference on DTW distance under uncertain conditions.
method Conditional selective inference framework to derive valid p-values.
result First method to provide valid p-values for DTW distance.

A new method aligns spatial and temporal data, improving on Dynamic Time Warping.

problem Comparing data over space and time, accounting for both spatial and temporal variability.
method Spatio-Temporal Alignments (STA) using regularized optimal transport (OT) and soft-DTW.
result Soft-DTW increases quadratically with time shifts, effectively handling spatio-temporal data.

The concept of sample mean in dynamic time warping (DTW) spaces has been successfully applied to improve pattern recognition systems and generalize centroid-based clustering algorithms. Its existence has neither been proved nor challenged. This article presents sufficient conditions for existence of a sample mean in DT…

2016-10-14abs ↗pdf ↗

Dynamic Time Warping improves regression accuracy on spectroscopy data.

problem Improving regression accuracy on spectroscopy data with DTW when data is across multiple wavelengths.
method Illustrated DTW's effectiveness on spectroscopy time-series data, showing its benefits in improving regression accuracy when only a single wavelength is considered. DTW combined with k-Nearest Neighbour reveals similarities and differences at the time-series level.
result DTW improves regression accuracy on spectroscopy data, especially when considering a single wavelength.

New algorithm tackles adversarial contextual bandits using stochastic smoothing.

problem Adversarial contextual bandit problems.
method Stochastic smoothing perspective and random perturbation based algorithms.
result Zero-order bound of O(T)O(\sqrt{T}) and first-order bound of O(LT2/3)O(L^{*2/3}_{T}) for the proposed algorithm.

Guided warping augments time series data by aligning features with a teacher.

problem Small time series datasets limit neural network performance.
method Guided warping with a discriminative teacher to augment data deterministically.
result Significant improvement in performance on various time series datasets.

We investigate metric learning in the context of dynamic time warping (DTW), the by far most popular dissimilarity measure used for the comparison and analysis of motion capture data. While metric learning enables a problem-adapted representation of data, the majority of methods has been proposed for vectorial data onl…

2016-10-17abs ↗pdf ↗

Templates are branched 2-manifolds with semi-flows used to model `chaotic' hyperbolic invariant sets of flows on 3-manifolds. Knotted orbits on a template correspond to those in the original flow. Birman and Williams conjectured that for any given template the number of prime factors of the knots realized would be boun…

2005-07-14abs ↗pdf ↗

New chatter detection method using DTW and kNN outperforms existing techniques.

problem Chatter detection from sensor signals using machine learning and similarity measures.
method K-Nearest Neighbor (kNN) algorithm for classification and Dynamic Time Warping (DTW) for time series similarity.
result DTW-based approach achieves high accuracy in three out of four cutting configurations, reaching up to 99%.

METRO predicts reactions using minimal templates, reducing computational overhead and achieving state-of-the-art results.

problem Predicting possible reaction substrates for complex molecules from simpler precursors.
method METRO (Molecule-Edit Templates for RetrOsynthesis) uses minimal templates to predict reactions efficiently and accurately.
result METRO achieves state-of-the-art results on standard benchmarks, reducing computational overhead.

Unified framework for imitation learning via moment matching.

problem Closing the gap between imitation and real-world performance.
method Classifying imitation learning algorithms based on reward or action-value moment matching, considering adversarial divergences.
result Derivation of bounds on policy performance for all algorithms in each class, and introduction of moment recoverability.

A new KD layer lets student models learn and apply teacher knowledge explicitly.

problem Implicit action of traditional KD on student's feature transform limits its use in intermediate layers.
method Proposes a learnable KD layer that explicitly embeds teacher's knowledge in feature transform.
result Improves KD with two abilities: leveraging teacher's knowledge and feeding forward knowledge deeper.

Paper proposes a new efficient transport-based dissimilarity measure for time series classification.

problem Classifying time series with warping distortions.
method Defining a problem statement, proposing an Optimal Transport-based dissimilarity measure.
result The proposed method can solve the time series classification problem with reduced computational cost.

We describe the Williams zeta functions and the twist zeta functions of sub-Lorenz templates generated by renormalizable Lorenz maps, in terms of the corresponding zeta-functions of the sub-Lorenz templates generated by the renormalized map and by the map that determines the renormalization type.

2010-03-25abs ↗pdf ↗

New algorithms minimize regret in SSP with optimal sparse updates.

problem Minimizing regret in Stochastic Shortest Path models.
method Implicit finite-horizon approximation for analysis, model-free and model-based algorithms developed.
result Minimax optimal regret for both model-free and model-based algorithms.

Neural production systems learn visual dynamics by applying rule templates to entities.

problem Modeling interactions among entities in structured visual environments.
method Inspired by production systems, the paper uses rule templates to bind placeholder variables to specific entities, scoring and applying the best fitting rules to update entity properties.
result The architecture achieves robust future-state prediction and extrapolation from simple to complex environments, outperforming GNNs.