Search arXiv⌕ Search

arXiv · 2608.29882

Spillover Effects under Network Interference When Neighbours' Treatment Effects Are Heterogeneous

Abstract

Optimising budget-constrained network interventions requires evaluating not just who is connected, but predicting how strongly individual recipients will propagate the treatment's benefits. Existing models predict spillover from neighbours' treatments and attributes. We argue that spillover also depends on how strongly each neighbour responded to its own treatment. We prove that no model in which neighbours' responsiveness enters separately from their treatments can capture this interaction, and we introduce \textsc{SpilloverNet}, a graph neural network designed to preserve neighbour-level response dynamics. Because a neighbour's response is unobserved, a natural approach is to estimate it from covariates and plug it in. However, we prove that any predictor relying solely on standard network data faces an irreducible error floor set by unobserved personal responsiveness. Empirically, at low heterogeneity the plug-in's correlation with the true response looks acceptable while its spillover error is already 24.5\% against an oracle 13.8\%; as heterogeneity grows its error climbs to 51.9\%, worse than using no responsiveness estimate at all. A per-unit estimate from a direct-response measurement, collected in a small pilot before spillover arrives, escapes this bound and cuts regret against oracle-$τ$ targeting by up to 14 percentage points in a budgeted targeting problem. On two real social graphs, \textsc{SpilloverNet} reaches 7.7--8.4\% error, outperforming standard GNNs as well as specialised causal-representation baselines.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Faezeh Dehghan Tarzjani, Bhaskar Krishnamachari. 2026-09-08. Spillover Effects under Network Interference When Neighbours' Treatment Effects Are Heterogeneous. https://arxiv.org/abs/2608.29882

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Centering Drives Normalization Gains: Price-Offset Nuisances in Cross-Sectional Return Prediction

Cross-sectional return prediction from raw intraday bars is sensitive to each instrument price level, an additive nuisance under a return-ranking hypothesis. We test whether removing this offset, rather than rescaling amplitudes or changing the encoder, explains gains on a point-in-time CSI~300 five-minute panel. We evaluate eight parameter-matched encoders with and without RevIN normalization; a parameter-free ladder then separates identity, scale-only, centering, last-value referencing, differencing, and standardization across all fields and restricted channels. Centering drives the reliable effect, while scale-only normalization does not help. All eight paired effects are positive and survive Holm correction on raw rank IC, after style residualization, and after further residualizing on short-term reversal. Among six stronger encoders, gains of 0.0376-0.0567 exceed the 0.0109 spread of normalized IC (0.0830-0.0939). Price-only standardization retains 93--101% of the all-field gain. These results place the main effect in transformed price-channel offset removal rather than amplitude scaling or encoder choice.

cs.CE↗

TERRA-NG v1.0: Extreme-Scale, GPU-accelerated Mantle Convection

We present TERRA-NG, a portable, GPU-accelerated, matrix-free mantle-convection code. A single Kokkos C++ implementation runs at scale on NVIDIA, AMD, and Intel GPU supercomputers. TERRA-NG has a deliberately narrow design: built on a radially extruded mesh of spherical wedges, tailored to the spherical shell geometry, which enables domain-specific optimizations like single quadrature-point integral-evaluations, radial coordinate storage compression and radial shared-memory tiling. The corresponding low-order $W_1$-iso-$W_2/W_1$ wedge-based Stokes--energy discretisation is verified against the Zhong et al.(2008) spherical-shell convection benchmark suite. We showcase TERRA-NG through strong- and weak-scaling on the JUWELS Booster (NVIDIA A100), MareNostrum 5 (NVIDIA H100), LUMI-G (AMD MI250X), Hunter (AMD MI300A APU), and SuperMUC-NG Phase 2 (Intel PVC) supercomputers. Coupled mantle convection simulations at $\sim\!11$ km and $\sim\!5.6$ km radial spacing ($\sim 2.8$ B and $\sim 22$ B DoFs) can be run routinely on standard node partitions of all considered systems. Global $\sim\!1$ km-per-gridpoint mantle convection ($\sim 1.4$ T DoFs) is feasible on an extreme-scale allocation, and a sub-km hero-run at $\sim\!0.7$ km grid spacing scaling up to $\sim 11,000$ GPUs of LUMI-G ($\sim 11$ T DoFs) shows the potential of the code on future, larger machines.

cs.CE↗

AFT Neural Function Approximators for 1D Nonlinear Force Laws

Nonlinear contacts and friction strongly influence the vibration response of assembled structures, but their accurate numerical treatment is computationally demanding. The harmonic balance method is widely used to compute periodic steady-state responses, yet the required alternating frequency-time scheme becomes costly for nonsmooth and hysteretic nonlinearities and must be repeated throughout the nonlinear solution process. Here we show that this procedure can be replaced by neural networks that directly map displacement Fourier coefficients to nonlinear force coefficients and provide the corresponding Jacobian through automatic differentiation. The surrounding solver and continuation algorithms remain unchanged for the computation of frequency response curves. The neural networks exclusively learn individual nonlinear elements rather than complete system responses. Physics-based nondimensionalization and phase normalization facilitate the learning process and enable a single trained network to cover a wide range of parameter combinations. Building on the cubic spring, unilateral spring, and Jenkins elements considered here, the approach points toward a reusable library of nonlinear-element surrogates that can be combined in arbitrary number and location within a mechanical system. By bypassing the iterative force evaluation in time domain, the method offers favorable computational scaling for high-resolution analyses and systems with many nonlinear elements.

cs.CE↗