Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1605.02411

Convergence Analysis of Classes of Asymmetric Networks of Cucker-Smale Type with Deterministic Perturbations

Christoforos Somarakis·Evripidis Paraskevas·John S. Baras·Nader Motee
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce and discuss two nonlinear perturbed extensions of the Cucker-Smale model with asymmetric coupling weights. The first model assumes a finite collection of autonomous agents aiming to perform a consensus process in the presence of identical internal dynamics. The second model describes a similar population of agents that perform velocity alignment with the restriction of collision-free orbits. Although qualitatively different, we explain how these two non-trivial types of perturbations are analyzed under a unified framework. Rigorous analysis is conducted towards establishing new sufficient conditions for asymptotic flocking to a synchronized motion. Applications of our results are compared with simulations to illustrate the effectiveness of our theoretical estimates.

Explore related subjects

math.OCmath.CA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christoforos Somarakis, Evripidis Paraskevas, John S. Baras, Nader Motee. 2017-10-03. Convergence Analysis of Classes of Asymmetric Networks of Cucker-Smale Type with Deterministic Perturbations. https://doi.org/10.1109/tcns.2017.7536030

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Nonsmooth Newton methods with effective subspaces for polyhedral regularization

We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the tilt-stability condition at the optimal solution, these methods achieve the quadratic convergence rates expected of Newton schemes. Numerical experiments on Lasso, generalized Lasso, OSCAR-regularized least-square problems, and an image super-resolution task illustrate both the broad applicability and the accelerated convergence profile of the proposed algorithms, in comparison with first-order and several recently developed nonsmooth Newton schemes.

math.OC↗
arXiv2026

Non-Asymptotic Global Convergence of PPO-Clip

Reinforcement learning has gained attention for modern Large Language Model post-training. The actor-only variants of Proximal Policy Optimization (PPO) are widely applied for their efficiency. These algorithms incorporate a clipping mechanism to improve stability. Besides, a regularization term, such as the reverse KL-divergence or a more general \(f\)-divergence, is introduced to control excessive deviation from a reference policy. Despite their empirical success, a rigorous theoretical understanding of the problem and the algorithm's properties is limited. This paper advances the theoretical foundations of the PPO-Clip algorithm by analyzing a deterministic actor-only PPO algorithm within the general RL setting with \(f\)-divergence regularization under the softmax policy parameterization. We derive a non-uniform Lipschitz smoothness condition and a Łojasiewicz inequality for the considered problem. Based on these properties, we establish non-asymptotic global linear convergence in value gap for the forward KL regularizer. For the reverse KL regularizer, we derive global linear convergence from any finite softmax initialization in both value gap and squared policy distance.

math.OC↗
arXiv2026

An Occupation-Measure and Frank-Wolfe Framework for Heterogeneous Mean-Field Control

Heterogeneous mean-field control (MFC) involves multiple interacting populations with distinct dynamics, control constraints, and coupling structures. We develop a heterogeneous occupation-measure mean-field control (OM-MFC) framework that reformulates the population-distribution control problem as an optimization problem over occupation measures. In this representation, potentially nonlinear dynamics enter through linear weak Liouville constraints, while nonlocal inter-population interactions become structured bilinear functionals of the occupation-measure marginals. Exploiting this structure, we derive a Frank--Wolfe (FW) method and show that its linear minimization oracle decomposes into independent population-wise optimal control problems once the current population distributions are fixed, enabling parallel computation without an a priori discretization of the measure space. We further establish a sufficient convexity condition based on the symmetrized matrix-valued interaction kernel, under which Frank--Wolfe with an exact oracle admits the standard $O(1/k)$ convergence rate. Numerical examples on heterogeneous UAV coordination and three-dimensional search-and-rescue illustrate the framework both within the certified convex regime and for directional interactions beyond that regime.

math.OC↗