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

Trend · papers per month

63126188251 · Jun 202019922001200920172026
48 results for temporal coding

MedGraph learns patient visit embeddings from EMRs, capturing both attributes and temporal sequences.

problem Limited EMR embedding methods fail to capture patient demographics, utilisation, and code descriptions.
method MedGraph constructs an attributed bipartite graph and uses a point process to model temporal sequences.
result MedGraph outperforms state-of-the-art methods in medical risk prediction tasks.

A new SNN learning algorithm for energy-efficient VLSI circuits.

problem Designing energy-efficient SNNs for VLSI implementation.
method Temporal coding, analog VLSI, resistive memory.
result Classification accuracy comparable to state-of-the-art temporal coding SNN algorithms.

We explore whether useful temporal neural generative models can be learned from sequential data without back-propagation through time. We investigate the viability of a more neurocognitively-grounded approach in the context of unsupervised generative modeling of sequences. Specifically, we build on the concept of predi…

2017-11-30abs ↗pdf ↗

TNC learns time series representations by leveraging temporal neighborhoods.

problem Complex, unlabeled time series data.
method Temporal Neighborhood Coding (TNC) with a debiased contrastive objective.
result TNC outperforms other unsupervised methods in time series clustering and classification.

We model GitHub interactions as a temporal knowledge graph for software engineering questions.

problem Insufficient performance of existing temporal models on extrapolated queries and time prediction.
method Introduced an extension to current temporal models using relative temporal information.
result Improved performance on extrapolated queries and time prediction.

Enhances understanding of patient healthcare journeys using self-attention.

problem Capturing hidden dependencies in multi-level patient journey data.
method Proposes a multi-level self-attention network (MusaNet) for encoding patient journeys.
result MusaNet produces higher-quality representations than state-of-the-art methods.

Temporal information impacts only a fraction of time series datasets, skewing benchmark evaluations.

problem Temporal information's impact on time series classification is often overestimated.
method Permutation tests on UCR archive to identify datasets where temporal info is irrelevant.
result Many tabular datasets perform well without temporal info, skewing benchmark evaluations.

New training algorithm enhances SNNs for temporal signal processing.

problem Lack of robust training algorithms for large-scale SNNs.
method Formulated SNN as IIR filters, proposed training algorithm for optimal synapse filter kernels and weights.
result Model and training algorithm outperform state-of-the-art approaches in accuracy.

Paper tackles temporal overfitting in wind power curve modeling.

problem Temporal overfitting in wind power curve modeling.
method Proposes a Gaussian process-based method to partition and model time-invariant and time-varying components.
result Significant improvement in predicting responses for different time periods.

DGRCL integrates dynamic and static graph relations for financial market prediction.

problem Capturing the evolving nature of stock markets while considering both temporal changes and static relational structures.
method Dynamic Graph Representation with Contrastive Learning (DGRCL) framework, including Embedding Enhancement (EE) and Contrastive Constrained Training (CCT) modules.
result DGRCL significantly outperforms state-of-the-art TGL baselines on NASDAQ and NYSE datasets.

Paper proposes a novel approach to improve spatiotemporal precipitation forecasts.

problem Improving accuracy of spatiotemporal precipitation forecasts for flood damage mitigation.
method Introduces a rain-code fusion approach using ConvLSTM and multi-frame fusion for spatiotemporal precipitation code-to-code forecasting.
result Demonstrates enhanced accuracy in precipitation forecasts beyond 3 timesteps using the rain-code fusion.

We describe the submission of the Quo Vadis team to the Traffic4cast competition, which was organized as part of the NeurIPS 2019 series of challenges. Our system consists of a temporal regression module, implemented as 1×11\times1 2d convolutions, augmented with spatio-temporal biases. We have found that using biases i…

2019-10-27abs ↗pdf ↗

A3T-GCN improves traffic forecasting by capturing spatial and temporal dependencies.

problem Accurate real-time traffic forecasting in complex road networks.
method Attention Temporal Graph Convolutional Network (A3T-GCN) integrating recurrent units and graph convolutional network.
result Improved prediction accuracy through attention mechanism and global temporal information.

A new model uses neural networks to efficiently learn multivariate temporal point processes.

problem Efficiently modeling multivariate temporal point processes with low parameter complexity.
method Modeling the cumulative hazard function with neural networks for each variate.
result The proposed model achieves state-of-the-art performance on data fitting and event prediction tasks.

This article addresses the issue of representing electroencephalographic (EEG) signals in an efficient way. While classical approaches use a fixed Gabor dictionary to analyze EEG signals, this article proposes a data-driven method to obtain an adapted dictionary. To reach an efficient dictionary learning, appropriate s…

2013-03-04abs ↗pdf ↗

Paper tackles estimating initial conditions of spatio-temporal processes from sparse data.

problem Estimating initial conditions of spatio-temporal advection-diffusion processes from sparse data.
method Regularized convex optimization problem with Alternating Direction Method of Multipliers.
result Efficient solutions for non-uniform and shifted uniform sampling schemes.

This paper introduces the factorial marked temporal point process model and presents efficient learning methods. In conventional (multi-dimensional) marked temporal point process models, event is often encoded by a single discrete variable i.e. a marker. In this paper, we describe the factorial marked point processes w…

2018-01-21abs ↗pdf ↗

LVTINO improves high-definition video restoration with consistent temporal details.

problem Restoring high-definition video with fine spatial detail and temporal consistency.
method LVTINO uses Video Consistency Models to bypass frame-by-frame image-based LDMs, achieving perceptual quality and computational efficiency.
result Significant perceptual improvements over current methods, achieving state-of-the-art quality with minimal evaluations.

Although software analytics has experienced rapid growth as a research area, it has not yet reached its full potential for wide industrial adoption. Most of the existing work in software analytics still relies heavily on costly manual feature engineering processes, and they mainly address the traditional classification…

2016-07-30abs ↗pdf ↗

CODE learns ODE dynamics from sparse data, outperforming neural and kernel methods.

problem Learning ODE dynamics from sparse and noisy data.
method CODE uses Polynomial Chaos Expansion (aPCE) for the ODE's RHS, enabling global orthonormal polynomial representation.
result CODE exhibits remarkable extrapolation capabilities even under novel initial conditions and measurement noise.

There is a consensus that human and non-human subjects experience temporal distortions in many stages of their perceptual and decision-making systems. Similarly, intertemporal choice research has shown that decision-makers undervalue future outcomes relative to immediate ones. Here we combine techniques from informatio…

2016-04-18abs ↗pdf ↗

Hybrid model improves geopolitical conflict forecasting.

problem Forecasting geopolitical events from sparse, bursty data.
method Sparse Temporal Fusion Transformer (TFT) + Variational Nearest Neighbor Gaussian Process (VNNGP).
result Consistently outperforms standalone TFT in long-range horizons.

New model recommends stocks considering individual preferences and diversification.

problem Inaccurate stock price predictions and ignoring investment theories.
method Portfolio Temporal Graph Network Recommender (PfoTGNRec) incorporating diversification-enhancing sampling.
result PfoTGNRec outperforms state-of-the-art models in real-world data.

T2FSNN improves deep SNNs by reducing spikes and latency.

problem Inefficiency in spiking neural networks due to lack of scalable training algorithms.
method Introduces time-to-first-spike coding with kernel-based dynamic threshold and dendrite, combined with gradient-based optimization and early firing methods.
result Reduces inference latency and spike count by 22% and less than 1% compared to burst coding.