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

Trend · papers per month

4794140187 · Jun 202019922001200920172026
48 results for temporal ranking

Time-aware fact-checking improves veracity predictions for time-sensitive claims.

problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.

Estimates spatio-temporal Hawkes processes using tensor recovery.

problem Estimating influence functions for spatio-temporal Hawkes processes.
method Formulates influence function as a tensor kernel, assumes low-rank structure, solves as convex optimization problem.
result Provides theoretical guarantees and demonstrates efficiency with simulations.

The collaborative ranking problem has been an important open research question as most recommendation problems can be naturally formulated as ranking problems. While much of collaborative ranking methodology assumes static ranking data, the importance of temporal information to improving ranking performance is increasi…

2019-08-15abs ↗pdf ↗

Proposes a new tensor decomposition method for functional temporal data with adaptive complexity.

problem Challenges in temporal tensor decomposition for general tensor data with continuous indexes.
method Encodes continuous spatial indexes as learnable Fourier features and uses neural ODEs for temporal trajectories. Introduces a sparsity-inducing prior for complexity adaptation.
result Significantly outperforms existing methods in prediction performance and robustness against noise.

Paper proposes LATC for multivariate time series prediction and missing data imputation.

problem Large-scale, incomplete, and corrupted multivariate time series data.
method Transforms multivariate time series into a tensor structure, models global and local trends, and uses autoregressive norm.
result Integration of global and local trends improves missing data imputation and rolling prediction.

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.

Method improves clarity in forecasting spatio-temporal data.

problem Forecasting spatio-temporal data with clarity and interpretability.
method Supervised semi-nonnegative matrix factorization with frequency regularization.
result Method offers clearer interpretability in forecasting spatio-temporal data.

Stock prediction aims to predict the future trends of a stock in order to help investors to make good investment decisions. Traditional solutions for stock prediction are based on time-series models. With the recent success of deep neural networks in modeling sequential data, deep learning has become a promising choice…

2018-09-25abs ↗pdf ↗

Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.

problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.

Temporal coarse-graining of multi-sector default count data generates effective correlation matrices and rank copulas.

problem Explaining the difference in default dependence between monthly and annual aggregation.
method Dynamic low-rank state-space model with AR(1) latent credit-state factors.
result Effective correlation matrices and rank copulas are generated from monthly default count data.

Paper introduces a novel framework for recognizing dynamic ranking structures in preference-based data.

problem Complex and noisy preference-based data often hide underlying homogeneous structures.
method Developed an approach to identify dynamic ranking groups using temporal penalties and spectral estimation. Introduced an objective function for detecting structural changes.
result Consistent recognition of ranking groups and structural changes in preference-based data.

NoTMF forecasts sparse urban road movement speeds with nonstationary temporal matrix factorization.

problem Sparse and nonstationary movement speed data from urban roads.
method Nonstationary Temporal Matrix Factorization (NoTMF) model.
result NoTMF outperforms baseline models in forecasting urban road movement speeds.

Temporal Functional Circuits explain KAN forecasts with interpretable edge functions.

problem Lack of mechanistic explanations in KAN forecasting.
method Transform KAN edge functions into faithful, temporally grounded explanations using a gated residual KAN.
result Gated KAN achieves lower MSE than linear-only models on regime-switching signals.

This paper reviews methods for discovering patient subgroups from EHR data.

problem Discovering subgroups of patients and co-occurring medical conditions from EHR data.
method Low-rank data approximation methods like matrix and tensor decompositions.
result These methods provide transparent and interpretable insights into patient phenotypes.

We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…

2016-08-11abs ↗pdf ↗

Framework detects and ranks suspicious market manipulation using temporal convolutions and expert assessment.

problem Detecting and deterring rogue agents in financial markets.
method Weakly supervised learning, expert assessment, similarity search.
result Promising preliminary results in detecting and ranking suspicious market manipulation.

We consider dynamic pricing with many products under an evolving but low-dimensional demand model. Assuming the temporal variation in cross-elasticities exhibits low-rank structure based on fixed (latent) features of the products, we show that the revenue maximization problem reduces to an online bandit convex optimiza…

2018-01-30abs ↗pdf ↗

Develops a deep non-stationary kernel for non-stationary spatio-temporal point processes.

problem Capturing non-stationary dependencies in point process data.
method Approximates the influence kernel with a novel low-rank decomposition and introduces a log-barrier penalty to maintain non-negativity.
result Demonstrates superior performance and computational efficiency compared to state-of-the-art methods.

New protocol evaluates synthetic data for temporal consistency.

problem Synthetic data generators can produce invalid timestamps and trajectories.
method Characterize datasets by four properties, then measure timestamp validity and dynamics.
result Temporal fidelity must be measured, not inferred from static data.

A new model detects and localizes anomalies in multivariate time series data.

problem Anomaly diagnosis in multivariate time series data, especially localization.
method Attention Low-Rank Transformer (ALoRa-T) with low-rank regularization and Attention Low-Rank score.
result The proposed method significantly outperforms state-of-the-art methods in anomaly detection and localization.

This paper evaluates various loss functions for Transformer models in stock ranking.

problem Evaluating loss functions for Transformer models in stock ranking.
method Systematic evaluation of advanced loss functions (pointwise, pairwise, listwise) on S&P 500 data.
result Different loss functions impact a model's ability to discern profitable relative orderings among assets.

We study the problem of detecting an abrupt change to the signal covariance matrix. In particular, the covariance changes from a "white" identity matrix to an unknown spiked or low-rank matrix. Two sequential change-point detection procedures are presented, based on the largest and the smallest eigenvalues of the sampl…

2017-06-15abs ↗pdf ↗

We propose two methods for exact Gaussian process (GP) inference and learning on massive image, video, spatial-temporal, or multi-output datasets with missing values (or "gaps") in the observed responses. The first method ignores the gaps using sparse selection matrices and a highly effective low-rank preconditioner is…

2018-08-09abs ↗pdf ↗

Paper proposes an active learning method for surgical workflow recognition using long-range temporal dependency.

problem Challenges in automatic surgical workflow recognition due to lack of large-scale labelled datasets.
method NL-RCNet with non-local block for capturing long-range temporal dependency and intra-clip dependency score for selection.
result Our approach outperforms state-of-the-art methods by selecting only 50% of samples for training.

Neural network factorization speeds up Vlasov equation simulations.

problem Accelerating simulations of collisionless plasma described by the Vlasov equation.
method Data-driven low-rank matrix factorization using convolutional neural networks.
result The method outperforms standard linear algebra at inference time.

SPINEX improves time series forecasting with explainable neighbors.

problem Enhancing time series forecasting accuracy and interpretability.
method Leverages similarity and higher-order temporal interactions across multiple scales.
result SPINEX consistently ranks among top performers in forecasting precision.

Learning from spatio-temporal data has numerous applications such as human-behavior analysis, object tracking, video compression, and physics simulation.However, existing methods still perform poorly on challenging video tasks such as long-term forecasting. This is because these kinds of challenging tasks require learn…

2020-02-21abs ↗pdf ↗

The smart grid vision entails advanced information technology and data analytics to enhance the efficiency, sustainability, and economics of the power grid infrastructure. Aligned to this end, modern statistical learning tools are leveraged here for electricity market inference. Day-ahead price forecasting is cast as a…

2013-10-02abs ↗pdf ↗

SALT models combine ARHMM and SLDS for efficient, interpretable time-series analysis.

problem Efficient modeling of systems with time-varying dynamics and long-range dependencies.
method Switching autoregressive low-rank tensor models parameterized with a low-rank factorization.
result SALT models provide a balance of interpretability and efficiency, outperforming ARHMMs and SLDSs.

Modular pipeline improves stock portfolio prediction robustness under regime changes.

problem Overfitting in deep learning models for non-stationary datasets.
method Modular machine learning pipeline with GBDT models and online learning techniques.
result GBDT models with dropout show high performance, robustness, and generalisability.

Fine-grained action segmentation in long untrimmed videos is an important task for many applications such as surveillance, robotics, and human-computer interaction. To understand subtle and precise actions within a long time period, second-order information (e.g. feature covariance) or higher is reported to be effectiv…

2019-06-03abs ↗pdf ↗

TASC improves synthetic control for time-series data with trends.

problem Inability of existing SC methods to fully utilize temporal structure in time-series data.
method TASC uses a state-space model with a constant trend and Kalman filter for counterfactual inference.
result TASC offers advantages in settings with strong temporal trends and high observation noise.