惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

S
SegmentFault 最新的问题
G
Google Developers Blog
Stack Overflow Blog
Stack Overflow Blog
WordPress大学
WordPress大学
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
罗磊的独立博客
月光博客
月光博客
IT之家
IT之家
爱范儿
爱范儿
Google DeepMind News
Google DeepMind News
小众软件
小众软件
C
Check Point Blog
B
Blog RSS Feed
H
Help Net Security
博客园 - 司徒正美
L
LangChain Blog
MongoDB | Blog
MongoDB | Blog
B
Blog
The Cloudflare Blog
Apple Machine Learning Research
Apple Machine Learning Research
Microsoft Security Blog
Microsoft Security Blog
M
MIT News - Artificial intelligence
N
Netflix TechBlog - Medium
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Additive Matrix Integer-Valued Autoregressive Model
[Submitted on 29 May 2026] · 2026-05-29 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Contemporary data-driven and technology-integrated era, various matrix-valued integer-valued time series, such as cross-regional crime statistics, multi-category sales records, and network traffic matrices, exhibit high dimensionality, complex structures, and strong row-column intertwined dependencies. Although the existing matrix integer-valued autoregressive (MINAR) model provides a framework that directly handles matrix data and captures bidirectional row-column dependencies, it suffers from limited interpretability and inflexible structural representation, as its parameters often lack clear empirical meaning and the model cannot separately distinguish the effects arising from rows, columns, and lagged dynamics. To overcome these drawbacks, this paper proposes the additive matrix integer-valued autoregressive (Add-MINAR) model. By introducing an additive structure that explicitly decomposes the matrix response into row effects, column effects, and lagged effects, the proposed model not only preserves the matrix-valued nature but also significantly enhances parameter interpretability and structural flexibility. Two estimation methods, namely projection estimation and iterative conditional least squares estimation, are developed for parameter identification and inference, and their asymptotic properties, including consistency and asymptotic normality, are rigorously established. Simulation results show that the iterative conditional least squares estimator generally outperforms the projection estimator in most scenarios. Empirical analysis of Chicago crime data further demonstrates that the Add-MINAR model achieves superior in-sample fitting and out-of-sample forecasting performance compared to benchmark models such as MINAR, making it particularly suitable for practical applications with explicit row-column interaction features.

Submission history

From: Tianyun Guo [view email]
[v1] Fri, 29 May 2026 07:54:12 UTC (635 KB)