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.
Recent works have derived non-asymptotic upper bounds for convergence of underdamped Langevin MCMC. We revisit these bound and consider introducing scaling terms in the underlying underdamped Langevin equation. In particular, we provide conditions under which an appropriate scaling allows to improve the error bounds in…
We study the underdamped Langevin diffusion when the log of the target distribution is smooth and strongly concave. We present a MCMC algorithm based on its discretization and show that it achieves ε error (in 2-Wasserstein distance) in O(d/ε) steps. This is a significant improv…
We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback-Leibler (KL) divergence as the objective functional. We show that an underdamped form of the Langevin algorithm performs accelerated gradient descent in this metric. To characterize t…
Log-periodic oscillations have been used to predict price trends and crashes on financial markets. So far two types of log-periodic oscillations have been associated with the real markets. The first type are oscillations which accompany a rising market and which ends in a crash. The second type oscillations, called "an…
Discretizations of Langevin diffusions provide a powerful method for sampling and Bayesian inference. However, such discretizations require evaluation of the gradient of the potential function. In several real-world scenarios, obtaining gradient evaluations might either be computationally expensive, or simply impossibl…
The present paper introduces a majority orienting model in which the dealers' behavior changes based on the influence of the price to show the oscillation of stock price in the stock market. We show the oscillation of the price for the model by applying the van der Pol equation which is a deterministic approximation of…
The study derives generalization bounds for neural oscillators, improving their performance with regularization.
problem Quantifying the generalization capacities of neural oscillators.
method Using Rademacher complexity and squared Wasserstein-1 distances, the study derives theoretical upper PAC generalization bounds for neural oscillators.
result Theoretical bounds show polynomial growth in estimation errors with MLP size and time length, and regularization improves performance.
We study the problem of sampling from a distribution p∗(x)∝exp(−U(x)), where the function U is L-smooth everywhere and m-strongly convex outside a ball of radius R, but potentially nonconvex inside this ball. We study both overdamped and underdamped Langevin MCMC and establish upper bound…
Using geometric quantization procedure, the quantization of algebra of observables for physical system with Ricci-flat phase space is obtained. In the classical case the appointed physical system is reduced to harmonic oscillator when the one real parameter is vanished.
Oscillations lie at the core of many biological processes, from the cell cycle, to circadian oscillations and developmental processes. Time-keeping mechanisms are essential to enable organisms to adapt to varying conditions in environmental cycles, from day/night to seasonal. Transcriptional regulatory networks are one…
In a complex system, the interactions between individual agents often lead to emergent collective behavior like spontaneous synchronization, swarming, and pattern formation. The topology of the network of interactions can have a dramatic influence over those dynamics. In many studies, researchers start with a specific …
The paper analyzes convergence of Langevin dynamics with time-dependent metrics.
problem Analyzing convergence of Langevin dynamics with time-dependent metrics.
method Formulated a modified gradient flow of the Kullback-Leibler divergence, selected a time-dependent relative Fisher information functional, and developed a time-dependent Hessian matrix condition.
result Proved convergence conditions for various Langevin dynamics.
Networks of coupled dynamical systems provide a powerful way to model systems with enormously complex dynamics, such as the human brain. Control of synchronization in such networked systems has far reaching applications in many domains, including engineering and medicine. In this paper, we formulate the synchronization…