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.
Graph Convolutional Reinforcement Learning improves cooperation in dynamic multi-agent environments.
problem Learning cooperation in dynamic multi-agent environments is challenging.
method Graph Convolutional Reinforcement Learning adapts to dynamic graphs and captures interplay between agents.
result Our method substantially outperforms existing methods in cooperative scenarios.
New framework IDOL identifies latent causal processes with instantaneous relations from time series data.
problem Identifying latent causal processes with instantaneous relations from time series data.
method Sparse influence constraint and variational inference architecture with sparsity regularization.
result Our method can identify latent causal processes with instantaneous relations.
Lower discount factors act as a regularizer in RL, improving performance.
problem Improving RL performance with limited data.
method Explicitly equating reduced discount factors to regularization terms.
result Regularization effectiveness depends on data properties.
A new tensor-based method for predicting temporal relationships in knowledge bases.
problem Predicting temporal relationships in evolving knowledge bases.
method Tensor decomposition of order 4 with new regularization schemes.
result Achieves state-of-the-art performance in temporal link prediction.
The Temporal Group LASSO is an example of a multi-task, regularized regression approach for the prediction of response variables that vary over time. The aim of this work is to introduce the reader to the concepts behind the Temporal Group LASSO and its related methods, as well as to the type of potential applications …
Temporal regularization improves stability in reinforcement learning.
problem High variance in reinforcement learning, especially in high-dimensional domains.
method Temporal regularization based on smoothness in value estimates over trajectories.
result Temporal regularization provides improvement even in high-dimensional Atari games.
Temporal networks are ubiquitous and evolve over time by the addition, deletion, and changing of links, nodes, and attributes. Although many relational datasets contain temporal information, the majority of existing techniques in relational learning focus on static snapshots and ignore the temporal dynamics. We propose…
A cornerstone of human statistical learning is the ability to extract temporal regularities / patterns from random sequences. Here we present a method of computing pattern time statistics with generating functions for first-order Markov trials and independent Bernoulli trials. We show that the pattern time statistics c…
Method improves clarity in forecasting spatio-temporal data.
problem Forecasting spatio-temporal data with clarity and interpretability.
method Supervised semi-nonnegative matrix factorization with frequency regularization.
result Method offers clearer interpretability in forecasting spatio-temporal data.
Proposes a time-aware attention model for CTR prediction.
problem Lack of temporal signals in existing CTR prediction models.
method Time-aware attention model with absolute and relative temporal signals, regularized adversarial sampling.
result Significantly improves CTR prediction performance.
DANR improves network regularization for spatio-temporal data.
problem Inadequate edge weights compromise network regularization.
method Discrepancy-aware network regularization (DANR) with ADMM.
result DANR achieves improved performance on various tasks.
Proposes tPARAFAC2 for tracking evolving patterns in time-evolving data.
problem Lack of temporal regularization in tensor factorizations for capturing evolving patterns.
method Temporal PARAFAC2 (tPARAFAC2) with temporal regularization.
result tPARAFAC2 accurately captures evolving patterns better than existing methods.
Algorithm learns causal structures from time-series data, reducing tests for temporal vs. contemporaneous relations.
problem Learning causal structures from time-series data with latent confounders.
method Constraint-based algorithm that refines a causal graph by learning temporal relations first, then contemporaneous ones.
result Reduces the number of statistical tests and improves accuracy for synthetic and real-world data.
Paper introduces a new cosmological volume function and its properties.
problem Introducing a new cosmological volume function.
method Introduces and analyzes the cosmological volume function τ_V, showing it's continuously differentiable.
result τ_V leads to a canonical splitting of the metric tensor and a canonical Wick-rotated Riemannian metric.
Study of convergence in Lorentzian spacetimes using temporal functions.
problem Non-compactness of spacetime isometries and convergence in semi-Riemannian settings.
method Introduced anchored convergence and used Cauchy temporal functions to define convergence for spacetimes.
result Established local and global regularity of Cauchy temporal functions and their properties.
THGFM models dynamic relational systems with cross-type and temporal fusion.
problem Learning on temporal heterogeneous graphs with diverse node and relation types.
method Dual-Path Architecture with Shared-Space and Relational Type-Partitioned Temporal Attention.
result THGFM outperforms baseline models on academic graph benchmarks.
Paper improves video categorization using temporal coherence.
problem Video categorization in multiple modalities.
method Temporal coherence-based regularization for multimodal models.
result Models with temporal coherence outperform state-of-the-art.
ATiSE embeds temporal information into KGs using time series decomposition.
problem Improving KG embedding models by incorporating temporal information.
method ATiSE uses Additive Time Series decomposition to map temporal KGs into multi-dimensional Gaussian distributions.
result ATiSE achieves state-of-the-art performance on link prediction over four temporal KGs.
Rapidly growing product lines and services require a finer-granularity forecast that considers geographic locales. However the open question remains, how to assess the quality of a spatio-temporal forecast? In this manuscript we introduce a metric to evaluate spatio-temporal forecasts. This metric is based on an Opti- …
The paper extends NSGPs with L1-regularization for sparsity and solves the resulting R-NSGP regression problem.
problem Sparsity in non-stationary temporal data.
method Developed an ADMM-based method for solving the regularized NSGP regression problem.
result The proposed methods induce sparsity in the parameters of NSGPs.
DGRCL integrates dynamic and static graph relations for financial market prediction.
problem Capturing the evolving nature of stock markets while considering both temporal changes and static relational structures.
method Dynamic Graph Representation with Contrastive Learning (DGRCL) framework, including Embedding Enhancement (EE) and Contrastive Constrained Training (CCT) modules.
result DGRCL significantly outperforms state-of-the-art TGL baselines on NASDAQ and NYSE datasets.
Stochastic networks are a plausible representation of the relational information among entities in dynamic systems such as living cells or social communities. While there is a rich literature in estimating a static or temporally invariant network from observation data, little has been done toward estimating time-varyin…
Symmetry-regularized Neural ODEs improve model stability and interpretability.
problem Improving the stability and physical interpretability of Neural ODEs.
method Integrating Lie symmetries and conservation laws into the loss function.
result Symmetry-regularized Neural ODEs enhance model stability and interpretability.
MTRGL learns temporal correlations from multi-modal data for improved pair trading.
problem Discerning temporal correlations among financial entities.
method Combines time series data and discrete features into a temporal graph, using a memory-based temporal graph neural network.
result MTRGL outperforms traditional methods in temporal graph link prediction and pair trading.
TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.
problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.
Improved TD learning with neural nets reduces sample complexity and overparameterization.
problem Temporal difference learning with neural networks in large state spaces.
method Projection-free and max-norm regularized Neural TD learning, with Lyapunov drift analysis.
result Max-norm regularization significantly improves TD learning's sample complexity and overparameterization.
Paper proposes a Hellinger distance regularizer to disentangle options in reinforcement learning.
problem Temporal abstraction in reinforcement learning, specifically the mutual exclusivity of learned options.
method Introduces a Hellinger distance regularizer to disentangle options.
result Demonstrates the effectiveness of the Hellinger distance regularizer in disentangling options.
Proposes a model to understand urban dynamics from mega-metropolises.
problem Understanding residents mobility patterns in mega-metropolises.
method Neighbor-Regularized and context-aware Non-negative Tensor Factorization (NR-cNTF).
result NR-cNTF accurately captures city rhythms and spatial communities.
Graph WaveNet models spatial-temporal graphs by learning hidden dependencies and long sequences.
problem Capturing hidden spatial dependencies and long-range temporal sequences in graphs.
method Graph WaveNet integrates adaptive dependency matrix learning and stacked dilated 1D convolution.
result Graph WaveNet outperforms existing methods on public traffic network datasets.
A new method aligns spatial and temporal data, improving on Dynamic Time Warping.
problem Comparing data over space and time, accounting for both spatial and temporal variability.
method Spatio-Temporal Alignments (STA) using regularized optimal transport (OT) and soft-DTW.
result Soft-DTW increases quadratically with time shifts, effectively handling spatio-temporal data.
A simple regularization technique speeds up training of Neural ODEs.
problem Training Neural ODEs is computationally expensive.
method Randomly sampling the end time of the ODE during training.
result Significantly decreases training time and improves performance.
A simple GI loss improves temporal generalization without complex methods.
problem Temporal drift between train and test distributions in evolving data.
method Gradient Interpolation (GI) loss to regularize temporal complexity.
result GI loss outperforms complex methods on real-world datasets.
TCR improves DNN robustness to noisy labels with minimal overhead.
problem Training on noisy labeled datasets degrades DNN generalization.
method TCR combines original labels and previous epoch predictions for regularization.
result TCR consistently enhances DNN robustness to label noise.
Taxi demand prediction is an important building block to enabling intelligent transportation systems in a smart city. An accurate prediction model can help the city pre-allocate resources to meet travel demand and to reduce empty taxis on streets which waste energy and worsen the traffic congestion. With the increasing…
Regularizes RNNs to be invariant to input order.
problem Making RNNs invariant to input order.
method Stochastic regularization to enforce permutation invariance.
result Improves model performance on permutation invariant tasks.
LEAP identifies latent causal variables from temporal data.
problem Recovering time-delayed latent causal variables from general temporal data.
method Proposes LEAP, a framework that extends VAEs with constraints for temporally causal latent processes.
result Successfully identifies temporally causal latent processes from observed variables under various dependency structures.
Recent works demonstrated the usefulness of temporal coherence to regularize supervised training or to learn invariant features with deep architectures. In particular, enforcing smooth output changes while presenting temporally-closed frames from video sequences, proved to be an effective strategy. In this paper we pro…
A model for POI recommendation using relation embedding.
problem Challenges in POI recommendation due to sparse user-POI matrix and varying context.
method Translation-based relation embedding using Knowledge Graph Embedding techniques, combined matrix factorization framework.
result Demonstrates effectiveness of the proposed model on real-world datasets.
We introduce a dynamical spatio-temporal model formalized as a recurrent neural network for forecasting time series of spatial processes, i.e. series of observations sharing temporal and spatial dependencies. The model learns these dependencies through a structured latent dynamical component, while a decoder predicts t…
SWoTTeD discovers hidden temporal patterns in EHR data.
problem Complex temporal patterns in EHR data.
method Sliding Window for Temporal Tensor Decomposition (SWoTTeD) with constraints and regularizations.
result SWoTTeD achieves at least as accurate reconstruction as state-of-the-art models and extracts meaningful temporal phenotypes.
New null distance bounds confirm Big Bang singularity in cosmological models.
problem Understanding the geometry of spacetime near Big Bang singularities.
method Developed a new null distance metric for temporal functions and applied it to cosmological models.
result Null distance is bounded by a constant multiple of Riemannian distance on level sets with constant gradient norm.
Proves globally hyperbolic spacetimes via null distance completeness.
problem No Hopf-Rinow Theorem in Lorentzian Geometry.
method Observation of null distances and their behavior with time functions.
result Proves globally hyperbolic spacetimes via null distance completeness.
Model predicts severity of traffic accidents using spatial and temporal features.
problem Estimating severity of traffic accidents in aggregated and disaggregated data.
method Gradient Boosting models and Gaussian Processes for inference and feature importance.
result Complexity of road networks and other situational features significantly impact accident severity.
Proposes a new model for more accurate demand forecasting considering dynamic contextual information.
problem Traditional methods fail to capture spatio-temporal and dynamic contextual dependencies in demand forecasting.
method Integrates temporal, relational, spatial, and dynamic contextual dependencies using a Context Integrated Graph Neural Network (CIGNN).
result CIGNN outperforms state-of-the-art baselines in multi-step ahead demand forecasting.
A new model predicts network events with improved accuracy and interpretability.
problem Predicting and understanding complex dynamic relational data in networks.
method Mutually Exciting Latent Space Hawkes (LSH) model for continuous-time networks.
result The LSH model outperforms existing models in prediction accuracy and interpretability.
MDGNN predicts stock prices by capturing multifaceted relations over time.
problem Challenges in predicting stock prices due to dynamic and intricate relations.
method MDGNN uses a discrete dynamic graph and Transformer structure to capture multifaceted relations and temporal evolution.
result MDGNN achieves the best performance in public datasets compared to SOTA methods.
Temporal VAE improves VaR estimation for financial portfolios.
problem Estimating VaR for large asset portfolios in finance.
method Temporal VAE with annealing regularization to avoid posterior collapse.
result Temporal VAE outperforms classical VaR estimation methods on real data.