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

Trend · papers per month

86172257343 · Jun 202019922001200920172026
48 results for dynamic evidence

New method optimizes portfolios by dynamically integrating ESG constraints.

problem Static ESG scores mismatch sequential portfolio decisions.
method MACF-X, a family of adapters that learns ESG costs from multimodal evidence.
result Reduces tail ESG budget pressure while maintaining financial performance.

A new method for CT-DCEGs simplifies inference for asymmetric processes.

problem Inference in asymmetric state space problems with continuous time evolution.
method An extension of CEG propagation for CT-DCEGs, employing junction tree inference.
result CT-DCEGs are preferred over DBNs and continuous time BNs for asymmetric processes.

The Surprise index assesses autonomous systems' competency in uncertain environments.

problem Evaluating competency of autonomous systems in dynamic, uncertain environments.
method Surprise index, a measure that quantifies system performance based on available data.
result The Surprise index can be computed for dynamic systems with Gaussian marginal distributions.

ITF improves DSR but inflates curvature, while marginal likelihood reduces it, affecting QoIs.

problem Curvature mismatch between teacher forcing and marginal likelihood in chaotic dynamical systems.
method Comparing objective-induced curvatures of ITF and marginal likelihood in a probabilistic switching augmentation of AL-RNNs.
result Curvature inflation by ITF and reduction by marginal likelihood affect dynamical quantities of interest.

Model forecasts market structure from financial networks using machine learning.

problem Predicting market correlation structure from financial networks.
method Dynamic Asset Graph (DAG), Dynamic Minimal Spanning Tree (DMST), Dynamic Threshold Networks (DTN).
result Model improves market structure forecasting by up to 40% over benchmarks.

Technical trading represents a class of investment strategies for Financial Markets based on the analysis of trends and recurrent patterns of price time series. According standard economical theories these strategies should not be used because they cannot be profitable. On the contrary it is well-known that technical t…

2011-10-24abs ↗pdf ↗

DQN outperforms static policies in a dynamic fee environment for automated market makers.

problem How automated market makers (AMMs) perform under dynamic fees is unknown.
method Constructed a closed-loop simulator with dynamic fees, noise flow, and arbitrage.
result A small DQN policy outperforms static policies in a dynamic fee environment.

There is more and more empirical evidence that multifractality constitutes another and perhaps the most significant financial stylized fact. A realistic model of the financial dynamics should therefore incorporate this effect. The most promising in this respect is the Multifractal Model of Asset Returns (MMAR) introduc…

2006-05-17abs ↗pdf ↗

Study of volume dynamics at market spread in Bitcoin/USD.

problem Understanding the statistical properties of order volumes in financial markets.
method Examined the dynamical properties of volume available at the spread, focusing on mean reversion, asymmetry, and clustering.
result Evidence of mean reverting volume changes and strong asymmetries in sell and buy orders.

Study examines infinite limits of transformer dynamics, identifying key parameterizations.

problem Understanding the training dynamics of transformer models in the feature learning regime.
method Analysis of infinite scaling limits using dynamical mean field theory.
result Identified parameterizations that admit well-defined infinite width and depth limits.

AdaBoost is one of the most popular ML algorithms. It is simple to implement and often found very effective by practitioners, while still being mathematically elegant and theoretically sound. AdaBoost's interesting behavior in practice still puzzles the ML community. We address the algorithm's stability and establish m…

2012-12-05abs ↗pdf ↗

We offer a novel view of AdaBoost in a statistical setting. We propose a Bayesian model for binary classification in which label noise is modeled hierarchically. Using variational inference to optimize a dynamic evidence lower bound, we derive a new boosting-like algorithm called VIBoost. We show its close connections …

2012-09-10abs ↗pdf ↗

We analyse a period spanning 35 years of activity in the Sao Paulo Stock Exchange Index (IBOVESPA) and show that the Heston model with stochastic volatility is capable of explaining price fluctuations for time scales ranging from 5 minutes to 100 days with a single set of parameters. We also show that the Heston model …

2004-02-06abs ↗pdf ↗

Recurrence Plot (RP) and Recurrence Quantification Analysis RQA) are signal numerical analysis methodologies able to work with non linear dynamical systems and non stationarity. Moreover they well evidence changes in the states of a dynamical system. It is shown that RP and RQA detect the critical regime in financial i…

2005-05-24abs ↗pdf ↗

This paper examines multifractal dynamics in cryptocurrencies using two methodologies.

problem Understanding the multifractal nature of cryptocurrencies and their stochastic processes.
method Two alternative multi-scaling methodologies applied to 84 cryptocurrencies.
result Cryptocurrencies exhibit different degrees of long-range dependence and stochastic processes.

There is vast empirical evidence that given a set of assumptions on the real-world dynamics of an asset, the European options on this asset are not efficiently priced in options markets, giving rise to arbitrage opportunities. We study these opportunities in a generic stochastic volatility model and exhibit the strateg…

2010-02-26abs ↗pdf ↗

Neural networks with learned biases can approximate any function.

problem Whether neural networks with only learned biases can approximate any continuous function.
method Theoretical and numerical analysis of random weights and learned biases in neural networks.
result Feedforward and recurrent neural networks with random weights can approximate any continuous function and dynamical systems.

The study examines robust decision-making in volatile financial markets, finding action robustness is more impactful than uncertainty tolerance.

problem Sequential decision making in high-frequency markets under evolving uncertainty.
method Analyzes two dimensions of robustness: uncertainty tolerance and action robustness, using simulations and empirical evidence.
result Action robustness has a larger impact on profitability than uncertainty tolerance, and excessive robustness can reduce profitability in illiquid markets.

Developed a new algorithm to improve dynamic treatment regimens.

problem Non-convergence of Q-learning-based Q-shared algorithm in dynamic treatment regimens.
method Penalized Q-shared algorithm to address convergence issues.
result The penalized Q-shared algorithm converges and outperforms the original in various settings.

Off-policy learning in dynamic decision problems is essential for providing strong evidence that a new policy is better than the one in use. But how can we prove superiority without testing the new policy? To answer this question, we introduce the G-SCOPE algorithm that evaluates a new policy based on data generated by…

2015-02-11abs ↗pdf ↗

The paper studies the continuous-time dynamics of VIX with stochastic volatility and jumps in VIX and volatility. Built on the general parametric affine model with stochastic volatility and jump in logarithm of VIX, we derive a linear relation between the stochastic volatility factor and VVIX index. We detect the exist…

2015-06-24abs ↗pdf ↗

Adaptive AI delegation framework for dynamic decision authority allocation.

problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.

As a mental disorder progresses, it may affect brain structure, but brain function expressed in brain dynamics is affected much earlier. Capturing the moment when brain dynamics express the disorder is crucial for early diagnosis. The traditional approach to this problem via training classifiers either proceeds from ha…

2019-11-16abs ↗pdf ↗

MINIMALIST maximizes mutual information for likelihood estimation from simulated data.

problem Learning model parameters from likelihood functions that cannot be computed.
method Maximizes mutual information between simulated data and model parameters using neural networks.
result Different methods aiming at the same optimal energy form can be directly benchmarked.

We have analyzed the Indices of Industrial Production (Seasonal Adjustment Index) for a long period of 240 months (January 1988 to December 2007) to develop a deeper understanding of the economic shocks. The angular frequencies estimated using the Hilbert transformation, are almost identical for the 16 industrial secto…

2013-05-10abs ↗pdf ↗

We calculate the realized volatility in the spin model of financial markets and examine the returns standardized by the realized volatility. We find that moments of the standardized returns agree with the theoretical values of standard normal variables. This is the first evidence that the return dynamics of the spin fi…

2015-11-29abs ↗pdf ↗

A new method improves uncertainty estimation in deep learning, especially for hard-to-label samples.

problem Improving uncertainty estimation for hard-to-label samples in deep learning.
method Introduces Fisher Information Matrix (FIM) to dynamically reweight objective loss terms.
result Consistently outperforms traditional evidential neural networks in uncertainty estimation tasks.

We propose to incorporate adversarial dropout in generative multi-adversarial networks, by omitting or dropping out, the feedback of each discriminator in the framework with some probability at the end of each batch. Our approach forces the single generator not to constrain its output to satisfy a single discriminator,…

2018-07-30abs ↗pdf ↗