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

Trend · papers per month

3507001,0501,400 · Jun 202019922001200920172026
48 results for Dynamical functional approach

Study analyzes Bayesian inference algorithms using dynamical functional approach.

problem Analysis of approximate inference algorithms for large Gaussian latent variable models.
method Dynamical functional approach to model nontrivial dependencies and obtain exact effective stochastic process.
result Closed-form expressions for the rate of convergence are derived and validated.

SINDy-PI robustly identifies implicit dynamics from noisy data.

problem Accurately modeling nonlinear dynamics from noisy data.
method Parallel, implicit SINDy algorithm with multiple optimization algorithms and model selection.
result Significantly more noise robust than previous SINDy approaches.

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.

Dynamic functional time-series methods improve forecast accuracy for foreign exchange implied volatility surfaces.

problem Forecasting implied volatility surfaces in foreign exchange markets.
method Dynamic functional principal component analysis and multivariate functional time-series methods.
result Dynamic univariate functional time-series method shows the greatest improvement in forecast accuracy.

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.

New model tackles complex spatio-temporal causal inference with dynamic confounders and functional data.

problem Complex spatio-temporal dynamics and unmeasured confounders hinder causal inference.
method PFD-BDCM, a unified generative framework for spatio-temporal dependencies, functional data, and dynamic confounding.
result PFD-BDCM outperforms existing methods across observational, interventional, and counterfactual queries.

In this paper, we analyze dynamic programming as a novel approach to solve the problem of maximizing the profits of a bank. The mathematical model of the problem and the description of a bank's work is described in this paper. The problem is then approached using the method of dynamic programming. Dynamic programming m…

2015-11-03abs ↗pdf ↗

A new method reduces complexity in estimating dynamic choice models.

problem Estimating structural parameters in dynamic discrete choice models using behavioral data.
method Two-stage approach: inverse reinforcement learning for Q-function estimation, state selection via clustering, and maximum likelihood estimation with nested fixed-point algorithm.
result The method mitigates the curse of dimensionality and provides finite-sample bounds on estimation error.

The paper addresses uncertainty in demand prediction for dynamic pricing.

problem Uncertainty quantification in the demand function for dynamic pricing.
method Developed a debiased approach to construct accurate confidence intervals for the demand function.
result Asymptotic normality guarantee of the debiased estimator for the demand function.

Framework optimizes battery storage for markets by separating long-term degradation from short-term market dynamics.

problem Intractable computation due to timescale mismatch between battery degradation and market dynamics.
method Approximate dynamic programming with value function approximation and pseudo-time encoding.
result Policy outperforms benchmarks in real-time market scenarios.

New method for estimating treatment effects without complex propensity models.

problem Estimating treatment effects in dynamic treatment regimes.
method Recursive Riesz representer estimation for de-biasing corrections.
result Directly estimates de-biasing corrections without auxiliary models.

SDIFT generates full-field dynamics from sparse, irregular data.

problem Modeling and reconstructing physical dynamics from sparse, off-grid observations.
method SDIFT uses a functional Tucker model and sequential diffusion for generating full-field evolution from irregular sparse observations.
result Significant improvements in reconstruction accuracy and computational efficiency compared to state-of-the-art approaches.

The paper addresses GP dynamics by improving simulation and prediction accuracy.

problem GP dynamics often underestimate prediction uncertainty, leading to safety issues.
method The paper introduces sampling-based and linearization-based techniques to account for the correlation between successive function evaluations.
result The proposed methods provide more accurate trajectory distributions and prediction uncertainties.

New method integrates sparse parametric and nonparametric techniques for complex system modeling.

problem Lack of accurate modeling for complex biological systems due to nonlinearities.
method Sparse nonparametric estimation framework combining parametric and nonparametric techniques.
result Accurately captures nonlinearities in complex systems without prior information.

AR model forecasts partially observed dynamical time series by estimating evolution function and imputing missing variables.

problem Forecasting dynamical time series with missing variables.
method Autoregressive with slack time series (ARS) model.
result ARS model forecasts future time series with time-invariant and linear assumptions.

A new method for reinforcement learning that adapts to different domains using auxiliary classifiers.

problem Training reinforcement learning agents to perform well in different domains with varying dynamics.
method Learning auxiliary classifiers to distinguish source-domain from target-domain transitions and modifying the reward function accordingly.
result The approach improves transfer performance in reinforcement learning tasks with varying dynamics.

Proposes a probabilistic digital twin for dynamical systems using sparse Bayesian learning.

problem Creating and updating accurate digital twins for complex dynamical systems.
method Sparse Bayesian machine learning, two approaches: input-output and output-only.
result Identifies correct perturbation terms and associated parameters in dynamical systems.

New RL approach learns dynamic VCG mechanisms in unknown MDP environments.

problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for dynamic VCG mechanism learning.

Novel F2NARX model improves surrogate modeling for stochastic dynamical systems.

problem Challenges in constructing accurate and efficient surrogate models for stochastic dynamical systems.
method Function-on-Function Nonlinear AutoRegressive model with eXogenous inputs (F2NARX) combining PCA and Gaussian process regression.
result F2NARX outperforms state-of-the-art NARX models in efficiency and accuracy.

A new model explains relative spreads between economies using dynamic Nelson-Siegel and functional regression.

problem Analyzing and predicting relative spreads between economies in fixed income markets.
method State-space functional regression model incorporating dynamic Nelson-Siegel model and kernel PCA.
result The new model outperforms the dynamic Nelson-Siegel model in explaining relative spreads.

Dynamic functional connectivity (FC) has in recent years become a topic of interest in the neuroimaging community. Several models and methods exist for both functional magnetic resonance imaging (fMRI) and electroencephalography (EEG), and the results point towards the conclusion that FC exhibits dynamic changes. The e…

2016-01-04abs ↗pdf ↗

The paper uses LSM to solve complex monetary utility functions.

problem Computing dynamic monetary utility functions with high dimensions.
method Least Squares Monte Carlo (LSM) algorithm.
result LSM algorithm successfully applied to recursive Cost-of-Capital valuation.

Stabilizes complex systems using diffusion models trained on Lyapunov functions.

problem Generating stabilizing controllers for complex dynamical systems.
method Trains a diffusion model on pairs of asymptotically stable vector fields and their Lyapunov functions to identify the closest stable field and adjust control functions.
result Efficient and rapid stabilization of unseen systems, showcasing generalizability.

Paper uses DRL for dynamic pricing on e-commerce platforms.

problem Dynamic pricing on e-commerce platforms.
method Deep reinforcement learning, Markov Decision Process (MDP), continuous price sets, difference of revenue conversion rates (DRCR).
result DRCR is a more appropriate reward function than revenue.

Universal online optimization for dynamic environments using uniclass prediction.

problem Online optimization in changing environments with dynamic regret.
method Reduces dynamic online optimization to uniclass prediction problem, allowing control over dynamic regret bounds.
result First paper with state-of-the-art dynamic regret guarantees for general convex cost functions.

Geometric tempering fails for Langevin dynamics, proving convergence limits.

problem Proving convergence and limitations of geometric tempering for Langevin dynamics.
method Theoretical investigation of geometric tempering using Langevin dynamics.
result Geometric tempering can lead to exponential time convergence and poor functional inequalities.

A new method for learning gradient flows from population dynamics.

problem Reconstructing population dynamics from limited data.
method Residual approach to enforce continuity equations, combining with data-fitting divergence.
result Demonstrated state-of-the-art performance across trajectory inference benchmarks.

Proposes neural dynamic mode decomposition for end-to-end modeling of nonlinear dynamics.

problem Understanding and modeling nonlinear dynamical systems.
method Trains neural networks to minimize forecast error based on spectral decomposition in the lifted space.
result Demonstrates effectiveness in eigenvalue estimation and forecast performance.

Unified framework detects dynamic community structure in brain networks across individuals.

problem Detecting community structure in functional brain networks across multiple subjects and over time.
method Markov-switching stochastic block model (MSS-SBM) for multilayer brain networks.
result Captures dynamic reconfiguration of modular connectivity in brain networks across different task conditions.

We propose a simple discrete time semi-supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross-sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past…

2016-10-14abs ↗pdf ↗