Proposes BHT-ARIMA for forecasting multiple short time series.
problem Forecasting multiple short time series with mutual correlations.
method Block Hankel tensors, Tucker decomposition, generalized tensor ARIMA.
result Improves forecasting accuracy and reduces computational cost.
TEAFormers preserve multi-dimensional time series structures for better forecasting.
problem Traditional Transformers flatten multi-dimensional time series data, losing critical multi-dimensional relationships.
method Tensor-Augmented Transformer (TEAFormer) with Tensor-Augmentation (TEA) module.
result Significant performance enhancements in time series forecasting across benchmarks.
Paper proposes LATC for multivariate time series prediction and missing data imputation.
problem Large-scale, incomplete, and corrupted multivariate time series data.
method Transforms multivariate time series into a tensor structure, models global and local trends, and uses autoregressive norm.
result Integration of global and local trends improves missing data imputation and rolling prediction.
The paper develops tensor learning methods exploiting symmetries of tensor functions.
problem Efficiently handling tensors in various scientific contexts.
method Equivariant machine learning architectures exploiting orthogonal, Lorentz, and symplectic symmetries.
result Equivariant models outperform non-equivariant baselines in time series analysis.
Seq2Tens uses tensors to efficiently represent sequences, improving performance on time series and video tasks.
problem Challenges in analyzing sequential data due to complex dependencies and non-commutativity.
method Uses tensor algebra to capture dependencies and low-rank tensor projections to manage computational complexity.
result State-of-the-art performance on multivariate time series classification and video generation benchmarks.
KTVGL models tensor time series data for interpretable dynamic network estimation.
problem Estimating time-varying dependencies in multi-mode tensor time series data.
method Kronecker Time-Varying Graphical Lasso (KTVGL) for mode-specific dynamic network estimation.
result KTVGL produces interpretable modeling results and higher edge estimation accuracy than existing methods.
New method models matrix time series using tensor CP-decomposition.
problem Modeling matrix time series with reduced complexity.
method One-pass estimation via generalized eigenanalysis and refined projection.
result Component coefficient vectors estimated consistently with certain rates.
Multivariate time series prediction has applications in a wide variety of domains and is considered to be a very challenging task, especially when the variables have correlations and exhibit complex temporal patterns, such as seasonality and trend. Many existing methods suffer from strong statistical assumptions, numer…
Sparse Tucker decomposition with graph regularization improves time series forecasting accuracy.
problem High-dimensional time series forecasting with over-parameterization issue.
method Sparse Tucker decomposition and graph regularization for tensor-based model.
result Non-asymptotic error bound and superior performance in numerical experiments.
Enhances stock movement prediction using Higher Order Transformers for multimodal time-series data.
problem Predicting stock movements in financial markets with complex dynamics.
method Introduced Higher Order Transformers, extending self-attention and transformer architecture to capture complex market dynamics. Employed low-rank tensor decomposition and kernel attention to manage computational complexity. Integrated technical and fundamental analysis from historical prices and tweets.
result Demonstrated effectiveness of the method on the Stocknet dataset, improving stock movement prediction.
There has been an increased interest in multimodal language processing including multimodal dialog, question answering, sentiment analysis, and speech recognition. However, naturally occurring multimodal data is often imperfect as a result of imperfect modalities, missing entries or noise corruption. To address these c…
New method forecasts multilinear data using tensor autoregression.
problem Forecasting 2D data in big data.
method L-Transform Tensor autoregressive (L-TAR) method.
result Statistical independence achieved through invertible discrete linear transforms.
CP-factorization for high-dimensional tensor time series and double projection iterations
problem Identifying and estimating factor loadings in CP decomposition for high-dimensional tensor time series
method One-pass estimation procedure using standard eigen-analysis for matrix constructed based on serial dependence
result Asymptotic properties established under general settings, adapt to sparsity, accommodates weak factors
Variant of mSSA improves time series prediction error.
problem Improve prediction error in multivariate time series.
method Introduce spatio-temporal factor model, establish prediction error scaling.
result Prediction error scales as 1 / √(min(N, T)T).
We generalize a support vector machine to a support spinor machine by using the mathematical structure of wedge product over vector machine in order to extend field from vector field to spinor field. The separated hyperplane is extended to Kolmogorov space in time series data which allow us to extend a structure of sup…
SALT models combine ARHMM and SLDS for efficient, interpretable time-series analysis.
problem Efficient modeling of systems with time-varying dynamics and long-range dependencies.
method Switching autoregressive low-rank tensor models parameterized with a low-rank factorization.
result SALT models provide a balance of interpretability and efficiency, outperforming ARHMMs and SLDSs.
This work speeds up fHMM analysis by tensor algebra.
problem Scalability issues in analyzing factorial hidden Markov models.
method Tensorized algorithms and scalable filtering methods.
result Significant improvement in computational performance.
DCIts interprets complex time series data with interpretable coefficients.
problem Interpreting nonlinear multivariate time series data.
method Deep convolutional architecture with a Focuser and Modeler components.
result DCIts provides interpretable coefficients and interaction patterns.
New method estimates tensors from noisy data with missing entries.
problem Tensor estimation from noisy observations with missing entries.
method Sign series representation for tensor completion, addressing low- and high-rank signals.
result Excess risk bounds, estimation error rates, and sample complexities established.
Accelerates signature kernel computation for sequences.
problem Severe computational bottleneck in computing signature kernel.
method Random Fourier features to accelerate signature kernel computation.
result Uniform approximation guarantees for unbiased estimator with linear computation time.
tvGP-VAE models tensor-valued latent variables with Gaussian processes for better data structure representation.
problem Agnostic latent variables in VAEs ignore data structure correlations.
method Proposes tensor-variate Gaussian process prior for variational autoencoder.
result Explicitly modeling correlation structures improves model performance in reconstruction.
Marginal Structural Models (MSM) are the most popular models for causal inference from time-series observational data. However, they have two main drawbacks: (a) they do not capture subject heterogeneity, and (b) they only consider fixed time intervals and do not scale gracefully with longer intervals. In this work, we…
Quantum models generate financial time series with desired properties.
problem Generating synthetic financial data with temporal correlations.
method Quantum generative adversarial networks (QGANs) with quantum and classical components.
result QGANs can generate financial time series with matching distribution and temporal correlations.
A new method for filling in missing traffic data improves accuracy over existing techniques.
problem Incomplete spatiotemporal traffic data.
method Low-rank autoregressive tensor completion (LATC) framework.
result LATC framework better captures spatiotemporal consistency and local consistency.
A distributed framework for reducing high-dimensional matrix-variate time series data.
problem Reducing dimensionality of high-dimensional, heterogeneous matrix-variate time series data.
method Data partitioning, distributed two-dimensional tensor PCA, aggregation, final PCA, factor matrix computation.
result Preserves latent matrix structure, improves computational efficiency and information utilization.
A formula for the Riemannian metric tensor of differentiable manifolds of linear dynamical systems of same McMillan degree is presented in terms of their transfer function matrices. The necessary calculations for its application to ARMA and state space overlapping parametrizations are drafted. The importance of this ap…
New approach learns mixtures of linear dynamical systems without separation conditions.
problem Learning mixtures of linear dynamical systems with better fit or understanding.
method Tensor decompositions to learn mixtures of linear dynamical systems.
result Algorithm succeeds without strong separation conditions and can compete with Bayes optimal clustering.
It is shown that in the multivariate case the orders p, of the AR part, and q, of the MA part, are not invariants of the time series. Thus, it is concluded that it only makes sense to define the class of ARMA(p,p)- irreducible models, where p is the biggest of the system's Kronecker indices. This class is shown not to …
The cohomology theory for financial market can allow us to deform Kolmogorov space of time series data over time period with the explicit definition of eight market states in grand unified theory. The anti-de Sitter space induced from a coupling behavior field among traders in case of a financial market crash acts like…
Efficiently calibrates volatility models using Chebyshev Tensors.
problem Calibrating pricing models efficiently.
method Used Chebyshev Tensors to speed up calibration of the rough Bergomi volatility model.
result Chebyshev Tensors can calibrate the rough Bergomi volatility model 40,000 times more efficiently than brute-force methods.
New model captures time series dependence across and within blocks.
problem Complex multivariate time series dependence structures.
method Time series Gaussian chain graph models with directed and undirected edges.
result Consistent recovery of time series chain graph structure.
The main objective of this paper is to control the geometry of null cones with time foliation in Einstein vacuum spacetime under the assumptions of small curvature flux and a weaker condition on the deformation tensor for $\bT$. We establish a series of estimates on Ricci coefficients, which plays a crucial role to pro…
We propose a novel multilinear dynamical system (MLDS) in a transform domain, named L-MLDS, to model tensor time series. With transformations applied to a tensor data, the latent multidimensional correlations among the frontal slices are built, and thus resulting in the computational independence in the tra…
Forecasting based on financial time-series is a challenging task since most real-world data exhibits nonstationary property and nonlinear dependencies. In addition, different data modalities often embed different nonlinear relationships which are difficult to capture by human-designed models. To tackle the supervised l…
A new method reduces Volterra kernel complexity and uncertainty quantification.
problem Challenges in modeling nonlinear systems with Volterra series due to high model order.
method Bayesian Tensor Network Volterra kernel machines (BTN-V) using canonical polyadic decomposition.
result Competitive accuracy, enhanced uncertainty quantification, and reduced computational cost.
Optimal tensor PCA for estimating factors and loadings in high-dimensional panel data.
problem Estimating factors and loadings in high-dimensional panel data with non-negligible correlations.
method Tensor Principal Component Analysis (TPCA) for estimating factors and loadings in a tensor factor model.
result Simple TPCA is optimal for strong factors and can be improved for weak factors with alternating least-squares iterations.
The digital revolution of the banking system with evolving European regulations have pushed the major banking actors to innovate by a newly use of their clients' digital information. Given highly sparse client activities, we propose CPOPT-Net, an algorithm that combines the CP canonical tensor decomposition, a multidim…
Study uncovers complex critical points in tensor decomposition.
problem Nonconvex optimization of symmetric tensor decomposition.
method Utilized symmetry to construct critical points and analyze Hessian.
result Obtained precise analytic estimates on objective function and Hessian.
New model improves portfolio selection by analyzing tensor data.
problem Improving portfolio selection through better analysis of style returns.
method Introducing a tensor dynamic conditional correlation (TDCC) model with trace-normalization and dimension-normalization.
result The TDCC model enhances portfolio selection across multiple markets.
Proves well-posedness for Einstein equations with specific boundary data.
problem Proving well-posedness for Einstein equations with Dirichlet boundary data.
method Local-in-time well-posedness proof for vacuum Einstein equations with specific boundary conditions.
result Proves well-posedness for Einstein equations with Dirichlet boundary data under convexity-type assumptions.
Large-scale and multidimensional spatiotemporal data sets are becoming ubiquitous in many real-world applications such as monitoring urban traffic and air quality. Making predictions on these time series has become a critical challenge due to not only the large-scale and high-dimensional nature but also the considerabl…
In every point of a Kähler manifold there exist special holomorphic coordinates well adapted to the underlying geometry. Comparing these Kähler normal coordinates with the Riemannian normal coordinates defined via the exponential map we prove that their difference is a universal power series in the curvature tensor and…
tsbootstrap handles time series uncertainty without assuming independence.
problem Time series data violate IID assumptions, leading to undercoverage in traditional methods.
method Provides various resampling and bootstrap methods, including classical and adaptive conformal calibration.
result Dependence-aware methods reduce coverage deficits, with sieve resampling performing best.
Surveying machine learning methods for economic forecasting.
problem Improving accuracy of economic forecasts using machine learning.
method Nowcasting, textual data, panel and tensor data, high-dimensional Granger causality tests, time series cross-validation, classification with economic losses.
result Recent advances in machine learning methods enhance economic forecasting accuracy.
Adaptive tensor modeling preserves continuity in multidimensional data.
problem Discretization of continuous multidimensional data loses important information.
method Functional Tucker decomposition (FTD) with RKHS modeling.
result FTD enables adaptive and expressive tensor modeling.
We present an algorithm for supervised learning using tensor networks, employing a step of preprocessing the data by coarse-graining through a sequence of wavelet transformations. We represent these transformations as a set of tensor network layers identical to those in a multi-scale entanglement renormalization ansatz…
Nowadays, with the availability of massive amount of trade data collected, the dynamics of the financial markets pose both a challenge and an opportunity for high frequency traders. In order to take advantage of the rapid, subtle movement of assets in High Frequency Trading (HFT), an automatic algorithm to analyze and …
Quantum computing for option pricing using MPS states.
problem Efficiently generating time series for path-dependent options on quantum computers.
method Proposes a Matrix Product State (MPS) model for time series generation and trains it for the Heston model.
result Demonstrates the MPS model's capability to generate paths in the Heston model for path-dependent option pricing.