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

21426283 · May 202619922001200920172026
48 results for Slow Modes

Efficiently simulates slow dynamics of high-dimensional stochastic systems.

problem Simulating high-dimensional stochastic systems with slow dynamics and fast modes.
method Designs an algorithm to estimate an invariant manifold and its dynamics, averaging out fast modes.
result Efficient simulator of effective dynamics on low-dimensional invariant manifold.

The paper proposes a method to improve Koopman operator estimation using indicator functions.

problem Difficulty in identifying good observables for Koopman operator expansion.
method Clustering procedure based on Hidden Markov Model (HMM) to infer surrogate observables.
result Inferred indicator functions significantly improve estimation of Koopman operator eigenvalues and transition timescales.

During this last decades, several attempts to construct slow invariant manifold of the Lorenz-Krishnamurthy five-mode model of slow-fast interactions in the atmosphere have been made by various authors. Unfortunately, as in the case of many two-time scales singularly perturbed dynamical systems the various asymptotic p…

2018-08-24abs ↗pdf ↗

Gating units in GRUs and LSTMs create slow modes and control phase-space complexity.

problem Training challenges in RNNs due to exploding or vanishing gradients.
method Random matrix theory and mean-field theory applied to GRUs and LSTMs.
result Gates in GRUs and LSTMs lead to accumulation of slow modes and control phase-space complexity.

Meta-CoTGAN improves adversarial text generation by preventing mode collapse.

problem Mode collapse in adversarial text generation.
method Meta-Cooperative Training Paradigm with a language model.
result Meta-CoTGAN effectively slows down mode collapse and improves generation quality and diversity.

Measures mode separation in high-dimensional densities via a reversible diffusion process.

problem Quantifying how sharply a distribution fragments into barrier-separated clusters in high dimensions.
method A unique reversible diffusion process with f as stationary distribution, extracting SSA and DA from its autocovariance matrix.
result Empirical autocovariance spectrum and readouts (SSA, DA) quantify mode separation using only samples and pretrained score-based models.

This study examines memory effects in S&P500 market correlations using Langevin models.

problem The neglect of memory effects in market correlations for optimal portfolio selection.
method Fit a generalised Langevin equation (GLE) to S&P500 market correlation data.
result Memory effects in market correlations significantly improve forecasting accuracy and suggest a hidden slow time scale.

Canonical transformation plays a fundamental role in simplifying and solving classical Hamiltonian systems. We construct flexible and powerful canonical transformations as generative models using symplectic neural networks. The model transforms physical variables towards a latent representation with an independent harm…

2019-09-30abs ↗pdf ↗

Accelerates optimal transport computation by 10x with spectral insights.

problem Exponential slow-down of convergence in Entropic Optimal Transport as regularization weakens.
method Spectral insights and spectral warm-start strategy to mitigate convergence issues.
result Faster convergence compared to the reference method Sinkhorn algorithm.

Develops an oblique projection technique to approximate a foliation for non-normal dynamics.

problem Modeling dynamics far from a primary Spectral Submanifold (SSM) in non-normal systems.
method Oblique projection technique based on experimental data.
result Approximates a stable invariant foliation for non-normal dynamics efficiently.

We find stationary distributions in a financial model with trends and mean-reversion.

problem Financial markets with competing trends and mean-reversion.
method Analytical derivation of stationary distributions in various noise and feedback regimes.
result The distributions are unimodal Gaussians in small noise, small feedback limits, but can be bimodal for stronger trends.

This article derives prognostic expressions for the evolution of globally aggregated economic wealth, productivity, inflation, technological change, innovation and growth. The approach is to treat civilization as an open, non-equilibrium thermodynamic system that dissipates energy and diffuses matter in order to sustai…

2013-06-15abs ↗pdf ↗

New model reduces sampling cost in diffusion models, making them faster and applicable to real-world applications.

problem Challenges in generating high-quality samples, mode coverage, and fast sampling in deep generative models.
method Proposes denoising diffusion GANs that model each denoising step using a multimodal conditional GAN to reduce sampling cost.
result Demonstrates 2000imes imes faster sampling on CIFAR-10 dataset while maintaining competitive sample quality and diversity.

Improves DPGMM sampler by better initializing subclusters for more effective clustering.

problem Poor initialization of subclusters leads to ineffective sampling and clustering.
method Proposed heuristic and deep learning-based methods to improve subcluster initialization.
result Better splits lead to improved performance, results, and stability.

We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local…

2018-01-12abs ↗pdf ↗

State-free reversible VAMPnets (SRVs) are a neural network-based framework capable of learning the leading eigenfunctions of the transfer operator of a dynamical system from trajectory data. In molecular dynamics simulations, these data-driven collective variables (CVs) capture the slowest modes of the dynamics and are…

2019-06-12abs ↗pdf ↗

This work interprets SFA through variational inference, relaxing linearity constraints.

problem Recover non-linear SFA from variational inference.
method Probabilistic interpretation of SFA through variational inference, relaxing linearity constraints.
result Reinterprets SFA as a variational framework, allowing slowness as a regularizer to reconstruction loss.

Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…

2017-07-17abs ↗pdf ↗

We develop a 2D travel time tomography method which regularizes the inversion by modeling groups of slowness pixels from discrete slowness maps, called patches, as sparse linear combinations of atoms from a dictionary. We propose to use dictionary learning during the inversion to adapt dictionaries to specific slowness…

2017-12-16abs ↗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.

For dynamical systems that can be modelled as asymptotically stable linear systems forced by Gaussian noise, this paper develops methods to infer or estimate their modes from observations in real time. The modes can be real or complex. For a real mode, we wish to infer its damping rate and mode shape. For a complex mod…

2019-09-23abs ↗pdf ↗

Cyclical MCMC tackles high-dimensional multimodal distributions, showing convergence under certain conditions.

problem High-dimensional multimodal posterior distributions in deep learning.
method Cyclical MCMC framework that tracks tempered versions of the target distribution over time.
result Cyclical MCMC converges to the target distribution under fast mixing kernels but fails in slow mixing cases.

Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.

problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.

We provide a rigorous numerical computation method to validate periodic, homoclinic and heteroclinic orbits as the continuation of singular limit orbits for the fast-slow system x=f(x,y,ε),y=εg(x,y,ε)x' = f(x,y,ε), y' = εg(x,y,ε) with one-dimensional slow variable yy. Our validation procedure is based on topological tools called isolatin…

2015-07-06abs ↗pdf ↗

Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.

problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.

Recent work by Brock et al. (2018) suggests that Generative Adversarial Networks (GANs) benefit disproportionately from large mini-batch sizes. Unfortunately, using large batches is slow and expensive on conventional hardware. Thus, it would be nice if we could generate batches that were effectively large though actual…

2019-10-29abs ↗pdf ↗

Derives a biologically plausible neural network for Slow Feature Analysis.

problem Learning latent features from time series data.
method Starting from an SFA objective, derives Bio-SFA with a biologically plausible neural network implementation.
result Validates Bio-SFA on naturalistic stimuli, reproducing interesting properties of brain cells.

A new, efficient kk-modes algorithm improves clustering of categorical data.

problem Clustering categorical data using existing methods like kk-means is inefficient.
method Developed a novel kk-modes algorithm called OTQT, which improves on existing methods.
result OTQT finds more accurate clusters per iteration and is faster overall.

Multimodal clustering is an unsupervised technique for mining interesting patterns in nn-adic binary relations or nn-mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n…

2017-02-27abs ↗pdf ↗