In this article, existence results concerning temporal functions with additional properties on a globally hyperbolic manifold are obtained. These properties are certain bounds on geometric quantities as lapse and shift. The results are linked to completeness properties and the existence of closed isometric embeddings i…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Temporal properties”
The Temporal Dimension of Riskq-fin.PM
Multi-period measures of risk account for the path that the value of an investment portfolio takes. In the context of probabilistic risk measures, the focus has traditionally been on the magnitude of investment loss and not on the dimension associated with the passage of time. In this paper, the concept of temporal pat…
TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.
problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.
Detects malicious accounts in permissionless blockchains using graph properties and ML.
problem Identifying and classifying malicious accounts in permissionless blockchains.
method Temporal graph properties, ML algorithms (ExtraTreesClassifier, K-Means), cosine similarity, behavior change analysis.
result ExtraTreesClassifier performs best in detecting malicious accounts on Ethereum blockchain.
Efficient Hierarchical Bayesian Inference for Spatio-temporal Regression Models in Neuroimagingstat.ML
Novel Bayesian framework for spatio-temporal neuroimaging data.
problem Inference on multi-task sparse hierarchical regression models with complex spatio-temporal dynamics.
method Flexible hierarchical Bayesian framework with Kronecker product covariance structure, majorization-minimization optimization, and Riemannian geometry.
result Improved performance on synthetic and real M/EEG data.
IMPaCT improves node classification in chronological split temporal graphs.
problem Domain adaptation challenges in graph data due to chronological splits.
method IMPaCT proposes a method to impose invariant properties based on realistic assumptions derived from temporal graph structures.
result IMPaCT achieves a 3.8% performance improvement over current SOTA method on the ogbn-mag graph dataset.
Stock market as temporal networkq-fin.ST
Financial networks have become extremely useful in characterizing the structure of complex financial systems. Meanwhile, the time evolution property of the stock markets can be described by temporal networks. We utilize the temporal network framework to characterize the time-evolving correlation-based networks of stock…
Identifiability Without Gaussianity: Symbolic World Models and Near-Infinite Temporal Consistencystat.ML
Symbolic grounding in causal dynamics achieves near-infinite temporal consistency.
problem Achieving linear identifiability in non-Gaussian physical systems.
method Physics-Grounded Symbolic Architecture (PGSA)
result PGSA achieves exact linear identifiability for all physical regimes.
A central area of research in nonlinear science is the study of instabilities that drive the emergence of extreme events. Unfortunately, experimental techniques for measuring such phenomena often provide only partial characterization. For example, real-time studies of instabilities in nonlinear fibre optics frequently …
New framework for unbiased sampling of temporal networks.
problem Challenges in analyzing and modeling large, continuous temporal networks.
method General framework for unbiased temporal network sampling with online, single-pass algorithms and unbiased estimators.
result Effective algorithms for fast, accurate, and memory-efficient statistical estimation of temporal network patterns and properties.
The paper develops a new model to evaluate policies in complex temporal/spatial experiments.
problem Evaluating the impact of policies in experiments with temporal and spatial dependencies.
method Temporal/spatio-temporal Varying Coefficient Decision Process (VCDP) model, decomposing ATE into DE and IE.
result Effective estimation and inference of DE and IE with rigorous statistical analysis.
We model GitHub interactions as a temporal knowledge graph for software engineering questions.
problem Insufficient performance of existing temporal models on extrapolated queries and time prediction.
method Introduced an extension to current temporal models using relative temporal information.
result Improved performance on extrapolated queries and time prediction.
MRIF models dynamic user interests at multiple temporal-ranges.
problem Capturing dynamic and multi-resolution user interests in recommendation.
method Multi-resolution Interest Fusion (MRIF) model that considers both temporal-ranges and drifts in user interests.
result MRIF outperforms state-of-the-art recommendation methods consistently.
Efficient spatio-temporal Gaussian process inference method.
problem Scalable Gaussian process inference for multivariate, spatio-temporal data.
method Combines spatio-temporal filtering with natural gradient variational inference, resulting in a scalable non-conjugate GP method.
result Linear scaling with respect to time and logarithmic scaling with respect to time steps.
New method clusters evolving networks using spatio-temporal graph Laplacian.
problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.
The spatio-temporal graph learning is becoming an increasingly important object of graph study. Many application domains involve highly dynamic graphs where temporal information is crucial, e.g. traffic networks and financial transaction graphs. Despite the constant progress made on learning structured data, there is s…
New training algorithm enhances SNNs for temporal signal processing.
problem Lack of robust training algorithms for large-scale SNNs.
method Formulated SNN as IIR filters, proposed training algorithm for optimal synapse filter kernels and weights.
result Model and training algorithm outperform state-of-the-art approaches in accuracy.
We analyzed multifractal properties of 5-minute stock returns from a period of over two years for 100 highly capitalized American companies. The two sources: fat-tailed probability distributions and nonlinear temporal correlations, vitally contribute to the observed multifractal dynamics of the returns. For majority of…
Paper generalizes reward distribution in multi-armed bandits with temporally-partitioned rewards.
problem Handling partial rewards distributed over multiple rounds in multi-armed bandits.
method Introduces Beta-spread property to generalize reward distribution, derives lower bound, and provides TP-UCB-FR-G algorithm.
result Improves regret upper bound for some scenarios using Beta-spread property.
This letter extends the concept of graph-frequency to graph signals that evolve with time. Our goal is to generalize and, in fact, unify the familiar concepts from time- and graph-frequency analysis. To this end, we study a joint temporal and graph Fourier transform (JFT) and demonstrate its attractive properties. We b…
Study on 3D surfaces and tangles formed by Poncelet triangles.
problem Geometric and topological properties of 3D surfaces and tangles.
method Exploration of Poncelet triangles and associated points.
result Properties of 3D surfaces and tangles formed by Poncelet triangles.
We consider the estimation of large covariance and precision matrices from high-dimensional sub-Gaussian or heavier-tailed observations with slowly decaying temporal dependence. The temporal dependence is allowed to be long-range so with longer memory than those considered in the current literature. We show that severa…
TSAM predicts directed temporal links using GCN and self-attention.
problem Predicting links in directed temporal networks.
method GCN, self-attention mechanism, autoencoder architecture, graph attentional layers, graph convolutional layers, graph recurrent unit layer.
result TSAM outperforms benchmarks on four realistic networks.
Temporal Pattern Mining (TPM) is the problem of mining predictive complex temporal patterns from multivariate time series in a supervised setting. We develop a new method called the Fast Temporal Pattern Mining with Extended Vertical Lists. This method utilizes an extension of the Apriori property which requires a more…
Develops a learning algorithm for PSL formulas from examples.
problem Learning human-interpretable descriptions of complex systems from examples.
method Reduces learning to propositional logic constraint satisfaction and uses SAT solver.
result Proposed method provides succinct human-interpretable descriptions from examples.
Two autoencoding models learn latent traffic scene representations.
problem Learning latent representations of traffic scenarios.
method CNN and RNN models for spatio-temporal and temporal data, incorporating permutation invariance.
result Latent scenario embeddings can be used for clustering and similarity retrieval.
Recent studies have highlighted adversarial examples as a ubiquitous threat to different neural network models and many downstream applications. Nonetheless, as unique data properties have inspired distinct and powerful learning principles, this paper aims to explore their potentials towards mitigating adversarial inpu…
TMTF improves time series visualization by separating dynamic regimes.
problem Misleading global transition matrix in time series analysis.
method Temporal chunking, local transition matrices, and image assembly.
result Temporal segmentation reveals distinct transition dynamics.
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.
New protocol evaluates synthetic data for temporal consistency.
problem Synthetic data generators can produce invalid timestamps and trajectories.
method Characterize datasets by four properties, then measure timestamp validity and dynamics.
result Temporal fidelity must be measured, not inferred from static data.
New method generates plausible counterfactuals for time series classification.
problem Generating realistic counterfactuals for time series data.
method Gradient-based optimization with soft-DTW alignment and multi-faceted loss function.
result Our method outperforms existing approaches in temporal realism and distributional alignment.
Comparing data defined over space and time is notoriously hard, because it involves quantifying both spatial and temporal variability, while at the same time taking into account the chronological structure of data. Dynamic Time Warping (DTW) computes an optimal alignment between time series in agreement with the chrono…
Probabilistic Temporal Tensor Factorization (PTTF) is an effective algorithm to model the temporal tensor data. It leverages a time constraint to capture the evolving properties of tensor data. Nowadays the exploding dataset demands a large scale PTTF analysis, and a parallel solution is critical to accommodate the tre…
Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learningstat.ML
We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally correlated. Existing algorithms do not consider such temporal correlations and thus their performance degrades significantly with the correlations. I…
The study formalizes temporal precision and recall for anomaly detection in sequences.
problem Insufficient understanding of precision and recall in sequential anomaly detection.
method Formalized temporal precision and recall measures, developed time-tolerant confusion matrices, and demonstrated statistical significance.
result Precision and recall may overestimate performance with temporal tolerance.
Deep learning model improves seismic rock property estimation.
problem Estimating reservoir rock properties from seismic reflection data.
method Proposes a deep learning-based seismic inversion workflow that models seismic traces spatiotemporally.
result Achieves best performance on SEAM dataset with coefficient of 79.77\%
Model integrates multi-view temporal data for better understanding of latent dynamics.
problem Understanding time-dependent heterogeneous properties from multi-view data.
method Generative model using variational autoencoder and recurrent neural network.
result Identifies disentangled latent embeddings across views while accounting for time factor.
Proposes MSTD-RCNN for improved financial time-series classification.
problem Combining Multi-Scale and Temporal Dependency for better financial time-series classification.
method Multi-Scale Temporal Dependent Recurrent Convolutional Neural Network (MSTD-RCNN).
result Achieves state-of-the-art performance in trend classification and simulated trading.
ESPRESSO: Entropy and ShaPe awaRe timE-Series SegmentatiOn for processing heterogeneous sensor datacs.LG
ESPRESSO segments time-series data for better human activity recognition.
problem Segmenting high-dimensional time-series data for applications like HAR.
method ESPRESSO combines entropy and shape analysis for multi-dimensional time-series segmentation.
result ESPRESSO outperforms four state-of-the-art methods across seven datasets.
dCMF models evolving patterns in multiway data with temporal dynamics.
problem Capturing evolving patterns in multiway datasets with temporal dependencies.
method Time-aware coupled factorization model constrained by LDS structure.
result dCMF outperforms alternatives in capturing complex dynamics.
Network embedding aims to embed nodes into a low-dimensional space, while capturing the network structures and properties. Although quite a few promising network embedding methods have been proposed, most of them focus on static networks. In fact, temporal networks, which usually evolve over time in terms of microscopi…
The analysis of temporal networks has a wide area of applications in a world of technological advances. An important aspect of temporal network analysis is the discovery of community structures. Real data networks are often very large and the communities are observed to have a hierarchical structure referred to as mult…
Combines pseudo-point and state space approximations for scalable GPs.
problem Handling large numbers of off-the-grid spatial data-points and long time-series.
method Combines pseudo-point approximations for spatial data with state space GP approximations for temporal data.
result Combined approach is more scalable and applicable to a greater range of spatio-temporal problems.
TTERGM models improve social network predictions by incorporating triadic relationships.
problem Lack of models capturing triadic relationships and social learning theories in temporal network data.
method Introduced TTERGM, a generative model that includes triadic relationships and social learning theory as additional probability distributions. Parameters are estimated via Monte Carlo maximum likelihood.
result TTERGM achieves improved accuracy and fidelity compared to existing models on social network data.
We propose a novel model for temporal detection and localization which allows the training of deep neural networks using only counts of event occurrences as training labels. This powerful weakly-supervised framework alleviates the burden of the imprecise and time-consuming process of annotating event locations in tempo…
Analyzing the temporal behavior of nodes in time-varying graphs is useful for many applications such as targeted advertising, community evolution and outlier detection. In this paper, we present a novel approach, STWalk, for learning trajectory representations of nodes in temporal graphs. The proposed framework makes u…
Ultralow-dimensionality reduction for identifying critical transitions by spatial-temporal PCAstat.ML
A new method identifies critical transitions in high-dimensional data.
problem Challenges in identifying critical transitions in high-dimensional time-series data.
method Spatial-temporal Principal Component Analysis (stPCA)
result Identifies tipping points before critical transitions reliably.
New algorithms for collaborative reinforcement learning with limited communication.
problem Efficiently learning value functions in multi-agent systems with strict information constraints.
method Distributed gradient-based temporal difference algorithms with consensus schemes.
result Parameter estimates converge to ODEs with defined invariant sets under general assumptions.