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

195390584779 · Jun 202019922001200920172026
48 results for time domain

A new model for imputing missing values in time series data across domains.

problem Imputing missing values in time series data across domains with domain shifts and high missing rates.
method A diffusion-based imputation model that integrates shared spectral components and domain-specific temporal structures, with cross-domain consistency alignment.
result Our model effectively handles missing values and domain shifts, outperforming existing methods.

NFM models time-series data directly in the Fourier domain, achieving state-of-the-art performance.

problem Traditional time-series analysis focuses on the time domain, limiting flexibility.
method NFM models time-series data in the Fourier domain, using frequency extrapolation and interpolation.
result NFM achieves state-of-the-art performance on various time-series tasks.

Benchmark for UDA in time series classification.

problem Lack of benchmarks for unsupervised domain adaptation in time series.
method Introduces a comprehensive benchmark with new datasets and state-of-the-art neural network backbones.
result Insights into strengths and limitations of UDA methods for time series data.

Classifies domains critical for heat content and exit-time moments.

problem Understanding critical domains for heat content and exit-time moments.
method First variation of heat content, constant flow property, isoparametric foliation.
result Domains critical for heat content at all times have constant flow property and isoparametric foliation.

Paper proposes a unified time series forecasting model with adaptive transfer.

problem General forecasting models for diverse time series data.
method Unified representations through Decomposed Frequency Learning and adaptive domain-specific features via Time Series Register.
result State-of-the-art forecasting performance on seven real-world benchmarks.

SYNC learns time-aware causal representations to improve model generalization in evolving domains.

problem Spurious correlations and shortcut learning in existing EDG methods hinder model generalization.
method SYNC integrates dynamic causal factors and causal mechanism drifts into a sequential VAE framework.
result SYNC achieves superior temporal generalization performance on synthetic and real-world datasets.

MTS-CycleGAN adapts multivariate time series data for ironmaking industry.

problem Creating a domain invariant dataset from multivariate time series data of different blast furnaces.
method Adversarial-based deep mapping learning network (CycleGAN) with LSTM-based AutoEncoder and discriminator.
result MTS-CycleGAN successfully translates multivariate time series data between different blast furnaces.

Proposes CTSDG model for better vehicle intention prediction across domains.

problem Domain generalization for vehicle intention prediction in dynamic environments.
method Structural causal model with recurrent latent variable integration.
result Consistent improvement in prediction accuracy compared to state-of-the-art methods.

Study on heat content for domains with fractal boundaries.

problem Analyzing short-time asymptotics of heat content for domains with fractal boundaries.
method Developing mathematical analysis on de Gennes' hypothesis and exploring fractal curvatures.
result Fractal curvatures and their scaling exponents may emerge in the short-time heat content asymptotics of domains with fractal boundaries.

A two-layer classifier improves smartphone transportation mode recognition.

problem Improving accuracy of transportation mode classification.
method Two-layer hierarchical classifier combining time and frequency domain features.
result Maximum classification accuracy of 97.02%.

PETAL adapts models to changing target domains over time.

problem Lifelong test-time adaptation in changing target domains.
method Probabilistic framework with student-teacher model and data-driven parameter restoration.
result PETAL achieves better results than state-of-the-art for online lifelong test-time adaptation.

Estimates time-varying network connections using multi-stage smoothing.

problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.

FredNormer improves time series forecasting by adapting to frequency domain patterns.

problem Current normalization methods struggle with non-stationary time series due to their time-domain approach.
method FredNormer analyzes frequency components, adapts weights, and improves robustness.
result FredNormer boosts forecasting accuracy by 33.3% on ETTm2 dataset.

We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predict…

2014-12-15abs ↗pdf ↗

HyFAD improves time series imputation by combining time and frequency diffusion.

problem Improve time series imputation by handling frequency-sensitive denoising and balancing global and local dynamics.
method HyFAD is a hybrid time-frequency diffusion model with frequency-aware embedding, built on DDPM paradigm.
result HyFAD achieves state-of-the-art performance in time series imputation.

Deep neural networks with more parameters and FLOPs have higher capacity and generalize better to diverse domains. But to be deployed on edge devices, the model's complexity has to be constrained due to limited compute resource. In this work, we propose a method to improve the model capacity without increasing inferenc…

2019-11-26abs ↗pdf ↗

Study on complex hyperbolic bidisk isometries and their Dirichlet domains.

problem Investigating isometries and Dirichlet domains in the complex hyperbolic bidisk.
method Examined the isometries of the complex hyperbolic bidisk and the Dirichlet domain formed by a cyclic subgroup action.
result Proved that the Dirichlet domain has two sides.

Human activity recognition plays an important role in people's daily life. However, it is often expensive and time-consuming to acquire sufficient labeled activity data. To solve this problem, transfer learning leverages the labeled samples from the source domain to annotate the target domain which has few or none labe…

2018-07-20abs ↗pdf ↗

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.

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.

This paper tackles continuous domain generalization, improving model performance across unseen domains.

problem Existing domain generalization approaches fail to capture the complex, multidimensional nature of real-world variation.
method Introduces Continuous Domain Generalization (CDG), a principled framework grounded in geometric and algebraic theories. Proposes a Neural Lie Transport Operator (NeuralLio) for structure-preserving parameter transitions and a gating mechanism for robust generalization.
result Demonstrates significant improvement in generalization accuracy and robustness across various datasets.

New approach to solving minimal surface system Dirichlet problem on smooth domains.

problem Solving Dirichlet problem for minimal surface system on smooth domains.
method Using mean curvature flow (MCF) with boundary conditions and non-negative Ricci curvature assumption.
result Existence of long-time mean curvature flow and existence result for exterior Dirichlet problem.

Hybrid framework injects TSLM insights into GRLM for robust time-series reasoning.

problem Lack of domain-specific knowledge in large language models for time-series reasoning.
method Hybrid knowledge-injection framework combining RLVR for efficient knowledge transfer.
result Consistently outperforms existing models by 7.9%-26.1% on multivariate time-series benchmarks.

VQShape learns interpretable time-series representations and achieves comparable performance to specialist models.

problem Lack of interpretability in existing time-series models.
method Vector quantization of time-series data into abstracted shapes.
result VQShape achieves comparable performance to specialist models in classification tasks.

Inference-Time Scaling can be extended to domains prone to systematic failure using intrinsic statistics.

problem Scaling inference time in domains prone to systematic failure
method Intrinsic Selection (iS), Intrinsic Particle Filtering (iPF), and Particle Distillation (dPF)
result Intrinsic Selection improves engineering design selection by 20% and pass@1 by 6.1 points on average.

In Prognostics and Health Management (PHM) sufficient prior observed degradation data is usually critical for Remaining Useful Lifetime (RUL) prediction. Most previous data-driven prediction methods assume that training (source) and testing (target) condition monitoring data have similar distributions. However, due to …

2019-07-17abs ↗pdf ↗

Domain adaptation provides a powerful set of model training techniques given domain-specific training data and supplemental data with unknown relevance. The techniques are useful when users need to develop models with data from varying sources, of varying quality, or from different time ranges. We build CrossTrainer, a…

2019-05-07abs ↗pdf ↗

Supervised learning results typically rely on assumptions of i.i.d. data. Unfortunately, those assumptions are commonly violated in practice. In this work, we tackle such problem by focusing on domain generalization: a formalization where the data generating process at test time may yield samples from never-before-seen…

2019-11-03abs ↗pdf ↗

Generative models assess quality on time-series data using ITS and FITD.

problem Lack of consensus for quality assessment of class-conditional generative models on time-series data.
method Introduced InceptionTime Score (ITS) and Frechet InceptionTime Distance (FITD) to evaluate generative models.
result ITS and FITD combined with TSTR can accurately assess generative model performance on time-series data.

STAM learns important time steps and variables for multivariate time series prediction.

problem Accurate interpretation of multivariate time series predictions.
method Spatiotemporal attention mechanism (STAM) for multivariate time series modeling.
result STAM maintains state-of-the-art prediction accuracy with improved interpretability.

OLinear forecasts time series more efficiently by transforming data orthogonally.

problem Efficiently forecasting time series with entangled dependencies.
method OLinear uses OrthoTrans to transform data orthogonally, then applies NormLin for linear layer.
result OLinear achieves state-of-the-art performance with high efficiency.

In this note we discuss graphs over a domain ΩN2Ω\subset N^2 in the product manifold N2×RN^2\times \mathbb{R}. Here N2N^2 is a complete Riemannian surface and ΩΩ has peice-wise smooth boundary. Let γΩγ\subset\partialΩ be a smooth connected arc and ΣΣ be a complete graph in N2×RN^2\times \mathbb{R} over ΩΩ. We show that i…

2017-09-10abs ↗pdf ↗

Improves survival analysis across multiple domains with machine learning.

problem Adapting survival analysis to new or rare illness types with limited labeled data.
method Introduces a new survival metric and discrepancy measure for censored data, enabling domain adaptation.
result Superb performance on target domains, better treatment recommendations, and interpretable weight matrix.

Simple policy search outperforms advanced learnable test-time augmentation techniques.

problem Improving predictive performance through test-time data augmentation.
method Greedy policy search (GPS) for learning test-time augmentation policies.
result Augmentation policies learned with GPS achieve superior predictive performance and robustness.