Adversarial Water-Filling: Theory, Algorithms and Foundation Model

• URL: http://arxiv.org/abs/2605.26163v1
• Date: Sun, 24 May 2026 17:37:30 GMT
• Title: Adversarial Water-Filling: Theory, Algorithms and Foundation Model
• Abstract summary: Competitive network resource allocation problems over frequency and space can be formulated as minimax interaction between transmit power andmagnitude-case interference.<n>In this paper we propose the Adrial Water-aware (AWF) theory and algorithms for these real situations.
• Score: 48.01112598331267
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Competitive resource allocation problems over frequency and space can be formulated as minimax interaction between transmit power and worst-case interference. This formulation naturally arises in multi-operator low Earth orbit (LEO) satellite spectrum sharing, where transmissions from competing constellations interfere in real-time. Under Gaussian channels, AWF is strongly convex--concave on nondegenerate active channels, whereas discrete constellations yield generally nonconvex mercury/water-filling formulations. In this paper we propose the Adversarial Water-Filling (AWF) problem with corresponding theory and algorithms for these real situations. In addition, we develop a wireless foundation model for AWF to learn the AWF search dynamics. The architecture incorporates permutation-invariant channel representations, a constraint-aware graph neural network (GNN) with sparse message passing, and global latent variables capturing the low-dimensional water level implied by the AWF optimality. Through learned projected extragradient iterations, the model approximates stationary solutions of the constrained minimax problem arising under mercury/water-filling. We further show that, under local regularity and contractivity conditions, the learned AWF dynamics converge locally linearly around regular stationary points. Experiments demonstrate empirical generalization across unseen problem sizes, different constraints, and multiple discrete constellations, while achieving more than one-order-of-magnitude runtime improvements over iterative baselines. The related code can be found at https://github.com/convexsoft/AWF.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• Physics-Informed Domain-Invariant Feature Learning with Autoencoder-Driven Gaussian Clustering for Robust Non-line-of-Sight Scenarios [0.786430477112975]
  Jamming and spoofing pose significant threats to wireless and satellite navigation.<n>We propose a hybrid learning framework that incorporates physics-informed constraints into deep neural networks.<n>We show that the proposed method reduces AoA estimation error by up to 6 in low-exemplar settings.
  arXiv  Detail & Related papers  (2026-06-21T10:42:12Z)
• A Generalized Sinkhorn Algorithm for Mean-Field Schrödinger Bridge [19.922542189921447]
  The mean-field Schrdinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal interaction to reach a given distribution by a fixed deadline.<n>Unlike Schrdinger bridge, the dynamical constraint for MFSB is a population of interacting agents with repulsive controls.<n>We propose a generalization the Hopf-Cole algorithm for MFSB and, on building it, design a Sinkhorn-type algorithm to solve the associated system integro-PDEs.
  arXiv  Detail & Related papers  (2026-04-08T00:04:52Z)
• PhyG-MoE: A Physics-Guided Mixture-of-Experts Framework for Energy-Efficient GNSS Interference Recognition [49.955269674859004]
  This paper introduces PhyG-MoE (Physics-Guided Mixture-of-Experts), a framework designed to align model capacity with signal complexity.<n>Unlike static architectures, the proposed system employs a spectrum-based gating mechanism that routes signals based on their spectral feature entanglement.<n>A high-capacity TransNeXt expert is activated on-demand to disentangle complex features in saturated scenarios, while lightweight experts handle fundamental signals to minimize latency.
  arXiv  Detail & Related papers  (2026-01-19T07:57:52Z)
• Scale-Adaptive Generative Flows for Multiscale Scientific Data [20.583125441867434]
  Flow-based generative models can face challenges when modeling scientific data with multiscale Fourier spectra.<n>Key insight is that the noise should not be smoother than the target data, to ensure bounded drift fields near the initial time.<n>We show that spectrum-matched noise improves numerical efficiency compared to standard white-noise approaches.
  arXiv  Detail & Related papers  (2025-09-03T03:17:49Z)
• Stochastic Flow Matching for Resolving Small-Scale Physics [28.25905372253442]
  In physical sciences such as weather, super-resolving small-scale details poses significant challenges. We propose encoding the inputs to a latent base distribution, followed by flow matching to generate small-scale physics. We conduct extensive experiments on both the real-world CWA weather dataset and the PDE-based Kolmogorov dataset.
  arXiv  Detail & Related papers  (2024-10-17T21:09:13Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Over-the-Air Federated Learning and Optimization [52.5188988624998]
  We focus on Federated learning (FL) via edge-the-air computation (AirComp) We describe the convergence of AirComp-based FedAvg (AirFedAvg) algorithms under both convex and non- convex settings. For different types of local updates that can be transmitted by edge devices (i.e., model, gradient, model difference), we reveal that transmitting in AirFedAvg may cause an aggregation error. In addition, we consider more practical signal processing schemes to improve the communication efficiency and extend the convergence analysis to different forms of model aggregation error caused by these signal processing schemes.
  arXiv  Detail & Related papers  (2023-10-16T05:49:28Z)
• GAFlow: Incorporating Gaussian Attention into Optical Flow [62.646389181507764]
  We push Gaussian Attention (GA) into the optical flow models to accentuate local properties during representation learning. We introduce a novel Gaussian-Constrained Layer (GCL) which can be easily plugged into existing Transformer blocks. For reliable motion analysis, we provide a new Gaussian-Guided Attention Module (GGAM)
  arXiv  Detail & Related papers  (2023-09-28T07:46:01Z)
• On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning [15.300983585090794]
  We present a unifying framework for heterogeneous FL algorithms with em arbitrary adaptive online model pruning. In particular, we prove that under certain sufficient conditions, these algorithms converge to a stationary point of standard FL for general smooth cost functions. We illuminate two key factors impacting convergence: pruning-induced noise and minimum coverage index.
  arXiv  Detail & Related papers  (2022-01-27T20:43:38Z)
• Gaussian Mixture Graphical Lasso with Application to Edge Detection in Brain Networks [21.49394455839253]
  This work is inspired by Latent DirichletAllocation (LDA) We propose a novel model called GaussianMixture Graphical Lasso (MGL) MGL learns the proportionsof signals generated by each mixture component and their parameters iteratively via an EM framework.
  arXiv  Detail & Related papers  (2021-01-13T21:15:30Z)
• F-FADE: Frequency Factorization for Anomaly Detection in Edge Streams [53.70940420595329]
  We propose F-FADE, a new approach for detection of anomalies in edge streams. It uses a novel frequency-factorization technique to efficiently model the time-evolving distributions of frequencies of interactions between node-pairs. F-FADE is able to handle in an online streaming setting a broad variety of anomalies with temporal and structural changes, while requiring only constant memory.
  arXiv  Detail & Related papers  (2020-11-09T19:55:40Z)

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.