Beyond Binary: Continuous State Optimization with Graph-Structured Objectives

• URL: http://arxiv.org/abs/2608.09366v1
• Date: Mon, 10 Aug 2026 09:46:28 GMT
• Title: Beyond Binary: Continuous State Optimization with Graph-Structured Objectives
• Abstract summary: Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives.<n>We propose an algorithm that performs lazy updates to minimize switching costs while maintaining near-optimal regret.
• Score: 61.561691314533135
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives, such as fairness, accuracy, and latency. While recent work has formalized this as an optimization problem over binary states, many real-world control parameters, such as fairness thresholds, diversity mixing rates, or resource budgets, are continuous. In this work, we extend the framework to \emph{continuous state spaces}. We model the problem as minimizing a sum of linear objectives subject to \emph{movement costs} that penalize system instability. We capture the local structure of the objectives using a \emph{dependency graph} (or factor graph), where each objective is determined by a subset of the state attributes. To address the tension between exploration and stability, we propose \emph{Lazy Graph-LinUCB}, an algorithm that performs lazy updates to minimize switching costs while maintaining near-optimal regret. Beyond stability, we introduce three advanced mechanisms to exploit the underlying graph structure: (1) an \emph{asynchronous} update schedule that eliminates synchronization overhead in sparse graphs; (2) an \emph{adaptive} algorithm that learns the graph structure from data; and (3) a \emph{joint estimator} that leverages data sharing among correlated objectives to significantly tighten regret bounds. Empirically, we demonstrate that these structural exploitations reduce movement costs by more than a factor of three in heterogeneous systems while maintaining similar cumulative losses.

Related papers

• DecoVLN: Decoupling Observation, Reasoning, and Correction for Vision-and-Language Navigation [49.233063630722334]
  We propose DecoVLN, a framework for robust streaming perception and closed-loop control in long-horizon navigation.<n>We introduce adaptive refinement mechanism that selects frames from a historical candidate pool by iteratively optimizing a unified scoring function.<n>We also introduce a state-action pair-level corrective finetuning strategy to alleviate compounding errors.
  arXiv  Detail & Related papers  (2026-03-13T16:24:37Z)
• ChronoSpike: An Adaptive Spiking Graph Neural Network for Dynamic Graphs [10.05203937088835]
  Spiking neural networks offer event-driven efficiency but remain limited by sequential propagation, binary information loss, and local aggregation that misses global context.<n>We propose ChronoSpike, an adaptive spiking graph neural network that integrates learnable LIF neurons with per-channel membrane dynamics, multi-head attentive spatial aggregation on continuous features, and a lightweight Transformer temporal encoder.<n>On three large-scale benchmarks, ChronoSpike outperforms twelve state-of-the-art baselines by $2.0%$ Macro-F1 and $2.4%$ Micro-F1 while achieving $3-10times$ faster training than recurrent methods with a
  arXiv  Detail & Related papers  (2026-02-01T09:50:21Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks [50.2033914945157]
  We present a representation learning framework, Intensity Profile Projection, for continuous-time dynamic network data. The framework consists of three stages: estimating pairwise intensity functions, learning a projection which minimises a notion of intensity reconstruction error. Moreoever, we develop estimation theory providing tight control on the error of any estimated trajectory, indicating that the representations could even be used in quite noise-sensitive follow-on analyses.
  arXiv  Detail & Related papers  (2023-06-09T15:38:25Z)
• Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment [53.72873672076391]
  Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information. We propose a self-supervised method called S2T for temporal graph learning, which extracts both temporal and structural information. S2T achieves at most 10.13% performance improvement compared with the state-of-the-art competitors on several datasets.
  arXiv  Detail & Related papers  (2023-02-15T06:36:04Z)
• Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs [65.18780403244178]
  We propose a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE) Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing.
  arXiv  Detail & Related papers  (2022-02-17T02:17:31Z)
• Unsupervised Deep Manifold Attributed Graph Embedding [33.1202078188891]
  We propose a novel graph embedding framework named Deep Manifold Attributed Graph Embedding (DMAGE) A node-to-node geodesic similarity is proposed to compute the inter-node similarity between the data space and the latent space. We then design a new network structure with fewer aggregation to alleviate the oversmoothing problem.
  arXiv  Detail & Related papers  (2021-04-27T08:47:39Z)
• Optimizing Reachability Sets in Temporal Graphs by Delaying [8.122270502556374]
  temporal graph is a dynamic graph where every edge is assigned a set of integer time labels. We study how changes of the time labels, corresponding to delays on the availability of the edges, affect the reachability sets from given sources.
  arXiv  Detail & Related papers  (2020-04-13T11:36:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.