MOSAIC: Minimax-Optimal Sparsity-Adaptive Inference for Change Points in Dynamic Networks

• URL: http://arxiv.org/abs/2509.06303v1
• Date: Mon, 08 Sep 2025 03:09:50 GMT
• Title: MOSAIC: Minimax-Optimal Sparsity-Adaptive Inference for Change Points in Dynamic Networks
• Abstract summary: We propose a new inference framework, named MOSAIC, for change-point detection in dynamic networks.<n>We establish the minimax rate of detection boundary, which relies on the sparsity of changes.<n>We develop an eigen-decomposition-based test with screened signals that approaches the minimax rate in theory, with only a minor logarithmic loss.
• Score: 11.200971045515763
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new inference framework, named MOSAIC, for change-point detection in dynamic networks with the simultaneous low-rank and sparse-change structure. We establish the minimax rate of detection boundary, which relies on the sparsity of changes. We then develop an eigen-decomposition-based test with screened signals that approaches the minimax rate in theory, with only a minor logarithmic loss. For practical implementation of MOSAIC, we adjust the theoretical test by a novel residual-based technique, resulting in a pivotal statistic that converges to a standard normal distribution via the martingale central limit theorem under the null hypothesis and achieves full power under the alternative hypothesis. We also analyze the minimax rate of testing boundary for dynamic networks without the low-rank structure, which almost aligns with the results in high-dimensional mean-vector change-point inference. We showcase the effectiveness of MOSAIC and verify our theoretical results with several simulation examples and a real data application.

Related papers

• Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activations [13.626248090879235]
  This paper establishes a theoretical framework for the uniform convergence of smoothly activated deep neural network (DNN) estimators.<n>We prove that smooth DNNs can mitigate the curse of dimensionality in uniform convergence by adaptively exploiting the low-dimensional hierarchical composition structure of the target function.
  arXiv  Detail & Related papers  (2026-06-04T02:24:50Z)
• Rethinking Entropy Minimization in Test-Time Adaptation for Autoregressive Models [52.18157855348584]
  Test-Time Adaptation (TTA) via entropy minimization (EM) has proven effective for classification tasks, yet its application remains theoretically fragmented.<n>In this work, we deriving a rigorous formulation of EM tailored to autoregressive models.<n>We show that the exact objective naturally decomposes into a token-level policy gradient loss and a token-level entropy loss, and we reinterpret prior methods as partial realizations of this unified formulation.<n>Using Whisper ASR as a testbed, we demonstrate that our approach consistently improves performance across more than 20 diverse domains, including acoustic noise, accents, and multilingual settings.
  arXiv  Detail & Related papers  (2026-05-05T12:00:06Z)
• From Arithmetic to Logic: The Resilience of Logic and Lookup-Based Neural Networks Under Parameter Bit-Flips [0.6868507883617846]
  In this work, we study resilience as a structural property of neural architectures.<n>We show that lower precision, higher sparsity, bounded activations, and shallow depth are consistently favored.<n>We identify a novel even-layer recovery effect unique to logic-based architectures.
  arXiv  Detail & Related papers  (2026-03-24T03:53:04Z)
• Maximum entropy based testing in network models: ERGMs and constrained optimization [1.9116784879310027]
  We develop a constrained entropy-maximization problem on the space of networks.<n>The resulting test statistics are defined through the Lagrange multipliers associated with the constrained optimization problem.<n>We show that the proposed Lagrange-multiplier framework connects naturally to classical score tests for constrained maximum likelihood estimation.
  arXiv  Detail & Related papers  (2026-02-24T12:35:08Z)
• Approximate Multiplier Induced Error Propagation in Deep Neural Networks [0.9099663022952496]
  This work presents an analytical framework that connects the statistical error moments of an AxM to the induced distortion in General Matrix multiplication.<n>By providing a lightweight alternative to behavioral or hardware level simulations, this framework enables rapid estimation of AxM impact on Deep Neural Networks (DNNs) inference quality.
  arXiv  Detail & Related papers  (2025-12-06T19:05:17Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• A neural network approach for solving the Monge-Ampère equation with transport boundary condition [0.0]
  This paper introduces a novel neural network-based approach to solving the Monge-Ampere equation with the transport boundary condition. We leverage multilayer perceptron networks to learn approximate solutions by minimizing a loss function that encompasses the equation's residual, boundary conditions, and convexity constraints.
  arXiv  Detail & Related papers  (2024-10-25T11:54:00Z)
• Ensemble Kalman Filtering Meets Gaussian Process SSM for Non-Mean-Field and Online Inference [47.460898983429374]
  We introduce an ensemble Kalman filter (EnKF) into the non-mean-field (NMF) variational inference framework to approximate the posterior distribution of the latent states. This novel marriage between EnKF and GPSSM not only eliminates the need for extensive parameterization in learning variational distributions, but also enables an interpretable, closed-form approximation of the evidence lower bound (ELBO) We demonstrate that the resulting EnKF-aided online algorithm embodies a principled objective function by ensuring data-fitting accuracy while incorporating model regularizations to mitigate overfitting.
  arXiv  Detail & Related papers  (2023-12-10T15:22:30Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• Structured Optimal Variational Inference for Dynamic Latent Space Models [16.531262817315696]
  We consider a latent space model for dynamic networks, where our objective is to estimate the pairwise inner products plus the intercept of the latent positions. To balance posterior inference and computational scalability, we consider a structured mean-field variational inference framework.
  arXiv  Detail & Related papers  (2022-09-29T22:10:42Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• Revisit Geophysical Imaging in A New View of Physics-informed Generative Adversarial Learning [2.12121796606941]
  Full waveform inversion produces high-resolution subsurface models. FWI with least-squares function suffers from many drawbacks such as the local-minima problem. Recent works relying on partial differential equations and neural networks show promising performance for two-dimensional FWI. We propose an unsupervised learning paradigm that integrates wave equation with a discriminate network to accurately estimate the physically consistent models.
  arXiv  Detail & Related papers  (2021-09-23T15:54:40Z)
• Local AdaGrad-Type Algorithm for Stochastic Convex-Concave Minimax Problems [80.46370778277186]
  Large scale convex-concave minimax problems arise in numerous applications, including game theory, robust training, and training of generative adversarial networks. We develop a communication-efficient distributed extragrad algorithm, LocalAdaSient, with an adaptive learning rate suitable for solving convex-concave minimax problem in the. Server model. We demonstrate its efficacy through several experiments in both the homogeneous and heterogeneous settings.
  arXiv  Detail & Related papers  (2021-06-18T09:42:05Z)
• Optimal Sampling Density for Nonparametric Regression [5.3219212985943924]
  We propose a novel active learning strategy for regression, which is model-agnostic, robust against model mismatch, and interpretable. We adopt the mean integrated error (MISE) as a generalization criterion, and use the behavior of the MISE as well as thelocally optimal bandwidths. The almost model-free nature of our approach should encode raw properties of the target problem, and thus provide a robust and model-agnostic active learning strategy.
  arXiv  Detail & Related papers  (2021-05-25T14:52:17Z)
• An Ode to an ODE [78.97367880223254]
  We present a new paradigm for Neural ODE algorithms, called ODEtoODE, where time-dependent parameters of the main flow evolve according to a matrix flow on the group O(d) This nested system of two flows provides stability and effectiveness of training and provably solves the gradient vanishing-explosion problem.
  arXiv  Detail & Related papers  (2020-06-19T22:05:19Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)
• On the Principle of Least Symmetry Breaking in Shallow ReLU Models [13.760721677322072]
  We show that the emphleast loss of symmetry with respect to the target weights may apply to a broader range of settings. Motivated by this, we conduct a series of experiments which corroborate this hypothesis for different classes of non-isotropic non-product distributions, smooth activation functions and networks with a few layers.
  arXiv  Detail & Related papers  (2019-12-26T22:04:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.