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

Trend · papers per month

103206308411 · Jun 202019922001200920182026
48 results for Temporal Representation

Model predicts travel time under rare conditions using a vector-space model.

problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.

Proposes models for learning latent representations of evolving network vertices over time.

problem Inadequate models for capturing temporal smoothness in evolving networks.
method Proposes two models: retrofitted and linear transformation, to capture temporal smoothness.
result Proposed models significantly outperform existing models in temporal link prediction tasks.

DGE learns event representations from image sequences without manual annotations.

problem Data hunger and domain adaptation issues in self-supervised learning for temporal segmentation.
method Dynamic Graph Embedding (DGE) learns event representations by iteratively updating a graph and its embedding.
result DGE achieves robust temporal segmentation on benchmark datasets, outperforming state-of-the-art methods.

ATiSE embeds temporal information into KGs using time series decomposition.

problem Improving KG embedding models by incorporating temporal information.
method ATiSE uses Additive Time Series decomposition to map temporal KGs into multi-dimensional Gaussian distributions.
result ATiSE achieves state-of-the-art performance on link prediction over four temporal KGs.

STDGI learns node representations for spatio-temporal graphs via mutual information maximization.

problem Challenges in learning node representations for spatio-temporal graphs due to structural changes over time.
method STDGI is a fully unsupervised approach based on mutual information maximization that exploits both spatial and temporal dynamics.
result STDGI's learned node representations improve spatio-temporal auto-regressive forecasting models.

GTEA learns node representations in temporal interaction graphs.

problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.

Temporal-difference and Q-learning learn feature representations that converge to optimal ones.

problem Understanding how feature representations evolve in temporal-difference and Q-learning with neural networks.
method Mean-field theory applied to overparameterized two-layer neural networks.
result The feature representation converges to the optimal one, generalizing previous results.

DySAT learns dynamic graph node representations capturing structural and temporal patterns.

problem Learning latent representations of nodes in dynamic graphs.
method Dynamic Self-Attention Network (DySAT) that combines self-attention layers for structural and temporal dimensions.
result DySAT outperforms state-of-the-art baselines in link prediction on dynamic graphs.

Novel ECG classification for AF using spectro-temporal Kalman filtering and deep CNN.

problem Atrial fibrillation (AF) detection in ECG signals.
method Spectro-temporal representation using Kalman filter and deep convolutional neural networks.
result Proposed method achieves an overall F1 score of 80.2% on the PhysioNet/Computing in Cardiology (CinC) 2017 dataset.

Recent progress in using recurrent neural networks (RNNs) for image description has motivated the exploration of their application for video description. However, while images are static, working with videos requires modeling their dynamic temporal structure and then properly integrating that information into a natural…

2015-02-27abs ↗pdf ↗

TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.

problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.

Develops a hybrid deep learning model for stock price prediction.

problem Predicting daily stock prices in the stock market.
method Representation learning with Stock2Vec embedding and temporal convolutional layers.
result Achieves better performance on stock price prediction than benchmarks.

CtrlNS learns latent factors and distribution shifts from sparse transitions without prior knowledge.

problem Lack of prior knowledge of domain variables limits causal temporal representation learning.
method Sparse transition assumption and identifiability results from theoretical perspective.
result Effective in identifying distribution shifts and latent factors without prior knowledge.

OMBA learns product and user representations for better online market basket analysis.

problem Limited ability to uncover rarely occurring and temporal associations in MBA.
method Jointly learns product and user representations, captures temporal dynamics, scalable online method.
result OMBA outperforms state-of-the-art methods by 21% on real-world datasets.

iCITRIS learns causal variables from interactive systems with instantaneous effects.

problem Identifying causal variables from temporal sequences with instantaneous effects.
method iCITRIS method for causal representation learning that handles instantaneous effects in intervened temporal sequences.
result iCITRIS accurately identifies causal variables and their causal graph from three interactive system datasets.

A new kernel framework analyzes spatio-temporal data from dynamic equations.

problem Analyzing spatio-temporal data from dynamic equations with noisy measurements.
method Kernel-based framework with representer theorem for minimizing error with given samples.
result Minimizes error in solutions of dynamic equations with noisy spatio-temporal data.

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.

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.

CAWs learn temporal network dynamics without node identities or edge attributes.

problem Learning temporal network dynamics without node identities or edge attributes.
method Causal Anonymous Walks (CAWs) using temporal random walks and hitting counts.
result CAW-N outperforms previous methods in predicting links over 6 real temporal networks.

Mobile devices learn audio representations using self-supervised methods.

problem Learning general-purpose audio representations on mobile devices.
method Temporal context exploitation in spectrogram domain, inspired by Word2Vec.
result Self-supervised models can produce embeddings that perform similarly to fully supervised models.

New dataset and analysis improve evaluation of visual representation models.

problem Insufficient evaluation methods for visual representation models.
method Analyzed five representations and developed a new dataset.
result Models with poor linear classification performance can still perform well on complex tasks.

The paper evaluates different graph input representations for urban network analysis.

problem Challenges in analyzing urban networks due to their size and complexity.
method Design and evaluation of six graph input representations considering topological and temporal characteristics.
result Temporal information in graph input representations significantly improves model accuracy (RMSE of 1.42).

Paper proposes a novel approach to improve temporal clustering of time series data.

problem Challenges in clustering temporal data with varying sampling rates and high dimensionality.
method Transform time series into Euclidean space using similarity measures, then use CNN-GRU autoencoder for latent representation.
result Approach outperforms existing methods by up to 32% on various time series datasets.

Synthesizes images from audio and visual data using spike-based autoencoders.

problem Extracting meaningful information from spatio-temporal data for image synthesis.
method Spike-based autoencoders trained to learn spatio-temporal representations of audio and visual data.
result Synthesized images from audio samples with high fidelity, achieving competitive performance.

DDP models dynamic comorbidity networks from event data.

problem Understanding complex temporal patterns of co-occurring diseases.
method Developed deep diffusion processes (DDP) to model dynamic comorbidity networks.
result DDP enables accurate risk prediction and interpretable disease trajectories.

Convolutional LSTM improves missing data imputation in spatio-temporal data.

problem Missing data in spatio-temporal data affects analysis performance.
method Proposes a convolutional bidirectional-LSTM for spatio-temporal missing data imputation.
result The proposed model outperforms state-of-the-art methods for missing data imputation.

Successor Features improve transfer in RL by decoupling feature and reward.

problem Improving feature representation for task transfer in reinforcement learning.
method Decouples feature representation from reward function, allowing domain transfer.
result Advantages and limitations of Successor Features for transfer identified.

New method improves neural decoding accuracy and reveals latent memory organization.

problem Improving neural decoding of temporal memory organization.
method Bayesian neural decoding using a diversity-encouraging latent representation learning method.
result Substantially higher accuracy in neural decoding and clear latent representation.