Regressor-triggered federated gradient updates
Implementation & benchmark of arXiv:2607.09496 — Event-triggered parameter estimator for sensor fusion
Source paper: Event-triggered parameter estimator for sensor fusion arXiv:2607.09496 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace periodic client-to-server updates for an online neural-network head with event-triggered transmissions based only on local feature regressors and sufficient statistics, not on the current global parameter estimate. Each client transmits when its local Gram matrix or feature-response statistic changes enough that using the previously transmitted value would violate a prescribed perturbation bound. This should preserve exponential convergence in the strongly excited linear-head regime while reducing communication and synchronization overhead.
Formulas
Mathematical statement
For client i, let C_i(t) in R^{p_i x n} be its feature regressor, y_i(t)=C_i(t) theta_star its target, theta_star the unknown linear-head parameter, and gamma>0 the estimator gain. The ideal continuous-time estimator is d theta_hat/dt = gamma sum_i C_i(t)^T(y_i(t)-C_i(t) theta_hat). Define H(t)=sum_i C_i(t)^T C_i(t). Aggregate persistent excitation means that there exist T>0 and alpha>0 such that the integral from t to t+T of H(s) ds is at least alpha I for every t. With event-held statistics H_i^held and b_i^held=C_i^T y_i at the last event time tau_i^k, use d theta_hat/dt = gamma sum_i(b_i^held-H_i^held theta_hat). The stale-statistic perturbation is Delta(t)=sum_i[(H_i^held-H_i(t))theta_hat-(b_i^held-b_i(t))]. A trigger enforcing ||H_i-H_i^held||_2<=epsilon_i and ||b_i-b_i^held||_2<=epsilon_i^b bounds this perturbation by sum_i(epsilon_i||theta_hat||_2+epsilon_i^b). The Lyapunov error energy V=1/2||theta_hat-theta_star||_2^2 decreases when this perturbation is smaller than the contraction margin generated by gamma and alpha; otherwise the method predicts a residual error or loss of stability.
Implementation notes
1. Integration point: begin with a two-layer network whose feature extractor is frozen and whose trainable final layer is theta, or use online linear probing of a transformer embedding. Each federated client observes feature vectors C_i(t) and labels y_i(t), but does not continuously communicate. The server maintains theta and receives client sufficient statistics H_i=C_i^T C_i and b_i=C_i^T y_i. 2. Pseudocode: initialize H_i_held and b_i_held at the first client event; between events accumulate local minibatch statistics; if spectral_norm(H_i-H_i_held)>epsilon_H or norm(b_i-b_i_held)>epsilon_b, transmit both statistics and reset the held values. At the server, apply theta <- theta + eta * sum_i(b_i_held-H_i_held theta), or integrate the corresponding ODE with Euler steps. If exact convergence is required under changing features, use a decreasing threshold epsilon_H(t)=epsilon_H0 exp(-rho t); a fixed threshold is expected to produce a bounded error floor. 3. Computed quantities: H_i and b_i are exactly computable locally; spectral norms can be estimated with 3-5 power iterations. The persistent-excitation constants alpha and T are generally unknown for neural features, so estimate the minimum eigenvalue of rolling sums of H over logged windows. 4. First cheap experiment: freeze a ResNet-18 or small MLP feature extractor on CIFAR-10, partition data across 10 simulated clients, and train only the linear head. Compare minibatch-periodic communication with epsilon_H in {1e-4,1e-3,1e-2,1e-1}. Measure head error, loss decay, accuracy, rolling excitation eigenvalue, and transmission count. The quantitative prediction is that sufficiently small epsilon_H preserves the full-communication exponential-like loss-decay slope, while the asymptotic parameter or loss error grows approximately linearly with the stale-statistic bound. The largest stable threshold should decrease when the estimated excitation eigenvalue alpha decreases. Accept the mechanism if it achieves at least 5x fewer transmissions with less than 10% degradation in fitted loss-decay rate and if the observed threshold transition tracks the predicted dependence on alpha and estimator gain.
Verification
Stage 1 · Toy mechanism gate: Failed ✗
Stage 2 · Mechanism transferred to benchmark: Not tested
Stage 2 · Practical benchmark result: Not run
Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works
Stage 1 — Mechanism check agent confidence 8/10
Built a NumPy MVP of event-triggered federated linear-head updates with local Gram/statistic triggers, a periodic-communication baseline, PE estimation, perturbation-bound checks, threshold sweeps, and Euler stability sweeps. The bound held numerically, and the Euler boundary matched the prediction 2/lambda_max=2.0, with stability through step 1.9 and divergence at 2.1. Communication dropped to 5.25% of periodic transmissions at epsilon_H=0.4, but the predicted approximately linear increase in residual error with threshold was not observed: tail error decreased from 0.188 to 0.161, so the central stale-statistic error-scaling mechanism was not confirmed.
- Agent confidence
- 8/10
- Baseline
- Periodic updates: 3600 transmissions, tail RMS error 0.18763, tail loss 0.0176025.
- Idea
- epsilon_H=0.4: 189 transmissions, a 19.0x reduction or 5.25% of baseline, tail RMS error 0.16094, tail loss 0.0129501; threshold-sweep error-versus-epsilon slope was -0.0682 rather than the predicted positive residual scaling.
Limitations: Only a two-client, two-dimensional synthetic linear head was tested. The target perturbation was deterministic rather than a realistic federated dataset; no neural feature extractor, asynchronous server, wall-clock communication cost, bandwidth serialization, decreasing thresholds, unknown PE estimation, or CIFAR/MLP experiment was evaluated.
How to run: python3 experiment.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Artifacts
- experiment.py 7.3 KB View Raw
- report.md 1.6 KB View
- results.json 5.6 KB View Raw