Searcharxiv⌕ Search

arXiv subjects

Karl H. Johansson

Publications and source records attributed to Karl H. Johansson.

At least 19 recordsLinked to original sources

Universal Quantizer Design for Identification of Systems with Memory

In system identification from quantized observations, the quantizer determines how much information about the parameters the observations retain, and hence the achievable estimation accuracy. Quantizer design can be guided by the Fisher information matrix (FIM), which assesses the parameter information retained by candidate quantizers. Existing methods, however, typically rely on closed-form expressions of the FIM. This paper proposes a universal quantizer design method for general systems with memory. Its core is a universal FIM estimator that evaluates the information per bit from simulated trajectories, and the thresholds are designed by maximizing the estimated criterion under a bit budget. For unknown parameters, the design is implemented through a two-stage procedure. Numerical studies on a quantized ARX system yield designs close to the reference optimum, while a nonlinear cascaded-tanks example reduces the identification error by about 50% relative to a single median threshold.

eess.SY↗

Variance Reduction for Decentralized Stochastic Optimization with Multiple Local Updates

Multiple local updates are widely used in decentralized optimization to enhance communication efficiency, often in conjunction with stochastic gradients when exact gradient computation is costly. However, such algorithms generally converge only to a neighborhood of the optimum, whose size depends on the stepsize and the variance of gradient noise. Variance reduction has been incorporated into ADMM-based methods to achieve exact convergence in expectation, but their stepsizes typically scale inversely with both the square root of the network size and the cube of the number of local updates, leading to slow convergence as the network size or the number of local updates increases. In this paper, we propose a novel primal-dual-based decentralized optimization algorithm that integrates variance reduction with multiple local updates, with a stepsize independent of the network size and inversely proportional to the number of local updates (rather than its cube), thereby enabling significantly larger stepsizes and faster convergence. Moreover, to the best of our knowledge, we establish the first linear convergence guarantee in expectation for decentralized optimization with multiple local updates under stochastic gradients in the strongly convex setting. Beyond the theoretical guarantee, the proposed method exchanges only one variable per round, halving the communication cost compared with gradient-tracking-based methods. Numerical experiments further demonstrate its advantages in convergence speed and accuracy.

math.OC↗

Competition, Switching, and Control in Coupled Adoption-Opinion Dynamics

We propose a Multi-technology AdopTion-opinion co-Evolution (MATE) model to describe the diffusion of $m \geq 2$ competing alternatives within a networked population whose opinions evolve under social influence and the feedback generated by adoption. Communities interact through two layers: a physical network governing exposure to adoption, and a social network shaping opinion evolution through social imitation. Individuals can adopt a technology, eventually becoming dissatisfied at a rate reflecting the quality of the technology, and switch to an alternative at a rate driven by their opinion of that alternative. For an arbitrary number of competing technologies $m \geq 2$, we characterize the equilibria and establish the existence of an adoption-diffused equilibrium in which all technologies coexist. For $m > 2$, the equilibrium configuration depends on the broader competitive environment: unlike the two-technology case, within-community relative adoption generally depends also on equilibrium opinions and on the other alternatives. Finally, we formulate finite-horizon opinion-shaping control problems, derive necessary optimality conditions via the discrete-time Pontryagin maximum principle, and compute numerical extremals using a forward-backward sweep method.

eess.SY↗

Susceptibility optimization for wisdom of crowds: A social power reformulation and realization framework

Whether social influence makes a crowd wiser or more biased hinges on who yields to others and who holds firm. Such heterogeneous susceptibilities to social influence, together with the influence network, determine the weight each agent's initial estimate carries in the collective estimate, known as social power. This paper studies susceptibility optimization for maximizing the wisdom of crowds under the Friedkin-Johnsen model. Minimizing the squared collective bias over susceptibilities leads to a nonconvex problem. To overcome this nonconvexity, we develop a social power reformulation and realization framework, which decomposes the problem into two stages: first characterizing the social power that minimizes the collective bias, then determining the susceptibilities that induce such social power. Social power reformulation yields a quadratic program over the probability simplex. Under uniform-sign biases, the optimal social power concentrates on the least biased agents and immediately determines the optimal susceptibilities; under mixed-sign biases, its geometry enables a linear-time construction algorithm. For social power realization, we introduce the notions of susceptibility realizability and establish necessary and sufficient conditions for them, under which we derive all optimal susceptibilities in closed form using the Laplacian pseudoinverse and eigenvector centrality. These results yield a unified algorithm that solves the original problem globally, with worst-case complexity cubic in the number of agents when realizability holds. Finally, we develop a fully distributed implementation with linear communication complexity, illustrating how collective intelligence can emerge from local interactions.

eess.SY↗

Unified Communication Compression Beyond Global Error Bounds for Distributed Nonconvex Optimization

In this paper, we propose a unified compression algorithm for distributed nonconvex opitmization with both the locally- and globally-bounded communication compressors, including 1-bit compressors, saturating quantizers, and the globally-bounded compressors with both relative and absolute compression errors, as well as additional arbitrary bounded noise. We provide a rigorous convergence analysis in nonconvex settings and establish linear convergence under the Polyak-Lojasiewicz (P-L) condition. Notably, we establish an $\mathcal{O}(1/\sqrt{T})$ convergence rate for the locally-bounded class in the distributed nonconvex setting, matching that achieved by the centralized algorithms with 1-bit compressors, where $T$ denotes the total number of iterations. Moreover, one initial uncompressed communication round further yields an order-wise improvement to $\mathcal{O}(1/T^{2/3})$. For the P-L setting and the globally-bounded class, we recover state-of-the-art convergence rates.

math.OC↗

Distributed Optimization with Nesterov Momentum and Finite-Time Quantized Averaging over Directed Networks: Extended Version

In modern large-scale networked systems, rapidly solving optimization problems while utilizing communication resources efficiently is critical for addressing complex tasks. However, distributed optimization over bandwidth-limited networks must cope with two obstacles: limited-bandwidth communication, and slow convergence when the objective is ill-conditioned. In this paper, we consider unconstrained distributed optimization over strongly connected directed networks, where nodes exchange quantized (i.e., compressed) messages. We propose QANM (Quantized Averaged Nesterov Momentum), an algorithm that combines Nesterov momentum with a finite-time quantized averaging protocol. At every iteration, QANM enables all nodes to reach exact agreement, without requiring doubly stochastic weight matrices or undirected communication. For strongly convex and smooth objectives, we show that the objective gap of QANM decays at the accelerated rate $1-κ^{-1/2}$ (where $κ$ is the condition number), up to a residual of order $Δ^2$ determined by the quantization level $Δ$. This improves the condition-number dependence of the transient iteration complexity from $κ$ to $\sqrtκ$ compared with gradient descent that utilizes the same quantized averaging mechanism. Finally, we evaluate QANM on a distributed sensor fusion problem, showing that our algorithm exhibits the fastest initial error reduction compared with other methods from current literature.

eess.SY↗

Distributed Coordination Algorithms with Efficient Communication for Open Multi-Agent Systems with Dynamic Communication Links and Processing Delays: Extended Version

In this paper we focus on the distributed quantized average consensus problem in open multi-agent systems consisting of dynamic directed communication links among active nodes. We propose three communication-efficient distributed algorithms designed for different scenarios. Our first algorithm solves the quantized averaging problem over the currently active node set under finite network openness (i.e., when the active set eventually stabilizes). Our second algorithm extends the aforementioned approach for the case where nodes suffer from arbitrary bounded processing delays. Our third algorithm operates over indefinitely open multi-agent networks with dynamic communication links (i.e., with continuous node arrivals and departures), computing the average that incorporates both active and historically active nodes. We analyze our algorithms' operation, establish their correctness, and present novel necessary and sufficient topological conditions ensuring their finite-time convergence. Numerical simulations on distributed sensor fusion for environmental monitoring demonstrate fast finite-time convergence and robustness across varying network sizes, departure/arrival rates, and processing delays. Finally, it is shown that our proposed algorithms compare favorably to algorithms in the existing literature.

eess.SY↗

Behavior of Nonlinear Opinion Dynamics over Large Networks

Opinion dynamics have been studied for decades across disciplines, with much of the theoretical literature focusing on behaviors such as consensus, polarization, and clustering. Although classic models can exhibit more complex opinion patterns in simulations, quantifying such distributions is not fully understood. To address this question, in this paper, we study the behavior of nonlinear opinion dynamics over large-scale networks using graphons, which capture the underlying network structure. In the model, agents update their opinions according to a nonlinear rule that includes saturation effects in interactions. The network is represented by random graphs generated from a graphon, and a corresponding nonlinear dynamical model is introduced over the graphon. We show that the graphon dynamics approximate the finite-dimensional system, when the network size is large. Leveraging spectral approximation results for random graphs, we further show that the equilibria of the nonlinear model can also be approximated by those of the continuum limit. This result enables a quantitative characterization of the opinion distribution based on the underlying graphon structure. The theoretical results are illustrated by numerical simulation.

eess.SY↗

Noisy-Space Policy Gradient for Diffusion Policies in Offline Reinforcement Learning

Diffusion policies offer a powerful and expressive parameterization for continuous control. Yet, their integration with reinforcement learning remains conceptually and algorithmically challenging. In this work, we address this gap by introducing a noisy-space action-value (Q-)function that assigns values to diffusion latents through the distribution of executed actions induced by the denoising process. We show that this construction admits a precise semantic interpretation and derive a noisy-space policy gradient (NSPG) that optimizes noisy latents using only clean action-space value estimates. Building on this result, we formulate a KL-regularized policy improvement over noisy latents and show that the resulting objective admits a diffusion-compatible regression form, avoiding backpropagation through the denoising process. Empirical results on state-based D4RL benchmarks and vision-based OGBench tasks demonstrate that the proposed noisy-space objective provides a principled and effective basis for training diffusion policies in offline reinforcement learning. Project webpage: https://mahmoud-selim.github.io/NSPG/

cs.LG↗

Distributed risk-averse optimization via CVaR

Distributed systems often operate under uncertainty, where minimizing expected loss may overlook rare but severe events. This paper studies a distributed risk-averse convex optimization problem in which agents cooperatively minimize the average of local conditional value-at-risk (CVaR) objectives over a time-varying network. Each agent has access only to noisy evaluations of its local loss function, rather than to its CVaR objective or gradient. We therefore develop a zeroth-order algorithm that uses sampled losses to construct empirical CVaR estimates and their gradient estimates. At each iteration, agents combine neighboring decisions and perform a local update. Under convexity and Lipschitz continuity assumptions, we prove that the agents reach exact asymptotic consensus. We also establish a finite-time expected suboptimality bound for the weighted ergodic iterate. With diminishing step sizes and fixed sample sizes, the local last iterates converge almost surely to a common optimum, and their limiting expected CVaR gap is bounded in terms of the smoothing and finite-sample errors. This distributed bound matches the parameter dependence of the centralized benchmark provided in this paper. Finally, simulations on a distributed sensor network estimation problem illustrate the efficacy of the method.

math.OC↗

Demonstration of Space Robot Teleoperation over a Lossy and Delayed Network using ATMOS

We present a demonstration showcasing the Autonomy Testbed for Multi-purpose Orbiting Systems (ATMOS), a planar spacecraft-analog robot designed for hardware-in-the-loop evaluation of guidance and control strategies in microgravity-like conditions. Using ATMOS as the physical test platform, we investigate the design, analysis, and performance evaluation of control architectures for remotely operated spacecraft under round-trip communication delays. In this work, we develop and experimentally validate a control strategy that combines state prediction and trajectory tracking control to perform a docking maneuver, accounting for time-varying random communication latency between ground operators and the ATMOS system. The demonstration includes a long-distance remote control experiment between Seoul and Stockholm, introducing realistic intercontinental delays and variability. The results highlight the capability of ATMOS to support rapid, reliable, and cost-effective testing of spacecraft teleoperation concepts, establishing a first step toward robust validation of on-orbit operations in microgravity-like environments.

cs.RO↗

From Noisy Data to Hierarchical Control: A Model-Order-Reduction Framework

This paper develops a direct data-driven framework for constructing reduced-order models (ROMs) of discrete-time linear dynamical systems with unknown dynamics and process disturbances. The proposed scheme enables controller synthesis on the ROM and its refinement to the original system via an interface function designed using noisy data. To achieve this, the notion of simulation functions (SFs) is employed to establish a formal relation between the original system and its ROM, yielding a quantitative bound on the mismatch between their output trajectories. To construct such relations and interface functions, we rely on data collected from the unknown system. In particular, using noise-corrupted input-state data gathered along a single trajectory of the system, and without identifying the original dynamics, we propose data-dependent conditions, cast as a semidefinite program, for the simultaneous construction of ROMs, SFs, and interface functions. Through a case study, we demonstrate that data-driven controller synthesis on the ROM, combined with controller refinement via the interface function, enables the satisfaction of complex logic specifications.

eess.SY↗

Iterative Training of Physics-Informed Neural Networks with Fourier-enhanced Features

Spectral bias, the tendency of neural networks to learn low-frequency features first, is a well-known issue with many training algorithms for physics-informed neural networks (PINNs). To overcome this issue, we propose IFeF-PINN, an algorithm for iterative training of PINNs with Fourier-enhanced features. The key idea is to enrich the latent space using high-frequency components through Random Fourier Features. This creates a two-stage training problem: (i) estimate a basis in the feature space, and (ii) perform regression to determine the coefficients of the enhanced basis functions. For an underlying linear model, it is shown that the latter problem is convex, and we prove that the iterative training scheme converges. Furthermore, we empirically establish that Random Fourier Features enhance the expressive capacity of the network, enabling accurate approximation of high-frequency PDEs. Through extensive numerical evaluation on classical benchmark problems, the superior performance of our method over state-of-the-art algorithms is shown, and the improved approximation across the frequency domain is illustrated.

cs.LG↗

Alternating Levenberg-Marquardt Training of Physics-Informed Neural Networks with Fourier-Enhanced Features

Physics-informed neural networks (PINNs) often fail to accurately resolve partial differential equations (PDEs) with high-frequency or multi-scale solutions, as well as strongly nonlinear problems. Two factors underlie this difficulty: spectral bias, the tendency of neural networks to underfit high-frequency features; and representation-coefficient coupling, the entanglement of representation learning and coefficient fitting within a single nonconvex optimization objective. In this work, we propose the Fourier-enhanced alternating Levenberg--Marquardt PINN (FALM-PINN), an optimization framework that decouples representation learning from coefficient fitting. The upper-level problem learns a Fourier-enhanced basis that enriches the latent space with high-frequency components, while the lower-level problem resolves the coupling by fitting the projection coefficients on this basis, solving a nonlinear least-squares problem with the Levenberg--Marquardt algorithm. The framework applies to general nonlinear and coupled PDE systems, and reduces to a single-step convex optimization problem for linear PDEs. We prove global convergence of the alternating training scheme in both cases. Numerical examples on multiple challenging high-frequency and nonlinear PDEs show that FALM-PINN achieves relative $L^2$ errors up to two orders of magnitude lower than state-of-the-art baselines.

cs.LG↗

Secure Set-based State Estimation for Safety-Critical Applications under Adversarial Attacks on Sensors

Set-based state estimation provides guaranteed state inclusion certificates that are crucial for the safety verification of dynamical systems. However, when system sensors are subject to cyberattacks, maintaining both safety and security guarantees becomes a fundamental challenge. Existing point-based secure state estimation methods cannot adequately address this challenge because they cannot provide state inclusion certificates. This paper introduces a novel approach that simultaneously ensures safety guarantees through guaranteed state inclusion and security guarantees against sensor attacks, without imposing conservative restrictions on system operation. We propose a Secure Set-based State Estimation (S3E) algorithm that maintains the true system state within the estimated set under sensor attacks, provided the initialization set contains the initial state and the system remains observable from the uncompromised sensor subset. The algorithm provides the estimated set as a collection of constrained zonotopes (agreement sets), which can be used as robust certificates to verify whether the system adheres to safety constraints. Furthermore, we demonstrate that the estimated set remains unaffected by attack signals of sufficiently large magnitude and also establish sufficient conditions for attack detection, identification, and filtering. This compels the attacker to inject only signals of small magnitudes to evade detection, thus preserving the accuracy of the estimated set. To address the computational complexity of the algorithm, we offer several strategies for complexity-performance tradeoffs. The efficacy of the proposed algorithm is illustrated through several examples, including its application to a three-story building model.

eess.SY↗

MetaKoopman: Bayesian Meta-Learning of Koopman Operators for Modeling Structured Dynamics under Distribution Shifts

Modeling and forecasting nonlinear dynamics under distribution shifts is essential for robust decision-making in real-world systems. In this work, we propose MetaKoopman, a Bayesian meta-learning framework for modeling nonlinear dynamics through linear latent representations. MetaKoopman learns a Matrix Normal-Inverse Wishart (MNIW) prior over the Koopman operator, enabling closed-form Bayesian updates conditioned on recent trajectory segments. Moreover, it provides a closed-form posterior predictive distribution over future state trajectories, capturing both epistemic and aleatoric uncertainty in the learned dynamics. We evaluate MetaKoopman on a full-scale autonomous truck and trailer system across a wide range of adverse winter scenarios, including snow, ice, and mixed-friction conditions, as well as in simulated control tasks with diverse distribution shifts. MetaKoopman consistently outperforms prior approaches in multi-step prediction accuracy, uncertainty calibration, and robustness to distributional shifts. Field experiments further demonstrate its effectiveness in dynamically feasible motion planning, particularly during evasive maneuvers and operation at the limits of traction. Project website: https://mahmoud-selim.github.io/MetaKoopman/

cs.LG↗

Decentralized Linearized Consensus ADMM with Efficient Quantized Communication

Distributed optimization offers significant advantages over centralized methods in terms of scalability and robustness when solving large-scale problems. In this paper, we propose a novel decentralized optimization algorithm that integrates Inexact Consensus ADMM (IC-ADMM) with a finite-time decentralized quantized communication algorithm. The proposed method enjoys three main benefits: (i) it operates on directed communication graphs, (ii) it requires only quantized local information instead of exact values, and (iii) it does not rely on solving the local subproblems exactly. Under the assumption that each node's local objective is strongly convex and L-smooth, the algorithm is guaranteed to achieve global linear convergence to a neighborhood of the optimal solution. Extensive numerical experiments demonstrate its advantages over existing methods in terms of convergence speed and communication efficiency.

math.OC↗

CADMM-Prox: A Bi-level Consensus ADMM for Non-smooth Non-convex Distributed Consensus Optimization

Non-smooth and non-convex optimization problems are pervasive in machine learning, control, and signal processing, due to the need for sparse solutions and the inherently non-convex nature of many objective functions. In this paper, we study non-smooth and non-convex distributed optimization problems. We propose a novel bi-level Consensus Alternating Direction Method of Multipliers (ADMM) algorithm, termed CADMM-Prox. The proposed algorithm integrates classical Consensus ADMM with a proximal mechanism by introducing a sufficiently large proximal term associated with an outer-level variable. Under the mild assumption that the local objective functions are semi-convex, CADMM-Prox is guaranteed to converge globally to a neighborhood of a Clarke stationary point. Numerical experiments on a phase retrieval problem demonstrate that our proposed method exhibits more stable convergence behavior compared with baseline algorithm.

math.OC↗