When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects

• URL: http://arxiv.org/abs/2608.27187v1
• Date: Thu, 27 Aug 2026 14:32:40 GMT
• Title: When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects
• Abstract summary: We introduce a controlled contrast framework that indexes potential outcomes by own treatment, temporally aggregated peer exposure, and a post-assignment evolution summary.<n>We develop the Dynamic Network Doubly Robust estimator, DynaNet-DR, which combines a temporally factorized propensity with normalized augmentation.
• Score: 1.049126606580198
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Peer effects are difficult to estimate when interaction graphs evolve because pre-assignment network history, dynamic peer exposure, and post-assignment network change have distinct causal roles. We introduce a controlled contrast framework that indexes potential outcomes by own treatment, temporally aggregated peer exposure, and a post-assignment evolution summary. Differences between the resulting means define own-treatment, peer-exposure, controlled network-evolution, and joint controlled contrasts rather than a mediation decomposition. We develop the Dynamic Network Doubly Robust estimator, DynaNet-DR, which combines a temporally factorized propensity with normalized augmentation. Under consistency, summary sufficiency, sequential exchangeability, positivity, nuisance convergence, and weak dependence, its canonical estimator is consistent when either the outcome regression or the propensity estimator is consistent. The reported implementation adds representative-score prediction, fixed clipping, and finite-sample stabilization. Semi-synthetic benchmarks on fixed real temporal graph sequences show favorable estimation accuracy among methods targeting the full profile. These benchmarks assess summary-indexed contrasts rather than counterfactual edge generation, and the MathOverflow study is an observational illustration under the stated assumptions.

Related papers

• Behavioral Latency as Weak Event-Time Supervision for EEG Reaction-Time Decoding [8.835986135254549]
  Single-trial EEG analyses are often organized around events and latencies, yet EEG-based reaction-time (RT) prediction is posed as scalar regression on a fixed stimulus-locked window.<n>Here we reformulate trial-wise RT decoding as event-time posterior modeling.<n>We evaluate this formulation on the Healthy Brain Network contrast change detection EEG task under a subject-disjoint, release-separated protocol.
  arXiv  Detail & Related papers  (2026-08-29T20:18:03Z)
• ContextShift: A Controlled Benchmark for Context Dependence in Object Detection [1.8320252176005443]
  We introduce ContextShift, a benchmark that manipulates object--context relationships while preserving object appearance.<n>We observe a consistent degradation pattern: false negatives increase by up to 227% and prediction volume decreases by up to 44%.<n>We show that context-aware augmentation improves robustness: every augmented variant outperforms the dataset-only baseline on both original and manipulated test images.
  arXiv  Detail & Related papers  (2026-06-08T13:48:16Z)
• Mask2Cause: Causal Discovery via Adjacency Constrained Causal Attention [0.13764085113103217]
  We propose an end-to-end framework that recovers the underlying causal graph directly during the forecasting forward pass.<n>We show that inferred causal structures can be used to reduce parameter count of forecasting models by more than 70% on average.
  arXiv  Detail & Related papers  (2026-05-08T05:43:47Z)
• Negative-Aware Diffusion Process for Temporal Knowledge Graph Extrapolation [16.301114199423044]
  Temporal Knowledge Graph (TKG) reasoning seeks to predict future missing facts from historical evidence.<n>Negative-Aware Diffusion model for TKG Extrapolation (NADEx)<n>NADEx encodes subject-centric histories of entities, relations and temporal intervals into sequential embeddings.
  arXiv  Detail & Related papers  (2026-02-09T15:50:56Z)
• Drift No More? Context Equilibria in Multi-Turn LLM Interactions [58.69551510148673]
  contexts drift is the gradual divergence of a model's outputs from goal-consistent behavior across turns.<n>Unlike single-turn errors, drift unfolds temporally and is poorly captured by static evaluation metrics.<n>We show that multi-turn drift can be understood as a controllable equilibrium phenomenon rather than as inevitable decay.
  arXiv  Detail & Related papers  (2025-10-09T04:48:49Z)
• Multimodal Quantitative Measures for Multiparty Behaviour Evaluation [6.709251546882382]
  We introduce a unified, intervention-driven framework for objective assessment of multiparty social behaviour in skeletal motion data.<n>We validate metric sensitivity through three theory-driven perturbations.<n>Mixed-effects analyses reveal predictable, joint-independent shifts.
  arXiv  Detail & Related papers  (2025-08-01T13:46:12Z)
• Collaborative Value Function Estimation Under Model Mismatch: A Federated Temporal Difference Analysis [55.13545823385091]
  Federated reinforcement learning (FedRL) enables collaborative learning while preserving data privacy by preventing direct data exchange between agents.<n>In real-world applications, each agent may experience slightly different transition dynamics, leading to inherent model mismatches.<n>We show that even moderate levels of information sharing significantly mitigate environment-specific errors.
  arXiv  Detail & Related papers  (2025-03-21T18:06:28Z)
• Topology-Aware Conformal Prediction for Stream Networks [68.02503121089633]
  We propose Spatio-Temporal Adaptive Conformal Inference (textttCISTA), a novel framework that integrates network topology and temporal dynamics into the conformal prediction framework.<n>Our results show that textttCISTA effectively balances prediction efficiency and coverage, outperforming existing conformal prediction methods for stream networks.
  arXiv  Detail & Related papers  (2025-03-06T21:21:15Z)
• Time-series Generation by Contrastive Imitation [87.51882102248395]
  We study a generative framework that seeks to combine the strengths of both: Motivated by a moment-matching objective to mitigate compounding error, we optimize a local (but forward-looking) transition policy. At inference, the learned policy serves as the generator for iterative sampling, and the learned energy serves as a trajectory-level measure for evaluating sample quality.
  arXiv  Detail & Related papers  (2023-11-02T16:45:25Z)
• Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks [50.2033914945157]
  We present a representation learning framework, Intensity Profile Projection, for continuous-time dynamic network data. The framework consists of three stages: estimating pairwise intensity functions, learning a projection which minimises a notion of intensity reconstruction error. Moreoever, we develop estimation theory providing tight control on the error of any estimated trajectory, indicating that the representations could even be used in quite noise-sensitive follow-on analyses.
  arXiv  Detail & Related papers  (2023-06-09T15:38:25Z)
• On the (Un-)Avoidability of Adversarial Examples [4.822598110892847]
  adversarial examples in deep learning models have caused substantial concern over their reliability. We provide a framework for determining whether a model's label change under small perturbation is justified. We prove that our adaptive data-augmentation maintains consistency of 1-nearest neighbor classification under deterministic labels.
  arXiv  Detail & Related papers  (2021-06-24T21:35:25Z)
• Consistency Guided Scene Flow Estimation [159.24395181068218]
  CGSF is a self-supervised framework for the joint reconstruction of 3D scene structure and motion from stereo video. We show that the proposed model can reliably predict disparity and scene flow in challenging imagery. It achieves better generalization than the state-of-the-art, and adapts quickly and robustly to unseen domains.
  arXiv  Detail & Related papers  (2020-06-19T17:28:07Z)

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.