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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920182026
48 results for independent changes

New findings show independent subordination is not relevant for accurate option pricing.

problem Determining if independent subordination improves option pricing accuracy.
method Utilized a class of additive processes (ATS) to demonstrate that independent subordination is incompatible with market data and shows worse calibration performances.
result Independent subordination is not relevant for accurate option pricing, as shown by the ATS class of processes.

GOCPD detects change points by maximizing the probability of two independent models.

problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.

We introduce a new class of processes for the evaluation of multivariate equity derivatives. The proposed setting is well suited for the application of the standard copula function theory to processes, rather than variables, and easily enables to enforce the martingale pricing requirement. The martingale condition is i…

2016-07-06abs ↗pdf ↗

Geometric pruning rules improve change point detection in multiple time series.

problem Detecting multiple changes in multiple independent time series.
method Dynamic programming algorithms with inequality-based and geometric pruning rules.
result Geometric pruning rules offer close-to-linear time complexity for multiple independent time series.

In this paper we study the setting where features are added or change interpretation over time, which has applications in multiple domains such as retail, manufacturing, finance. In particular, we propose an approach to provably determine the time instant from which the new/changed features start becoming relevant with…

2017-04-29abs ↗pdf ↗

Framework for causal discovery from changing data.

problem Challenges of causal discovery in heterogeneous or nonstationary data.
method Constraint-based CD-NOD framework for causal skeleton and orientation recovery, independent changes detection.
result Efficient estimation of causal mechanism changes and low-dimensional representation of nonstationarity.

Unified framework for disentangled representations using mechanistic independence.

problem Identifiability of disentangled latent factors under statistical dependencies.
method Introduces mechanistic independence to characterize latent factors by their actions on observed variables, proposing various independence criteria.
result Establishes conditions for identifiability of latent subspaces without statistical assumptions.

We consider the problem of quickest change-point detection in data streams. Classical change-point detection procedures, such as CUSUM, Shiryaev-Roberts and Posterior Probability statistics, are optimal only if the change-point model is known, which is an unrealistic assumption in typical applied problems. Instead we p…

2017-06-11abs ↗pdf ↗

Given a heterogeneous time-series sample, the objective is to find points in time (called change points) where the probability distribution generating the data has changed. The data are assumed to have been generated by arbitrary unknown stationary ergodic distributions. No modelling, independence or mixing assumptions…

2012-03-07abs ↗pdf ↗

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.

It has been postulated that a good representation is one that disentangles the underlying explanatory factors of variation. However, it remains an open question what kind of training framework could potentially achieve that. Whereas most previous work focuses on the static setting (e.g., with images), we postulate that…

2017-08-03abs ↗pdf ↗

Paper introduces new invariant for pairs of immersions.

problem Understanding behavior of immersions through tangencies and triple points.
method Introduces J2+J^{2+}-invariant for oriented pairs of immersions, invariant under inverse tangencies and triple points.
result Invariant changes under direct tangencies but remains invariant under orientation change and inverse tangencies.

RIMs improve generalization by specializing modular structures.

problem Improving generalization and robustness to changes in tasks.
method Recurrent Independent Mechanisms (RIMs) architecture with independent dynamics, sparing communication, and selective updates.
result RIMs lead to dramatic improvement in generalization on tasks with varying factors.

Detects model changes in machine learning with empirical difference test.

problem Detect significant model changes between pre-change and post-change parameters.
method Constructs an empirical difference test (EDT) to approximate GLRT, with low computational complexity and false alarm constraint.
result EDT approximates GLRT and provides a method to set threshold for false alarm constraint.

New algorithm for nonstationary multi-armed bandits with optimal performance.

problem Nonstationary multi-armed bandits with changing model parameters over time.
method Adaptive Resetting Bandit (ADR-bandit) algorithm using adaptive windowing techniques.
result ADR-bandit achieves nearly optimal performance in both abrupt and gradual changes.

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change its shape under the above restrictions. We prove that flexible polyhedral surfa…

2001-11-01abs ↗pdf ↗

Random Forest proximity distances reveal feature contributions in black-box models.

problem Understanding feature contributions in complex, opaque machine learning models.
method Observing changes in input affecting proximity distances and instance movement in decision space.
result Each feature's independent contribution to model decisions can be calculated and analyzed.

Deep learning generates efficient change-point detection methods.

problem Detecting change-points in data with various types of change and data behavior.
method Train a neural network to automatically generate detection methods.
result Neural network-based methods are competitive and outperform standard methods in various noise conditions.

New framework TDRL identifies latent causal variables from sequential data.

problem Identify latent causal variables from sequential data.
method Proposes TDRL framework to recover time-delayed latent causal variables and identify their relations from measured sequential data.
result Identifies latent causal variables reliably from sequential data.

Locally private methods detect changes in time series data.

problem Detecting distributional changes in time series data under local differential privacy.
method Proposed locally differentially private algorithms based on randomized response and binary mechanisms.
result Theoretical performance bounds and empirical validation of detection accuracy.

Model predicts risk-adjusted returns across various financial markets.

problem Stationary models fail in predicting risk-adjusted returns due to market regime changes.
method Asset-independent regime-switching model using hidden Markov models.
result Accurately detects bull, bear, and high volatility periods for improved risk-adjusted returns.

The paper develops methods to accurately locate change points in high-dimensional mean shift models.

problem Locating change points in high-dimensional mean shift models.
method Locally refitted least squares estimator, component-wise and simultaneous rates of estimation.
result Asymptotic validity of component-wise and simultaneous confidence intervals for change point parameters.

The method learns disentangled representations for localized image manipulations.

problem Image generating neural networks are viewed as black boxes with global effects.
method Localized ResNet Autoencoder with multiple loss functions.
result The network can transfer specific facial attributes like shape and color of eyes, hair, mouth, etc. between persons.

Generative model for morphological continuum of normal and pathological states.

problem Identifying trends and features that separate normality and pathology in biomedical images.
method Wasserstein Auto-encoder with HSIC regularization for latent features.
result Model generates a continuum of morphological changes corresponding to side information.

Novel approach combines local and global brain changes for AD prediction.

problem Detecting Alzheimer's disease through local and global brain changes.
method Patch-based 3D-CNNs combined with global topological features for multi-scale brain tissue connectivity.
result Average precision score of 0.95 for classifying cognitively normal subjects and AD patients (prevalence ~55%).

In this paper, we show how the sampling properties of the Hurst exponent methods of estimation change with the presence of heavy tails. We run extensive Monte Carlo simulations to find out how rescaled range analysis (R/S), multifractal detrended fluctuation analysis (MF-DFA), detrending moving average (DMA) and genera…

2012-01-23abs ↗pdf ↗

DSE learns transferable skills across changing dynamics and goals.

problem Learning transferable skills across different reinforcement learning tasks.
method Variational inference for multi-task reinforcement learning with shared and task-specific latent spaces.
result Policies can generalize to unseen dynamics and goals conditions.

Facial attribute editing aims to manipulate single or multiple attributes of a face image, i.e., to generate a new face with desired attributes while preserving other details. Recently, generative adversarial net (GAN) and encoder-decoder architecture are usually incorporated to handle this task with promising results.…

2017-11-29abs ↗pdf ↗

Paper introduces Ddim, a new measure of model complexity, for MDL-based learning and change detection.

problem Characterizing the complexity of probabilistic models for efficient learning and change detection.
method Introduces descriptive dimension (Ddim) as a measure of model complexity. Derives convergence rates and error probabilities for MDL-based learning and change detection.
result Ddim characterizes the performance of MDL-based learning and change detection.

Paper estimates differences in conditional independence graphs from time-dependent data.

problem Estimating changes in conditional dependencies between two time series with known similar structure.
method Penalized D-trace loss function approach in the frequency domain, using Wirtinger calculus, with convex and non-convex penalties.
result Established sufficient conditions for consistency and graph recovery in high-dimensional settings.

A new robust and flexible classification method for non-Gaussian data.

problem Robustness to scale changes and non-Gaussian distributions in classical discriminant analysis.
method FEMDA uses arbitrary Elliptically Symmetrical distributions and scale parameters for each data point.
result FEMDA is robust to scale changes and outperforms other methods.

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.

Develops a theory of common decomposition for correlated Brownian motions.

problem Tackles the modeling of correlated Brownian motions in financial applications.
method Uses change of time method to represent correlated Brownian motions as a triplet of processes.
result Shows equivalent conditions for the triplet being independent and proposes a new method for constructing correlated Brownian motions.

Robustly detects and attributes climate change impacts under interventions.

problem Detect and attribute climate change impacts from observations robustly.
method Supervised learning with anchor regression for robust predictions under interventions.
result CO2 forcing can be robustly predicted from temperature patterns under strong solar forcing interventions.

This work introduces robust counterfactuals for neural networks that remain valid after minor model changes.

problem Generating counterfactual explanations that are robust to slight model changes.
method Introduces a measure called Stability to quantify robustness of counterfactuals to potential model changes, and proposes practical relaxations.
result Counterfactuals with high Stability remain valid after potential model changes with high probability.