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

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for stochastic representation

This work tackles representation learning by introducing stochastic competition-based activations.

problem Learning diversified representations in deep learning models.
method Combining information-theoretic arguments with stochastic competition-based activations, using Stochastic Local Winner-Takes-All (LWTA) units.
result The proposed method yields significant discriminative representation learning abilities and allows for a principled investigation of intermediate network representations.

Study multi-task learning with low-rank representation in stochastic linear bandits.

problem Transfer learning across multiple linear bandit tasks with shared low-dimensional representation.
method Proposes a greedy policy with trace norm regularization to implicitly learn a low-rank representation without knowing the rank.
result Upper bound on multi-task regret of NdT(T+d)r\sqrt{NdT(T+d)r}, showing benefit over independent task solving.

Paper analyzes error in stochastic approximation for discontinuous functions.

problem Estimating expected error in discontinuous stochastic approximation.
method Uses finite differences and O(n1/5)O(n^{-1/5}) error estimate for discontinuous functions.
result Achieves error estimate of O(n1/5)O(n^{-1/5}) for discontinuous stochastic representation.

ST-MAML tackles task ambiguity in meta-learning by encoding tasks with stochastic representations.

problem Handling tasks from multiple distributions is challenging for meta-learning due to task ambiguity.
method ST-MAML uses a stochastic neural network module to encode tasks and propagate task representations to revise input variable encoding.
result ST-MAML matches or outperforms state-of-the-art methods on various tasks.

We present a deep recurrent neural network architecture to solve a class of stochastic optimal control problems described by fully nonlinear Hamilton Jacobi Bellmanpartial differential equations. Such PDEs arise when one considers stochastic dynamics characterized by uncertainties that are additive and control multipli…

2019-06-11abs ↗pdf ↗

Study forward investment performance in semimartingale markets with stochastic factors.

problem Investigate forward investment performance in incomplete semimartingale markets with power risk preferences and stochastic integrated factors.
method Develop necessary and sufficient conditions for FIPP existence, use integral representations, and solve ill-posed HJB equations.
result Explicit constructions for time-monotone FIPPs in semimartingale models, generalizing from Brownian to semimartingale markets.

The article provides representations of exchange option prices under SVJD dynamics.

problem Modeling and pricing exchange options under stochastic volatility and jumps.
method Develops representations for European and American exchange options using SVJD dynamics and equivalent martingale measures.
result Derives integro-partial differential equations and representations for exchange option prices.

Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.

problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.

A semi-supervised framework using stochastic interpolation and latent representations.

problem Challenges in conditional generative modeling with scarce labeled data.
method Combines conditional stochastic interpolation with low-dimensional latent representations.
result Significantly improves sample complexity and achieves faster convergence rate.

Contrastive learning harms minority group representations, affecting downstream tasks.

problem Representation harm in contrastive learning, especially affecting minority groups.
method Causal mediation analysis and stochastic block model explanation.
result Representation harm in contrastive learning is partly responsible for allocation harm in downstream tasks.

We extend Stochastic Gradient Variational Bayes to perform posterior inference for the weights of Stick-Breaking processes. This development allows us to define a Stick-Breaking Variational Autoencoder (SB-VAE), a Bayesian nonparametric version of the variational autoencoder that has a latent representation with stocha…

2016-05-20abs ↗pdf ↗

Study on how optimal representations emerge during deep learning training, focusing on the role of implicit regularization.

problem Understanding how optimal representations for tasks are learned during training.
method Investigates the role of implicit regularization in learning minimal sufficient representations, analyzing changes in representation content during training.
result Semantically meaningful but ultimately irrelevant information is encoded in early transient dynamics of training, which is later discarded.

This paper studies a class of non-Markovian singular stochastic control problems, for which we provide a novel probabilistic representation. The solution of such control problem is proved to identify with the solution of a ZZ-constrained BSDE, with dynamics associated to a non singular underlying forward process. Du…

2017-01-30abs ↗pdf ↗

π-GNN learns soft permutations for graph representations, improving graph classification and regression.

problem Limitations of MPNNs in graph neural networks.
method Proposes π-GNN, which learns a soft permutation matrix for each graph, projecting graphs into a common vector space.
result π-GNN achieves performance competitive with state-of-the-art models on graph classification and regression tasks.

The paper develops a deep signature approach for option pricing under non-Markovian stochastic volatility models.

problem Pricing options under non-Markovian stochastic volatility models is challenging due to the dependence on historical paths.
method Reformulate the asset dynamics as a rough stochastic differential equation and represent rough paths via signatures. Apply standard analytical tools to solve the transformed equation.
result The deep signature approach provides a theoretically grounded and computationally efficient framework for option pricing.

Paper applies theorem to find optimal investment boundary in stochastic capacity expansion.

problem Finding optimal investment boundary in a stochastic, time-inhomogeneous capacity expansion problem.
method Applies Bank and El Karoui Representation Theorem to solve first order conditions involving a non-integral term.
result Existence of base capacity ly(t)l^{\star}_y(t), showing optimal investment process becomes active at this level.

Enhances deep kernel learning with stochastic latent variables for better model regularization.

problem Weak model regularization in deep kernel learning, especially on small datasets.
method Introduces DLVKL model with stochastic latent variables, NSDE for expressive posterior, and hybrid prior.
result DLVKL-NSDE outperforms existing deep GPs on large datasets.

The paper explains emergent phenomena in deep learning using entropic forces.

problem Understanding the cause of emergent phenomena in deep learning and large language models.
method Proposes a rigorous entropic-force theory for neural networks trained with SGD and variants.
result Shows that representation learning is governed by emergent entropic forces that break continuous symmetries and preserve discrete ones.

Study max- and min-stability under first-order stochastic dominance, finding new functional characterizations.

problem Understanding max- and min-stability in stochastic dominance.
method Representation theorem for functionals satisfying max-stability, combining max- and min-stability to define Lambda-quantiles.
result New characterizations of functionals, including Lambda-quantiles, in finance and political science.

Unified kernel framework extends to stochastic systems, improving numerical stability.

problem Extending kernel methods to stochastic dynamical systems with diffusion.
method Unified kernel framework, Feynman-Kac path-integral representations, collocation-based computational framework.
result Kernel equivalence under uniform ellipticity assumptions and improved numerical stability with moderate diffusion.

Contrastive learning struggles with class collapse and feature suppression, revealing bias towards simpler solutions.

problem Contrastive learning struggles with class collapse and feature suppression, especially in supervised and unsupervised settings.
method Unified theoretical framework to determine which features are learnt by CL, revealing bias towards simpler solutions.
result Bias towards simpler solutions is a key factor in class collapse and feature suppression.

We develop a stochastic target representation for Ricci flow and normalized Ricci flow on smooth, compact surfaces, analogous to Soner and Touzi's representation of mean curvature flow. We prove a verification/uniqueness theorem, and then consider geometric consequences of this stochastic representation. Based on this …

2012-09-19abs ↗pdf ↗

New algorithm improves learning efficiency in multi-task contextual bandits.

problem Improving learning efficiency in multi-task contextual bandits.
method Alternating projected gradient descent (GD) and minimization estimator for low-rank feature matrix recovery.
result Proved regret bound for multi-task learning algorithm.

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

2017-11-03abs ↗pdf ↗

Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…

2014-12-18abs ↗pdf ↗

The paper provides an efficient method to price path-dependent derivatives using multiscale stochastic volatility models.

problem Pricing path-dependent derivatives under multiscale stochastic volatility models.
method Derives a Malliavin representation for the first-order approximation of the price of path-dependent derivatives.
result An efficient Monte Carlo approximation for pricing path-dependent derivatives is derived.

Revisits stochastic collocation with exponential splines for option pricing.

problem Improving the accuracy of option price interpolation using stochastic collocation.
method Uses exponential quadratic splines and optimizes abscissae or parameters of B-splines.
result Shows that fixing abscissae and optimizing parameters leads to better interpolation accuracy.

Developed a diffusion model on spherical data, addressing geometric and stochastic challenges.

problem Diffusion models on spherical data face unique geometric and stochastic issues.
method Extended spectral diffusion to spherical harmonics, introducing modified stochastic differential equations.
result Introduced a geometry-dependent inductive bias in spectral diffusion models.

Researchers develop explicit approximations for European put options in stochastic volatility models.

problem Developing accurate approximations for European put option prices in stochastic volatility models.
method Exploits expansions of the mixing representation of the put option price using Malliavin calculus.
result Explicit formulas for option prices and error bounds are derived, with closed-form solutions under piecewise-constant parameters.

This paper addresses law invariant coherent risk measures and their Kusuoka representations. By elaborating the existence of a minimal representation we show that every Kusuoka representation can be reduced to its minimal representation. Uniqueness -- in a sense specified in the paper -- of the risk measure's Kusuoka r…

2012-10-26abs ↗pdf ↗

Optimizes portfolios with constraints and stochastic factors, deriving explicit solutions.

problem Optimizing expected utility in an incomplete market with stochastic factors and convex constraints.
method Fundamental duality results and HJB PDE, derived condition for exponential affine solutions.
result Explicit expressions for optimal allocations and Riccati ODE solutions in specific markets.

SSDMs generate quantum states directly, outperforming classical methods.

problem Generating pure-state quantum representations efficiently.
method Score-based generative model on complex projective manifold.
result SSDMs match target pure-state ensembles by orders of magnitude.

New method finds balanced clusters in graphs using auxiliary information.

problem Finding balanced clusters in graphs with population-level constraints.
method Proposes individual-level balancing constraint and develops spectral clustering algorithms.
result Establishes first statistical consistency result for constrained spectral clustering.

In this paper we investigate general linear stochastic volatility models with correlated Brownian noises. In such models the asset price satisfies a linear SDE with coefficient of linearity being the volatility process. This class contains among others Black-Scholes model, a log-normal stochastic volatility model and H…

2009-09-25abs ↗pdf ↗

High-dimensional representations often have a lower dimensional underlying structure. This is particularly the case in many decision making settings. For example, when the representation of actions is generated from a deep neural network, it is reasonable to expect a low-rank structure whereas conventional structures l…

2019-01-28abs ↗pdf ↗

Proof confirms perfect representation in deep learning models.

problem Tackles the perfect Platonic Representation Hypothesis in deep learning models.
method Detailed proof using stochastic gradient descent (SGD) and analysis of global minima.
result SGD trains EDLNs to learn the same representation up to rotation, suggesting emergent entropic forces.

GENESIS-V2 infers unordered object representations without iterative refinement.

problem Unsupervised learning of unordered object representations for complex images.
method Stochastic stick-breaking process for clustering pixel embeddings.
result GENESIS-V2 outperforms recent baselines in unsupervised image segmentation and scene generation.