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

Trend · papers per month

4080119159 · May 202619922001200920182026
48 results for shifting patterns

Paper discovers shifting patterns in sequence classification and proposes a method to improve performance.

problem Discriminative patterns in sequential data are time-dependent and degrade traditional classification methods.
method Proposes a novel sequence classification method using multi-instance learning and LSTM models to detect and model shifting patterns.
result Demonstrates superior sequence classification performance and detection of shifting patterns in cropland mapping and affective state recognition.

New method for identifying phase shifts in XRD data.

problem Automating phase extraction from large XRD datasets.
method Nonnegative Matrix Factorization integrated with custom clustering.
result Robust determination of phase shifts and accurate phase diagrams.

Method analyzes large-scale network data to detect communication pattern shifts.

problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.

TFPS improves time series forecasting by learning pattern-specific experts.

problem Challenges in forecasting time series data with varying patterns across segments.
method Dual-domain encoder, subspace clustering, pattern-specific experts.
result Significantly improved forecasting accuracy, especially in long-term forecasting.

ReVol normalizes stock price features to mitigate distribution shifts, improving prediction accuracy.

problem Distribution shifts in stock price data hinder accurate prediction.
method ReVol uses normalization, attention-based estimation, and geometric Brownian motion.
result ReVol achieves an average improvement of more than 0.03 in IC and over 0.7 in SR.

Express Wavenet reduces neural network parameters to 1% of standard networks.

problem Optical neural networks with high parameter count.
method Wavelet modulation, random shift wavelets, expressway structure.
result Express Wavenet achieves high accuracy with significantly fewer parameters.

FinCast is a foundation model for financial time-series forecasting that outperforms existing methods.

problem Challenges in financial time-series forecasting due to temporal non-stationarity, multi-domain diversity, and varying temporal resolutions.
method FinCast is a foundation model specifically designed for financial time-series forecasting, trained on large-scale financial datasets.
result FinCast exhibits robust zero-shot performance, effectively capturing diverse patterns without domain-specific fine-tuning.

COP improves online conformal prediction by incorporating data patterns, leading to tighter prediction sets.

problem Overly conservative prediction sets in online conformal prediction methods when data distribution shifts.
method Conformal Optimistic Prediction (COP) incorporating estimated cumulative distribution function of non-conformity scores.
result COP produces tighter prediction sets with valid coverage guarantees, outperforming other methods.

In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input space, representative of data in their cluster. This is challenging with data having a nonconvex or manifold structure, as with images or text…

2014-06-16abs ↗pdf ↗

Paper generalizes PU classification for class prior shift and asymmetric error scenarios.

problem Bottlenecks in binary classification from PU data due to test marginal distribution and equal error penalties.
method Analysis of Bayes optimal classifier, risk minimization framework, and density ratio estimation framework.
result PU classification under class prior shift is equivalent to PU classification with asymmetric error.

Bayesian approach labels segment parameters for improved change detection.

problem Improving Bayesian change point detection by leveraging segment parameter patterns.
method Proposes a Bayesian mean-shift change point detection algorithm with a Dirichlet process prior for segment class labels.
result Enhanced performance in synthetic and real-world data.

Partially performative prediction studies how predictive models influence future data.

problem Distribution shift in predictive models due to endogenous and exogenous factors.
method Generalizing performative prediction to capture both endogenous and exogenous sources of distribution shift.
result Developed online analogues of performative stability and optimality for partially performative environments.

New method learns domain-invariant local feature patterns for unsupervised domain adaptation.

problem Performance degradation due to domain-shift in unsupervised domain adaptation.
method Jointly learns domain-invariant local feature patterns and holistic feature distributions.
result Superior performance on benchmark datasets compared to state-of-the-art methods.

Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.

problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.

A distributed algorithm learns patterns in large images and signals.

problem High-dimensional optimization in large images and signals.
method Distributed asynchronous algorithm with locally greedy coordinate descent.
result Patterns can be learned on large scales images from the Hubble Space Telescope.

HypeGBMS clusters data in hyperbolic space, overcoming Euclidean limitations.

problem Clustering in hierarchical or tree-like datasets in curved spaces.
method Hyperbolic Gaussian Blurring Mean Shift with Möbius-weighted means.
result HypeGBMS effectively captures latent hierarchies in non-Euclidean data.

ALT improves TSC by capturing complex patterns in time series data.

problem Challenges in traditional TSC methods with time series complexity and variability.
method ALT incorporates variable-length shifted time windows to enhance LLT for better feature representation.
result ALT achieves state-of-the-art performance with few hyperparameters.

AdaCGP learns dynamic graph topology from time series data, improving over existing methods.

problem Learning dynamic graph topology from time-varying signals, especially in real-time applications.
method AdaCGP is a sparsity-aware adaptive algorithm that recursively estimates the Graph Shift Operator (GSO) through variable splitting.
result AdaCGP outperforms state-of-the-art methods in GSO estimation, achieving improvements exceeding 83%.

CATS adapts multivariate time series models by addressing correlation shift.

problem Correlation differences across domains in multivariate time series data.
method CATS introduces correlation shift to measure domain differences, and uses a graph attention module and temporal convolution to align target correlations with source correlations.
result CATS increases over 10% average accuracy compared to vanilla Transformer-based models with minimal additional parameters.

Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.

problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.

Many clustering algorithms exist that estimate a cluster centroid, such as K-means, K-medoids or mean-shift, but no algorithm seems to exist that clusters data by returning exactly K meaningful modes. We propose a natural definition of a K-modes objective function by combining the notions of density and cluster assignm…

2013-04-24abs ↗pdf ↗

Enhances EEG-based BCIs by adapting to non-stationary data shifts.

problem Non-stationary nature of EEG signals and covariate shifts.
method Covariate shift estimation and unsupervised adaptive ensemble learning.
result Significantly enhances BCI performance in MI classifications.

New framework explains leading digit patterns without probabilistic assumptions.

problem Explaining leading digit distributions without relying on probabilistic models.
method Shift-invariant functional equation and affine-plus-periodic formulas.
result Unified mathematical foundation for understanding digit distributions.

Paper improves bike-sharing demand prediction by adapting to changing patterns.

problem Improving bike-sharing demand prediction under temporal domain shifts.
method Gen-ROTDA, a robust optimal transport-guided residual domain adaptation framework.
result Gen-ROTDA achieves the lowest MAE and is the best OT-family method on average.

DUET enhances multivariate time series forecasting by clustering time and channels.

problem Heterogeneous temporal patterns and complex channel correlations in multivariate time series.
method DUET uses dual clustering on temporal and channel dimensions to handle these challenges.
result DUET achieves state-of-the-art performance on 25 real-world datasets.

MIP framework improves urban flow prediction by adapting to distribution shifts.

problem Distribution shifts in urban flow data make prediction models unreliable.
method Memory-enhanced Invariant Prompt learning with learnable memory bank.
result MIP ensures robust predictions by focusing on invariant features.

A streaming GNN model tackles continual learning for updating node representations in real-time.

problem Learning new patterns in streaming graph data while maintaining existing patterns.
method Designing an approximation algorithm for pattern detection, combining data replaying and model regularization.
result Our model efficiently updates model parameters and achieves comparable performance to model retraining.

Researchers adaptively analyze market regimes to reveal investor behavior shifts.

problem Market relationships shift across different regimes, affecting investor behavior.
method Combining Kalman filtering, Markov-switching, and asymmetric response estimation.
result Foreign investors' predictive power increases during crises, while individual investors react more strongly to positive shocks.

DoubleAdapt improves stock trend forecasting by adapting models to evolving data.

problem Incremental learning for stock trend forecasting is challenging due to distribution shifts.
method DoubleAdapt framework with two adapters for data and model adaptation.
result DoubleAdapt achieves state-of-the-art predictive performance on real-world stock datasets.

New framework infers causal shifts in event sequences under out-of-domain interventions.

problem Inferring causal relationships in event sequences without considering out-of-domain interventions.
method Proposes a new causal framework to define ATE, designs an unbiased ATE estimator, and uses a Transformer-based neural network model.
result Demonstrates superior performance in ATE estimation and goodness-of-fit under out-of-domain-augmented point processes.

MOT uses RL with OT to adapt to different market conditions for algorithmic trading.

problem Adapting to varying market conditions in algorithmic trading.
method MOT uses multiple actors with disentangled representation learning and Optimal Transport to model different market patterns.
result MOT outperforms in real futures market data with excellent profit capabilities and risk balancing.

ORCA calibrates LLMs for efficient, generalizable reasoning.

problem Miscalibration of large language models leading to inefficiencies.
method Online Reasoning Calibration (ORCA) using conformal prediction and test-time training.
result ORCA provides higher efficiency and generalization across different reasoning tasks.

CRL improves recommendation systems by reducing distribution shift.

problem Offline metrics fail to predict online performance due to distribution shift in recommender systems.
method Proposes an information-theoretic disentanglement criterion and a variational lower bound for better generalisation under distribution shift.
result CRL variants deliver substantial online gains in listener engagement compared to baseline models.

Using open source data, we observe the fascinating dynamics of nighttime light. Following a global economic regime shift, the planetary center of light can be seen moving eastwards at a pace of about 60 km per year. Introducing spatial light Gini coefficients, we find a universal pattern of human settlements across dif…

2013-03-12abs ↗pdf ↗

QuantaAlpha uses evolutionary algorithms to mine financial alpha robustly across market distributions.

problem Challenges in alpha mining due to market noise and regime shifts.
method Evolutionary framework treating each mining run as a trajectory, mutation, crossover, targeted revision, and reuse of effective patterns.
result Consistent gains over strong baselines and prior systems, achieving high IC and ARR.

AJL framework detects dynamic patterns in high-dimensional time-varying models.

problem Complex time-varying associations and abrupt regime shifts in longitudinal processes.
method Hierarchical regularization framework integrating functional variable selection with structural changepoint detection.
result The refined estimator achieves the oracle property in ultra-high-dimensional settings.

This work shifts focus from prediction to intervention in social systems.

problem The limitations of focusing solely on prediction in automated decision systems.
method Shift from prediction-focused paradigm to intervention-oriented approach.
result A new perspective unifies statistical frameworks and tools for ADS design, implementation, and evaluation.

The paper tackles performative policy learning with strategic agents, improving scalability and generalizability.

problem Strategic agents adjust their features in response to a released policy, causing endogenous distribution shifts.
method Relaxing parametric assumptions, the paper uncovers a low-dimensional structure in distribution shifts and proposes a gradient-based policy optimization algorithm.
result The proposed algorithm achieves high sample efficiency and provides theoretical guarantees for convergence.