Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.03875

Learning Multi-Timescale Interventions under Safety and Resource Constraints

David Mguni·Wanrong Yang·Jing Dong·Jing Peng·Ziquan Liu·Muhammad Salman Haleem·Baoxiang Wang·Dominik Wojtczak
View original source ↗Read source document ↗Export metadata ↓

Abstract

Many sequential decision problems offer qualitatively different ways of influencing the environment: some interventions act immediately, whereas others induce persistent effects that continue to shape future states long after the decision that initiated them. An agent must then decide jointly when to intervene, which temporal mode to use and how strongly, while accounting for residual effects and limited intervention resources. We introduce MINT: Multi-timescale Intervention Network Training. Persistent effects are carried by an augmented intervention state that accumulates and decays, while a structured policy separates intervention-mode selection from conditional control. Unlike temporal abstractions that extend policy execution, persistent-effect interventions remain part of the environment dynamics and may overlap with later interventions. We show that the augmented state is a sufficient statistic for the intervention history, preserving the Markov property, and establish Bellman contraction and almost-sure convergence of a tabular Q-learning instance. Across persistent-control MuJoCo locomotion, stochastic inventory management, and a physiologically grounded Type 1 Diabetes Mellitus (T1DM) simulator, MINT attains the best mean primary metric on two of three benchmarks while using fewer intervention activations than an identically augmented flat policy. Its return advantage is present at every binding intervention budget and narrows to parity in the unconstrained reference setting. In T1DM it achieves $90.9\pm0.9\%$ time in range with zero time below range, improving on the strongest baseline by $21.5\%$ points. Code, benchmarks and the configuration for every reported run are available at https://github.com/heywanrong/mint-rl.

Explore related subjects

cs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Mguni, Wanrong Yang, Jing Dong, Jing Peng, Ziquan Liu, Muhammad Salman Haleem, Baoxiang Wang, Dominik Wojtczak. 2026-08-17. Learning Multi-Timescale Interventions under Safety and Resource Constraints. https://arxiv.org/abs/2508.03875

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

KEEP EXPLORING

Related papers

arXiv2026

Analysis of Regularized Learning in Banach Spaces for Linear-functional Data

This article delves into the study of the theory of regularized learning in Banach spaces for linear-functional data. It encompasses discussions on representer theorems, pseudo-approximation theorems, and convergence theorems. Regularized learning is designed to minimize regularized empirical risks over a Banach space. The empirical risks are calculated by utilizing training data and multi-loss functions. The input training data are composed of linear functionals in a predual space of the Banach space to capture discrete local information from multimodal data and multiscale models. Through the regularized learning, approximations of the exact solution to an unidentified or uncertain original problem are globally achieved. In the convergence theorems, the convergence of the approximate solutions to the exact solution is established through the utilization of the weak* topology of the Banach space. The theorems of regularized learning are utilized in the interpretation of classical machine learning, such as support vector machines and artificial neural networks.

cs.LG↗
arXiv2026

On Minimal Depth in Neural Networks

Understanding the relationship between the depth of a neural network and its representational capacity is a central problem in deep learning theory. In this work, we develop a geometric framework to analyze the expressivity of ReLU networks with the notion of depth complexity for convex polytopes. The depth of a polytope recursively quantifies the number of alternating convex hull and Minkowski sum operations required to construct it. This geometric perspective serves as a rigorous tool for deriving depth lower bounds and understanding the structural limits of deep neural architectures. We establish lower and upper bounds on the depth of polytopes, as well as tight bounds for classical families. These results yield two main consequences. First, we provide a purely geometric proof of the expressivity bound by Arora et al. (2018), confirming that $\lceil \log_2(n+1)\rceil$ hidden layers suffice to represent any continuous piecewise linear (CPWL) function. Second, we prove that, unlike general ReLU networks, convex polytopes do not admit a universal depth bound. Specifically, the depth of cyclic polytopes in dimensions $n \geq 4$ grows unboundedly with the number of vertices. This result implies that Input Convex Neural Networks (ICNNs) cannot represent all convex CPWL functions with a fixed depth, revealing a sharp separation in expressivity between ICNNs and standard ReLU networks.

cs.LG↗
arXiv2026

ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy

Reinforcement learning agents depend on reward signals whose density is rarely under the designer's control, and when such signals are absent, an agent must generate its own drive to explore. State entropy maximization offers a principled objective for this, but existing methods break down at scale in two ways: the intrinsic reward vanishes once a state has been visited, discouraging revisits to the very gateways that lead onward, and estimating entropy over millions of accumulated observations becomes computationally prohibitive. We address both with Episodic and Lifelong Exploration via Maximum Entropy (ELEMENT), a multiscale intrinsically motivated framework for reward-free exploration that transfers to downstream tasks. ELEMENT couples lifelong entropy maximization with a complementary episodic term acting on a faster timescale. For the episodic term, we derive average episodic state entropy, an intrinsic reward that is the exact minimizer of a tractable upper bound on the reward-decomposition objective; for the lifelong term, we propose a $k$NN graph-based estimator that keeps entropy tractable without forgetting. ELEMENT consistently outperforms state-of-the-art intrinsic reward baselines on state coverage and unsupervised pre-training. Videos, code, and supplementary material: https://sites.google.com/view/element-rl.

cs.LG↗