Searcharxiv⌕ Search

arXiv subjects

Philip E. Paré

Publications and source records attributed to Philip E. Paré.

At least 19 recordsLinked to original sources

Hyperlyve: Parallelized Enumeration and Exact Lyapunov Stability Certification for Deep ReLU Networks

We introduce Hyperlyve (Hyperplane Partitioned Lyapunov Verification and Enumeration), a framework for proving the asymptotic stability of nonlinear dynamical systems, including those with neural network controllers. Hyperlyve learns and formally certifies continuous piecewise-affine (CPA) neural Lyapunov functions within a counterexample-guided inductive synthesis (CEGIS) loop. Hyperlyve's key innovation is a parallel algorithm that enumerates the hyperplane arrangement formed by the ReLU activations of deep networks and certifies that Lyapunov conditions hold within each polyhedral region. We derive sound and complete regional tests to verify the asymptotic stability of the exact smooth dynamics (rather than a piecewise-linear approximation) within a compact domain of interest. Furthermore, we formally characterize the computational complexity of the CPA neural Lyapunov verification problem as co-NP-complete, filling a key gap in the literature. Empirical results demonstrate that Hyperlyve enumerates ReLU networks over 150-times faster than competing tools, which contributes to Hyperlyve proving the asymptotic stability of systems that are currently intractable for state-of-the-art verifiers.

eess.SY↗

Fit-LRP: Fitting Linear Relaxations to Polytopes for Neural Network Verification over Non-Convex Regions

State-of-the-art neural network verifiers evaluate linear relaxations over axis-aligned bounding boxes. However, verification domains in cyber-physical systems are rarely boxes. Reachability specifications, obstacle-avoidance constraints, and neural Lyapunov certificates typically yield oblique or non-convex polyhedral regions, over which box-based bounds become extremely loose. This paper proposes Fit-LRP (Fitting Linear Relaxations to Polytopes), a framework the implements exact optimization of affine bounds over non-convex domains (represented by unions of polytopes) by solving a sequence of small, low-dimensional linear programs. Our approach seamlessly enhances the final optimization step of LiRPA and $α,\! β$-CROWN branch-and-bound (BaB) algorithms. In BaB verification, approximating oblique constraints with axis-aligned splits causes severe combinatorial blowup and risks non-termination. By optimizing the final affine bound of a nonlinear function over the exact polyhedral state-space constraints our method eliminates box-induced over-approximations, enabling earlier search-tree pruning. On ARCH-COMP and neural Lyapunov benchmarks, Fit-LRP reduces branching on the hardest region by $47\times$, cuts worst-case verification time by $15\times$, and with region-wise partitioning, verifies on a single CPU $6.1\times$ faster than $α,\! β$-CROWN on a GPU.

cs.LG↗

Local Reproduction Numbers for Analysis and Optimal Mitigation of Epidemic Processes

In this paper, we propose a unifying framework to analyze layered networked epidemic processes where the population, represented either as a networked SIS or SIR model, is coupled with an infrastructure network. We propose novel local metrics that enable the analysis of the epidemic spreading locally (node-level) and the prediction of the network-wide spreading under some sufficient conditions. Inspired by the bilayer nature of our model, we partition the layered network between intra- and inter-layer interactions. We identify conditions at the layer level which allow the characterization of the network-level basic reproduction number in terms of the physical structure of the layered network. Then, we leverage the local metrics to propose an optimization framework for epidemic mitigation based on a fundamental notion: the network-wide spreading can be quantified by the aggregation of the local (node-level) epidemic burden. We provide guarantees that the local metric-based optimization can be solved as a geometric program. We illustrate our theoretical results via numerical examples and evaluate the performance of the local metrics and the optimization framework they enable versus other existing epidemic mitigation approaches based on network-level metrics.

eess.SY↗

Bayesian Safety Guarantees for Port-Hamiltonian Systems with Learned Energy Functions

Control barrier functions for port-Hamiltonian systems inherit model uncertainty when the Hamiltonian is learned from data. We show how to propagate this uncertainty into a safety filter with independently tunable credibility budgets. To propagate this uncertainty, we employ a two-stage Bayesian approach. First, posterior prediction over the Hamiltonian yields credible bands for the energy storage, producing Bayesian barriers whose safe sets are high-probability inner approximations of the true allowable set with credibility $1 - (η_{\mathrm{ptB}})$. Independently, a drift credible ellipsoid accounts for vector field uncertainty in the CBF inequality with credibility $1 - (η_{\rm dr})$. Since energy and drift uncertainties enter through disjoint credible sets, the end-to-end safety guarantee is at least $1 - (η_{\rm dr} + η_{\mathrm{ptB}})$. Experiments on a mass-spring oscillator with a GP-learned Hamiltonian show that the proposed filter preserves safety despite limited and noisy observations.

eess.SY↗

Hyperlyve: Hyperplane Partitioning for Neural Lyapunov Verification

This work introduces HyParLyVe (Hyperplane Partitioned Lyapunov Verifier), a novel algorithm for sound and complete verification of neural Lyapunov candidates by interpreting shallow ReLU networks as hyperplane arrangements. This perspective reduces positive definiteness verification to a finite set of vertex evaluations, and the decrease condition to a bounded optimization problem over each region. We formally prove correctness of the proposed verification procedures and demonstrate that HyParLyVe achieves significant speedups over state-of-the-art methods.

eess.SY↗

Port-Transversal Barriers: Graph-Theoretic Safety for Port-Hamiltonian Systems

Synthesizing control barrier functions (CBFs) for complex nonlinear systems remains difficult, particularly when safety constraints have high relative degree with respect to the input. In this work, we study the class of composite port-Hamiltonian systems as a network of interconnected subsystems, and this network admits a natural graph structure. We propose a novel graph-theoretic framework for the CBF synthesis problem. The framework addresses the problem of CBF construction for complex nonlinear systems by offering a relative-degree constraint induced by graph distance and a barrier reshaping rule informed by the graph topology. Furthermore, we perform a feasibility analysis of the reshaped barrier under a bounded input constraint and identify the sufficient conditions for feasibility. Lastly, the proposed framework is validated on an LC ladder network, where the CBF feasibility on a capacitor charge constraint depends on where the input enters the network.

eess.SY↗

A Networked SIS Epidemic--Opinion Model with Higher-Order Interactions

This paper studies a susceptible--infected--susceptible (SIS) epidemic model coupled with opinion dynamics over a network of communities with higher-order interactions. Unlike standard networked SIS models, which account only for pairwise transmission, the proposed model incorporates group-level infection mechanisms and feedback between epidemic prevalence and community opinions. We establish local stability and instability conditions for a particular healthy equilibrium, derive a sufficient condition for global exponential eradication of the infection state, and identify conditions under which higher-order interactions induce bistability in the reduced dynamics on a positively invariant synchronous set. These results characterize how higher-order interactions alter the dynamics of opinion-dependent epidemic systems. Numerical simulations illustrate the predicted eradication, bistable, and endemic regimes.

eess.SY↗

Demographic Dependence of Vaccine Adoption under Opinion Persuasion

Inspired by contagion models of social belief formation, we develop an epistemically-informed modeling framework, SIS-Vo, in which vaccine-related information propagates on a signed opinion network. Our model allows for heterogeneous treatment effects of policy messages across subpopulations through demographic-specific responses. We derive fixed-point characterizations of the healthy (disease-free) and endemic equilibria of this model, and obtain conditions for local stability of the healthy state in terms of the contact network and opinion-dependent vaccination capacities. Using numerical simulations, we illustrate how suitably targeted policy interventions, acting through opinion dynamics, can stabilize the epidemic process by moving the system towards the healthy regime. The SIS-Vo framework thus provides a natural basis for control-theoretic analysis of vaccination policies that remain robust even when misinformation targets specific subgroups.

physics.soc-ph↗

Global and Distributed Reproduction Numbers of a Multilayer SIR Model with an Infrastructure Network

In this paper, we propose an SIR spread model in a population network coupled with an infrastructure network that has a pathogen spreading in it. We develop a threshold condition to characterize the monotonicity and peak time of a weighted average of the infection states in terms of the global (network-wide) effective reproduction number. We further define the distributed reproduction numbers (DRNs) of each node in the multilayer network which are used to provide local threshold conditions for the dynamical behavior of each entity. Furthermore, we leverage the DRNs to predict the global behavior based on the node-level assumptions. We use both analytical and simulation results to illustrate that the DRNs allow a more accurate analysis of the networked spreading process than the global effective reproduction number.

eess.SY↗

Spectral Flow Learning Theory: Finite-Sample Guarantees for Vector-Field Identification

We study the identification of continuous-time vector fields from irregularly sampled trajectories. We introduce spectral flow learning, which learns in a windowed flow space using a lag-linear label operator that aggregates lagged Koopman actions. We provide finite-sample, high-probability (FS-HP) guarantees for the class of variable-step linear multistep methods (vLMM). The FS-HP rates are constructed using spectral regularization with qualification-controlled filters for flow predictors under standard source and filter assumptions. A multistep observability inequality links flow error to vector-field error and yields two-term bounds that combine a statistical rate with an explicit discretization bias from vLMM theory. Simulations on a controlled mass-spring system corroborate the theory and clarify conditioning, step-sample tradeoffs, and practical implications.

eess.SY↗

Robust Safety-Critical Control of Networked SIR Dynamics

We present a robust safety-critical control framework tailored for networked susceptible-infected-recovered (SIR) epidemic dynamics, leveraging control barrier functions (CBFs) and robust control barrier functions to address the challenges of epidemic spread and mitigation. In our networked SIR model, each node must keep its infection level below a critical threshold, despite dynamic interactions with neighboring nodes and inherent uncertainties in the epidemic parameters and measurement errors, to ensure public health safety. We first derive a CBF-based controller that guarantees infection thresholds are not exceeded in the nominal case. We enhance the framework to handle realistic epidemic scenarios under uncertainties by incorporating compensation terms that reinforce safety against uncertainties: an independent method with constant bounds for uniform uncertainty, and a novel approach that scales with the state to capture increased relative noise in early or suppressed outbreak stages. Simulation results on a networked SIR system illustrate that the nominal CBF controller maintains safety under low uncertainty, while the robust approaches provide formal safety guarantees under higher uncertainties; in particular, the novel method employs more conservative control efforts to provide larger safety margins, whereas the independent approach optimizes resource allocation by allowing infection levels to approach the boundaries in steady epidemic regimes.

eess.SY↗

Learning Passive Continuous-Time Dynamics with Multistep Port-Hamiltonian Gaussian Processes

We propose the multistep port-Hamiltonian Gaussian process (MS-PHS GP) to learn physically consistent continuous-time dynamics and a posterior over the Hamiltonian from noisy, irregularly-sampled trajectories. By placing a GP prior on the Hamiltonian surface $H$ and encoding variable-step multistep integrator constraints as finite linear functionals, MS-PHS GP enables closed-form conditioning of both the vector field and the Hamiltonian surface without latent states, while enforcing energy balance and passivity by design. We state a finite-sample vector-field bound that separates the estimation and variable-step discretization terms. Lastly, we demonstrate improved vector-field recovery and well-calibrated Hamiltonian uncertainty on mass-spring, Van der Pol, and Duffing benchmarks.

cs.LG↗

A Physics-Informed Neural Networks-Based Model Predictive Control Framework for $SIR$ Epidemics

This work introduces a physics-informed neural networks (PINNs)-based model predictive control (MPC) framework for susceptible-infected-recovered ($SIR$) spreading models. Existing studies in MPC design for epidemic control often assume either 1) measurable states of the dynamics, where the parameters are learned, or 2) known parameters of the model, where the states are learned. In this work, we address the joint real-time estimation of states and parameters within the MPC framework using only noisy infected states, under the assumption that 1) only the recovery rate is known, or 2) only the basic reproduction number is known. Under the first assumption, we propose MPC-PINNs and two novel PINNs algorithms, all of which are integrated into the MPC framework. First, we introduce MPC-PINNs, which are designed for $SIR$ models with control. We then propose log-scaled PINNs (MPC-LS-PINNs), which incorporate a log-scaled loss function to improve robustness against noise. Next, we present split-integral PINNs (MPC-SI-PINNs), which leverage integral operators and state coupling in the neural network training process to effectively reconstruct the complete epidemic state information. Building upon these methods, we further extend our framework for the second assumption. We establish the necessary conditions and extend our PINNs algorithms, where MPC-SI-PINNs are simplified as split-PINNs (MPC-S-PINNs). By incorporating these algorithms into the MPC framework, we simultaneously estimate the epidemic states and parameters while generating optimal control strategies. Experiment results demonstrate the effectiveness of the proposed methods under different settings.

cs.LG↗

Online Identification of Time-Varying Systems Using Excitation Sets and Change Point Detection

In this work, we first show that the problem of parameter identification is often ill-conditioned and lacks the persistence of excitation required for the convergence of online learning schemes. To tackle these challenges, we introduce the notion of optimal and greedy excitation sets which contain data points with sufficient richness to aid in the identification task. We then present the greedy excitation set-based recursive least squares algorithm to alleviate the problem of the lack of persistent excitation, and prove that the iterates generated by the proposed algorithm minimize an auxiliary weighted least squares cost function. When data points are generated from time-varying parameters, online estimators tend to underfit the true parameter trajectory, and their predictability deteriorates. To tackle this problem, we propose a memory resetting scheme leveraging change point detection techniques. Finally, we illustrate the performance of the proposed algorithms via several numerical case studies to learn the (time-varying) parameters of networked epidemic dynamics, and compare it with results obtained using conventional approaches.

eess.SY↗

Hybrid SIS Dynamics for Demand Modeling of Frequently Updated Products

We propose a hybrid spreading process model to capture the dynamics of demand for software-based products. We introduce discontinuous jumps in the state to model sudden surges in demand that can be seen immediately after a product update is released. After each update, the modeled demand evolves according to a continuous-time susceptible-infected-susceptible (SIS) epidemic model. We identify the necessary and sufficient conditions for estimating the hybrid model's parameters for an arbitrary finite number of sequential updates. We verify the parameter estimation conditions in simulation, and evaluate how the estimation of these parameters is impacted by the presence of observation and process noise. We then validate our model by applying our estimation method to daily user engagement data for a regularly updating software product, the live-service video game `Apex Legends.'

eess.SY↗

Scalable Distributed Reproduction Numbers of Network Epidemics with Differential Privacy

Reproduction numbers are widely used for the estimation and prediction of epidemic spreading processes over networks. However, conventional reproduction numbers of an overall network do not indicate where an epidemic is spreading. Therefore, we propose a novel notion of local distributed reproduction numbers to capture the spreading behaviors of each node in a network. We first show how to compute them and then use them to derive new conditions under which an outbreak can occur. These conditions are then used to derive new conditions for the existence, uniqueness, and stability of equilibrium states of the underlying epidemic model. Building upon these local distributed reproduction numbers, we define cluster distributed reproduction numbers to model the spread between clusters composed of nodes. Furthermore, we demonstrate that the local distributed reproduction numbers can be aggregated into cluster distributed reproduction numbers at different scales. However, both local and cluster distributed reproduction numbers can reveal the frequency of interactions between nodes in a network, which raises privacy concerns. Thus, we next develop a privacy framework that implements a differential privacy mechanism to provably protect the frequency of interactions between nodes when computing distributed reproduction numbers. Numerical experiments show that, even under differential privacy, the distributed reproduction numbers provide accurate estimates of the epidemic spread while also providing more insights than conventional reproduction numbers.

eess.SY↗

Modeling Epidemic Spread: A Gaussian Process Regression Approach

Modeling epidemic spread is critical for informing policy decisions aimed at mitigation. Accordingly, in this work we present a new data-driven method based on Gaussian process regression (GPR) to model epidemic spread through the difference on the logarithmic scale of the infected cases. We bound the variance of the predictions made by GPR, which quantifies the impact of epidemic data on the proposed model. Next, we derive a high-probability error bound on the prediction error in terms of the distance between the training points and a testing point, the posterior variance, and the level of change in the spreading process, and we assess how the characteristics of the epidemic spread and infection data influence this error bound. We present examples that use GPR to model and predict epidemic spread by using real-world infection data gathered in the UK during the COVID-19 epidemic. These examples illustrate that, under typical conditions, the prediction for the next twenty days has 94.29% of the noisy data located within the 95% confidence interval, validating these predictions. We further compare the modeling and prediction results with other methods, such as polynomial regression, k-nearest neighbors (KNN) regression, and neural networks, to demonstrate the benefits of leveraging GPR in disease spread modeling.

stat.ML↗

Optimal Bayesian Persuasion for Containing SIS Epidemics

We consider a susceptible-infected-susceptible (SIS) epidemic model in which a large group of individuals decide whether to adopt partially effective protection without being aware of their individual infection status. Each individual receives a signal which conveys noisy information about its infection state, and then decides its action to maximize its expected utility computed using its posterior probability of being infected conditioned on the received signal. We first derive the static signal which minimizes the infection level at the stationary Nash equilibrium under suitable assumptions. We then formulate an optimal control problem to determine the optimal dynamic signal that minimizes the aggregate infection level along the solution trajectory. We compare the performance of the dynamic signaling scheme with the optimal static signaling scheme, and illustrate the advantage of the former through numerical simulations.

eess.SY↗