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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for structural changes

Online detection of abrupt changes in high-dimensional data streams.

problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.

Proposes a model to detect changes in multivariate time series data.

problem Detect abrupt changes in multivariate time series data considering dependencies and correlations.
method Integrates graph neural networks into an encoder-decoder framework to model correlation structures and dynamics.
result Advantageous performance on CPD tasks over strong baselines, classifying changes as correlation or independent.

Methods for detecting structural changes, or change points, in time series data are widely used in many fields of science and engineering. This chapter sketches some basic methods for the analysis of structural changes in time series data. The exposition is confined to retrospective methods for univariate time series. …

2017-02-17abs ↗pdf ↗

We present two online causal structure learning algorithms which can track changes in a causal structure and process data in a dynamic real-time manner. Standard causal structure learning algorithms assume that causal structure does not change during the data collection process, but in real-world scenarios, it does oft…

2019-04-30abs ↗pdf ↗

Estimates change points in Weibull time series with copulas.

problem Change-point estimation for nonlinear Weibull time series with copula-based Markov models.
method Copula-based Markov chain model with Weibull marginal distributions, incorporating asymmetric dependence structures through Clayton and Joe copulas.
result Proposed method performs well in estimating change points and model parameters, demonstrated through extensive numerical studies and empirical application.

A conformal change of TMTMTM\oplus T^*M is a morphism of the form (X,α)(X,eτα)(X,α)\mapsto(X,e^τα) (XTM,αTM,τC(M))(X\in TM,α\in T^*M,τ\in C^\infty(M)). We characterize the generalized almost complex and almost Hermitian structures that are locally conformal to integrable and to generalized Kähler structures, respectively, and give examples of …

2007-10-19abs ↗pdf ↗

New algorithm detects changes in high-dimensional data with mean and variance.

problem Challenges in detecting changes in high-dimensional data with mean and variance.
method Complete graph-based approach to detect changes of mean and variance from low to high-dimensional online data.
result The proposed method outperforms existing methods in terms of detection power.

PANDA predicts protein binding affinity changes from sequences, outperforming existing methods.

problem Accurately predicting changes in protein binding affinity due to mutations.
method Sequence-based machine learning approach using protein sequence information.
result PANDA achieves higher Pearson correlation coefficients than existing methods.

In many real-world sequential decision making problems, the number of available actions (decisions) can vary over time. While problems like catastrophic forgetting, changing transition dynamics, changing rewards functions, etc. have been well-studied in the lifelong learning literature, the setting where the action set…

2019-06-05abs ↗pdf ↗

PERCEPT detects changes in high-dimensional data streams using topological data analysis.

problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.

We consider the problem of estimating the location of a single change point in a dynamic stochastic block model. We propose two methods of estimating the change point, together with the model parameters. The first employs a least squares criterion function and takes into consideration the full structure of the stochast…

2018-12-07abs ↗pdf ↗

Detects change points in time series focusing on specific components.

problem Identifying moments when specific components of multivariate time series change distributions.
method Two-stage non-parametric algorithm: causal structure learning followed by change point detection.
result Validated the approach on synthetic and real-world datasets.

TADA detects anomalies in time series using topological data analysis.

problem Detecting global changes in dependency structure between channels in multivariate time series.
method Topological Data Analysis for detecting anomalies in multivariate time series.
result The approach is more suitable for detecting global changes of correlation structures than existing methods.

This work benchmarks neural embeddings for link prediction in evolving knowledge graphs.

problem Evaluating the robustness of neural embeddings in changing knowledge graphs.
method Proposes an open-source evaluation pipeline using relation-centric connectivity measures.
result Demonstrates the importance of simulating embedding accuracy for frequently updated knowledge graphs.

MOSAIC detects change points in dynamic networks with low-rank and sparse changes.

problem Detecting change points in dynamic networks with specific structural properties.
method Eigen-decomposition-based test with screened signals and residual-based adjustment.
result MOSAIC achieves minimax-optimal detection and testing rates.

Study bounds changes in hyperbolic 3-manifold structures after drilling short geodesics.

problem Bounding changes in complex projective structures after drilling short geodesics.
method Analyzes L2L^2-bounds on changes in conformally compact hyperbolic 3-manifolds.
result Change is bounded by a universal constant times the square root of the length of the drilled geodesics.

Study validates capital structure theories in Indian public sector banks.

problem Understanding the impact of capital structure on financial performance in Indian banks.
method Developed theoretical framework from capital structure theories, tested hypotheses using statistical techniques.
result Established relation between debt component and financial performance variables.

Paper introduces a novel framework for recognizing dynamic ranking structures in preference-based data.

problem Complex and noisy preference-based data often hide underlying homogeneous structures.
method Developed an approach to identify dynamic ranking groups using temporal penalties and spectral estimation. Introduced an objective function for detecting structural changes.
result Consistent recognition of ranking groups and structural changes in preference-based data.

Framework LiLY recovers latent causal variables from time-series data under distribution shifts.

problem Learning and correcting models under unknown distribution shifts in time-series data.
method LiLY framework that recovers latent causal variables and identifies their relations from temporal data under different distribution shifts.
result The framework reliably identifies time-delayed latent causal influences from observed variables under different distribution changes.

Spectral analysis detects structural changes in financial networks.

problem Detecting structural transitions in financial networks to assess systemic risk.
method Ensemble properties of spectral radius of random graph models calibrated on real-world evolving networks.
result The spectral deviation captures ongoing topological changes in financial networks.

In this article we prove that any unitary, axiomatic topological quantum field theory in four-dimensions can not detect changes in the smooth structure of M, a simply connected, closed (compact without boundary), oriented smooth manifold. However, as Donaldson-Witten theory (a topological quantum field theory but not a…

2011-06-12abs ↗pdf ↗

Paper extends SI method for detecting CPs in complex systems' frequency domain.

problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.

Applying logarithmic transformations along 2-tori, we construct a generalized complex structure J_n with n type changing luci for every n0n\geq 0 on genus 1-Lefschetz fibrations with a cusp neighborhood, which include elliptic surfaces with non-zero euler characteristic. Applying a technique of broken Lefschetz fibrati…

2013-05-17abs ↗pdf ↗

Study shows non-orientable manifolds restrict signature-changing metrics globally.

problem Global obstructions to signature-changing metrics on non-orientable manifolds.
method Explicit geometric constructions based on Möbius strip topology.
result Radical of signature-changing metrics cannot be everywhere transverse.

Detects graph topology changes from noisy signals using prior spectral information.

problem Detecting changes in graph topology from graph signals.
method Leverages graph filtering and subspace detection to distill problem into a CUSUM-based algorithm.
result Demonstrates the effectiveness of incorporating prior spectral signatures for change-point detection.

Motivated by the interplay between structural and reduced form credit models, we propose to model the firm value process as a time-changed Brownian motion that may include jumps and stochastic volatility effects, and to study the first passage problem for such processes. We are lead to consider modifying the standard f…

2009-04-15abs ↗pdf ↗

Reduces change detection to estimation using confidence sequences.

problem Detecting changes in data streams with minimal delay and false alarms.
method Reduction from sequential change detection to sequential estimation using confidence sequences.
result Change detection scheme with minimal structural assumptions and strong guarantees.

We examine how the structure of the world trade network has been shaped by globalization and recessions over the last 40 years. We show that by treating the world trade network as an evolving system, theory predicts the trade network is more sensitive to evolutionary shocks and recovers more slowly from them now than i…

2010-10-03abs ↗pdf ↗