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

137273410546 · Jun 202019922001200920172026
48 results for Stochastic Realization Theory

Asymptotic analysis of short-maturity options on realized variance in local-stochastic volatility models.

problem Analyzing the behavior of short-maturity options on realized variance in local-stochastic volatility models.
method Large deviations theory and variational problems to solve rate functions for different cases.
result Explicit solutions for the rate function in the uncorrelated case and upper/lower bounds and expansions for the correlated case.

This paper compares HMC and RNN expressivity using SRT.

problem Comparing expressivity of HMC and RNN models.
method Embed HMC and RNN in a GUM, use SRT to compare structured covariance series.
result Conditions for realizing covariance series by GUM, HMC, or RNN.

Deep learning approximates SPDE solutions from noise trajectories.

problem Approximating solutions to stochastic partial differential equations (SPDEs).
method Uses neural networks to approximate SPDE solutions based on noise realizations.
result Accurately estimates SPDE solutions and functionals like mean and variance.

BOSH optimizes functions with stochastic evaluations more efficiently and precisely.

problem Optimizing functions with noisy evaluations can lead to suboptimal solutions.
method BOSH uses a hierarchical Gaussian process to generate a growing pool of realizations.
result BOSH provides more efficient and higher-precision optimization than standard BO.

A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations are unknown but revealed across time through i.i.d. realizations. The proposed al…

2019-01-23abs ↗pdf ↗

Develops robust methods for infinite-dimensional stochastic processes.

problem Measuring covariations in stochastic evolution equations in infinite dimensions.
method Asymptotic theory for jump robust measurement of covariations.
result Identifies scaling limits for realized covariations.

The paper solves investment problems with uncertain factors using game theory.

problem Optimal forward investment in an incomplete market with model uncertainty.
method Combining stochastic differential games and ergodic BSDE approach.
result Representation of robust forward performance processes in factor form.

The abstract discusses convergent realizations of Lie subalgebras in control theory.

problem Characterizing Lie subalgebras that can be realized as convergent vector fields.
method Generalizations and reformulations of algebraic properties for output realization.
result Recovery and clarification of previous results on control-affine systems and realization of Chen-Fliess series.

Modeling joint log-volatility dynamics with multivariate fractional Ornstein-Uhlenbeck process.

problem Empirical evidence of joint behavior in realized volatility time series.
method Multivariate fractional Ornstein-Uhlenbeck process with different Hurst exponents and non-trivial interdependencies.
result Model accurately captures asymmetries and spillover effects in realized-volatility time series.

Entropy measure quantifies volatility correlation and risk diversity in asset portfolios.

problem Quantifying volatility correlation and risk diversity in asset portfolios.
method Kullback-Leibler cluster entropy DC[PQ]\mathcal{D_{C}}[P \| Q] for empirical and model probability distributions of realized volatility.
result Portfolio built on diversity indexes derived from Kullback-Leibler entropy measure of realized volatility exhibits better performance.

Enhanced volatility forecasting using options data and rough volatility model.

problem Improving realized volatility forecasting accuracy.
method Infer spot volatility from options data using rough stochastic volatility model, accelerate estimation with deep learning, benchmark against traditional models.
result Augmented HAR-RV-RHeston model outperforms traditional models in daily and long-term forecasting.

Rough volatility models are continuous time stochastic volatility models where the volatility process is driven by a fractional Brownian motion with the Hurst parameter smaller than half, and have attracted much attention since a seminal paper titled "Volatility is rough" was posted on SSRN in 2014 showing that the log…

2019-05-13abs ↗pdf ↗

Study finds roughness in volatility despite diffusive instantaneous volatility.

problem Determining the roughness of volatility in financial assets.
method Non-parametric method based on normalized pp-th variation for estimating roughness of sample paths.
result Realized volatility exhibits rough behavior with a significantly smaller Hurst exponent than instantaneous volatility.

Develops a GMM method to estimate roughness in stochastic volatility models.

problem Estimating roughness in stochastic volatility models with fractional Brownian motion.
method GMM approach for log-normal models with integrated variance and noisy realized variance.
result Consistent and asymptotically normal parameter estimator with bias correction.

New framework tackles stochastic latent subgroup heterogeneity in online decision-making.

problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.

Unified framework for Brownian motion distances on specific geometric manifolds.

problem Understanding Brownian motion distances on radially isoparametric manifolds.
method Developed a geometric framework and derived drift-window inequalities.
result Unified framework for coadapted Brownian couplings on RIM.

We study the stochastic Riemannian gradient algorithm for matrix eigen-decomposition. The state-of-the-art stochastic Riemannian algorithm requires the learning rate to decay to zero and thus suffers from slow convergence and sub-optimal solutions. In this paper, we address this issue by deploying the variance reductio…

2016-05-26abs ↗pdf ↗

Stochastic Gradient Descent introduces noise in training, affecting model decision boundaries.

problem Understanding the impact of noise in SGD on model decision boundaries.
method Characterized SGD and persistent SGD dynamics in a neural network model, measuring noise magnitude in both under- and over-parametrized regimes.
result Noisier algorithms lead to wider decision boundaries in constraint satisfaction problems.

PLoM learns stochastic solutions to PDEs with limited data.

problem Synthesizing solutions to nonlinear PDEs with scarce data.
method Probabilistic Learning on Manifolds constrained by PDEs.
result Learned stochastic solutions minimize PDE residuals.

New framework models neural systems with random architecture on manifolds.

problem Complex, uncertain systems with non-Gaussian outputs.
method Latent random field on compact manifold generates neural architecture and weights.
result Synthetic neural systems can produce stochastic outputs for deterministic inputs.

Introduces a framework using information theory for understanding machine learning.

problem Understanding the effectiveness and design of modern machine learning architectures.
method An information-theoretic approach to learning, focusing on model complexity and architecture.
result Successful architectures have a broad complexity range, enabling learning in over-parameterized model classes.

Efficient RL algorithm for MDPs with linear QπQ^π realizability, achieving optimal regret bound.

problem Efficient reinforcement learning under linear QπQ^π realizability assumption for MDPs with stochastic dynamics.
method Frozen Policy Iteration algorithm that uses high-confidence data and freezes policy for well-explored states.
result Achieves optimal regret bound of O~(d2H6T)\widetilde{O}(\sqrt{d^2H^6T}) for linear (contextual) bandits.

We define generalized currents associated with immersions of abstract solenoids with a transversal measure. We realize geometrically the full real homology of a compact manifold with these generalized currents, and more precisely with immersions of minimal uniquely ergodic solenoids. This makes precise and geometric De…

2007-02-16abs ↗pdf ↗

Paper proposes a new method to stabilize noisy gradient algorithms.

problem Stochastic-gradient Langevin algorithms can introduce bias when taming denominators depend on stochastic-gradient realizations.
method Proposes a structure-preserving framework for designing tamed denominators that avoid unnecessary taming and maintain the stabilizing effect of taming.
result The method avoids stationary bias and explains the stationary error split into bias and remaining error.

This study tightens bounds on how GD and SGD generalize in smooth convex optimization problems.

problem Understanding how GD and SGD generalize in smooth stochastic convex optimization problems.
method Provided tight excess risk lower bounds for GD and SGD under different conditions.
result Lower bounds suggest overfitting occurs and gaps remain in some cases.