Searcharxiv⌕ Search

arXiv subjects

Ahmed Allibhoy

Publications and source records attributed to Ahmed Allibhoy.

7 recordsLinked to original sources

Provably Safe Generative Sampling with Constricting Barrier Functions

Flow-based generative models, such as diffusion models and flow matching models, have achieved remarkable success in learning complex data distributions. However, a critical gap remains for their deployment in safety-critical domains: the lack of formal guarantees that generated samples will satisfy hard constraints. We propose a safety filtering framework that acts as an online shield for any pre-trained generative model. Our key insight is to cooperate with the generative process rather than override it. We define a constricting safety tube that is relaxed at the initial noise distribution and progressively tightens to the target safe set at the final data distribution, mirroring the coarse-to-fine structure of the generative process itself. By characterizing this tube via Control Barrier Functions (CBFs), we synthesize a feedback control input through a convex Quadratic Program (QP) at each sampling step. As the tube is loosest when noise is high and intervention is cheapest in terms of control energy, most constraint enforcement occurs when it least disrupts the model's learned structure. We prove that this mechanism guarantees safe sampling in discrete-time. The minimum-norm control synthesized at each step minimizes the per-step contribution to the KL divergence between the safe and original distributions. Across all experiments, we observe 100% constraint satisfaction. Our framework applies to any pre-trained flow-based sampling scheme requiring no retraining or architectural modifications. We validate the approach across constrained image generation, physically-consistent trajectory sampling, and safe robotic manipulation policies, achieving 100% constraint satisfaction while preserving semantic fidelity.

cs.LG↗

Constricting Tubes for Prescribed-Time Safe Control

We propose a constricting Control Barrier Function (CBF) framework for prescribed-time control of control-affine systems with input constraints. Given a system starting outside a target safe set, we construct a time-varying safety tube that shrinks from a relaxed set containing the initial condition to the target set at a user-specified deadline. Any controller rendering this tube forward invariant guarantees prescribed-time recovery by construction. The constriction schedule is bounded and tunable by design, in contrast to prescribed-time methods where control effort diverges near the deadline. Feasibilityå under input constraints reduces to a single verifiable condition on the constriction rate, yielding a closed-form minimum recovery time as a function of control authority and initial violation. The framework imposes a single affine constraint per timestep regardless of state dimension, scaling to settings where grid-based reachability methods are intractable. We validate on an 18-dimensional multi-agent system, demonstrating scalability and prescribed-time recovery with bounded control effort.

math.OC↗

Global Optimization Through Heterogeneous Oscillator Ising Machines

Oscillator Ising machines (OIMs) are networks of coupled oscillators that seek the minimum energy state of an Ising model. Since many NP-hard problems are equivalent to the minimization of an Ising Hamiltonian, OIMs have emerged as a promising computing paradigm for solving complex optimization problems that are intractable on existing digital computers. However, their performance is sensitive to the choice of tunable parameters, and convergence guarantees are mostly lacking. Here, we show that lower energy states are more likely to be stable, and that convergence to the global minimizer is often improved by introducing random heterogeneities in the regularization parameters. Our analysis relates the stability properties of Ising configurations to the spectral properties of a signed graph Laplacian. By examining the spectra of random ensembles of these graphs, we show that the probability of an equilibrium being asymptotically stable depends inversely on the value of the Ising Hamiltonian, biasing the system toward low-energy states. Our numerical results confirm our findings and demonstrate that heterogeneously designed OIMs efficiently converge to globally optimal solutions with high probability.

math.OC↗

Anytime Solvers for Variational Inequalities: the (Recursive) Safe Monotone Flows

This paper synthesizes anytime algorithms, in the form of continuous-time dynamical systems, to solve monotone variational inequalities. We introduce three algorithms that solve this problem: the projected monotone flow, the safe monotone flow, and the recursive safe monotone flow. The first two systems admit dual interpretations: either as projected dynamical systems or as dynamical systems controlled with a feedback controller specified by a quadratic program derived using techniques from safety-critical control. The third flow bypasses the need to solve quadratic programs along the trajectories by incorporating a dynamics whose equilibria precisely correspond to such solutions, and interconnecting the dynamical systems on different time scales. We perform a thorough analysis of the dynamical properties of all three systems. For the safe monotone flow, we show that equilibria correspond exactly with critical points of the original problem, and the constraint set is forward invariant and asymptotically stable. The additional assumption of convexity and monotonicity allows us to derive global stability guarantees, as well as establish the system is contracting when the constraint set is polyhedral. For the recursive safe monotone flow, we use tools from singular perturbation theory for contracting systems to show KKT points are locally exponentially stable and globally attracting, and obtain practical safety guarantees. We illustrate the performance of the flows on a two-player game example and also demonstrate the versatility for interconnection and regulation of dynamical processes of the safe monotone flow in an example of a receding horizon linear quadratic dynamic game.

math.OC↗

Control Barrier Function Based Design of Gradient Flows for Constrained Nonlinear Programming

This paper considers the problem of designing a continuous-time dynamical system that solves a constrained nonlinear optimization problem and makes the feasible set forward invariant and asymptotically stable. The invariance of the feasible set makes the dynamics anytime, when viewed as an algorithm, meaning it returns a feasible solution regardless of when it is terminated. Our approach augments the gradient flow of the objective function with inputs defined by the constraint functions, treats the feasible set as a safe set, and synthesizes a safe feedback controller using techniques from the theory of control barrier functions. The resulting closed-loop system, termed safe gradient flow, can be viewed as a primal-dual flow, where the state corresponds to the primal variables and the inputs correspond to the dual ones. We provide a detailed suite of conditions based on constraint qualification under which (both isolated and nonisolated) local minimizers are stable with respect to the feasible set and the whole state space. Comparisons with other continuous-time methods for optimization in a simple example illustrate the advantages of the safe gradient flow.

math.OC↗

Regularity Properties of Optimization-Based Controllers

This paper studies regularity properties of optimization-based controllers, which are obtained by solving optimization problems where the parameter is the system state and the optimization variable is the input to the system. Under a wide range of assumptions on the optimization problem data, we provide an exhaustive collection of results about their regularity, and examine their implications on the existence and uniqueness of solutions and the forward invariance guarantees for the resulting closed-loop systems. We discuss the broad relevance of the results in different areas of systems and controls.

math.OC↗

Data-based Receding Horizon Control of Linear Network Systems

We propose a distributed data-based predictive control scheme to stabilize a network system described by linear dynamics. Agents cooperate to predict the future system evolution without knowledge of the dynamics, relying instead on learning a data-based representation from a single sample trajectory. We employ this representation to reformulate the finite-horizon Linear Quadratic Regulator problem as a network optimization with separable objective functions and locally expressible constraints. We show that the controller resulting from approximately solving this problem using a distributed optimization algorithm in a receding horizon manner is stabilizing. We validate our results through numerical simulations.

math.OC↗