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

3517021,0521,403 · Jun 202019922001200920172026
48 results for Time-based models

LLMs struggle to outperform markets over long periods and diverse stocks.

problem Overstated effectiveness of LLM-based investing strategies due to biases.
method FINSABER framework for systematic backtests over two decades and 100+ symbols.
result Previously reported LLM advantages deteriorate significantly under broader evaluation.

Paper introduces timing-based adversarial attacks on DRL-based navigation systems.

problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.

Many recommendation algorithms rely on user data to generate recommendations. However, these recommendations also affect the data obtained from future users. This work aims to understand the effects of this dynamic interaction. We propose a simple model where users with heterogeneous preferences arrive over time. Based…

2017-03-01abs ↗pdf ↗

Paper proposes a new reinforcement learning framework for cryptocurrency market making.

problem Improving profit and stability in cryptocurrency market making.
method Event-based reinforcement learning environment, training two policy-based agents with neural networks and various reward functions.
result Improved profit and stability demonstrated over time-based approach.

We study the computational capacity of a model neuron, the Tempotron, which classifies sequences of spikes by linear-threshold operations. We use statistical mechanics and extreme value theory to derive the capacity of the system in random classification tasks. In contrast to its static analog, the Perceptron, the Temp…

2010-10-26abs ↗pdf ↗

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 ↗

An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have been successful for many learning tasks, they do not consider time-evolving sig…

2016-07-12abs ↗pdf ↗

A machine learning model manages portfolio risk in high dimensions.

problem Managing risk in high-dimensional financial portfolios.
method A supervised learning approach using replicating martingales and polynomial/neural network bases.
result The model outperforms naive Monte Carlo and least-squares Monte Carlo methods.

This study examines whether the efficiency of cryptocurrency markets (Bitcoin and Ethereum) evolve over time based on Lo's (2004) adaptive market hypothesis (AMH). In particular, we measure the degree of market efficiency using a generalized least squares-based time-varying model that does not depend on sample size, un…

2019-04-20abs ↗pdf ↗

Well-defined formal definitions for sentiment and opinion are extended to incorporate the necessary elements to provide a formal quantitative definition of reputation. This definition takes the form of a time-based index, in which each element is a function of a collection of opinions mined during a given time period. …

2017-05-28abs ↗pdf ↗

We present analytical investigations of a multiplicative stochastic process that models a simple investor dynamics in a random environment. The dynamics of the investor's budget, x(t)x(t), depends on the stochasticity of the return on investment, r(t)r(t), for which different model assumptions are discussed. The fat-tail d…

2007-09-23abs ↗pdf ↗

In the landscape of TD algorithms, the Q(σσ, λλ) algorithm is an algorithm with the ability to perform a multistep backup in an online manner while also successfully unifying the concepts of sampling with using the expectation across all actions for a state. σ[0,1]σ\in [0, 1] indicates the extent to which sampling is use…

2019-12-21abs ↗pdf ↗

FRAME (Filters, Random fields, And Maximum Entropy) is an energy-based descriptive model that synthesizes visual realism by capturing mutual patterns from structural input signals. The maximum likelihood estimation (MLE) is applied by default, yet conventionally causes the unstable training energy that wrecks the gener…

2018-12-04abs ↗pdf ↗

The study compares different models for predicting factor premiums and finds neural networks perform better but have unstable weights.

problem Predicting and timing the CMA factor premium using machine learning models.
method Compared regression models (OLS, Ridge, Random Forest, Neural Network) and tested factor timing strategies.
result Neural networks outperform linear models in explaining factor premium variance, but weights are unstable.

New method improves conditional covariance estimation using targeted groups of assets.

problem Improving conditional covariance estimation in financial time series.
method Introduces targeting in BEKK and DCC models for financial time series analysis.
result Encouraging results from empirical case study, especially with fewer assets.

STAD adapts models to evolving time-based data shifts.

problem Gradual distribution shifts over time challenge existing test-time adaptation methods.
method Bayesian filtering method that learns time-varying dynamics in hidden features.
result STAD excels in handling small batch sizes and label shift on real-world data.

This paper explores the possibility that asset prices, especially those traded in large volume on public exchanges, might comply with specific physical laws of motion and probability. The paper first examines the basic dynamics of asset price displacement and finds one can model this dynamic as a harmonic oscillator at…

2017-05-28abs ↗pdf ↗

Dynamic retirement glidepaths evolve over time based on some measure such as the retiree's funded status or current market valuations. Conversely, static glidepaths are fixed at a starting point and selected under the assumption that they will not change. In practice, new static glidepaths may be derived periodically m…

2015-06-28abs ↗pdf ↗

Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …

2016-09-12abs ↗pdf ↗

The paper optimizes retirement spending considering habit formation and pension income.

problem Optimizing lifetime consumption under habit formation and pension income.
method Time inhomogeneous stochastic control problem with numerical solution using finite difference scheme.
result Consumption patterns change over time based on habit and optimal strategy.

SMURF-THP improves Transformer Hawkes process models by providing uncertainty quantification.

problem Uncertainty quantification for Transformer Hawkes process predictions.
method Score matching for learning the score function of event arrival times.
result SMURF-THP outperforms likelihood-based methods in confidence calibration.

Many users in online social networks are constantly trying to gain attention from their followers by broadcasting posts to them. These broadcasters are likely to gain greater attention if their posts can remain visible for a longer period of time among their followers' most recent feeds. Then when to post? In this pape…

2016-05-22abs ↗pdf ↗

In this work, we ask two questions: 1. Can we predict the type of community interested in a news article using only features from the article content? and 2. How well do these models generalize over time? To answer these questions, we compute well-studied content-based features on over 60K news articles from 4 communit…

2018-08-27abs ↗pdf ↗

Convolutional neural networks (CNNs) are commonly used for image classification tasks, raising the challenge of their application on data flows. During their training, adaptation is often performed by tuning the learning rate. Usual learning rate strategies are time-based i.e. monotonously decreasing. In this paper, we…

2019-11-18abs ↗pdf ↗

This study shows how DDPM can be represented by the OU process.

problem Designing optimal noise schedules for DDPM.
method Formal equivalence between DDPM and OU process, heuristic designs based on Fisher Information.
result Fisher-Information-motivated schedule corresponds to cosine noise schedule.

AI models outperform simple rules in cross-asset futures timing, especially with lower transaction costs.

problem Optimizing cross-asset portfolio weights using traditional forecasting and optimization methods.
method End-to-end AI policies that map market states directly to portfolio weights, trained on CME futures using a differentiable Sharpe ratio loss function.
result Transformer-based AI policies outperform simple rules and equal weighting, trading less and matching or exceeding equal weighting through moderate transaction costs.

Dynamic treatment effects estimated over time using covariate balancing.

problem Estimating treatment effects in panel data with dynamic treatments.
method Dynamic covariate balancing with potential local projections.
result Established inferential guarantees for the proposed method.

Online detection of abrupt changes in high-dimensional data streams.

problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.