New algorithm speeds up causal discovery for network data.
problem Scalability issues in score-matching for temporal network data.
method Developed a new parent-finding subroutine for DAGs, improving score matching efficiency.
result Efficiency-lifted score matching for both i.i.d. and temporal data on networks.
EventFlow forecasts event sequences without autoregression, improving accuracy.
problem Forecasting errors in autoregressive models for event sequences.
method EventFlow uses flow matching to learn joint distributions over event times directly.
result EventFlow reduces forecast error by 20%-53% compared to baselines.
A new model DKMPP integrates covariates and uses an integration-free method for spatio-temporal point processes.
problem Training intractable deep spatio-temporal point processes with multimodal covariates.
method DKMPP uses a deep kernel to model complex relationships and an integration-free score matching method.
result DKMPP and score-based estimators outperform baseline models in spatio-temporal point processes.
New probability path model improves flow matching forecasting performance.
problem Impact of probability path model selection on flow matching forecasting performance.
method Proposed a novel probability path model designed to improve forecasting performance.
result Our model achieves faster convergence during training and improved predictive performance compared to existing models.
SPF uses a hierarchical approach to efficiently emulate climate changes.
problem Slow and unstable climate emulation for long horizons.
method Spatiotemporal Pyramid Flows (SPF) model data hierarchically across spatial and temporal scales.
result SPF outperforms flow matching baselines and pre-trained models on ClimateBench.
3MSBM learns smooth trajectories from multiple snapshots.
problem Capturing long-range temporal dependencies in complex systems.
method Lifts dynamics to phase space, generalizes stochastic bridges to multi-marginal conditional problems, learns transport maps preserving intermediate marginals.
result Significantly improves convergence and scalability in capturing complex dynamics.
Accurate prediction of disease trajectories is critical for early identification and timely treatment of patients at risk. Conventional methods in survival analysis are often constrained by strong parametric assumptions and limited in their ability to learn from high-dimensional data, while existing neural network mode…
Person Re-Identification (person re-id) is a crucial task as its applications in visual surveillance and human-computer interaction. In this work, we present a novel joint Spatial and Temporal Attention Pooling Network (ASTPN) for video-based person re-identification, which enables the feature extractor to be aware of …
New analysis shows how temporal variability affects online learning performance.
problem Understanding the impact of temporal variability on online learning performance.
method Careful regret analysis and adaptive algorithm development.
result Proved a novel static regret bound that depends on temporal variability.
Paper proposes a new stock price forecasting method using DRAGAN and feature matching.
problem Capturing correlations and training instability in GANs for stock price forecasting.
method Introduces DRAGAN and feature matching for improved training stability and correlation capture.
result Proposed method outperforms LSTM and basic GANs in stock price forecasting.
New framework analyzes temporal features in state space models.
problem Understanding temporal dependencies in data streams.
method Proposes a framework for rigorous analysis of state representations in ESNs, using temporal feature spaces and kernel machines.
result Phase transition in kernel richness for cycle reservoir topology.
Proposes a deep learning framework for evaluating patient similarities from EHRs.
problem Evaluating clinical similarities between patients for various healthcare applications.
method A deep learning framework with medical concept embedding, preserving temporal information.
result Significant improvement in patient similarity evaluation over baselines.
MarketGAN generates financial returns using GANs to match empirical stylized facts.
problem Generating financial returns under data scarcity and preserving stylized facts.
method Generative adversarial learning with a TCN backbone.
result MarketGAN outperforms conventional methods in portfolio applications.
Reinforcement learning improves online matching by combining expert policies.
problem Efficient decision-making in complex systems like cloud services and marketplaces.
method Combines reinforcement learning with expert policies, using advantage-based weight updates.
result The orchestrated policy converges faster and yields higher efficiency than individual experts and conventional RL.
Libra ensures fair order-matching in electronic financial exchanges.
problem Technical shortcomings and infrastructure complexities in electronic trading.
method Formally defined temporal fairness, evaluated existing fair market designs, introduced Libra.
result Libra is more robust and resilient to technical manipulation than existing designs.
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.
Study sharp convergence rates of empirical UOT for spatio-temporal point processes.
problem Statistical analysis of UOT for spatio-temporal point processes.
method Empirical plug-in estimators for Kantorovich-Rubinstein distance between intensity measures.
result Sharp convergence rates of empirical UOT in terms of intrinsic dimensions of measures.
New algorithm optimally evaluates policies with linear approximations.
problem Policy evaluation with linear function approximation.
method Accelerated, variance-reduced fast temporal difference algorithm (VRFTD).
result VRFTD matches both deterministic and stochastic lower bounds.
In healthcare applications, temporal variables that encode movement, health status and longitudinal patient evolution are often accompanied by rich structured information such as demographics, diagnostics and medical exam data. However, current methods do not jointly optimize over structured covariates and time series …
Paper develops a classification method using matrix-variate t-distributions.
problem Classifying matrix-valued observations with dependence structure.
method Develops an Expectation-Maximization algorithm for discriminant analysis.
result Method shows promise on various datasets.
New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.
problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.
Unified framework for efficient Gaussian process inference.
problem Efficient inference in non-conjugate Gaussian process models.
method Combines expectation propagation with linearization for improved efficiency.
result Unified view of various inference schemes, including classical smoothers and EP.
New unsupervised deep learning method improves temporal resolution in tMRA.
problem Limited temporal resolution in tMRA due to fixed view-sharing scheme.
method Optimal transport driven cycle-consistent generative adversarial network (cycleGAN) without fully sampled k-space reference data.
result Can generate high quality reconstructions at various temporal resolutions.
TriTPP models enable faster and more flexible event data modeling.
problem Inflexibility and slow sampling in traditional TPP models.
method Triangular Maps and Normalizing Flows for parallel sampling and likelihood computation.
result TriTPP models achieve orders of magnitude faster sampling while maintaining flexibility.
ADD-THIN improves TPP forecasting by handling long-term data sequences.
problem Sequential limitations in autoregressive models for TPPs.
method Diffusion model for TPPs that operates on entire sequences.
result ADD-THIN outperforms state-of-the-art models in forecasting.
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.
This article addresses the issue of representing electroencephalographic (EEG) signals in an efficient way. While classical approaches use a fixed Gabor dictionary to analyze EEG signals, this article proposes a data-driven method to obtain an adapted dictionary. To reach an efficient dictionary learning, appropriate s…
We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry extensions are estimated by maximizing the log-likelihood, or an appropriately penalize…
Framework improves clinical timeline reconstruction from text and tables.
problem Temporal precision and event timing in clinical narratives and EHRs.
method Retrieval-augmented multimodal alignment framework.
result Consistently improves absolute timestamp accuracy and temporal concordance.
Novel bounds improve TD learning consistency in RL.
problem Analyzing Temporal Difference learning's performance.
method High-dimensional concentration inequalities and Berry-Esseen bounds for Markov chain induced martingales.
result Sharp high-probability consistency guarantee for TD learning, matching asymptotic variance up to logarithmic factors.
EAP clusters evolving data, promoting temporal smoothness and automatic cluster tracking.
problem Clustering time-evolving data with temporal smoothness and automatic cluster identification.
method Evolutionary Affinity Propagation (EAP) on a factor graph exchanging messages between adjacent data snapshots.
result EAP clusters data with temporal smoothness and automatically tracks clusters, outperforming existing methods.
QAM uses adjoint matching to optimize continuous-action RL policies efficiently.
problem Efficient optimization of expressive diffusion or flow-matching policies with respect to a Q-function.
method QAM leverages adjoint matching to bypass the numerical instability of backpropagation through multi-step denoising processes.
result QAM consistently outperforms prior approaches on hard, sparse reward tasks in offline and offline-to-online RL.
New models directly model inter-event times without intensity functions.
problem Learning temporal point processes with intensity-based approaches.
method Normalizing flows and mixture models for flexible and efficient modeling.
result Achieves state-of-the-art performance in prediction tasks.
Study uses complex networks and machine learning to predict soccer match outcomes.
problem Predicting soccer match outcomes with complex networks and machine learning.
method Complex network metrics and match statistics were used to build machine learning models.
result Models based on passing networks were as effective as traditional models using match statistics.
PROFET builds DBNs from ODEs, handling uncertainty in data and models.
problem Handling uncertainty in both data and models for DBN construction.
method Automatic DBN construction from ODEs, adaptive-time particle filtering.
result PROFET automates DBN construction and inference from ODE models.
RFN models urban mobility demand by separating temporal and spatial variability.
problem Aligning supply and demand in MoD systems for efficient transportation.
method Recurrent flow networks with latent variables and normalizing flows.
result RFN models explicitly disentangle temporal and spatial variability in urban mobility.
Deep learning improves weather modeling for electricity load forecasting.
problem Accurate load and renewable energy forecasting requires complex spatio-temporal weather modeling.
method Automated spatio-temporal feature extraction using deep neural networks.
result Deep learning outperforms traditional methods in French national load forecasting.
TD-Flow improves long-term predictions in agent learning.
problem Cumulative errors in step-by-step inference of future states.
method Leverages flow-matching techniques and a novel Bellman equation to learn accurate geometric horizon models.
result Significantly reduces errors at long horizons compared to prior methods.
TSFlow uses Gaussian processes to match priors for better time series forecasting.
problem Difficulties in aligning generative models' priors with time series data.
method Conditional flow matching (CFM) with Gaussian processes, optimal transport, and data-dependent priors.
result TSFlow produces high-quality unconditional samples and competitive forecasting results.
PAMA learns covariate importance for better matching in observational studies.
problem Poor performance of conventional matching methods when covariates differ in relevance.
method PAMA is a semi-supervised framework that learns covariate importance from paired data and optimizes a weighted quadratic score.
result PAMA outperforms standard methods, particularly in high-dimensional settings and under model misspecification.
Generative network integrates into ROM for PDEs, matching measurements and estimating uncertainties.
problem Predicting and quantifying uncertainties in numerical simulations of PDEs.
method Generative network (GN) integrated into a reduced-order model (ROM) framework for inverse problems.
result GN-based ROM efficiently quantifies uncertainty and matches measurements with high accuracy.
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.
TDprop uses Jacobi preconditioning to improve adaptive optimizers in Deep RL.
problem Improving performance of adaptive optimizers in Deep RL.
method TDprop computes per-parameter learning rates based on Jacobi preconditioning of the TD update rule.
result TDprop matches or exceeds Adam's performance in Deep RL experiments, suggesting Jacobi preconditioning can improve adaptive methods.
GAttNHP predicts future events in temporal knowledge graphs by encoding long-range dependencies and handling mutual excitation.
problem Forecasting future events in temporal knowledge graphs due to long-range dependencies, mutual excitation, and heavy-tailed inter-arrival times.
method GAttNHP uses a self-attention encoder, semantic soft-grouping, and NCQ regression to address these issues.
result GAttNHP improves entity and time prediction on six benchmark TKG datasets compared to state-of-the-art baselines.
Two approaches use TDA and graph theory for tennis match prediction.
problem Predicting tennis match outcomes using network features.
method Lower-star filtration on player competitive networks, Random Forest model, modified Katz similarity index.
result TDA features alone can achieve above-chance prediction in tennis match outcomes.
Proposes Deep LTMLE for estimating dynamic treatment effects in longitudinal studies.
problem Estimating counterfactual mean outcomes under dynamic treatment policies in longitudinal settings.
method Uses a transformer architecture with temporal-difference learning for initial estimation, followed by TMLE correction and statistical inference.
result Demonstrates superior performance in complex, long-term scenarios compared to existing methods.
Temporal Difference Learning analysis under non-i.i.d. data and nonlinear approximation.
problem Finite-sample behavior of TD(0) under non-i.i.d. data and nonlinear approximation.
method High-probability, finite-sample analysis of vanilla TD(0) on polynomially mixing Markov data, assuming Holder continuity and bounded generalized gradients.
result Bounds on the convergence rate of TD(0) with high probability, matching known i.i.d. rates and holding even with nonstationary initialization.
A new method aligns convolution filters for temporal sequences using Dynamic Time Warp.
problem Improving deep learning models' ability to handle temporal sequence data.
method Integrates Dynamic Time Warp algorithm into 1-D convolution layers for better alignment of input and filter.
result Exceeds or matches standard 1-D convolution layers in time series classification tasks.