Systems and Control
Multipolar dynamics of social segregation: Data validation on Swedish vaccination statistics
Luka Baković, David Ohlin and Emma Tegling
We perform a validation analysis on the multipolar model of opinion dynamics. A general methodology for using the model on
datasets of two correlated variables is proposed and tested using data on the relationship between COVID-19 vaccination rates and political participation in Sweden. The model is shown to successfully capture the opinion segregation demonstrated by the data and spatial correlation of biases is demonstrated as necessary for the result. A mixing of the biases on the other hand leads to a more homogeneous opinion distribution, and greater penetration of the majority opinion, which here corresponds to a decision to vote or vaccinate.
Read the full abstract ▾
Systems and Control · Cross-listed from quant-ph
Performance Comparison of Gate-Based and Adiabatic Quantum Computing for AC Power Flow Problem
Zeynab Kaseb, Matthias Moller, Peter Palensky et al. (+1 more)
We present the first direct comparison between gate-based
quantum computing (GQC) and adiabatic
quantum computing (AQC) paradigms for solving the AC power flow (PF) equations. The PF problem is reformulated as a combinatorial optimization problem. For the GQC approach, the
Quantum Approximate Optimization
Algorithm (QAOA) is employed, while for the AQC approach, the problem is formulated as an Ising model. Numerical experiments on a 4-bus test system evaluate solution accuracy and computational performance. Results obtained using QAOA are benchmarked against those produced by D-Wave's Advantage system and Fujitsu's latest-generation Digital Annealer, implemented through the
Quantum-Inspired Integrated Optimization (QIIO) software. The findings provide quantitative insights into the performance trade-offs, scalability, and practical viability of GQC and AQC paradigms for PF analysis, highlighting the potential of
quantum optimization
algorithms to address the computational challenges associated with the operation of modern electricity grids in the fault-tolerant era.
Read the full abstract ▾
All authors Zeynab Kaseb, Matthias Moller, Peter Palensky, Pedro P. Vergara
Audio and Speech Processing
Towards Multimodal Query-Based Spatial Audio Source Extraction
Chenxin Yu, Hao Ma, Xu Li et al. (+4 more)
Query-based audio source extraction seeks to recover a target source from a mixture conditioned on a query. Existing approaches are largely confined to single-channel audio, leaving the spatial information in multi-channel recordings underexploited. We introduce a query-based spatial audio source extraction framework for recovering dry target signals from first-order ambisonics (FOA) mixtures. Our method accepts either an audio
prompt or a text
prompt as condition input, enabling flexible end-to-end extraction. The core of our proposed model lies in a tri-axial
Transformer that jointly models temporal, frequency, and spatial channel dependencies. The model uses contrastive
language-audio pretraining (CLAP)
embeddings to enable unified audio-text conditioning via feature-wise linear modulation (FiLM). To eliminate costly annotations and improve generalization, we propose a label-free data pipeline that dynamically generates spatial mixtures and corresponding targets for training. The result of our experiment with high separation quality demonstrates the efficacy of
multimodal conditioning and tri-axial modeling. This work establishes a new paradigm for high-fidelity spatial audio separation in immersive applications.
Read the full abstract ▾
All authors Chenxin Yu, Hao Ma, Xu Li, Xiao-Lei Zhang, Mingjie Shao, Chi Zhang, Xuelong Li
Audio and Speech Processing
Two Heads Are Better Than One: Audio-Visual Speech Error Correction with Dual Hypotheses
Sungnyun Kim, Kangwook Jang, Sungwoo Cho et al. (+3 more)
This paper introduces a new paradigm for generative error correction (GER) framework in audio-visual
speech recognition (AVSR) that reasons over modality-specific evidences directly in the
language space. Our framework, DualHyp, empowers a large
language model (LLM) to compose independent N-best hypotheses from separate automatic
speech recognition (ASR) and visual
speech recognition (VSR) models. To maximize the effectiveness of DualHyp, we further introduce RelPrompt, a noise-aware guidance mechanism that provides modality-grounded
prompts to the LLM. RelPrompt offers the temporal reliability of each modality stream, guiding the model to dynamically switch its focus between ASR and VSR hypotheses for an accurate correction. Under various corruption scenarios, our framework attains up to 57.7% error rate gain on the LRS2
benchmark over standard ASR baseline, contrary to single-stream GER approaches that achieve only 10% gain. To facilitate research within our DualHyp framework, we release the code and the
dataset comprising ASR and VSR hypotheses at https://github.com/sungnyun/dualhyp.
Read the full abstract ▾
All authors Sungnyun Kim, Kangwook Jang, Sungwoo Cho, Joon Son Chung, Hoirin Kim, Se-Young Yun
Systems and Control
Partitioned Scheduling for DAG Tasks Considering Probabilistic Execution Time
Fuma Omori, Atsushi Yano and Takuya Azumi
Autonomous driving systems, critical for safety, require real-time guarantees and can be modeled as DAGs. Their acceleration features, such as caches and pipelining, often result in execution times below the worst-case. Thus, a probabilistic approach ensuring constraint satisfaction within a probability threshold is more suitable than worst-case guarantees for these systems. This paper considers probabilistic guarantees for DAG tasks by utilizing the results of probabilistic guarantees for single processors, which have been relatively more advanced than those for multi-core processors. This paper proposes a task set partitioning method that guarantees schedulability under the partitioned scheduling. The evaluation on randomly generated DAG task sets demonstrates that the proposed method schedules more task sets with a smaller mean analysis time compared to existing probabilistic schedulability analysis for DAGs. The evaluation also compares four bin-packing heuristics, revealing Item-Centric Worst-Fit-Decreasing schedules the most task sets.
Read the full abstract ▾
Image and Video Processing
DIGITWISE: Digital Twin-based Modeling of Adaptive Video Streaming Engagement
Emanuele Artioli, Farzad Tashtarian and Christian Timmerer
As the popularity of
video streaming entertainment continues to grow, understanding how users engage with the content and react to its changes becomes a critical success factor for every stakeholder. User engagement, i.e., the percentage of
video the user watches before quitting, is central to customer loyalty, content personalization, ad relevance, and A/B testing. This paper presents DIGITWISE, a digital twin-based approach for modeling adaptive
video streaming engagement. Traditional adaptive bitrate (ABR)
algorithms assume that all users react similarly to
video streaming artifacts and network issues, neglecting individual user sensitivities. DIGITWISE leverages the concept of a digital twin, a digital replica of a physical entity, to model user engagement based on past viewing sessions. The digital twin receives input about streaming events and utilizes supervised machine learning to predict user engagement for a given session. The system model consists of a data processing pipeline, machine learning models acting as digital twins, and a unified model to predict engagement. DIGITWISE employs the XGBoost model in both digital twins and unified models. The proposed architecture demonstrates the importance of personal user sensitivities, reducing user engagement prediction error by up to 5.8% compared to non-user-aware models. Furthermore, DIGITWISE can optimize content provisioning and delivery by identifying the features that maximize engagement, providing an average engagement increase of up to 8.6%.
Read the full abstract ▾
Audio and Speech Processing
Acoustic Teleportation via Disentangled Neural Audio Codec Representations
Philipp Grundhuber, Mhd Modar Halimeh and Emanuël A. P. Habets
This paper presents an approach for acoustic teleportation by disentangling
speech content from acoustic environment characteristics in neural audio codec representations. Acoustic teleportation transfers room characteristics between
speech recordings while preserving content and speaker identity. We build upon previous work using the EnCodec architecture, achieving substantial objective quality improvements with non-intrusive ScoreQ scores of 3.03, compared to 2.44 for prior methods. Our training strategy incorporates five tasks: clean reconstruction, reverberated reconstruction, dereverberation, and two variants of acoustic teleportation. We demonstrate that temporal downsampling of the acoustic
embedding significantly degrades performance, with even 2x downsampling resulting in a statistically significant reduction in quality. The learned acoustic
embeddings exhibit strong correlations with RT60. Effective disentanglement is demonstrated using t-SNE clustering analysis, where acoustic
embeddings cluster by room while
speech embeddings cluster by speaker.
Read the full abstract ▾
Signal Processing · Cross-listed from cs.IT
Movable and Reconfigurable Antennas for 6G: Unlocking Electromagnetic-Domain Design and Optimization
Lipeng Zhu, Haobin Mao, Ge Yan et al. (+3 more)
The growing demands of 6G mobile communication networks necessitate advanced
antenna technologies. Movable
antennas (MAs) and reconfigurable
antennas (RAs) enable dynamic control over
antenna's position, orientation, radiation, polarization, and frequency response, introducing rich electromagnetic-domain degrees of freedom for the design and performance enhancement of wireless systems. This article overviews their application scenarios, hardware architectures, and design methods. Field test and simulation results highlight their performance benefits over conventional fixed/non-reconfigurable
antennas.
Read the full abstract ▾
All authors Lipeng Zhu, Haobin Mao, Ge Yan, Wenyan Ma, Zhenyu Xiao, Rui Zhang
Image and Video Processing
Approximate Bilevel Graph Structure Learning for Histopathology Image Classification
Sudipta Paul, Amanda W. Lund, George Jour et al. (+2 more)
The structural and spatial arrangements of
cells within tissues represent their functional states, making graph-based learning highly suitable for histopathology image analysis. Existing methods often rely on fixed graphs with predefined edges, limiting their ability to capture the true biological complexity of tissue interactions. In this work, we propose ABiG-Net (Approximate Bilevel Optimization for Graph Structure Learning via Neural Networks), a novel framework designed to learn optimal interactions between patches within whole slide images (WSI) or large regions of interest (ROI) while simultaneously learning discriminative node
embeddings for the downstream image classification task. Our approach hierarchically models the tissue architecture at local and global scales. At the local scale, we construct patch-level graphs from cellular orientation within each patch and extract features to quantify local structures. At the global scale, we learn an image-level graph that captures sparse, biologically meaningful connections between patches through a first-order approximate bilevel optimization strategy. The learned global graph is optimized in response to classification performance, capturing the long-range contextual dependencies across the image. By unifying local structural information with global contextual relationships, ABiG-Net enhances interpretability and downstream performance. Experiments on two histopathology
datasets demonstrate its effectiveness: on the Extended CRC
dataset, ABiG-Net achieves 97.33 $\pm$ 1.15 % accuracy for three-class colorectal cancer grading and 98.33 $\pm$ 0.58 % for binary classification; on the melanoma
dataset, it attains 96.27 $\pm$ 0.74 % for tumor-lymphocyte ROI classification.
Read the full abstract ▾
All authors Sudipta Paul, Amanda W. Lund, George Jour, Iman Osman, Bülent Yener
Systems and Control
Safe Driving in Occluded Environments
Zhuoyuan Wang, Tongyao Jia, Pharuj Rajborirug et al. (+5 more)
Ensuring safe autonomous driving in the presence of occlusions poses a significant challenge in its policy design. While existing model-driven control techniques based on set invariance can handle visible risks, occlusions create latent risks in which safety-critical states are not observable. Data-driven techniques also struggle to handle latent risks because direct mappings from risk-critical objects in sensor inputs to safe actions cannot be learned without visible risk-critical objects. Motivated by these challenges, in this paper, we propose a probabilistic safety certificate for latent risk. Our key technical enabler is the application of probabilistic invariance: It relaxes the strict observability requirements imposed by set-invariance methods that demand the knowledge of risk-critical states. The proposed techniques provide linear action constraints that confine the latent risk probability within tolerance. Such constraints can be integrated into model predictive controllers or embedded in data-driven policies to mitigate latent risks. The proposed method is tested using the CARLA simulator and compared with a few existing techniques. The theoretical and empirical analysis jointly demonstrate that the proposed methods assure long-term safety in real-time control in occluded environments without being overly conservative and with transparency to exposed risks.
Read the full abstract ▾
All authors Zhuoyuan Wang, Tongyao Jia, Pharuj Rajborirug, Neeraj Ramesh, Hiroyuki Okuda, Tatsuya Suzuki, Soummya Kar, Yorie Nakahira
Signal Processing
Constellation Design in OFDM-ISAC over Data Payloads: From MSE Analysis to Experimentation
Kawon Han, Kaitao Meng, Alexandra Chatzicharistou et al. (+1 more)
Orthogonal frequency division multiplexing (OFDM) is one of the most widely adopted waveforms for integrated sensing and communication (
ISAC) systems, owing to its high spectral efficiency and compatibility with modern communication standards. This paper investigates the sensing performance of OFDM-based
ISAC for multi-target delay (range) estimation under specific radar receiver processing schemes. An estimation-theoretic framework is developed to characterize sensing performance with random communication payloads. We establish the fundamental limit of delay estimation accuracy by deriving the closed-form expression of the mean-square error (MSE) achieved using matched filtering (MF) and reciprocal filtering (RF) receivers. The results show that, in multi-target scenarios, the impact of signal constellations on the delay estimation MSE differs across receivers: MF performance depends on the fourth-order moment of the zero-mean, unit-power constellation in the presence of multiple targets, whereas RF performance depends on its inverse second-order moment, irrespective of the number of targets. Building on this analysis, we present a
ISAC constellation design under specific receiver architecture that brings a receiver-dependent flexible trade-off between sensing and communication in OFDM-
ISAC systems. The theoretical findings are validated through simulations and proof-of-concept experiments, and also the sensing and communication performance trade-off is experimentally shown with the proposed constellation design.
Read the full abstract ▾
All authors Kawon Han, Kaitao Meng, Alexandra Chatzicharistou, Christos Masouros
Systems and Control
Decision-dependent Robust Charging Infrastructure Planning for Light-duty Truck Electrification at Industrial Sites
Yifu Ding, Ruicheng Ao, Pablo Duenas-Martinez et al. (+1 more)
Many industrial sites and digital logistics platforms rely on diesel-powered light-duty trucks to transport workers and small-scale facilities, which results in a significant amount of greenhouse gas emissions (GHGs). To address this, we develop a robust model for planning charging infrastructure to electrify light-duty trucks at industrial sites. The model is formulated as a mixed-integer linear program (MILP) that optimizes the charging infrastructure selection (across multiple charger types and locations) and determines charging schedules for each truck based on the selected infrastructure. Given the strict stop times and schedules at industrial sites, we introduce a scheduling-with-abandonment problem in which trucks forgo charging if their waiting time exceeds a maximum threshold. We further incorporate the impacts of overnight charging and range anxiety on drivers' waiting and abandonment behaviors. To model
stochastic, heterogeneous parking durations, we classified trucks using machine learning (ML) methods based on contextual and time-location features. We then constructed decision-dependent, feature-driven robust uncertainty sets in which parking-time variability varies flexibly with drivers' charging choices. These feature-driven sets are applied to two robust optimization formulations with decision-dependent uncertainty (RO-DDU), resulting in distinct outcomes and managerial implications. We conduct a case study at an open-pit mining site to plan charger installations across eight charging zones, serving approximately 200 trucks. By decomposing the problem into a short rolling horizon or using a heuristic approach for the full-year or representative-day
dataset, the model achieves an optimality gap of less than 0.1% under diverse uncertainty scenarios.
Read the full abstract ▾
All authors Yifu Ding, Ruicheng Ao, Pablo Duenas-Martinez, Thomas Magnanti
Signal Processing · Cross-listed from cs.LG
A Semi-amortized Lifted Learning-to-Optimize Masked (SALLO-M) Transformer Model for Scalable and Generalizable Beamforming
Yubo Zhang, Xiao-Yang Liu and Xiaodong Wang
We develop an unsupervised deep learning framework for real-time scalable and generalizable downlink beamforming in multi-user multiple-input single-output (MU-MISO) systems. The proposed semi-amortized lifted learning-to-optimize (SALLO) framework employs a multi-layer
Transformer to iteratively refine an auxiliary variable and the beamformer solution, with a few projected gradient ascent steps at each layer. A key feature of our SALLO
Transformer model is that it can handle varying numbers of users and
antennas, enabled by a user-
antenna dual tokenization and a structured sample/
attention masking scheme, leading to generalization across different configurations without retraining. To improve convergence and robustness, we introduce three training strategies: (a) sliding-window training to stabilize gradient propagation, (b) curriculum learning with random masking to enable user-
antenna configuration generalization and prevent poor early-stage convergence, and (c) sample replay to mitigate catastrophic forgetting during multi-stage training. Ablation studies validate several key architecture designs and show that the enhanced training scheme improves both generalizability and solution quality. Simulation results over both Gaussian and sparse channels show that the proposed scheme consistently outperforms existing deep learning baselines across diverse system configurations and channel conditions. The performance gain becomes more pronounced in overloaded regimes, highlighting improved robustness under challenging scenarios. Furthermore, our scheme surpasses the WMMSE
benchmark in underloaded systems and even in overloaded systems when the overloading factor is below certain threshold. These gains are achieved with fast inference and a substantially more lightweight model than wireless foundation models.
Read the full abstract ▾
Systems and Control · Cross-listed from cs.LG
Time-Varying Optimization for Streaming Data Via Temporal Weighting
Muhammad Faraz Ul Abrar, Nicolò Michelusi and Erik G. Larsson
Classical optimization theory deals with fixed, time-invariant objective functions. However, time-varying optimization has emerged as an important subject for decision-making in dynamic environments. In this work, we study the problem of learning from streaming data through a time-varying optimization lens. Unlike prior works that focus on generic formulations, we introduce a structured, weight-based formulation that explicitly captures the streaming-data origin of the time-varying objective, where at each time step, an
agent aims to minimize a weighted average loss over all the past data samples. We focus on two specific weighting strategies: (1) uniform weights, which treat all samples equally, and (2) discounted weights, which geometrically decay the influence of older data. For both schemes, we derive tight bounds on the “tracking error” (TE), defined as the deviation between the model parameter and the time-varying optimum at a given time step, under gradient descent (GD) updates. We show that under uniform weighting, the TE vanishes asymptotically with a $\mathcal{O}(1/t)$ decay rate, whereas discounted weighting incurs a nonzero error floor controlled by the discount factor and the number of gradient updates performed at each time step. Our theoretical findings are validated through numerical simulations.
Read the full abstract ▾