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

69139208277 · Jun 202019922001200920172026
48 results for time-evolving dynamics

A fast spectral algorithm detects community structure in evolving graphs.

problem Detecting community structure in time-evolving sparse graphs.
method Extension of the Bethe-Hessian matrix for spectral community detection.
result The algorithm reaches the optimal detectability threshold and outperforms other methods.

New method clusters evolving networks using spatio-temporal graph Laplacian.

problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.

In this paper we use a time-evolving graph which consists of a sequence of graph snapshots over time to model many real-world networks. We study the path classification problem in a time-evolving graph, which has many applications in real-world scenarios, for example, predicting path failure in a telecommunication netw…

2019-05-10abs ↗pdf ↗

We model microbiome interactions as graphs to interpret complex dynamics.

problem Understanding the differences in microbiome profiles between healthy and ill individuals.
method Developed a method to learn low-dimensional graph representations of time-evolving microbiome interactions.
result Extracted graph features that highlight microbes and interactions strongly correlated with clinical diseases.

New method clusters directed graphs using Koopman operators.

problem Challenges in clustering directed graphs, especially complex eigenvalues and lack of cluster definition.
method Relate graph Laplacians to transfer operators and metastable sets in stochastic systems, derive clustering algorithms for directed and time-evolving graphs.
result Clusters can be interpreted as coherent sets, useful for analyzing transport and mixing processes.

Graph-based methods pervade the inference toolkits of numerous disciplines including sociology, biology, neuroscience, physics, chemistry, and engineering. A challenging problem encountered in this context pertains to determining the attributes of a set of vertices given those of another subset at possibly different ti…

2016-12-12abs ↗pdf ↗

The paper proposes a Gaussian mixture model for Hilbert-space-valued data.

problem Challenges in characterizing probability measures for infinite-dimensional random objects.
method Gaussian mixture framework based on kernel mean embeddings.
result The proposed algorithm yields a dense class of approximations in infinite-dimensional spaces.

Graph-based approach predicts stock trends using dynamic multi-relational graphs.

problem Predicting future stock movements in complex, time-evolving stock relationships.
method Dynamic multi-relational stock graphs, stochastic diffusion process, parallel retention.
result Outperforms state-of-the-art baselines in stock trend forecasting.

Novel framework synthesizes stochastic trajectories with anticipated structural breaks.

problem Synthesizing forward-looking, time-evolving stochastic trajectories with anticipated structural breaks.
method Anticipatory Neural Jump-Diffusion (ANJD) flow, AVNSG for dynamic spectral whitening.
result The framework effectively captures non-commutative moments and high-order stochastic texture.

The paper develops a neural network-based method for detecting change points in large-scale time-evolving data.

problem Detecting and locating change points in multivariate time-evolving data.
method Two-step procedure involving neural network training and test error function calibration over moving windows.
result Consistent estimates for the number and locations of change points under temporal dependence.

We propose a probabilistic modeling framework for learning the dynamic patterns in the collective behaviors of social agents and developing profiles for different behavioral groups, using data collected from multiple information sources. The proposed model is based on a hierarchical Bayesian process, in which each obse…

2016-06-24abs ↗pdf ↗

Generative adversarial networks generate realistic, time-evolving high-resolution atmospheric fields.

problem Improving spatial resolution of low-resolution atmospheric images.
method Recurrent, stochastic super-resolution GAN for generating ensembles of time-evolving high-resolution atmospheric fields.
result The GAN produces realistic, temporally consistent super-resolution sequences for radar-measured precipitation and cloud optical thickness.

STAD adapts models to evolving time-based data shifts.

problem Gradual distribution shifts over time challenge existing test-time adaptation methods.
method Bayesian filtering method that learns time-varying dynamics in hidden features.
result STAD excels in handling small batch sizes and label shift on real-world data.

This paper introduces a novel technique to track structures in time evolving graphs. The method is based on a parameter free approach for three-dimensional co-clustering of the source vertices, the target vertices and the time. All these features are simultaneously segmented in order to build time segments and clusters…

2013-01-12abs ↗pdf ↗

This research introduces dynamic portfolio cuts using a spectral approach for graph-theoretic diversification.

problem Traditional methods for estimating asset-return covariance assume statistical time-invariance, failing to capture the nonstationary nature of asset price movements.
method Introduces graph spectral estimators that account for nonstationarity, partitioning the market graph into time-evolving clusters for dynamic portfolio cuts.
result Demonstrates the advantages of the proposed framework over traditional methods through numerical case studies using real-world price data.

A method uses non-autonomous equations to classify time signals efficiently.

problem Time signal classification with minimal parameters and high accuracy.
method Develops a framework using non-autonomous dynamical equations to classify time signals.
result The method achieves comparable accuracy with fewer parameters than existing methods.

Models for recommender systems use latent factors to explain the preferences and behaviors of users with respect to a set of items (e.g., movies, books, academic papers). Typically, the latent factors are assumed to be static and, given these factors, the observed preferences and behaviors of users are assumed to be ge…

2015-09-15abs ↗pdf ↗

We present a novel probabilistic clustering model for objects that are represented via pairwise distances and observed at different time points. The proposed method utilizes the information given by adjacent time points to find the underlying cluster structure and obtain a smooth cluster evolution. This approach allows…

2015-04-14abs ↗pdf ↗

ACI uses Bayesian data assimilation to trace causes from effects in complex systems.

problem Capturing instantaneous, time-evolving causal relationships in complex, high-dimensional systems.
method Assimilative causal inference (ACI) leverages Bayesian data assimilation to trace causes backward from observed effects.
result ACI provides online tracking of causal roles that may reverse intermittently and reveals how far effects propagate.

We present the collaborative Kalman filter (CKF), a dynamic model for collaborative filtering and related factorization models. Using the matrix factorization approach to collaborative filtering, the CKF accounts for time evolution by modeling each low-dimensional latent embedding as a multidimensional Brownian motion.…

2015-01-22abs ↗pdf ↗

Develops ΦΦ-DVAE for assimilating unstructured data into physical models.

problem Challenges in incorporating unstructured data into physical models.
method Physics-informed dynamical variational autoencoder (ΦΦ-DVAE) combining latent state-space model and VAE.
result Demonstrates data-efficient dynamics encoding with competitive performance and uncertainty quantification.

This paper discusses the empirical validity of Goodwin's (1967) macroeconomic model of growth with cycles by assuming that the individual income distribution of the Brazilian society is described by the Gompertz-Pareto distribution (GPD). This is formed by the combination of the Gompertz curve, representing the overwhe…

2013-01-07abs ↗pdf ↗

This chapter covers methods for identifying and inferring graph topologies.

problem Identifying and inferring graph topologies from multidimensional relational data.
method Overview of methods including correlation metrics, covariance selection, kernels, structural equations, and vector autoregressions.
result Supports both batch and online learning with convergence guarantees and leverages high-order statistical information.

Artificial neural networks are simple and efficient machine learning tools. Defined originally in the traditional setting of simple vector data, neural network models have evolved to address more and more difficulties of complex real world problems, ranging from time evolving data to sophisticated data structures such …

2012-10-24abs ↗pdf ↗

TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.

problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.

Enhances neural network solvers for PDEs with complex boundary conditions.

problem Challenges in solving PDEs with high accuracy and complex boundary conditions.
method Integrates natural gradient optimization with numerical time-stepping schemes to enforce Dirichlet boundary conditions.
result Superior accuracy and computational efficiency of the proposed methods for solving PDEs.

We show that a simple model of a spatially resolved evolving economic system, which has a steady state under simultaneous updating, shows stable oscillations in price when updated asynchronously. The oscillations arise from a gradual decline of the mean price due to competition among sellers competing for the same reso…

2008-01-25abs ↗pdf ↗

The financial market is a complex dynamical system composed of a large variety of intricate relationships between several entities, such as banks, corporations and institutions. At the heart of the system lies the stock exchange mechanism, which establishes a time-evolving network of trades among companies and individu…

2015-01-21abs ↗pdf ↗

Paper tackles continuous transfer learning with evolving target domains.

problem Challenges of negative transfer in evolving target domains.
method Proposes label-informed C-divergence for measuring distribution shift and negative transfer.
result Demonstrates effectiveness of TransLATE framework in minimizing classification error and C-divergence.

We propose a family of statistical models for social network evolution over time, which represents an extension of Exponential Random Graph Models (ERGMs). Many of the methods for ERGMs are readily adapted for these models, including maximum likelihood estimation algorithms. We discuss models of this type and their pro…

2009-08-09abs ↗pdf ↗