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

Trend · papers per month

2595177761,034 · Jun 202019922001200920172026
48 results for finite state spaces

Smooth distributions on subcartesian spaces can be globally finitely generated.

problem Understanding smooth distributions on subcartesian spaces.
method Embedding in Euclidean space, Whitney Embedding Theorem, and distribution theory.
result Smooth generalized distributions and subbundles on connected subcartesian spaces are globally finitely generated.

Kernel-UCBVI algorithm balances exploration and exploitation in metric state-action spaces.

problem Exploration-exploitation dilemma in finite-horizon reinforcement learning with metric state-action spaces.
method Kernel-UCBVI, leveraging smoothness and kernel estimators of rewards and transitions.
result First regret bound for kernel-based RL using smoothing kernels, O(H3K2d/(2d+1))O(H^3 K^{2d/(2d+1)}).

This paper develops a Hoeffding inequality for the partial sums k=1nf(Xk)\sum_{k=1}^n f (X_k), where {Xk}kZ>0\{X_k\}_{k \in \mathbb{Z}_{> 0}} is an irreducible Markov chain on a finite state space SS, and f:S[a,b]f : S \to [a, b] is a real-valued function. Our bound is simple, general, since it only assumes irreducibility and finiteness…

2020-01-05abs ↗pdf ↗

Algorithm estimates human decision-making in high-dimensional states with finite-time guarantees.

problem Estimating optimal policies and measures of fit in dynamic decision models with high-dimensional state spaces.
method Single-loop estimation algorithm with stochastic gradient steps for reward maximization.
result Algorithm converges to a stationary solution with finite-time guarantees and approximates maximum likelihood sublinearly.

The paper explores geometric calculations on probability manifolds derived from master equations.

problem Understanding geometric properties of probability manifolds from master equations.
method Deriving geometric quantities like Levi-Civita connection, gradient, Hessian, parallel transport, and curvatures on probability manifolds.
result Calculation of geometric quantities in probability manifolds, including curvatures and connections.

Method infers causal structure from system behaviors using RKHS and kernel εε-machines.

problem Discovering causal structure in systems with varying external and measurement noise.
method Combines causal states and RKHS for efficient representation and inference of causal structure.
result Robustly estimates causal structure in high-dimensional data with varying noise.

In his 2011 work, Maas has shown that the law of any time-reversible continuous-time Markov chain with finite state space evolves like a gradient flow of the relative entropy with respect to its stationary distribution. In this work we show the converse to the above by showing that if the relative law of a Markov chain…

2014-05-11abs ↗pdf ↗

We study online reinforcement learning for finite-horizon deterministic control systems with {\it arbitrary} state and action spaces. Suppose that the transition dynamics and reward function is unknown, but the state and action space is endowed with a metric that characterizes the proximity between different states and…

2019-05-05abs ↗pdf ↗

New method predicts state evolution for non-first-order algorithms on nonconvex problems.

problem Analyzing nonconvex optimization problems with random data.
method Developed a state evolution for a broader class of algorithms including first-order and saddle point updates.
result Established rigorous state evolution predictions and finite-sample guarantees for non-first-order methods.

This paper generalizes neural transport learning for free energy estimation in arbitrary state spaces.

problem Efficient estimation of free energy in various state spaces.
method Generalized neural transport learning approach for arbitrary state spaces.
result Validation of the proposed method's effectiveness and efficiency in diverse settings.

We introduce the notion of a "state function" for framed tangles in a disk. After choosing a finite set of states for each marked disk, a state function is a projection from the vector space spanned by all tangles to the vector space spanned by the states, that is local, and topologically invariant. Given the states fo…

2018-06-25abs ↗pdf ↗

Study provides convergence guarantees for discrete diffusion models on finite and infinite state spaces.

problem Challenges in understanding discrete diffusion models on combinatorial state spaces.
method Established convergence bounds for three discrete diffusion models using Euler approximations.
result Optimal non-asymptotic convergence guarantees for discrete diffusion models without boundedness assumptions.

Adler had shown in 1979 that the Toda system can be given a coad- joint orbit description. We quantize the Toda system by viewing it as a single orbit of a multiplicative group of lower triangular matrices of determinant one with pos- itive diagonal entries. We get a unitary representation of the group with square inte…

2016-12-09abs ↗pdf ↗

New model for insurance states using Markov jump processes with non-countable state space.

problem Modeling insurance states with non-countable state spaces.
method Developed a new Thiele's differential equation for continuous time rehabilitation rates.
result Allows for consistent calculation of reserves in disability insurance.

Estimates quantum cohomology complexity for Fano varieties and homogeneous spaces.

problem Quantum cohomology complexity estimation for compact symplectic manifolds.
method Estimates the number of states with finite approximate complexity for Fano complete intersections and (co)minuscule homogeneous varieties.
result Sharp upper bound for the dimension of the space spanned by states with finite complexity for Gr(2, n).

The method approximates stationary distributions of Markov models by truncating irrelevant states.

problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.

RANDPOL uses randomized networks for efficient reinforcement learning in continuous state and action MDPs.

problem Efficient reinforcement learning in environments with continuous state and action spaces.
method RANDPOL uses randomized function approximation to represent policy and value functions, providing finite time guarantees and improved numerical performance.
result RANDPOL achieves better numerical performance and provides finite time guarantees compared to deep neural network based algorithms.

We address several problems concerning the geometry of the space of Hermitian operators on a finite-dimensional Hilbert space, in particular the geometry of the space of density states and canonical group actions on it. For quantum composite systems we discuss and give examples of measures of entanglement.

2006-03-20abs ↗pdf ↗

The goal of this note is to prove a compact embedding result for spaces of forward rate curves. As a consequence of this result, we show that any forward rate evolution can be approximated by a sequence of finite dimensional processes in the larger state space.

2019-07-02abs ↗pdf ↗

New method uses Cantor embeddings and Wasserstein distances to analyze predictive states in time series data.

problem Analyzing predictive states in stochastic processes using time series data.
method Wasserstein distances for detecting predictive equivalences in symbolic data, using Cantor embeddings for finite-dimensional representation.
result Exploratory analysis of temporal structure in various processes reveals insights.

Proves homological inequality for cycles in Hadamard spaces of asymptotic rank 2.

problem Establishing isoperimetric inequalities in Hadamard spaces of asymptotic rank two.
method Homological inequality for cycles in dimensions at least 2, assuming finite linearly controlled asymptotic dimension.
result Homological inequality for general cycles in Hadamard 3-manifolds and finite-dimensional CAT(0) cube complexes.

Main theorem of this paper states that Floer cohomology groups in a Hilbert space are isomorphic to the cohomological Conley Index. It is also shown that calculating cohomological Conley Index does not require finite dimensional approximations of the vector field. Further directions are discussed.

2014-01-30abs ↗pdf ↗

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

Study learns state representations from observations for control, proving guarantees.

problem Learning state representations from high-dimensional observations for control.
method Cost-driven approach, learning latent state model to predict costs.
result Proves finite-sample guarantees for near-optimal state representation and controller.

We extend the coherent state transform (CST) of Hall to the context of the moduli spaces of semistable holomorphic vector bundles with fixed determinant over elliptic curves. We show that by applying the CST to appropriate distributions, we obtain the space of level k, rank n and genus one non-abelian theta functions w…

2002-06-25abs ↗pdf ↗

The paper tackles finding optimal treatment sequences in continuous state spaces.

problem Finding counterfactually optimal action sequences in continuous state spaces.
method Formalizes the problem using finite horizon Markov decision processes and structural causal models. Develops a search method based on the A* algorithm.
result The method can find optimal action sequences in polynomial time under certain conditions.

Develops a dynamic mean field theory for reinforcement learning.

problem Finite state and action Bayesian reinforcement learning in large state spaces.
method Analogies with statistical physics, interpreting probabilities as couplings and values as spins, solving mean field equations.
result State-action values are statistically independent in the asymptotic state space limit, with exact or approximate equations for computation.

SRMC framework reduces Monte Carlo variance by history-based sampling in high-dimensional spaces.

problem Efficient sampling in high-dimensional discrete or continuous state spaces.
method Score-Repellent Monte Carlo (SRMC) framework that summarizes history through running average of score evaluations.
result Improves estimator variance and mode coverage with constant memory usage.

Study cost-driven state representation learning for control from partial observations.

problem Learning state representation for control from partial and high-dimensional observations.
method Cost-driven state representation learning via predicting cumulative costs.
result Established finite-sample guarantees for near-optimal representation and controller.

A Budgeted Markov Decision Process (BMDP) is an extension of a Markov Decision Process to critical applications requiring safety constraints. It relies on a notion of risk implemented in the shape of a cost signal constrained to lie below an - adjustable - threshold. So far, BMDPs could only be solved in the case of fi…

2019-03-03abs ↗pdf ↗

Reinforcement learning (RL) in Markov decision processes (MDPs) with large state spaces is a challenging problem. The performance of standard RL algorithms degrades drastically with the dimensionality of state space. However, in practice, these large MDPs typically incorporate a latent or hidden low-dimensional structu…

2016-11-11abs ↗pdf ↗

We consider the problem of estimating from sample paths the absolute spectral gap γγ_* of a reversible, irreducible and aperiodic Markov chain (Xt)tN(X_t)_{t \in \mathbb{N}} over a finite state space ΩΩ. We propose the UCPI{\tt UCPI} (Upper Confidence Power Iteration) algorithm for this problem, a low-complexity algorithm …

2018-06-15abs ↗pdf ↗

We consider nonparametric estimation of the state price density encapsulated in option prices. Unlike usual density estimation problems, we only observe option prices and their corresponding strike prices rather than samples from the state price density. We propose to model the state price density directly with a nonpa…

2009-10-08abs ↗pdf ↗

We consider finite groups which admit a faithful, smooth action on an acyclic manifold of dimension three, four or five (e.g. euclidean space). Our first main result states that a finite group acting on an acyclic 3- or 4-manifold is isomorphic to a subgroup of the orthogonal group O(3) or O(4), respectively. The analo…

2008-08-07abs ↗pdf ↗

Predictive State Representations (PSRs) are an expressive class of models for controlled stochastic processes. PSRs represent state as a set of predictions of future observable events. Because PSRs are defined entirely in terms of observable data, statistically consistent estimates of PSR parameters can be learned effi…

2013-09-26abs ↗pdf ↗