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

17335066 · May 202619922001200920182026
48 results for time-based index

The paper solves a dynamic portfolio optimization problem using Riccati transformation.

problem Dynamic stochastic portfolio optimization involving expected and intertemporal utilities.
method Solving a fully nonlinear HJB equation through Riccati transformation into a quasi-linear parabolic equation.
result The numerical method based on semi-implicit scheme converges at second order.

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 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.

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.

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 ↗

The paper studies how convex shapes evolve over time based on their curvature.

problem Understanding how convex shapes change over time based on their curvature.
method Analyzes the evolution of strictly convex hypersurfaces in \(\mathbb{R}^{n+1}\) moving with a specific speed.
result The flow converges to a round sphere after rescaling for \(α > \frac{1}{n+2}\), and to an ellipsoid for \(α = \frac{1}{n+2}\).

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.

Unsupervised method learns universal embeddings for variable-length multivariate time series.

problem Challenges in learning representations for time series data due to varying lengths and sparse labeling.
method Combines causal dilated convolutions with triplet loss for time-based negative sampling.
result Demonstrates quality, transferability, and practicability of learned representations.

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 ↗

Study shows cryptocurrency market efficiency changes over time.

problem Measuring cryptocurrency market efficiency over time.
method Used a generalized least squares-based time-varying model to measure efficiency without sample size dependence.
result Bitcoin's market efficiency is higher than Ethereum's over most periods.

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 ↗

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.

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.

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.

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.

The paper suggests asset prices follow physical laws, allowing for accurate price movement forecasts.

problem Predicting extreme price movements in financial markets.
method Modeling asset price dynamics as a harmonic oscillator and applying the principle of stationary action.
result The theory can make accurate forecasts of price movements during market crashes and specific price displacements at other times.

Paper revisits FRAME model, explaining instability and proposing a new metric.

problem Unstable training energy in FRAME model.
method Theoretical analysis using particle physics, proposing a new Wasserstein distance.
result Proposed Wasserstein distance stabilizes energy dissipation and maintains statistical consistency.

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.

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 ↗

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 ↗

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.

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.

Self-Organizing Maps provide quick flood predictions for real-time decision making.

problem Computational demand of physically-based overland flow models limits their use in real-time applications.
method Developed a flood-simulation specific SOM using cellular automata flood model results and synthetic DEM.
result SOMs can generate accurate water depth and flood extent results in a short time.

Study on symmetric operators on non-compact manifolds, focusing on their index modulo 2.

problem Investigating elliptic operators with a specific symmetry and their index modulo 2.
method Analysis of Callias-type operators on non-compact manifolds, establishing mod 2 versions of index theorems.
result Established mod 2 versions of the Gromov-Lawson relative index theorem, Callias index theorem, and Boutet de Monvel's index theorem for Toeplitz operators.

New index formula connects numerical and KK-theoretic indices.

problem Equivariant index for proper group actions on manifolds.
method Developed a trace on group conjugacy classes to relate numerical and KK-theoretic indices.
result Shows that numerical index equals KK-theoretic index under certain conditions.

This study analyzes AdaGrad's stability and convergence in non-convex optimization.

problem Lack of theoretical analysis for AdaGrad in non-convex optimization.
method Novel stopping time-based techniques from probability theory.
result Established stability and derived convergence rates for AdaGrad.

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.