Jun 2023· IEEE International Joint Conference on Neural Network· pp. 1-8· 4 citations· 40 references
Computer Science
TL;DR
A novel MTRL framework called Task-Specific feature Selector and Scheduler (T3S) is proposed, which consists of two components: a feature selector and a task scheduler that consistently outperforms the state-of-the-art M TRL algorithms on various robotics manipulation tasks.
Abstract
Multi-task reinforcement learning (MTRL) is a technique to train multiple tasks simultaneously, where previous works usually train a single model to solve different tasks by sharing parameters across various tasks. However, these methods are faced with inter-task interference since what parameters should be shared across tasks is not addressed, dramatically reducing learning efficiency. To solve these problems, we propose a novel MTRL framework called Task-Specific feature Selector and Scheduler (T3S), which consists of two components: a feature selector and a task scheduler. Specifically, the feature selectors employ hypernetworks to construct task-specific soft masks, which can be applied by globally shared representation to construct task-specific features. The task scheduler selects tasks for learning through two metrics, where the selection probability is inversely proportional to task progress (e.g., success rate) and task learning speed. Experimental results show that T3S consistently outperforms the state-of-the-art MTRL algorithms on various robotics manipulation tasks.
HRL-TaskOpt is presented, a novel Hierarchical Reinforcement Learning-based task scheduling framework that combines high-level global task offloading with millisecond-granularity local scheduling policies in an edge–cloud scenario and offers a scalable and intelligent solution for adaptive task scheduling.
Krishna Patwari, Raghvendra Kumar, J. Sastry· International Journal of Ele...· 0 citations
PAC, a Progress-Augmented Advantage Curriculum for multi-task RL of LLMs that combines two task-level signals: advantage-derived learnability, which measures the magnitude of the policy update a task can induce, and recent reward gains, which show whether those updates have improved task performance.
Yuan-Qiang Yu, Yan-Zhao Zheng, Zhen-Tao Zhang et al.· 1 citation
FARM (Fundamental Agentic Reward Model for Multi-task Wireless Network Optimization), a reward-space transfer framework that shifts cross-task knowledge reuse from policy space to trajectory-level decision evaluation, is proposed.
Fei-Ran You, Chang-Xu Ni, Hao-Zhe Ma et al.· 0 citations
ReLA is an RL scheduler built on structured representation learning and aggregation that learns intra-entity representations using self-attention and convolution, captures inter-entity operation–machine interactions using cross-attention, and aggregates multi-scale representations for parallel actor-based scoring of fe...
Zheng-Yi Kwan, Wei Zhang, Aik Beng Ng et al.· Proceedings of the Internati...· 0 citations
Task Specialization Fine-Tuning (TSFT), an online framework that predicts fine-tuning performance with a simple parametric model and exactly solves the resulting discrete budget allocation problem via integer linear programming, is proposed.
Jianan Zhou, Jung-Hoon Cho, Tianyue Zhou et al.· 0 citations
Multi-task model-based reinforcement learning (MBRL) typically relies on a single shared world model, but heterogeneity in task dynamics and physical properties often leads to brittle training and negative transfer. We propose Structured Residual Adaptation (SRA), a parameter-efficient approach that adapts a frozen wor...
Yan-Lang Zheng, Zhen-Fu Zhang, Jin-Tao Li et al.· International Conference on...· 0 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.