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

249498747996 · Jun 202019922001200920172026
48 results for dynamic settings

GDM models time series with smoother transitions and interpretable states.

problem Capturing smooth, variable-speed transitions and stochastic mixtures of states.
method Introduces a continuous relaxation of discrete states and a Gumbel noise model.
result Models real-world datasets more faithfully with smoother dynamics and interpretable states.

In this paper, we prove a limit set intersection theorem in relatively hyperbolic groups. Our approach is based on a study of dynamical quasiconvexity of relatively quasiconvex subgroups. Using dynamical quasiconvexity, many well-known results on limit sets of geometrically finite Kleinian groups are derived in general…

2010-09-08abs ↗pdf ↗

Proposes a method to learn stable invariant sets in dynamical systems.

problem Learning stable invariant sets in general dynamical systems.
method Generalizes Manek and Kolter's approach by introducing projection onto latent space shapes and using invertible neural networks.
result Validates the method and shows its usefulness for long-term prediction.

Study best-response learning dynamics in zero-sum polymatrix games under full and minimal information settings.

problem Learning dynamics in zero-sum polymatrix games under different information settings.
method Two-timescale learning dynamics combining smoothed best-response updates and TD-learning for estimating local payoff functions.
result Polynomial-time finite-sample guarantees for convergence to an ε-Nash equilibrium in the minimal information case.

This paper gives an overview of the theory of dynamic convex risk measures for random variables in discrete time setting. We summarize robust representation results of conditional convex risk measures, and we characterize various time consistency properties of dynamic risk measures in terms of acceptance sets, penalty …

2010-02-19abs ↗pdf ↗

We investigate the random dynamics of polynomial maps on the Riemann sphere and the dynamics of semigroups of polynomial maps on the Riemann sphere. In particular, the dynamics of a semigroup GG of polynomials whose planar postcritical set is bounded and the associated random dynamics are studied. In general, the Juli…

2011-04-19abs ↗pdf ↗

This paper demonstrates dynamic hyper-parameter setting, for deep neural network training, using Mutual Information (MI). The specific hyper-parameter studied in this paper is the learning rate. MI between the output layer and true outcomes is used to dynamically set the learning rate of the network through the trainin…

2018-05-18abs ↗pdf ↗

Extends super-replication theorem with dynamic strategies and transaction costs.

problem Dynamic super-replication under proportional transaction costs.
method Generalizes admissible strategies and defines a well-defined super-replication price process.
result Well-defined super-replication price process in dynamic setting.

Study homeomorphisms on fine curve graph of surfaces, revealing new types of dynamics.

problem Understanding dynamics of homeomorphisms on fine curve graphs of surfaces.
method Analyzing the action of homeomorphisms on the fine curve graph and relating to classical curve graphs.
result Homeomorphisms induce parabolic isometries, and all positive reals are realized as asymptotic translation lengths.

Guaranteed reachable set for unknown nonlinear systems on manifolds.

problem Determining reachable set for unknown nonlinear systems on manifolds.
method Underapproximations of reachable set using local dynamics and bounds on dynamics rate of change.
result Guaranteed set of reachable states for systems on complete Riemannian manifolds.

New algorithm reduces dynamic regret in time-varying movement costs.

problem Dynamic regret in online convex optimization with time-varying movement costs.
method Introduced a novel algorithm for time-varying movement costs, achieving comparator-adaptive dynamic regret bound.
result Established first comparator-adaptive dynamic regret bound of O~((M2+MPT)(T+tλt))\widetilde{\mathcal{O}}(\sqrt{(M^2+MP_T)(T+\sum_t λ_t)}).

The paper studies random dynamical systems of polynomial automorphisms on C^2 and finds mean stability.

problem Random dynamical systems of polynomial automorphisms on C^2.
method Generic random dynamical systems of polynomial automorphisms are shown to have mean stability.
result A generic random dynamical system of polynomial automorphisms on C^2 has mean stability.

Study on learning to predict dynamical systems without assuming their structure.

problem Learning to predict the next state of a dynamical system with unknown evolution function.
method Defined new combinatorial measures to quantify mistake and regret bounds in realizable and agnostic settings.
result In the realizable setting, the number of mistakes can grow arbitrarily with time.

Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.

problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.

Study dynamics of automorphisms on cubic surfaces and their connection to Painlevé 6.

problem Dynamics of holomorphic automorphisms on cubic surfaces and their relation to Painlevé 6.
method Defined Julia and Fatou sets, studied locally discrete and non-discrete dynamics, and proved existence of non-empty Fatou and Julia sets.
result Existence of non-empty Fatou and Julia sets for the group action.

Paper tackles reinforcement learning with complex observations and simple latent dynamics.

problem Understanding reinforcement learning with complex observations and simple latent dynamics.
method Statistical and algorithmic analysis of reinforcement learning under general latent dynamics.
result Identifies latent pushforward coverability as a condition for statistical tractability.

Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switching linear dynamical system (SLDS) and the switching vector autoregressive (VAR) process. Our Bayesian nonparametric approach utilizes a hiera…

2010-03-19abs ↗pdf ↗

New algorithm reduces sample complexity for online reinforcement learning.

problem Reducing sample complexity for online reinforcement learning in nonlinear systems.
method Generalized algorithm for various dynamical systems, including neural networks.
result Achieves policy regret of O(Nε^2 + d_u ln(m(ε))/ε^2) in general settings.

Study risk-controlling prediction sets for single trajectory data from dynamical systems.

problem Performance guarantees for risk-controlling prediction sets in single trajectory data from unknown stochastic dynamical systems.
method Used blocking and decoupling techniques to analyze performance guarantees under different data generating processes.
result Performance guarantees similar to iid setting when data is stationary and contractive, with graceful degradation otherwise.

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.

Characterizes convex cocompact actions in projective space with dynamical properties.

problem Understanding convex cocompact group actions in projective space.
method Dynamical characterization and expansion property analysis.
result Equivalence of convex cocompactness to an expansion property in different Grassmannians.

Different approaches to defining dynamic market risk measures are available in the literature. Most are focused or derived from probability theory, economic behavior or dynamic programming. Here, we propose an approach to define and implement dynamic market risk measures based on recursion and state economy representat…

2013-06-24abs ↗pdf ↗

This paper introduces a linear state-space model with time-varying dynamics. The time dependency is obtained by forming the state dynamics matrix as a time-varying linear combination of a set of matrices. The time dependency of the weights in the linear combination is modelled by another linear Gaussian dynamical model…

2014-10-02abs ↗pdf ↗

Study connects bank default models using dynamic contagion.

problem Understanding default contagion in heterogeneous interbank systems.
method Proposes a dynamic default contagion model with endogenous early defaults for a finite set of banks, reformulating as a stochastic particle system.
result Existence of clearing systems and continuity of the system response for the mean-field problem.

Algorithm learns optimal dynamic mechanisms from data.

problem Designing optimal mechanisms for dynamic settings with unknown reward functions.
method Offline reinforcement learning with pessimism principle.
result Learned mechanisms are efficient, individually rational, and truthful.

In this paper, we study online convex optimization in dynamic environments, and aim to bound the dynamic regret with respect to any sequence of comparators. Existing work have shown that online gradient descent enjoys an O(T(1+PT))O(\sqrt{T}(1+P_T)) dynamic regret, where TT is the number of iterations and PTP_T is the path-le…

2018-10-25abs ↗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.

Set-Sequence model learns cross-sectional dynamics directly from time series data.

problem Predicting large cross-sections of time series data with latent cross-sectional dynamics.
method A model that learns cross-sectional structure directly, enhancing expressivity and eliminating manual feature engineering.
result Significantly outperforms strong baselines in equity portfolio optimization and loan risk prediction.

The paper analyzes the mean field Langevin dynamics and its convergence rate.

problem The convergence property of the mean field Langevin dynamics in the context of neural networks.
method The analysis uses a proximal Gibbs distribution and techniques from convex optimization.
result A concise convergence rate analysis of the mean field Langevin dynamics in both continuous and discrete time settings.