Topics / Optimization and Control / Oct 5 - 11, 2026

Weekly issue

Top 20 Optimization and Control Papers: Oct 5 - 11, 2026

Updated · Category: Optimization and Control (arXiv math.OC) · Ranked by potential impact

Prefer new papers every day? It's free.Optimization and Control Daily Papers →
  1. 1
  2. 2
    Policy As Data: Replay-Based Policy Dual Averaging Via Advantage Regression

    This work introduces Regularized Dual Averaging Actor Critic (RDA2C), which assigns a distinct role to replay.

  3. 3
    Computational Optimization of HiPSC-derived Red Blood Cell Clone Banks for Alloimmunized Patients in A Saudi Population

    This study aimed to quantify the minimum size of an O RhD-negative (O-negative) human induced pluripotent stem cell (hiPSC)–derived RBC clone bank needed to cover alloimmunized transfusion recipients in a Saudi population and to provide a quantitative framework for prioritizing candidate clones based on real-world alloantibody frequencies and antigen-negativity constraints.

  4. 4
    Budget-Constrained Multi-Consensus Decentralized Gradient Descent

    We investigate decentralized gradient descent (DGD) with emphasis on efficient communication and computation resource utilization under budget constraints.

  5. 5
    Topology Design for Distributed Consensus with Relay-Assisted Communication

    Instead of permanently adding a fixed set of relay links, we introduce a time-sharing framework where multiple relay configurations are activated in a probabilistic manner.

Get papers like these the day they come out, not a week later.

Follow this category
  1. 6
    Ordered Weighted Average Support Vector Regression

    This paper introduces a novel Support Vector Regression (SVR) model that incorporates Ordered Weighted Average (OWA) operators to differently penalize deviations of observations from the {\epsilon}-strip.

  2. 7
    An Optimal Second-Order Algorithm for Finite-Sum Optimization Under Average Smoothness and Convexity

    In this paper, we consider a finite-sum optimization problem, where the objective function is convex, the $n$ component functions are twice continuously differentiable and their Hessians are mean-square Lipschitz.

  3. 8
    Eigenvalues of The Hessian in Deep Learning: The Origin of Symmetry and Its Breaking

    Hessian spectra at trained models in deep learning exhibit a persistent pattern: eigenvalues organize into distinct clusters, including a large bulk near zero and a few isolated outliers. This paper shows that a natural account of these spectral phenomena emerges when the original setting is understood as a departure from a nearby, otherwise hidden, highly symmetric reference.

  4. 9
    PLUTO: An Agentic AI Tool for Interactive Spacecraft Rendezvous Trajectory Design

    This paper introduces PLUTO (Plain Language Understanding for Trajectory Optimization), an interactive trajectory design framework that integrates agentic AI coding tools within a sequential convex programming (SCP) architecture.

  5. 10
    Harnessing LLMs with Direction-Scope Control for Combinatorial Solver Refinement

    Tracing this oscillation, our analysis reveals that feasibility degradation often follows large solver revisions, while substantial feedback redundancy makes it harder to identify which failures deserve attention. Motivated by these findings, we introduce DiSH, a harness that jointly controls revision direction and scope.

  6. 11
  7. 12
    FedRSPO+: A Heterogeneity-aware Algorithm for Decision-focused Federated Learning

    We propose FedRSPO+, a heterogeneity-aware framework for decision-focused federated learning, built on RSPO+, a regularized predict-then-optimize surrogate that smooths the decision map through projection.

  8. 13
    Weakly Quasar-Convex Optimization

    This paper introduces the class of weakly quasar-convex functions, a notion that simultaneously generalizes weak convexity (and hence convexity) and quasar-convexity.

  9. 14
    LASER: Latent Space Adjoint Matching for Support-Constrained Entropy-Regularized Offline RL

    However, naively optimizing the latent policy can easily cause the policy to collapse into a brittle mode or exploit sharp artifacts of the learned critic. In this work, we find that entropy regularization is essential in latent-space RL for addressing these challenges.

  10. 15
    Towards A Theory of Quantitative Vulnerability Analysis for Engineering Systems

    Since the 1980s, risk analysis for engineering systems has been defined based on a tuple of scenarios, $\mathcal{S}$, likelihoods, $L$, and consequences, $C$, where $Risk = (\mathcal{S},L,C)$. We argue that equating this triplet with risk alone is insufficient and potentially misleading.

  11. 16
  12. 17
  13. 18
    Learn Feasibility Once, Optimize All Objectives: Derivative-Free Diffusion Models for Chance-Constrained Programming

    In this paper, we propose a \textbf{D}erivative-free \textbf{D}iffusion-based framework that \textbf{D}isentangles constraint modeling from objective optimization, termed \textbf{D$^3$Opt}.

  14. 19
    Fully Coupled Nonlinear Mean-Field FBSΔEs: Solvability and An LQ Buffer-Adjustment Illustration

    Building on existing domination--monotonicity methods, we formulate deterministic matrix combinations in centered and mean coordinates and prove a continuation estimate uniform in the homotopy parameter.

  15. 20
    Accelerated Safe Gradient Flow

    This letter introduces an accelerated safe gradient flow (A-SGF) for strongly convex constrained optimization problems.