Paper tackles anomaly detection in large-scale networks.
problem Inferring network-level anomalies from indirect link measurements.
method Online subspace tracking of Hankelized traffic tensor using Candecomp/PARAFAC decomposition and RLS algorithm for normal flows; outlier detection for abnormal flows.
result Proposed algorithm achieves faster convergence and better anomaly detection performance.
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.
New model mimics neural next item recommendation using Hankel matrices.
problem Next item recommendation efficiency and structural knowledge capture.
method Tensor factorization with Hankel matrix representation.
result Model performs competitively with neural networks but is simpler.
Paper tackles tensor completion for 3D or higher exponential signals.
problem Recover N-dimensional exponential signals from limited data.
method Formulates as low-rank tensor completion problem, promotes exponential structure via Hankel matrix nuclear norm.
result Successfully recovers full signals from very limited samples.
Paper connects WFA and 2-RNNs, offering a new learning algorithm.
problem Expressiveness and learning of recurrent neural networks.
method Spectral learning algorithm for linear 2-RNNs.
result Provable learning algorithm for linear 2-RNNs.
A new method for traffic data imputation considering spatiotemporal correlations.
problem Traffic data imputation, especially for high-level missing scenarios.
method Spatiotemporal regularized Tucker decomposition approach.
result The proposed method outperforms existing methods on real-world traffic datasets.
New model fills in missing traffic data efficiently.
problem Missing data in large-scale spatiotemporal traffic data.
method Developed scalable tensor learning model LSTC-Tubal for imputation.
result LSTC-Tubal achieves high accuracy with lower computational cost.
New method improves traffic data recovery for streaming data.
problem Improve data quality in traffic data for ITS.
method Online robust tensor recovery algorithm leveraging spatio-temporal correlations and local consistency.
result Significantly improved computational efficiency and high recovery accuracy.
NCPF model improves traffic data imputation with neural and tensor methods.
problem Pervasive missing data in traffic analysis due to sensor failures and gaps.
method Neural Canonical Polyadic Factorization (NCPF) integrating CP decomposition and deep learning.
result NCPF outperforms state-of-the-art baselines in urban traffic datasets.
Paper proposes a new model for imputing missing spatiotemporal traffic data.
problem Missing data and sparsity in spatiotemporal traffic data.
method Low-rank tensor completion (LRTC) framework with truncated nuclear norm (TNN).
result The proposed model outperforms state-of-the-art imputation models in various scenarios.
RTC-GTNLN model recovers traffic data from missing values and noise.
problem Simultaneous missing data and noise in traffic data.
method Gradient tensor nuclear L1-L2 norm for robust tensor completion.
result RTC-GTNLN model outperforms existing methods in complex recovery scenarios.
HSNLD solves robust Hankel recovery efficiently and robustly.
problem Robust Hankel recovery of sparse outliers and missing entries.
method Hankel Structured Newton-Like Descent (HSNLD) algorithm.
result HSNLD achieves linear convergence independent of the condition number.
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.
Paper proposes a new tensor imputation method for spatiotemporal traffic data with missing patterns.
problem Imputation of corrupted or incomplete traffic data.
method Truncated tensor Schatten p-norm (TSpN) for spatiotemporal traffic data imputation.
result The proposed method outperforms other state-of-the-art tensor-based imputation models in various missing cases.
An algorithm finds a compact Hankel submatrix for spectral learning.
problem Efficiently computing SVD for large Hankel matrices in spectral learning.
method Maximal bipartite matching algorithm to select rows and columns of Hankel matrix.
result Compact Hankel submatrix with full structural rank.
The paper tackles system identification via Hankel nuclear norm regularization, improving estimation rates and singular value gaps.
problem Identifying low-order linear systems from limited data.
method Hankel nuclear norm regularization to encourage low-rankness of the Hankel matrix.
result Hankel regularization enables optimal system recovery with fewer observations and better estimation rates.
The paper reviews Hankel low-rank methods for time series analysis and forecasting.
problem Developing efficient methods for time series analysis and forecasting.
method Hankel low-rank approximation and completion techniques.
result Discussion of methods and challenges in obtaining optimal solutions.
This paper tackles efficient cooperative control for large-scale traffic signals using tensor-based deep learning.
problem Efficient training and control for large-scale multi-intersection traffic signals.
method Tensor representation, multi-task learning, imitation learning, proximal policy optimization.
result The proposed model achieves better performance compared to existing methods.
Spectral regularization simplifies sequence models by focusing on grammatical simplicity.
problem Sequence modeling challenges in learning tasks.
method Introduces spectral regularization based on Hankel matrices and trace norm, addressing bi-infinite matrices with an unbiased estimator.
result Demonstrates spectral regularization's potential benefits on Tomita grammars.
New method improves traffic speed estimation from sparse data.
problem Incomplete and noisy traffic speed data from sparse sensors.
method Laplacian-enhanced low-rank tensor kriging (LETC) framework.
result LETC achieves state-of-the-art kriging performance under low observation rates.
Deep learning improves MRI image reconstruction from sparse k-space data.
problem Accelerated MRI imaging with limited k-space data.
method Data-driven deep learning using convolutional neural networks and Hankel matrix decomposition.
result Deep learning consistently outperforms existing image-domain methods in k-space MRI reconstruction.
HOPE improves SSMs for long-memory tasks with robust initialization and training.
problem Improving state-space models for long-memory tasks with robust initialization and training.
method Developed a new parameterization scheme called HOPE using Hankel operators and Markov parameters.
result HOPE improves SSMs' performance on Long-Range Arena tasks and demonstrates non-decaying memory.
Bayesian model identifies outliers and determines tensor rank in streaming data.
problem Outliers and over-fitting in streaming tensor factorization.
method Variational Bayesian Inference for robust tensor rank determination and outlier identification.
result Model accurately identifies sparse outliers and determines tensor rank.
New method controls linear systems with adversarial disturbances.
problem Controlling linear dynamical systems under adversarial conditions.
method Novel convex relaxation using spectral filters from Hankel matrix eigenvectors.
result Polylogarithmic running time improvement over prior methods.
The paper tackles estimation of hidden state LTI systems of unknown order.
problem Estimation of Markov parameters and minimal realization of unknown order LTI systems.
method Hankel penalized least square estimator, Ho-Kalman algorithm, and a combined algorithm.
result Statistical guarantees for estimation error, rank recovery, and sample complexity.
Study of curves in n-space using singular value decomposition and Hankel determinants.
problem Understanding the geometry of curves in n-dimensional space.
method Using singular value decomposition and Hankel determinants, the paper analyzes the Frenet-Serret apparatus and curvature values of parametric curves.
result The curvature values of a curve can be expressed as a ratio of local singular values, providing a fixed multiple of a ratio of local singular values.
Noise-robust Koopman operator framework for control with improved stability and performance.
problem Developing a stable and noise-robust Koopman operator for control tasks.
method Proposes a learning framework using Hankel matrix and neural network approximations for system dynamics, ensuring long-term stability and noise robustness.
result Demonstrates improved model performance and noise robustness in control tasks compared to existing methods.
New nonconvex methods improve SysID efficiency and accuracy.
problem Efficiently identify low-order linear systems from limited data.
method Proposes two nonconvex reformulations of Hankel-rank minimization for SysID.
result Nonconvex methods achieve lower statistical error rates and sample complexities.
Paper tackles missing value imputation in time series forecasting.
problem Missing value imputation in time series analysis.
method Low-rank matrix completion with Hankel matrices and nuclear norm relaxation.
result Proper weighting scheme is crucial for known observations.
Paper speeds up GP inference by reducing precision matrix computation.
problem High computational complexity in computing kernel precision matrices.
method Splitting precision matrix into Hankel-Toeplitz matrices and computing only unique entries.
result Precision matrix computation reduced from O(NM2) to O(NM). Novel factorization for low-rank matrices in subspaces, improving efficiency.
problem Learning low-rank matrices constrained to subspaces.
method Riemannian manifold optimization with conjugate gradient and trust-region algorithms.
result Efficient algorithms for structured low-rank matrix learning.
Online tensor subspace tracking algorithm for incomplete data.
problem Online subspace tracking of partially observed high-dimensional data.
method OLSTEC algorithm based on CP decomposition and recursive least squares.
result OLSTEC outperforms state-of-the-art algorithms in convergence rate.
This paper proposes a method to select bases for spectral learning of PSRs using model entropy.
problem Learning PSR models with limited data and computational resources.
method Adopting model entropy to select columns for spectral learning of PSRs.
result The proposed method can effectively select bases for spectral learning of PSRs.
Constructs new topological theories in 2D not fitting standard axioms.
problem Developing new topological theories in 2D that don't conform to traditional axioms.
method Universal construction by Blanchet et al., Kronecker's characterization, field extension, Hankel matrices, Schur polynomials, and foam evaluation.
result Introduction of non-multiplicative theories and classification over finite-dimensional state spaces.
Unified model for tensor completion using low-rank and sparse Tucker decomposition.
problem Estimating missing data from incomplete tensor measurements.
method Unified low-rank and sparse enhanced Tucker decomposition model with ADMM.
result Our model achieves higher recovery accuracy on various real-world data sets.
Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.
problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.
Paper introduces a new web robot traffic generator.
problem Lack of realistic web robot traffic generators.
method Statistical and Bayesian models fitted to robot traffic data.
result Generated traffic mimics real robot traffic characteristics.
Project aims to reduce traffic congestion in Singapore using CNNs.
problem Traffic congestion in Singapore.
method Convolutional Neural Networks (CNNs) for traffic density estimation; traffic signal control algorithms.
result CNNs effectively estimate traffic density from images, leading to improved traffic control.
Deep learning framework predicts traffic patterns on road networks.
problem Challenges in spatiotemporal traffic forecasting.
method Proposes TGC-LSTM, a graph convolutional LSTM neural network.
result Outperforms baseline methods in real-world traffic datasets.
TM-CNN predicts lane-level traffic speeds considering volume impact.
problem Aggregated lane-level traffic speed prediction and volume impact.
method Two-stream multi-channel CNN, data conversion, two-stream deep neural network, loss function.
result TM-CNN outperforms existing models in multi-lane traffic speed prediction.
T-GCN predicts traffic using neural networks for spatial and temporal data.
problem Accurate real-time traffic forecasting in urban networks.
method Combines GCN for spatial and GRU for temporal data analysis.
result T-GCN outperforms state-of-the-art baselines on real-world traffic datasets.
Model predicts traffic incident duration and identifies key features.
problem Predict traffic incident duration and identify critical features.
method Multi-task learning framework with sparsity optimization and ADMM algorithm.
result Model predicts incident duration and identifies key features effectively.
Model predicts traffic speed using urban incidents.
problem Accurately predicting traffic speed in urban areas.
method Deep Incident-Aware Graph Convolutional Network (DIGC-Net).
result Model outperforms competing benchmarks in traffic speed prediction.
A k-space deep learning method corrects EPI ghost artifacts without a reference scan.
problem Nyquist ghost artifacts in EPI MRI due to phase mismatch between even and odd echoes.
method Structured low-rank Hankel matrix approaches combined with data-driven Hankel matrix decomposition and deep convolutional neural networks.
result The proposed k-space deep learning method outperforms existing methods in image quality and computing time.
Deep neural network reconstructs traffic speeds from sparse vehicle data.
problem Reconstructing traffic speeds from limited probe vehicle data.
method Convolutional neural network architecture for spatio-temporal learning.
result The method can reconstruct traffic speeds with low probe vehicle penetration.
A scoring method for driving safety using trajectory data.
problem Managing traffic safety through driver behaviors and violations.
method Extract driving habits and violations from trajectories, train a model, score drivers.
result Proves the effectiveness of the scoring method using traffic simulation.
STGCN uses deep learning to forecast traffic, capturing spatial and temporal dependencies.
problem Accurate traffic forecasting for urban control and guidance.
method Spatio-Temporal Graph Convolutional Networks (STGCN) on graphs with complete convolutional structures.
result STGCN outperforms state-of-the-art baselines on various real-world traffic datasets.
The paper studies the problem of recovering a spectrally sparse object from a small number of time domain samples. Specifically, the object of interest with ambient dimension n is assumed to be a mixture of r complex multi-dimensional sinusoids, while the underlying frequencies can assume any value in the unit disk…