Personalized Federated Learning (PFL) aims to learn multiple task-specific models rather than a single global model across heterogeneous data distributions. Existing PFL approaches typically rely on iterative optimization-such as model update trajectories-to cluster users that need to accomplish the same tasks together. However, these learning-dynamics-based methods are inherently vulnerable to low-quality data and noisy labels, as corrupted updates distort clustering decisions and degrade personalization performance. To tackle this, we propose FB-NLL, a feature-centric framework that decouples user clustering from iterative training dynamics. By exploiting the intrinsic heterogeneity of local feature spaces, FB-NLL characterizes each user through the spectral structure of the covariances of their feature representations and leverages subspace similarity to identify task-consistent user groupings. This geometry-aware clustering is label-agnostic and is performed in a one-shot manner prior to training, significantly reducing communication overhead and computational costs compared to iterative baselines. Complementing this, we introduce a feature-consistency-based detection and correction strategy to address noisy labels within clusters. By leveraging directional alignment in the learned feature space and assigning labels based on class-specific feature subspaces, our method mitigates corrupted supervision without requiring estimation of stochastic noise transition matrices. In addition, FB-NLL is model-independent and integrates seamlessly with existing noise-robust training techniques. Extensive experiments across diverse datasets and noise regimes demonstrate that our framework consistently outperforms state-of-the-art baselines in terms of average accuracy and performance stability.

Distribution networks with high penetration of Distributed Energy Resources (DERs) increasingly rely on communication networks to coordinate grid-interactive control. While many distributed control schemes have been proposed, they are often evaluated under idealized communication assumptions, making it difficult to assess their performance under realistic network conditions. This work presents an implementation-driven evaluation of a representative virtual power plant (VPP) dispatch algorithm using a co-simulation framework that couples a linearized distribution-system model with packet-level downlink emulation in ns-3. The study considers a modified IEEE~37-node feeder with high photovoltaic penetration and a primal--dual VPP dispatch that simultaneously targets feeder-head active power tracking and voltage regulation. Communication effects are introduced only on the downlink path carrying dual-variable updates, where per-DER packet delays and a hold-last-value strategy are modeled. Results show that, under ideal communication, the dispatch achieves close tracking of the feeder-head power reference while maintaining voltages within the prescribed limits at selected buses. When realistic downlink delay is introduced, the same controller exhibits large oscillations in feeder-head power and more frequent voltage limit violations. These findings highlight that distributed DER control performance can be strongly influenced by communication behavior and motivate evaluation frameworks that explicitly incorporate network dynamics into the assessment of grid-interactive control schemes.

This paper considers a networked tracking architecture in 6G integrated sensing and communication (ISAC) systems, where multiple base stations (BSs) cooperatively transmit radio signals and process received echo signals to track multiple moving targets. Compared to the single-BS counterpart, networked tracking allows the moving targets to be associated with different BSs over time such that the wireless resources can be dynamically allocated among BSs based on target locations. However, networked tracking imposes new challenges for algorithm design and resource allocation. In this paper, we first design the networked Kalman Filter (NKF) that is suitable for multi-BS based tracking, then characterize the posterior Cramer-Rao bound (PCRB) under this NKF, and last design the beamforming vectors of all the BSs to minimize the tracking PCRB. Numerical results show that our dynamic beamforming design can properly associate the targets to the suitable BSs at various sensing blocks and reduce the tracking mean-squared error (MSE).

Reproducibility, traceability, and transparency in testing cyber-physical energy systems are crucial for scientific advancement and cross-laboratory collaboration. Current experimentation and test documentation practices lack formal semantics, making it difficult to reproduce experiments, share data, and apply, for example, the artificial intelligence-driven analysis. A dataspace that relies on structured ontologies aims to address these gaps by providing machine-actionable descriptions. In this work, we outline an ontology-driven approach for reproducibility of cyber-physical energy systems testing and illustrate its applicability through representative cross-laboratory use cases, demonstrating feasibility while identifying remaining semantic and metadata gaps that limit reproducibility. Based on these observations, we propose an open three-viewpoint ontology framework to guide future ontology extensions.

This paper presents a sensing management frame- work for integrated sensing and communications (ISAC) within cell-free massive multiple-input multiple-output (MIMO) systems to reduce pilot-based channel state information (CSI) acquisition overhead. Conventional communication systems rely on frequent channel estimation procedures that impose significant signaling overhead, consuming valuable time-frequency resources. To ad- dress this inefficiency, we propose a state-based architecture that partitions users into communication and sensing groups based on service requirements. When users are not requesting data, the system utilizes sensing capabilities to track their location. Upon receiving a communication request, the system transitions to communication mode, leveraging the tracked state for predictive beamforming to eliminate the need for uplink pilot training. We develop an extended Kalman filter (EKF) based tracking algorithm coupled with adaptive resource allocation strategies. Furthermore, we analyze the impact of inter-target interference and design a sensing management protocol that performs sensing operations only when necessary to maintain the accuracy of user location estimates. Simulation results demonstrate that the pro- posed EKF-based tracking and sensing management can support predictive beamforming with downlink spectral efficiency close to the perfect-CSI case, while requiring sensing only occasionally after an initial convergence period. The results also indicate that this performance is robust in a cell-free massive MIMO setup and can be achieved with practical sensing waveforms.

Modern world models are becoming too complex to admit explicit dynamical descriptions. We study safety-critical contextual control, where a Planner must optimize a task objective using only feasibility samples from a black-box Simulator, conditioned on a context signal $ξ_t$. We develop a sample-based Penalized Predictive Control (PPC) framework grounded in online Riemannian optimization, in which the Simulator compresses the feasibility manifold into a score-based density $\hat{p}(u \mid ξ_t)$ that endows the action space with a Riemannian geometry guiding the Planner's gradient descent. The barrier curvature $κ(ξ_t)$, the minimum curvature of the conditional log-density $-\ln\hat{p}(\cdot\midξ_t)$, governs both convergence rate and safety margin, replacing the Lipschitz constant of the unknown dynamics. Our main result is a contextual safety bound showing that the distance from the true feasibility manifold is controlled by the score estimation error and a ratio that depends on $κ(ξ_t)$, both of which improve with richer context. Simulations on a dynamic navigation task confirm that contextual PPC substantially outperforms marginal and frozen density models, with the advantage growing after environment shifts.

Chemical sensing in real-world environments requires resolving rapidly fluctuating and spatially heterogeneous concentration fields. However, these dynamics are strongly distorted by widely used, low-cost metal-oxide (MOx) gas sensors, whose thermal and surface-kinetic response acts as a low-pass filter on the underlying concentration signal. Quantifying and compensating for these effects remains challenging, largely due to the lack of benchmark datasets that simultaneously capture the spatiotemporal structure of turbulent odour fields and the time-resolved response of point sensors. Here, we present a dataset combining planar laser-induced fluorescence (PLIF) measurements of an acetone tracer plume with synchronised recordings from a custom, kilohertz-rate microelectromechanical (MEMS) MOx electronic nose deployed in a laboratory wind tunnel. The PLIF system provides quantitative, two-dimensional concentration fields at high spatial and temporal resolution, while the co-located e-nose records film resistance, heater currents, and environmental parameters with aligned timestamps. The dataset enables quantitative assessment of sensor dynamics, development and benchmarking of reconstruction and deconvolution algorithms, and data-driven modelling of plume structure. All recordings, metadata, calibration files, and example analysis scripts are released in open, platform-independent formats. Together, these provide a valuable reference for researchers working in odour-guided robotics, environmental monitoring, computational fluid dynamics, and neuromorphic sensing, supporting the design and evaluation of high-speed odour-sensing systems.

Edge-cloud hybrid inference offloads difficult inputs to a powerful remote model, but the uplink channel imposes hard per-request constraints on the number of bits that can be transmitted. We show that selecting transmitted content based solely on attention-based importance, the standard approach in collaborative inference, is inherently limited under hard budgets. Two findings support this claim. First, replacing high-importance units with low-importance but complementary ones improves server accuracy. This shows that what matters is not individual importance but how well the transmitted set covers diverse aspects of the input. Second, spatially uniform selection without any content information achieves competitive accuracy at moderate budgets. This confirms that spatial coverage alone carries independent value. Based on this analysis, we propose SAGE (Semantic Attention-Guided Evidence), a principled, training-free method that combines importance filtering with embedding-diversity sampling. SAGE achieves 93% of the server ceiling in offloaded accuracy while transmitting fewer than half of the available evidence units on ImageNet-1K, substantially outperforming importance-only composition.

A notable difference between the ordinary and Hadamard products is that the Hadamard product of two singular positive semidefinite matrices can be nonsingular, and one of the factors can even be indefinite. We present an eigenvalue lower bound for a Hadamard product that depends on the rank, effective condition number, and diagonal entries of one factor, and the smallest eigenvalues of certain principal submatrices of the other factor. We give numerical examples and discuss its applications in array signal processing and matrix time series analysis.

Wireless agentic systems enable agents to autonomously perceive, reason, and act. However, existing works neglect the tight coupling between sensing and control in closed-loop integrated sensing and communication (ISAC) systems. In this paper, we propose an active inference (AIF)-driven wireless agentic system for closed-loop ISAC, which jointly optimizes control and sensing resource allocation via backward--forward message passing on a factor graph. The AIF agent maintains a generative model as a digital twin by integrating a localization model for uncertainty-aware state inference and a localization channel knowledge map (CKM) for approximating observation quality during planning. Simulation results demonstrate that the AIF-enabled agent adaptively allocates sensing resources based on spatially varying channel conditions, achieving superior balance among tracking accuracy, control effort, and sensing resource consumption over baseline strategies.

In this paper an algorithm for transient simulation of switching converters using prediction and correction to calculate duty ratio is proposed. It provides large signal simulation on the level of averaged currents and voltages in the circuit. Calculation of duty ratio using inductor current and capacitor voltage prediction and correction do not require their priori knowledge. Number of circuit solving per switching period is fixed and equal to two. Using this algorithm various of constant frequency regulated switching converters can be simulated. Due to predetermined circuit values convergence problems are avoided. This algorithm results in very fast and accurate large signal simulation.

Q-learning is one of the most fundamental algorithms in reinforcement learning. We analyze constant-stepsize Q-learning through a direct stochastic switching system representation. The key observation is that the Bellman maximization error can be represented exactly by a stochastic policy. Therefore, the Q-learning error admits a switched linear conditional-mean recursion with martingale-difference noise. The intrinsic drift rate is the joint spectral radius (JSR) of the direct switching family, which can be strictly smaller than the standard row-sum rate. Using this representation, we derive a finite-time final-iterate bound via a JSR-induced Lyapunov function and then give a computable quadratic-certificate version.

Decentralized optimization enables multiple devices to learn a global machine learning model while each individual device only has access to its local dataset. By avoiding the need for training data to leave individual users' devices, it enhances privacy and scalability compared to conventional centralized learning, where all data has to be aggregated to a central server. However, decentralized optimization has traditionally been viewed as a necessary compromise, used only when centralized processing is impractical due to communication constraints or data privacy concerns. In this study, we show that decentralization can paradoxically accelerate convergence, outperforming centralized methods in the number of iterations needed to reach optimal solutions. Through examples in logistic regression and neural network training, we demonstrate that distributing data and computation across multiple agents can lead to faster learning than centralized approaches, even when each iteration is assumed to take the same amount of time, whether performed centrally on the full dataset or decentrally on local subsets. This finding challenges longstanding assumptions and reveals decentralization as a strategic advantage, offering new opportunities for more efficient optimization and machine learning.

Reliable harmonization of heterogeneous magnetic resonance~(MR) image datasets, especially those acquired in pragmatic clinical trials, is critical to advance multi-center neuroimaging studies and translational machine learning in healthcare. We present an enhanced and rigorously validated version of the HACA3 harmonization algorithm, which we refer to as HACA3$^+$, incorporating key methodological enhancements: (1)~an improved artifact encoder to better isolate and mitigate image artifacts, (2)~background and foreground-sensitive attention mechanisms to increase harmonization specificity, and (3)~extensive training using data spanning 100+ scanners from 64 independent sites, providing a broader diversity of scanners than other harmonization methods. Our study focuses on four commonly acquired MR image contrasts (T1-weighted, T2-weighted, proton density, \& fluid-attenuated inversion recovery), reflecting realistic clinical protocols. We perform inter-site harmonization experiments using traveling subjects to assess the generalization and robustness of the harmonization model. We compare the results of the publicly available version of HACA3 and our implementation, HACA3$^+$. Downstream relevance is further established through whole brain segmentation and image imputation. Finally, we justify each enhancement through an ablation experiment. Pre-trained weights and code for HACA3$^+$ are made publicly available at https://github.com/shays15/haca3-plus.

Unknown payloads can strongly affect compliant robotic manipulation, especially when the payload center of mass is not aligned with the tool center point. In this case, the payload generates an offset wrench at the robot wrist. During motion, this wrench is not only related to payload weight, but also to payload inertia. If it is not modeled, the compliant controller can interpret it as an external interaction wrench, which causes unintended compliant motion, larger tracking error, and reduced transport accuracy. This paper presents a wrench-aware admittance control framework for unknown-payload pick-and-place using a UR5e robot. The method uses force-torque measurements in two different roles. First, a three-axis translational excitation term is used to reduce payload-induced force effects during transport without making the robot excessively stiff. Second, after grasping, the controller first estimates payload mass for transport compensation and then estimates the payload CoM offset relative to the TCP using wrist force-torque measurements collected during the subsequent translational motion. This helps improve object placement and stacking behavior. Experimental results show improved transport and placement performance compared with uncorrected placement while preserving compliant motion.

We present a physics-driven framework for accurate evaluation of discrete spectral bands using a low-cost multispectral setup built from off-the-shelf RGB cameras and narrow multi-band optical filters. The approach starts by explicitly formulating a linear measurement model. The camera responses are expressed as linear mixtures of unknown spectral components, with mixing coefficients determined by the overlap between the camera spectral sensitivities and the filter transmittances. For a multi-camera configuration, the per-camera models are stacked into a single global system whose structure is fully determined by the allocation of target wavelengths across the camera--filter units. We pose wavelength allocation as a deterministic design problem and select the configuration that minimizes the spectral condition number of the resulting system matrix. Guided by a frame-theoretic interpretation, this criterion promotes numerical stability, maximizes worst-case output signal-to-noise ratio, and improves the robustness of spectral reconstruction. The design space is finite, enabling the evaluation of all feasible configurations under practical constraints. We demonstrate the method on a representative example with 12 target wavelengths and four triband filters, and identify the wavelength allocation that yields the most stable and noise-robust recovery. The proposed framework includes redundant configurations, in which individual wavelengths are measured by multiple cameras, thereby providing additional degrees of freedom that further improve noise robustness.

We propose a robust nonlinear model predictive control (MPC) scheme for trajectory-tracking control of autonomous vehicles at the limits of handling on non-planar road surfaces. We derive the dynamics from first principles and selectively omit terms with negligible dynamic influence to maintain real-time capability. The resulting MPC with a three-dimensional (3D) dynamic single-track model integrates relevant dynamic effects directly into the prediction model and leverages them to improve prediction accuracy and therefore control performance. Even if the influence of terrain-induced vertical loads on the total acceleration potential is modeled, tire-road interactions are subject to uncertainty and disturbance. The uncertainty-aware constraint tightening scheme introduces a margin to constraint bounds to keep the vehicle controllable and stable in this environment. To validate our proposed approach, we perform high-fidelity dynamic double-track vehicle dynamics simulations on a model of a real circuit. We find that our algorithm can improve trajectory-tracking accuracy while maintaining low computation times.

Wireless links deployed in orchards often exhibit significant variability in the strength of the received signal that is not adequately captured by classical distance-based propagation models. In row-structured olive groves, signal attenuation differs markedly between along-row and cross-row propagation directions, leading to discrepancies when using omnidirectional propagation assumptions such as those adopted in the Free Space Path Loss (FSPL) model or ITU-R vegetation loss formulations. This paper proposes a topology-based propagation model that explicitly accounts for orchard layout and the relative positions of radio devices within the plantation structure. Experimental validation was conducted using LoRa technology operating at 868 MHz, and the results were compared with established models from the literature and with the proposed two-dimensional model. The proposed approach achieves a closer fit to measured RSSI data than conventional models, providing a more reliable basis for link budgeting and network planning in structured agricultural environments.

Reconfigurable intelligent surfaces (RISs) have recently attracted interest for non-terrestrial networks (NTNs), especially for improving satellite communication performance. However, RIS-assisted urban NTN designs that jointly support reliable communication and user positioning under blockage, while maintaining low online complexity, remain limited. This paper proposes a blockage-aware and shadowing-aware RIS-assisted framework for joint communication and positioning in an urban low-Earth-orbit (LEO) satellite downlink. A terrestrial RIS is used both to reinforce the blockage-sensitive satellite--user link and to create an additional reflected path that enhances delay-domain positioning observability. We develop a reduced two-dimensional positioning model based on the direct-path delay and the RIS-assisted excess delay, and combine the resulting position error bound (PEB) with the received signal-to-noise ratio (SNR) into a unified utility. A blockage-aware three-mode policy then adapts RIS operation among communication-oriented, balanced, and positioning-oriented modes according to the direct-link condition. To improve robustness, spatially correlated RIS--user shadowing is tracked across coherence blocks using a state-space model and a scalar Kalman filter, and the filtered estimate is used in a robust codebook-based RIS selection strategy with low online complexity. Numerical results show that the proposed framework provides a controllable SNR--PEB tradeoff, improves positioning accuracy while maintaining competitive SNR, stabilizes codeword selection under shadowing uncertainty, and increases joint success probability with RIS size and phase resolution, with diminishing returns at high hardware complexity.

Liquid crystal (LC) is a promising hardware solution for implementing large RISs, as it is cost-effective, energy efficient, scalable, and capable of providing continuous phase shifts with low power consumption. However, the phase shift response of LC-based RISs is inherently frequency dependent. If unaddressed, this characteristic leads to performance degradation, particularly in wideband scenarios. This issue is especially critical in secure communication applications, where minor phase shift variations across elements can result in considerable information leakage. This paper addresses these frequency-induced variations by developing a physics-based model for an LC unit cell across varying frequencies and proposing a novel phase shift design framework that maximizes secure communication across all subcarriers. Given the large number of elements in millimeter wave (mmWave) LC-RISs, acquiring full channel state information (CSI) is often impractical. Therefore, we optimize the phase shifts based solely on the locations of the legitimate mobile users (MUs) and potential eavesdroppers. Rather than targeting a single user point, the RIS is designed to illuminate a broader area. This approach enhances communication reliability for the MUs and mitigates performance degradation caused by location estimation errors. To solve the problem, we introduce both a semi-definite programming (SDP)-based solution and a low complexity heuristic method. While the SDP-based approach yields superior performance, it incurs higher computational complexity. Conversely, the scalable method exhibits a much slower scaling of complexity, which makes it highly suitable for extremely large RISs. Simulation results demonstrate that both algorithms improve the secrecy rate compared to baseline methods. Finally, the proposed design is validated through experimental evaluations on an LC RIS setup.

We consider a verification problem for opinion dynamics based on binary observations. The opinion dynamics is governed by a Friedkin-Johnsen (FJ) model, where only a sequence of binary outputs is available instead of the agents' continuous opinions. At every time-step we observe a binarized output for each agent depending on whether the opinion exceeds a fixed threshold. The objective is to verify whether an FJ model with a given set of stubbornness parameters and initial opinions can generate the observed binary outputs up to a small error. The FJ model is formulated as a transition system, and an approximate simulation relation of two transition systems is defined in terms of the proximity of their opinion trajectories and output sequences. We then construct a finite set of abstract FJ models by simplifying the influence matrix and discretizing the stubbornness parameters and the initial opinions. It is shown that the abstraction approximately simulates any concrete FJ model with continuous parameters and initial opinions, and is itself approximately simulated by some concrete FJ model. These results ensure that consistency verification can be performed over the finite abstraction. Specifically, by checking whether an abstract model satisfies the observation constraints, we can conclude whether the corresponding family of concrete FJ models is consistent with the binary observations. Finally, numerical experiments are presented to illustrate the proposed verification framework.

We present OmniVoice, a massively multilingual zero-shot text-to-speech (TTS) model that scales to over 600 languages. At its core is a novel diffusion language model-style discrete non-autoregressive (NAR) architecture. Unlike conventional discrete NAR models that suffer from performance bottlenecks in complex two-stage (text-to-semantic-to-acoustic) pipelines, OmniVoice directly maps text to multi-codebook acoustic tokens. This simplified approach is facilitated by two key technical innovations: (1) a full-codebook random masking strategy for efficient training, and (2) initialization from a pre-trained LLM to ensure superior intelligibility. By leveraging a 581k-hour multilingual dataset curated entirely from open-source data, OmniVoice achieves the broadest language coverage to date and delivers state-of-the-art performance across Chinese, English, and diverse multilingual benchmarks. Our code and pre-trained models are publicly available at https://github.com/k2-fsa/OmniVoice.

Integrating grid-forming converters (GFMCs) into grid-following converter (GFLC)-dominated power systems enhances the grid strength, but GFMCs' current-limiting characteristic triggers dynamic switching between constant voltage control (CVC) and current limit control (CLC). This switching feature poses critical transient stability risks to GFLCs, requiring urgent investigation. This paper first develops a mathematical model for this switched system. Then, it derives switching conditions for droop-controlled GFMCs, which are separately GFMC angle-dependent and GFLC angle-dependent. On this basis, the stability boundaries of GFLC within each subsystem are analyzed, and the impact of GFMC switching arising from GFLC angle oscillation is investigated. The findings reveal that the switched system's stability boundary coincides with that of the CLC subsystem. To enhance GFLC's transient stability and ensure GFMC converges to the CVC mode, this paper introduces a virtual fixed d-axis control (VFDC) strategy. Compared with existing methods, this method achieves decoupling and self-stabilization using only local state variables from individual converters. The conclusions are validated through simulations and Controller Hardware-in-the-Loop tests.

This note presents a concise mathematical formulation of tightly-coupled LiDAR-Inertial Odometry within an iterated error-state Kalman filter framework using a VoxelMap representation. Rather than proposing a new algorithm, it provides a clear and self-contained derivation that unifies the geometric modeling and probabilistic state estimation through consistent notation and explicit formulations. The document is intended to serve both as a technical reference and as an accessible entry point for a foundational understanding of the system architecture and estimation principles.

This paper proposes an adaptive modular geometric control framework for robotic manipulators. The proposed methodology decomposes the overall manipulator dynamics into individual modules, enabling the design of local geometric control laws at the module level. To address parametric uncertainties, geometric adaptation law is incorporated into the control structure, requiring only a single adaptation gain for the entire system while ensuring physically consistent and drift-free parameter estimates. Exponential stability of the proposed controller is established in the nominal case. Numerical simulations on a complex redundant robotic manipulator are conducted to evaluate the proposed approach against existing modular and geometric control methods. The results show that the proposed method reduces the RMS position error by at least 12.2% compared with state-of-the-art controllers under almost the same control effort. In addition, the adaptive extension demonstrates strong capability in compensating for parametric uncertainties and preserving high tracking performance.

The computation of positioning, navigation and timing (PNT) via signal of opportunity (SOP), where signals originally transmitted for communication, such as 5G, Wi-Fi, or DVB-S, are exploited due to their ubiquity and spectral characteristics, is an emerging research field. However, relying on these signals presents challenges, including limited knowledge of the signal modulation and the need to identify recurring sequences for correlation. We offer a guide to implement a receiver capable of capturing broadband downlink Ku-band signals from low Earth orbit (LEO) satellites (e.g., Starlink and OneWeb) and estimating the recurring symbols for SOP measurements. The methodology integrates recent approaches in the literature, highlighting the most effective aspects while guiding the replication of experiments even under limitations on the front-end gain and bandwidth. Using the proposed model, we can identify recurring symbols transmitted by Starlink satellites, which are then used to collect Doppler shift measurements over a 600 s interval. A position, velocity, and time (PVT) solution is also computed via least squares (LS), which achieves a positioning error of approximately 268 m after a post-fit refinement.

Hyperspectral single image super-resolution (HS-SISR) aims to enhance the spatial resolution of hyperspectral images to fully exploit their spectral information. While considerable progress has been made in this field, most existing methods are supervised and require ground truth data for training-data that is often unavailable in practice. To overcome this limitation, we propose a novel unsupervised training framework for HS-SISR, based on synthetic abundance data, where no high-resolution ground-truth reference is required for training. The approach begins by unmixing the hyperspectral image into endmembers and abundances. A neural network is then trained to perform abundance super-resolution using synthetic abundances only. These synthetic abundance maps are generated from a dead leaves model whose characteristics are inherited from the low-resolution image to be super-resolved and from the known point spread function (PSF) of the hyperspectral sensor. This trained network is subsequently used to enhance the spatial resolution of the original image's abundances, and the final super-resolution hyperspectral image is reconstructed by combining them with the endmembers. Experimental results demonstrate both the training value of the synthetic data and the effectiveness of the proposed method across 3 datasets, 3 scaling factors, and several evaluation metrics. The code is available at https://github.com/xinxinxu99/SISR-DL.git

Inspired by the success of performing multiple local optimization steps between communication rounds in federated learning, incorporating such local updates into distributed optimization has recently attracted growing interest. However, unlike federated learning, where local updates can accelerate training by reducing gradient estimation error under minibatch settings, it remains unclear whether similar benefits persist when exact gradients are available. Moreover, existing theoretical results typically require reducing the step size when multiple local updates are employed, which can entirely offset any potential benefit of these additional local updates. In this paper, we focus on the classic DIGing algorithm and leverage the tight performance bounds provided by Performance Estimation Problems (PEP) to show that incorporating local updates can indeed accelerate distributed optimization. To the best of our knowledge, this is the first rigorous demonstration of such acceleration for a broad class of objective functions. Our analysis further reveals that, under an appropriate step size, performing only two local updates is sufficient to achieve the maximal possible improvement, and that additional local updates provide no further gains. Because more updates increase computational cost, these findings offer practical guidance for efficient implementation. We also show that these speed gains depend critically on the network structure, with sparser or less connected graphs, characterized by the spectral properties of the mixing matrix, yielding smaller improvements. Extensive experiments on both synthetic and real-world datasets corroborate the theoretical findings.

Diffusion-based generative models have greatly impacted the speech processing field in recent years, exhibiting high speech naturalness and spawning a new research direction. Their application in real-time communication is, however, still lagging behind due to their computation-heavy nature involving multiple calls of large DNNs. Here, we present Stream$.$FM, a frame-causal flow-based generative model with an algorithmic latency of 32 milliseconds (ms) and a total latency of 48 ms, paving the way for generative speech processing in real-time communication. We propose a buffered streaming inference scheme and an optimized DNN architecture, show how learned few-step numerical solvers can boost output quality at a fixed compute budget, explore model weight compression to find favorable points along a compute/quality tradeoff, and contribute a model variant with 24 ms total latency for the speech enhancement task. Our work looks beyond theoretical latencies, showing that high-quality streaming generative speech processing can be realized on consumer GPUs available today. Stream$.$FM can solve a variety of speech processing tasks in a streaming fashion: speech enhancement, dereverberation, codec post-filtering, bandwidth extension, STFT phase retrieval, and Mel vocoding. As we verify through comprehensive evaluations and a MUSHRA listening test, Stream$.$FM establishes a state-of-the-art for generative streaming speech restoration, exhibits only a reasonable reduction in quality compared to a non-streaming variant, and outperforms our recent work (Diffusion Buffer) on generative streaming speech enhancement while operating at a lower latency.

In multitemporal InSAR, phase linking (PL) refers to the estimation of a single-reference interferometric phase history for distributed scatterers (DS) from the information contained in the sample coherence matrix. Because the phase information in this matrix is typically inconsistent, DS processing needs practical reliability indicators to decide whether a pixel's PL estimate is sufficiently supported by the data for subsequent deformation analysis. For maximum-likelihood estimation, uncertainty can be quantified via Fisher-information-based covariance estimates, but no analogous, generally applicable uncertainty quantification is available for the broad range of non-ML methods. We propose three heuristic quality coefficients within a unified mathematical framework that covers common PL methods: (1) a method-specific goodness-of-fit coefficient that normalizes the achieved PL objective between a method-consistent upper bound and an empirically modeled noise floor level; (2) a closure phase coefficient computed from the sample coherence matrix in advance; and (3) an ambiguity coefficient that compares the obtained PL estimate with the best alternative in its orthogonal complement in the solution space. All coefficients are normalized to the interval $[0,1]$, where 1 indicates maximum reliability and 0 matches the behavior expected under pure noise. Simulations under exponential and seasonal decorrelation models show that the goodness-of-fit coefficient tracks the normalized absolute phase error most consistently, whereas the closure phase coefficient provides an a priori indicator for pre-screening. Experiments on a TerraSAR-X stack over Visp, Switzerland, reveal plausible spatial patterns across urban and vegetated areas and show that the ambiguity coefficient provides complementary information, especially in regions with temporally varying scattering mechanisms.