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

12.5%25.0%37.5%50.0% · May 199319922001200920182026
48 results for Stochastic components

Neural network based generative models with discriminative components are a powerful approach for semi-supervised learning. However, these techniques a) cannot account for model uncertainty in the estimation of the model's discriminative component and b) lack flexibility to capture complex stochastic patterns in the la…

2017-06-29abs ↗pdf ↗

Asset prices contain information about the probability distribution of future states and the stochastic discounting of those states as used by investors. To better understand the challenge in distinguishing investors' beliefs from risk-adjusted discounting, we use Perron-Frobenius Theory to isolate a positive martingal…

2014-11-28abs ↗pdf ↗

New algorithm improves source separation with multi-trial supervision.

problem Non-convex optimization and interpretability of independent components.
method Proximal gradient-type algorithm in invertible matrices with backpropagation for joint learning.
result Increased success rate of non-convex optimization and improved interpretability.

Deep ensembles effectively capture epistemic uncertainty through training stochasticity, providing a frequentist perspective.

problem Understanding and quantifying epistemic uncertainty in machine learning models.
method Bootstrap-based estimator and decomposition of deep ensembles into data variability and training stochasticity.
result Deep ensembles primarily capture training stochasticity, explaining their effectiveness in quantifying epistemic uncertainty.

Study the averaging principle for non-autonomous slow-fast systems and apply it to financial local stochastic volatility models.

problem Understanding the behavior of non-autonomous slow-fast systems of stochastic differential equations.
method Prove the averaging principle under specific conditions and apply it to a financial model.
result Prices of derivatives converge to those calculated using the limit model under a risk-neutral measure.

This paper explores the non-convex composition optimization in the form including inner and outer finite-sum functions with a large number of component functions. This problem arises in some important applications such as nonlinear embedding and reinforcement learning. Although existing approaches such as stochastic gr…

2017-11-13abs ↗pdf ↗

Study variance-optimal hedging of forward curve derivatives under stochastic volatility.

problem Variance-optimal hedging of forward curve derivatives with stochastic volatility.
method Assumes HJM-Musiela dynamics modulated by stochastic covariance, uses Galtchouk-Kunita-Watanabe projection.
result Density of finite-maturity strategies, convergence of finite-rank projections, decomposition of hedging error.

SAMoSSA combines mSSA and AR for accurate time series analysis.

problem Accurately estimating both deterministic and stationary components in time series data.
method Two-stage algorithm: first mSSA for non-stationary components, then AR for stationary residual.
result SAMoSSA provides forecasting consistency and outperforms existing methods.

A new method interpolates between sampling and variational inference using stochastic mixtures.

problem Combining the strengths of sampling and variational inference methods.
method Develops a framework using stochastic mixtures of simple component distributions to interpolate between sampling and variational inference.
result Improves on both sampling and variational inference methods by reducing bias and variance.

Study shows conditions for local martingales in SDEs with stochastic volatility.

problem Conditions for local martingales in stochastic differential equations with stochastic volatility.
method Examine sufficient conditions for components of SDEs to be strict local martingales or martingales.
result Components of SDEs can be strict local martingales or martingales under certain conditions.

We consider in this paper a class of composite optimization problems whose objective function is given by the summation of a general smooth and nonsmooth component, together with a relatively simple nonsmooth term. We present a new class of first-order methods, namely the gradient sliding algorithms, which can skip the…

2014-06-04abs ↗pdf ↗

A new method clusters data from multiple sources using a mixture of multilayer SBMs.

problem Aggregating multiple clustering results from different data sources.
method Uses a mixture of multilayer Stochastic Block Models (SBM) to group co-membership matrices.
result Identifies and clusters observations based on their specificities within components.

New algorithm improves convergence rates for convex optimization problems.

problem Convex optimization problems with noisy stochastic data.
method Stochastic proximal point algorithm with weak linear regularity condition.
result Achieves $\mathcal{O}\left(\frac{1}{k} ight)$ convergence rate for SPP.

Dynamical systems are widely used in science and engineering to model systems consisting of several interacting components. Often, they can be given a causal interpretation in the sense that they not only model the evolution of the states of the system's components over time, but also describe how their evolution is af…

2018-03-23abs ↗pdf ↗

Decentralized learning reduces regret by sharing model updates, especially with stochastic components.

problem Achieve better online problem solving without sharing private data.
method Characterize loss functions as adversarial and stochastic components, analyze DOG algorithm's regret bound.
result Decentralized online gradient (DOG) achieves a new regret bound with communication, benefiting from private data randomness.

NSGLD improves SGLD for non-convex optimization problems.

problem Optimizing non-convex objectives efficiently.
method Introducing non-reversible SGLD by adding an anti-symmetric matrix to the drift term of the Langevin diffusion.
result NSGLD converges faster to the same stationary distribution with non-asymptotic guarantees.

Explains gradient descent methods and their convergence, focusing on simple analysis.

problem Understanding and analyzing gradient descent methods and their variants.
method Elementary mathematical analysis focusing on structures and assumptions of objective functions.
result Unified convergence analysis of various gradient descent methods and variants.

New methods reduce constraint violations to certainty in stochastic optimization.

problem Finding a point with certain constraint satisfaction and near-stationarity.
method Single-loop variance-reduced stochastic first-order methods with truncated momentum schemes.
result Achieves strong convergence guarantees for εε-stochastic stationary points with certain constraint satisfaction.

This technical report proves components consistency for the Doubly Stochastic Dirichlet Process with exponential convergence of posterior probability. We also present the fundamental properties for DSDP as well as inference algorithms. Simulation toy experiment and real-world experiment results for single and multi-clu…

2016-05-24abs ↗pdf ↗

Study uses VIX for zero-coupon Treasury rates, proving long-term stability and returns.

problem Modeling zero-coupon Treasury rates with VIX for volatility.
method Multivariate autoregressive stochastic volatility model, proving stability and Law of Large Numbers.
result VIX accurately models zero-coupon Treasury rates and returns.

A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov process. The first two components are related to the stock and volatility processe…

2012-05-16abs ↗pdf ↗

Method learns dynamics of slow variables from stochastic data.

problem Modeling unknown multiscale stochastic systems with limited data.
method Data-driven approach to learn effective dynamics from bursts of observation data.
result Generative model accurately captures effective dynamics of slow variables.

Study on Kyle-Back model with risk aversion and non-Gaussian beliefs.

problem Existence of equilibrium in Kyle's insider trading model.
method Forward-backward system coupled via optimal transport constraint, stochastic representation, well-posedness of solutions.
result Existence and properties of equilibrium for small risk aversion parameter.

The paper identifies key macroeconomic events affecting exchange rate volatility.

problem Understanding which macroeconomic events impact exchange rate volatility.
method Data-driven approach to select relevant macroeconomic events using sparsity-based methods.
result The identified macroeconomic events significantly impact exchange rate volatility.

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.

New method for asynchronous stochastic approximation converges in reinforcement learning.

problem Finding solutions to equations with noisy measurements in reinforcement learning.
method Batch Asynchronous Stochastic Approximation (BASA) with conditions for convergence and rate of convergence.
result Sufficient conditions for convergence and rate of convergence of BASA.

New method for separating mixed signals with nonlinear functions.

problem Recovering source signals from nonlinear mixtures.
method Optimisation-based function approximation to minimize mutual statistical dependence.
result The method can recover source signals from nonlinear mixtures under certain conditions.