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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for Nosé-Hoover dynamics

New method for Bayesian learning on large datasets using replica-exchange Nosé-Hoover dynamics.

problem Bayesian learning on complex posterior distributions with multiple isolated modes and mini-batch noise.
method Simulating replicas in parallel with different temperatures, applying Nosé-Hoover dynamics, and developing a noise-aware exchange protocol.
result Significant improvements over strong baselines in deep Bayesian neural networks on large-scale datasets.

A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability …

2016-03-22abs ↗pdf ↗

The Generalized Beta Prime distribution explains wealth and income distributions.

problem Explaining wealth and income distributions using a stochastic model.
method Using housing sale prices as a proxy, we numerically and analytically explore the properties of the Generalized Beta Prime distribution and its inequality indices.
result The Generalized Beta Prime distribution is a successful model for wealth and income distributions, with Hoover and Theil L being more appropriate for distributions with fat tails.

Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks have a power-law dist…

2015-07-10abs ↗pdf ↗

Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous, 1981;Hoover, 1979} applies and informs us that the graph is necessarily either dens…

2014-01-06abs ↗pdf ↗

Framework for systemic risk modeling using jointly exchangeable arrays.

problem Systemic risk in insurance portfolios with interactions.
method Jointly exchangeable arrays, central limit theorems, simulation-based validation.
result Asymptotic approximations for total portfolio losses in large portfolios over long time horizons.

Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or empty with probability one, whereas many real-world graphs are sparse. We prese…

2016-12-16abs ↗pdf ↗

Modeling implied volatility surface dynamics with Hawkes kernels.

problem Understanding and predicting high-frequency dynamics of the implied volatility surface.
method Hawkes modeling of the volatility surface, with coefficients governing skew and convexity.
result Simple conditions on Hawkes kernel coefficients ensure no-arbitrage and reduce parameter estimation.

We study markets with no riskless (safe) asset. We derive the corresponding Black-Scholes-Merton option pricing equations for markets where there are only risky assets which have the following price dynamics: (i) continuous diffusions; (ii) jump-diffusions; (iii) diffusions with stochastic volatilities, and; (iv) geome…

2016-12-07abs ↗pdf ↗

This paper analyzes the convergence of dynamic HMC and NUTS methods.

problem Theoretical understanding of dynamic HMC and NUTS convergence.
method General class of MCMC algorithms, NUTS as a particular case, geometric ergodicity, irreducibility.
result NUTS is geometrically ergodic under certain conditions and ergodic without bounded stepsize.

Paper develops a robust HVA measure for dynamic hedging under liquidity stress.

problem Valuation of dynamic hedging under liquidity stress.
method Defines robust HVA as worst-case expected loss over a relative-entropy neighborhood of loss distributions for no-trade bands.
result Wider no-trade bands lower rebalancing costs but increase hedge-error risk.

This paper uses entropy to derive stock price dynamics and option valuation.

problem Deriving stock price dynamics and option valuation from information constraints.
method Develops an entropic inference framework to derive stochastic processes from information constraints, representing price changes through two channels: continuous and jump.
result The derived dynamics is the Merton jump diffusion, with Geometric Brownian Motion as the no jump limit.

Given a sub-hyperbolic semi-rational branched covering which is not CLH-equivalent a rational map, it must have the non-empty canonical Thurston obstruction. By using this canonical Thurston obstruction, we decompose this dynamical system in this paper into several sub-dynamical systems. Each of these sub-dynamical sys…

2012-07-05abs ↗pdf ↗

Diffusion models simulate molecular dynamics with adjustable accuracy.

problem Simulating molecular dynamics with high accuracy and efficiency.
method Diffusion models as Euler-Maruyama integrators for Langevin dynamics, learning forces from static snapshots.
result Diffusion models generate molecular trajectories with temporal correlations similar to MD simulations.

Local Neural Operators enable efficient system-level analysis of complex PDEs.

problem System-level analysis of large-scale dynamical systems using neural operators.
method Integrating local Neural Operators with Krylov subspace iterative methods for stability and bifurcation analysis.
result Demonstrated effectiveness of local Neural Operators in fixed-point, stability, and bifurcation analysis of nonlinear PDEs.

Neural operators learn to solve LQ MFGs efficiently in infinite dimensions.

problem Solving many related LQ MFG problems in infinite-dimensional settings.
method Training neural operators to map problem data to equilibrium strategies.
result NOs reliably solve unseen LQ MFG variants with controlled parameters.

This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …

2016-01-18abs ↗pdf ↗

This paper considers the computational power of constant size, dynamic Bayesian networks. Although discrete dynamic Bayesian networks are no more powerful than hidden Markov models, dynamic Bayesian networks with continuous random variables and discrete children of continuous parents are capable of performing Turing-co…

2016-03-19abs ↗pdf ↗

SyMetric evaluates learned Hamiltonian dynamics from images, improving model stability and interpretability.

problem Lack of reliable metrics to assess learned Hamiltonian dynamics from images.
method Developed SyMetric, a binary indicator based on Hamiltonian dynamics properties.
result SyMetric identifies architectural improvements for better dynamics learning.

Geometric framework for dynamic feedback linearization of control systems with symmetry.

problem Dynamic feedback linearization of control systems with symmetry.
method Geometric framework based on Lie symmetry, systematic procedure for all smooth, generic system trajectories.
result Sufficient condition for dynamic feedback linearizability obtained.

Paper uses VAEs to model yield curves without arbitrage violations.

problem Forecasting yield curves across diverse macroeconomic regimes leads to arbitrage violations.
method Proposes a two-stage architecture with CVAEsT+LS and Neural SDEs penalized by No-Arbitrage PDE.
result Significantly reduces forecasting errors and overcomes HJM model limitations.

A simple quantitative example of a reflexive feedback process and the resulting price dynamics after an exogenous price shock to a financial network is presented. Furthermore, an outline of a theory that connects financial reflexivity, which stems from cross-ownership and delayed or incomplete information, and no-arbit…

2013-01-27abs ↗pdf ↗

Develops a robust hedging valuation adjustment measure for dynamic hedging under liquidity-demand stress.

problem Dynamic hedging under liquidity-demand stress
method Define robust HVA as the worst-case expected loss over a relative-entropy neighborhood of the loss distribution generated by simulated rebalancing and maturity-unwind trades.
result Distinguishes fixed-radius convention from fixed benchmark-stress convention and shows wider no-trade bands lower rebalancing costs but raise hedge-error risk.

We extend the "No-dynamic-arbitrage and market impact"-framework of Jim Gatheral [Quantitative Finance, 10(7): 749-759 (2010)] to the multi-dimensional case where trading in one asset has a cross-impact on the price of other assets. From the condition of absence of dynamical arbitrage we derive theoretical limits for t…

2016-12-22abs ↗pdf ↗

Framework augments physical models with deep learning for complex dynamics forecasting.

problem Forecasting complex dynamical phenomena with partial knowledge.
method APHYNITY framework: decomposes dynamics into physical and data-driven components.
result Framework accurately forecasts system evolution and identifies relevant parameters.

This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical finance. We give sufficient conditions for the existence of solutions and the absence of a duality gap. Our proof uses extended dynamic programm…

2011-05-04abs ↗pdf ↗

Efficiently adapting to new environments and changes in dynamics is critical for agents to successfully operate in the real world. Reinforcement learning (RL) based approaches typically rely on external reward feedback for adaptation. However, in many scenarios this reward signal might not be readily available for the …

2019-03-04abs ↗pdf ↗

In this work we introduce Heath-Jarrow-Morton (HJM) interest rate models driven by fractional Brownian motions. By using support arguments we prove that the resulting model is arbitrage free under proportional transaction costs in the same spirit of Guasoni [Math. Finance 16 (2006) 569-582]. In particular, we obtain a …

2008-02-09abs ↗pdf ↗

It is known that the Langevin dynamics used in MCMC is the gradient flow of the KL divergence on the Wasserstein space, which helps convergence analysis and inspires recent particle-based variational inference methods (ParVIs). But no more MCMC dynamics is understood in this way. In this work, by developing novel conce…

2019-02-01abs ↗pdf ↗

Study analyzes bond price covariation robustly under no-arbitrage conditions.

problem Identifying the number of statistically relevant factors in the bond market.
method Nonparametric analysis of realized covariations in a general no-arbitrage setting.
result A high number of factors is needed to describe term structure evolution and term structure of volatility varies over time.

Study designs steering rewards for MFGs with unknown dynamics and model uncertainty.

problem Designing incentives for large populations of agents in MFGs with uncertain model details.
method Developed optimistic exploration algorithms for agents with no-adaptive regret behaviors.
result Sub-linear regret guarantees for cumulative gaps between agent behaviors and desired outcomes.

The majority of real-world networks are dynamic and extremely large (e.g., Internet Traffic, Twitter, Facebook, ...). To understand the structural behavior of nodes in these large dynamic networks, it may be necessary to model the dynamics of behavioral roles representing the main connectivity patterns over time. In th…

2012-05-09abs ↗pdf ↗

Algorithm reconstructs triangle-free networks from data, certifying correctness.

problem Reconstructing triangle-free dynamic networks from observational data.
method Developed an algorithm for triangle-free networks, providing guarantees on correctness.
result Algorithm either certifies correctness or outputs a sparser graph with no false positives.

Study analyzes financial distributions and inequality in professional cycling teams.

problem Financial inequality and concentration among cycling teams.
method Rank-size law and various inequality indices applied to Tour de France data.
result Financial gains distribution is hyperbolic with a decay exponent of about -1, contrary to Pareto principle.

Study dynamic batch learning in high-dimensional sparse linear bandits.

problem Dynamic batch learning in high-dimensional sparse linear contextual bandits under batch constraints.
method Characterized fundamental learning limits via regret lower bound and provided matching upper bound.
result Prescribed an optimal scheme for dynamic batch learning in high-dimensional sparse linear contextual bandits.

New algorithm reduces learning regret in multi-agent systems with unknown dynamics.

problem Challenges in decentralized learning due to unknown dynamics and lack of communication.
method Proposed MARL algorithm for two-agent LQ systems with unknown dynamics and one-directional communication.
result Achieved O(T)O(\sqrt{T}) regret bound for multi-agent LQ systems with certain communication patterns.