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

Trend · papers per month

13.4%26.8%40.2%53.6% · Jun 202019922001200920182026
48 results for Dynamic Data Rates

Method calibrates local volatility and stochastic short rate models for equity-rate dynamics.

problem Joint calibration of local volatility and stochastic short rate models.
method Iterative approach using semimartingale optimal transport.
result Demonstrated performance on market data using European SPX options and cap interest rate options.

Transfer learning improves chaotic dynamics predictions with less data.

problem Efficiently predicting chaotic dynamics with limited data.
method Transfer learning for nonlinear dynamics, optimizing transfer rate and leveraging small-scale turbulence universality.
result Significantly more accurate inference of chaotic dynamics achieved.

Model proposes neural network for continuous time dynamics with inductive biases.

problem Training neural networks for small datasets with nonlinear dynamics.
method Inductive biases on decay rates and frequencies using Koopman operator theory.
result Higher forecasting performance with single short training sequence.

Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.

problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.

A new method predicts student skill success rates in real-time.

problem Accurate and explainable prediction of student skill success rates in real-time.
method Performance Distribution Tracing (PDT) using a Dynamic Bayesian Network with continuous random variables.
result PDT provides both explainability and accuracy in real-time predictions of student skill success rates.

We present a continuous-time maximum likelihood estimation methodology for credit rating transition probabilities, taking into account the presence of censored data. We perform rolling estimates of the transition matrices with exponential time weighting with varying horizons and discuss the underlying dynamics of trans…

2009-12-23abs ↗pdf ↗

Extends BBSM model to incorporate ESG ratings and path dynamics.

problem Price stock options considering historical market index dynamics and ESG ratings.
method Develops discrete, binary tree option pricing model under BBSM with ESG valuation.
result Model accurately fits stock price changes and European call option prices.

Study examines USD exchange rate dynamics using Kramers-Moyal expansion.

problem Understanding and predicting exchange rate instability.
method Kramers-Moyal expansion and Fokker-Planck formalism applied to log-return data.
result Identifies a stabilizing linear drift and nonlinear diffusion term in exchange rate fluctuations.

Study SGD dynamics in high-dimensional models, revealing consistent behavior across different batch sizes and learning rates.

problem Understanding SGD dynamics in high-dimensional multi-index models.
method Asymptotic analysis of SGD, developing mean-field equations and Gaussian diffusion approximations.
result Consistent SGD dynamics across different batch sizes and learning rates, distinct from gradient flow and online SGD.

New framework analyzes SGD dynamics in large samples and dimensions.

problem Analyzing stochastic gradient descent in large-scale settings.
method Inspired by random matrix theory, new framework for fixed stepsize and finite sum settings.
result SGD dynamics become deterministic in the large sample and dimensional limit, governed by a Volterra integral equation.

Advanced and effective collaborative filtering methods based on explicit feedback assume that unknown ratings do not follow the same model as the observed ones (\emph{not missing at random}). In this work, we build on this assumption, and introduce a novel dynamic matrix factorization framework that allows to set an ex…

2015-07-23abs ↗pdf ↗

Matrix factorization is a key component of collaborative filtering-based recommendation systems because it allows us to complete sparse user-by-item ratings matrices under a low-rank assumption that encodes the belief that similar users give similar ratings and that similar items garner similar ratings. This paradigm h…

2016-04-21abs ↗pdf ↗

The paper models exchange rate risk premium using mean-reverting dynamics.

problem Empirical failure of uncovered interest parity (UIP).
method Modeling risk premium using Ornstein-Uhlenbeck (OU) process embedded in stochastic differential equation for exchange rate.
result The model shows strong predictive performance at short and long horizons, but underperforms at intermediate horizons.

This paper demonstrates dynamic hyper-parameter setting, for deep neural network training, using Mutual Information (MI). The specific hyper-parameter studied in this paper is the learning rate. MI between the output layer and true outcomes is used to dynamically set the learning rate of the network through the trainin…

2018-05-18abs ↗pdf ↗

The analytical tractability of affine (short rate) models, such as the Vasicek and the Cox-Ingersoll-Ross models, has made them a popular choice for modelling the dynamics of interest rates. However, in order to account properly for the dynamics of real data, these models need to exhibit time-dependent or even stochast…

2015-02-10abs ↗pdf ↗

Rate-In dynamically adjusts dropout rates during inference to improve uncertainty estimation in neural networks.

problem Static dropout rates lead to suboptimal uncertainty estimates in neural networks.
method Rate-In dynamically adjusts dropout rates using information-theoretic principles.
result Rate-In improves calibration and sharpens uncertainty estimates compared to fixed or heuristic dropout rates.

ISOKANN learns collective variables and effective dynamics for metastable transitions.

problem Understanding metastable transitions in complex molecular systems.
method Integrates Koopman operators with neural networks to extract CVs and effective dynamics.
result Reconstructs coarse-grained kinetics and reproduces transition times across barriers.

New dynamics for SGD in small learning rate regime.

problem Improving stochastic gradient descent in small learning rate regime.
method Introducing stochastic modified flows and distribution dependent stochastic modified flows.
result Captures fluctuating dynamics of SGD in small learning rate - infinite width scaling regime.

Deep RL tackles mmWave backhaul resource allocation challenges.

problem Limited backhaul capacity and dynamic data rates in mmWave systems.
method Deep reinforcement learning (DRL) to predict and allocate backhaul resources.
result Efficient utilization of backhaul resources through DRL.

Bayesian optimisation for dynamically adjusting learning rates in machine learning models.

problem Dynamic adjustment of learning rates schedules in machine learning models.
method Probabilistic model based on latent Gaussian processes and auto-/regressive formulation.
result Flexibly adjusts learning rates schedules to abrupt changes of behaviours.

Neuroscience is experiencing a data revolution in which many hundreds or thousands of neurons are recorded simultaneously. Currently, there is little consensus on how such data should be analyzed. Here we introduce LFADS (Latent Factor Analysis via Dynamical Systems), a method to infer latent dynamics from simultaneous…

2016-08-22abs ↗pdf ↗

Proposes DHEB model for predicting online ad performance.

problem Sparse data at individual unit level in online advertising.
method Dynamic Hierarchical Empirical Bayesian (DHEB) model with data-driven hierarchy and shrinkage-based estimations.
result Proposed method outperforms other models in accuracy and efficiency.

We investigate the dynamics of growth models in terms of dynamical system theory. We analyse some forms of knowledge and its influence on economic growth. We assume that the rate of change of knowledge depends on both the rate of change of physical and human capital. First, we study model with constant savings. The mod…

2006-08-20abs ↗pdf ↗

The paper explores how dynamic preconditioning affects the CLT in online averaging.

problem When does dynamic preconditioning preserve the Polyak-Ruppert CLT?
method The authors decompose the averaged error and identify a stabilization-rate threshold for the CLT to hold.
result The CLT holds if the dynamic remainder vanishes in L2L^2 and the stabilization rate exceeds a threshold.

We study the continuous time random walk theory from financial tick data of the yen-dollar exchange rate transacted at the Japanese financial market. The dynamical behavior of returns and volatilities in this case is particularly treated at the long-time limit. We find that the volatility for prices shows a power-law w…

2004-09-04abs ↗pdf ↗

We use techniques from network science to study correlations in the foreign exchange (FX) market over the period 1991--2008. We consider an FX market network in which each node represents an exchange rate and each weighted edge represents a time-dependent correlation between the rates. To provide insights into the clus…

2009-05-29abs ↗pdf ↗

MOSAIC detects change points in dynamic networks with low-rank and sparse changes.

problem Detecting change points in dynamic networks with specific structural properties.
method Eigen-decomposition-based test with screened signals and residual-based adjustment.
result MOSAIC achieves minimax-optimal detection and testing rates.

Bayesian updating is modeled as a dynamical system, revealing learning rate laws.

problem Modeling Bayesian inference as a dynamical system.
method Formulated Bayesian updating as a continuous dynamical system, solving for trajectories in information geometry.
result Learning rate is governed by a 1/T1/T power-law when the Cramér-Rao bound is saturated.

Actor-critic algorithms converge to an ODE as data samples change dynamically.

problem Challenging to mathematically analyze due to non-i.i.d. data samples.
method Proved convergence to an ODE using time rescaling and geometric ergodicity.
result Convergence to the ODE limit and its properties proven.

Study models arrival rates and cancellation rates of limit orders in Borsa Istanbul.

problem Understanding order dynamics in Borsa Istanbul's stock market.
method Used limit order book data from Garanti Bank. Tested three discrete probability distributions and two theoretical models for arrival rates. Examined cancellation rates using L1 norms.
result Modelled daily, weekly, and monthly arrival rates of limit orders in the first fifteen bid and ask price levels.

Develops a bi-variate stochastic framework to model mortality and interest rates with long-range dependence.

problem Captures long-range dependence and instantaneous correlation in mortality and interest rates.
method Mixed fractional Brownian motions, analytical solutions, risk-neutral measure, sequential parameter estimation.
result Explicit pricing of zero-coupon bonds and extreme mortality bonds, practical implications for pricing and risk management.

The paper develops methods to estimate optimal treatment sequences under policy constraints.

problem Estimating the best sequence of treatments over multiple stages for individuals.
method Empirical welfare maximization approach, solving treatment assignment sequentially or simultaneously.
result Established convergence rates and upper bounds for estimation methods.

We discover scaling laws for kernel regression loss under various learning rate schedules.

problem Understanding loss dynamics and learning rate schedules in kernel regression.
method Theoretical analysis of stochastic gradient descent on a power-law kernel regression model.
result Established a Functional Scaling Law (FSL) capturing the full loss trajectory under arbitrary learning rate schedules.