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.

168,695 papers · 148 categories

Trend · papers per month

24487195 · Jun 202019922001200920172026
48 results for template fit

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.

Many spectral unmixing methods rely on the non-negative decomposition of spectral data onto a dictionary of spectral templates. In particular, state-of-the-art music transcription systems decompose the spectrogram of the input signal onto a dictionary of representative note spectra. The typical measures of fit used to …

2016-09-30abs ↗pdf ↗

Enhanced detection of sneutrinos at the LHC using machine learning.

problem Detecting rare new physics signals in the presence of significant backgrounds.
method Machine learning models (XGBoost and deep neural network) applied to template fit analysis.
result Template fit outperforms simple cuts in enhancing sneutrino detectability.

Proposes adaptive ridge regression for functional linear models with piecewise shapes.

problem Functional linear regression with unknown coefficient function.
method Adaptive piecewise function template with L2L_2 penalization.
result Improves predictive power and interpretability compared to standard methods.

New method uses neural networks to estimate parameters without needing detector simulations.

problem Estimating parameters in high-energy physics with detector effects.
method Two-level fitting approach: SRGN (Simulation-level fit based on Reweighting Generator-level events with Neural networks).
result Demonstrated using simulated datasets, SRGN can estimate parameters without detector effects.

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.

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.

We start with a description of Lacan's work that we then take into our analytics methodology. In a first investigation, a Lacan-motivated template of the Poe story is fitted to the data. A segmentation of the storyline is used in order to map out the diachrony. Based on this, it will be shown how synchronous aspects, p…

2016-04-23abs ↗pdf ↗

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 ↗

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.

X-DC improves speech separation by making DNNs more interpretable.

problem Black-box nature of DNNs in speech separation tasks.
method Introduces X-DC, a DNN architecture that interprets as spectrogram template fitting followed by Wiener filtering.
result X-DC achieves comparable speech separation performance to DC but with enhanced interpretability.

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 ↗

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.

The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization. A multi-objective optimization problem finds conical combinations of templates …

2017-09-13abs ↗pdf ↗

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.

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 ↗

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 ↗

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 ↗

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.

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 ↗

In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…

2019-05-08abs ↗pdf ↗

Choose any oriented link type X and closed braid representatives X[+], X[-] of X, where X[-] has minimal braid index among all closed braid representatives of X. The main result of this paper is a `Markov theorem without stabilization'. It asserts that there is a complexity function and a finite set of `templates' such…

2003-10-18abs ↗pdf ↗

TempLe learns transition templates for efficient multi-task RL.

problem Efficiently transferring knowledge across different RL tasks with varying state/action spaces.
method Generates transition dynamics templates to abstract similarities between tasks.
result Achieves significantly lower sample complexity than single-task or multi-task methods.

The prediction of organic reaction outcomes is a fundamental problem in computational chemistry. Since a reaction may involve hundreds of atoms, fully exploring the space of possible transformations is intractable. The current solution utilizes reaction templates to limit the space, but it suffers from coverage and eff…

2017-09-13abs ↗pdf ↗

This paper provides a generic framework of component analysis (CA) methods introducing a new expression for scatter matrices and Gram matrices, called Generalized Pairwise Expression (GPE). This expression is quite compact but highly powerful: The framework includes not only (1) the standard CA methods but also (2) sev…

2012-07-16abs ↗pdf ↗

This paper investigates how transformers can learn to generalize to unseen examples in context.

problem Understanding how transformers can generalize to unseen examples in a prompt.
method Gradient descent analysis of one-layer multi-head transformers for in-context learning.
result The training loss for a one-layer multi-head transformer converges linearly to a global minimum, effectively learning ridge regression over basis functions.

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.

Generates music with coherent rhythm, chords, and melody using LSTM models.

problem Lack of direction and coherence in generated music by neural networks.
method Two-stage LSTM model: first generates harmonic and rhythmic templates, then melodies conditioned on these.
result Subjective test shows improved musical coherence and coherence compared to baselines.