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,181 papers · 148 categories

Trend · papers per month

4895143190 · May 202619922001200920182026
48 results for Template matching

Generative models improve CECT template matching reliability.

problem Insufficient template matching for accurate CECT structure assessment.
method Image-derived generative adversarial network for pseudo-macromolecular structures.
result Statistical credibility of CECT template matching significantly improved.

Paper tackles curve pattern identification from fragmented cultural heritage objects.

problem Identify full design of curve patterns from fragmented cultural heritage objects.
method Two-stage matching algorithm combining template matching and CNN re-ranking.
result Proposed algorithm outperforms traditional methods in identifying curve patterns from fragmented objects.

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.

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 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.

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%.

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 ↗

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.

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.

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.

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.

With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many …

2014-01-17abs ↗pdf ↗

A flexible machine learning model infers the morphology of the Galactic Center Excess.

problem Inferring the unknown morphology of the Galactic Center Excess using Fermi gamma-ray data.
method Used a Gaussian process (GP) to model the Galactic Center Excess (GCE) as a flexible, non-parametric machine learning model.
result The best-fit GP contains morphological features not typically associated with traditional GCE studies, such as a localized bright source and a diagonal arm.

IsoNN learns graph representations without node order constraints.

problem Lack of interpretability and erratic performance in graph classification due to node-orderless property.
method IsoNN uses graph matching with subgraph templates to learn isomorphic features and break node-order.
result IsoNN achieves superior performance on graph classification tasks compared to existing methods.

The fact that the modular template coincides with the Lorenz template, discovered by Ghys, implies modular knots have very peculiar properties. We obtain a generalization of these results to other Hecke triangle groups. In this context, the geodesic flow can never be seen as a flow on a subset of S3S^3, and one is led …

2011-03-23abs ↗pdf ↗

Paper addresses data reconstruction from privacy-protected templates using STCA.

problem Reconstructing privacy-sensitive data from protected templates.
method Sparse ternary coding with ambiguization (STCA) for privacy preservation.
result STCA maintains theoretical performance against deep reconstruction attacks for synthetic data but requires special measures for real images.

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.

GPCDL uses Gaussian Processes to learn smooth templates from data.

problem Lack of smoothness in learned templates leads to overfitting and poor predictive performance.
method GPCDL incorporates Gaussian Process priors to enforce smoothness in the learned templates.
result GPCDL outperforms unregularized CDL in accuracy and predictive performance across various SNRs and applications.

SrvfNet aligns multiple functional data to templates without supervision.

problem Aligning large collections of functional data to templates without labeled data.
method Generative deep learning framework using SRVF and fully-connected layers.
result Framework achieves alignment and optimal template prediction without supervision.

Paper introduces template functions for featurizing persistence diagrams.

problem Featurizing persistence diagrams for machine learning.
method Characterizes compactness, constructs dense subsets of continuous functions.
result Template functions enable supervised learning with persistence diagrams.

Adaptive template systems improve feature extraction from persistence diagrams for machine learning.

problem Feature extraction from persistence diagrams for machine learning.
method Adaptive template systems using CDER, GMM, and HDBSCAN algorithms.
result Adaptive template systems yield competitive and often superior results in classification tasks.

A new matrix factorization method that approximates data without requiring nonnegativity or convexity.

problem Approximating data matrices without the constraints of nonnegativity or convexity.
method A multi-objective optimization problem finds conical combinations of templates that approximate a given data matrix.
result The method allows for approximation of data sets without the usual constraints of nonnegativity or convexity.

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.

Robust visual tracking for long video sequences is a research area that has many important applications. The main challenges include how the target image can be modeled and how this model can be updated. In this paper, we model the target using a covariance descriptor, as this descriptor is robust to problems such as p…

2013-03-24abs ↗pdf ↗

A new protocol corrects confounding effects to measure alignment-induced activation shifts accurately.

problem Confounding effects in measuring alignment-induced activation shifts using naive methods.
method Introduces a four-variant decomposition to separate alignment shift from template effects.
result Correctly measures alignment-induced activation shifts, recovering behaviorally active subspace.

We construct a template with two ribbons that describes the topology of all periodic orbits of the geodesic flow on the unit tangent bundle to any sphere with three cone points with hyperbolic metric. The construction relies on the existence of a particular coding with two letters for the geodesics on these orbifolds.

2014-11-25abs ↗pdf ↗

Models learn spatial templates from implicit language, predicting spatial arrangements with high accuracy.

problem Predicting spatial arrangements from implicit spatial language.
method Simple neural-based models leveraging annotated images and structured text.
result Models can predict spatial arrangements from implicit spatial language with high accuracy, even for unseen objects.

MAGIC generates image collages from set templates using attention and set representations.

problem Generating image collages from set templates is challenging for classical models.
method Memory Attentive Generation of Image Collages (MAGIC) using Set-Transformer layers and set-pooling.
result MAGIC can generate image collages from set templates in one forward pass.

Framework uses expert intervention to solve long-horizon reinforcement learning tasks.

problem Long horizon robot learning tasks with sparse rewards.
method Option templates and expert intervention to enable high-level task understanding.
result Framework outperforms state-of-the-art approaches by two orders of magnitude.

We use tools from geometric statistics to analyze the usual estimation procedure of a template shape. This applies to shapes from landmarks, curves, surfaces, images etc. We demonstrate the asymptotic bias of the template shape estimation using the stratified geometry of the shape space. We give a Taylor expansion of t…

2016-09-06abs ↗pdf ↗