Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

11223243 · Jun 202019922001200920182026
48 results for composable skills

MCP learns reusable skills for complex tasks by combining simple ones.

problem Learning complex tasks with many skills requires impractical amounts of data.
method Factorizes skills into primitives that can be combined multiplicatively.
result MCP can learn and reuse skills for novel tasks from pre-training.

Paper proposes a method to compose task-agnostic skills for solving new problems.

problem Learning task-specific policies for solving new problems.
method Deep reinforcement learning-based skill transfer and composition method.
result Method transfers skills to new problem settings and solves challenging environments with high data efficiency.

An important property for lifelong-learning agents is the ability to combine existing skills to solve unseen tasks. In general, however, it is unclear how to compose skills in a principled way. We provide a "recipe" for optimal value function composition in entropy-regularised reinforcement learning (RL) and then exten…

2018-07-12abs ↗pdf ↗

New method improves data efficiency in reinforcement learning by composing skills.

problem Improving data efficiency in reinforcement learning by composing previously mastered skills.
method Extending policy improvement to maximum entropy framework, introducing successor features, and explicitly learning divergence between base policies.
result Proposes a novel approach that outperforms or matches existing methods in various tasks.

We introduce a method for constructing skills capable of solving tasks drawn from a distribution of parameterized reinforcement learning problems. The method draws example tasks from a distribution of interest and uses the corresponding learned policies to estimate the topology of the lower-dimensional piecewise-smooth…

2012-06-27abs ↗pdf ↗

A Boolean algebra formalizes task composition for reinforcement learning.

problem Formalizing task composition for efficient learning and problem-solving.
method Formalized tasks as a Boolean algebra, learning goal-oriented value functions, and composing them to solve new tasks.
result Agents can solve new tasks without additional learning by composing value functions in specific ways.

A planning approach learns skills from interactions, balancing exploration and exploitation.

problem Learning robust high-level skills in noisy environments with unknown pre-conditions.
method Formulates skills as high-level policies, learns plans via bandit problems, balances exploration and exploitation.
result A planner capable of learning robust high-level skills in high-dimensional state spaces.

Novel approach for sim-to-real transfer using MPC and task representations.

problem Difficulty of sim-to-real transfer systems producing generalizable policies.
method Model-predictive control (MPC) and task representation learning.
result Direct transfer of multi-skill policy to real robot for unseen tasks.

SUPE combines unlabeled data with RL to efficiently explore tasks.

problem Efficient exploration in reinforcement learning with sparse rewards.
method Extract low-level skills using VAE, pseudo-label unlabeled data, and use as off-policy data for online RL.
result SUPE outperforms prior methods across 42 long-horizon tasks.

Model-free deep reinforcement learning has been shown to exhibit good performance in domains ranging from video games to simulated robotic manipulation and locomotion. However, model-free methods are known to perform poorly when the interaction time with the environment is limited, as is the case for most real-world ro…

2018-03-19abs ↗pdf ↗

Paper introduces a new job recommendation method using candidate job selection progression.

problem Traditional job recommendation methods are either filter-based or feature-based, limiting serendipitous and cold-start recommendations.
method Uses machine learning to analyze candidate job selection progression and derive latent competencies.
result Achieved best click-through rate in a real-world job recommender system.

Model learns to discover and disambiguate entities and relations in text streams.

problem Learning to follow and resolve mentions in a continuous text stream.
method End-to-end trainable memory network for online, one-shot learning.
result Improves disambiguation and discovery skills with minimal supervision.

Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…

2018-07-20abs ↗pdf ↗

Robotics learns new skills faster by reusing past movements.

problem Learning new motor skills is time-consuming and requires exploration of a large space of motor configurations.
method Combines probabilistic movement primitives with relative entropy policy search for skill initialization and adaptation.
result Quality of learned skills improves and the number of required iterations to learn a new task can be reduced by more than 60%.

We introduce the Adaptive Skills, Adaptive Partitions (ASAP) framework that (1) learns skills (i.e., temporally extended actions or options) as well as (2) where to apply them. We believe that both (1) and (2) are necessary for a truly general skill learning framework, which is a key building block needed to scale up t…

2016-02-10abs ↗pdf ↗

DAS3H optimizes skill-based spaced repetition schedules.

problem Optimizing adaptive and personalized spaced repetition schedules for skill-based learning.
method Developed a new student learning and forgetting model (DAS3H) that considers memory decay and multiple skills.
result DAS3H outperforms other models on real-world educational datasets.

The paper explains how language models acquire complex skills through scaling laws and statistical analysis.

problem Understanding how language models acquire new skills as their size and training data increase.
method Statistical framework and mathematical analysis of scaling laws.
result Language models can learn complex skills efficiently due to a strong inductive bias.

Convolutional neural networks improve surgical skill evaluation.

problem Manual feedback from senior surgeons is laborious, expensive, and subjective.
method Fully convolutional neural networks (CNNs) for classifying and regressing surgical skills.
result Deep neural networks achieve competitive performance on JIGSAWS dataset.

Researchers study how skills are learned in neural networks using physics principles.

problem Understanding how skills are sequentially learned in neural networks.
method Abstract and simplify the problem using physics principles, proposing three models: Geometry, Resource, and Domino.
result Models reveal insights into neural scaling laws, learning dynamics, and the benefits of modularity.

HiPPO adapts skills and higher-level policies together for better transfer in hierarchical RL.

problem Sub-optimality in skill transfer when lower-level skills are fixed.
method HiPPO: a novel hierarchical policy gradient method that trains all levels of the hierarchy jointly.
result Improved robustness of skills to environment changes through training time-abstractions.

The paper examines skill estimation and variance under model misspecification in IRT.

problem Underestimation and overestimation of skills when non-compensatory model is misspecified as compensatory.
method Theoretical approach to analyze underestimation and overestimation of skills and variance.
result Overestimation of skills occurs around the origin and asymptotic variance differs under model misspecification.

Gradient descent solves sparse skill estimation in crowdsourcing.

problem Crowd-sourced worker skill estimation with sparse and irregular assignments.
method Rank-one matrix completion and projected gradient descent.
result Skill estimates converge to global optima for specific sampling matrices.

DSE learns transferable skills across changing dynamics and goals.

problem Learning transferable skills across different reinforcement learning tasks.
method Variational inference for multi-task reinforcement learning with shared and task-specific latent spaces.
result Policies can generalize to unseen dynamics and goals conditions.

DADS discovers skills with predictable outcomes from unlabeled data.

problem Learning accurate models for complex dynamical systems is difficult and often doesn't generalize well.
method Dynamics-Aware Discovery of Skills (DADS) combines model-based and model-free learning.
result DADS discovers infinitely many behaviors in high-dimensional state-spaces.

New algorithm trains neural nets on simple skills to learn complex tasks faster.

problem Learning complex tasks through simple imitation.
method Train neural networks on simple, easy-to-learn skills to accelerate learning of complex, hard-to-learn tasks.
result Consistently outperforms state-of-the-art baseline in training speed and performance.

EDL discovers state-covering skills without relying on task rewards.

problem Discovering skills in reinforcement learning without a task-oriented reward function.
method EDL optimizes information-theoretic objective using different machinery to address coverage problem.
result EDL discovers state-covering skills more effectively than existing methods.

Sloth predicts LLM performance using latent skills across families.

problem Variations in benchmark performance due to differences in training configurations and data processing across model families.
method Sloth uses publicly available benchmark data and assumes LLM performance is driven by latent skills influenced by model size and training tokens. It exploits correlations across benchmarks to provide accurate predictions.
result Sloth predicts LLM performance accurately and offers insights into scaling behaviors for complex tasks.

The paper presents a method for personalized exercise recommendations that improves learner skill gain.

problem Adapting to individual needs in large, diverse groups of learners in digital environments.
method Contextual Thompson Sampling to select exercises that advance learner skill.
result The method recommends exercises associated with greater skill improvement and adapts to learner differences.

Paper tackles skill transfer in RL for morphologically different agents.

problem Transfer skills between morphologically different reinforcement learning agents.
method Proposes a paired variational encoder-decoder model (PVED) for subspace learning.
result Demonstrates improved skill transfer efficiency compared to state-of-the-art methods.

Optimal learning paths designed for E-learning systems using reinforcement learning.

problem Designing optimal learning paths for E-learning systems.
method Developed a hierarchical skill model and a proficiency level model, applied reinforcement learning to find the optimal learning strategy.
result Demonstrated the effectiveness of the proposed framework via numerical experiments.

New method automates asymmetric choice for better skill transfer in reinforcement learning.

problem Improving sample efficiency and transferability of reinforcement learning agents.
method Attentive Priors for Expressive and Transferable Skills (APES) using hierarchical KL-regularization.
result APES automates asymmetric choice, leading to better skill transfer across sequential tasks.