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

78156233311 · May 202619922001200920182026
48 results for Subtask dependencies

Agent learns to solve unseen tasks with subtask dependencies.

problem Generalizing to unseen tasks with subtask dependencies.
method Neural subtask graph solver (NSGS) with graph reward propagation for pre-training and actor-critic finetuning.
result Agent can find near-optimal subtask execution and generalize to unseen subtask graphs.

HAL learns hierarchical affordances to prune impossible subtasks, improving reinforcement learning efficiency.

problem Reinforcement learning struggles with complex hierarchical dependency structures.
method HAL learns a model of hierarchical affordances to prune impossible subtasks.
result HAL agents are better at learning complex tasks, navigating stochastic environments, and acquiring diverse skills.

Task focuses on fact checking in Q&A forums, improving over baseline systems.

problem Fact checking in community Q&A forums to distinguish factual from opinion.
method Two subtasks: distinguishing factual vs. opinion/advice/socializing, predicting answer truthfulness.
result Improved over baseline systems for both subtasks, but not for Subtask B.

In this paper we combine one method for hierarchical reinforcement learning - the options framework - with deep Q-networks (DQNs) through the use of different "option heads" on the policy network, and a supervisory network for choosing between the different options. We utilise our setup to investigate the effects of ar…

2016-04-27abs ↗pdf ↗

PALM learns abstract models for efficient planning and task transfer.

problem Efficiently learning and transferring hierarchical models for planning.
method PALM uses a new formal structure (L-AMDP) to learn independent, modular models at multiple levels of abstraction.
result PALM integrates planning and execution, facilitating rapid learning of abstract models.

Many similarity-based clustering methods work in two separate steps including similarity matrix computation and subsequent spectral clustering. However, similarity measurement is challenging because it is usually impacted by many factors, e.g., the choice of similarity metric, neighborhood size, scale of data, noise an…

2017-05-01abs ↗pdf ↗

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.

PLOTS learns procedural actions from observed sequences, up to 100x faster.

problem Learning procedural actions from observed sequences efficiently.
method Exploits subtask structure to incrementally build action plans, optimistically explores actions.
result Explicit procedural learning is 100x faster than policy-gradient methods and model-based approaches.

Unified pair trading approach using hierarchical reinforcement learning.

problem Decoupling pair selection and trading leads to limited performance.
method Hierarchical reinforcement learning framework for joint pair selection and trading.
result Unified approach outperforms existing methods on real-world stock data.

This paper evaluates how well neural models can solve complex tasks by breaking them into simpler ones.

problem Measuring neural models' ability to solve complex tasks by breaking them into simpler subtasks.
method Characterized axes of compositional generalization, introduced a benchmark suite of tasks, and improved Transformer models' attention mechanisms.
result Modified Transformer models generally perform better than natural baselines in solving complex tasks, but challenges remain.

Spectral clustering has found extensive use in many areas. Most traditional spectral clustering algorithms work in three separate steps: similarity graph construction; continuous labels learning; discretizing the learned labels by k-means clustering. Such common practice has two potential flaws, which may lead to sever…

2017-11-12abs ↗pdf ↗

The paper proposes methods to estimate positive examples and learn classifiers from mixed data.

problem Estimating the proportion of positive examples and learning classifiers from a mixture of positive and unlabeled data.
method Best Bin Estimation (BBE) for Mixture Proportion Estimation and Conditional Value Ignoring Risk (CVIR) for PU-learning.
result The proposed methods significantly improve both mixture proportion estimation and classifier learning.

Neural networks learn more efficiently with hidden factorial structures.

problem Challenges in high-dimensional statistical learning.
method Controlled experimental framework to test neural networks' ability to exploit hidden factorial structures.
result Neural networks can leverage hidden factorial structures to learn discrete distributions more efficiently.

Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. While many step charts are available in standardized packs, players may grow tired of existing charts, or wish to dance to a song for which no …

2017-03-20abs ↗pdf ↗

Proposes LMSSC for multi-view semi-supervised classification.

problem Leveraging multiple complementary views for improved classification.
method Semi-supervised classification with latent multi-view representation learning.
result Unified framework for latent representation learning, graph construction, and label propagation.

AxCell automates results extraction from machine learning papers.

problem Difficulty in tracking progress in machine learning due to many papers.
method AxCell uses table segmentation and learns structural knowledge to extract results.
result AxCell significantly improves results extraction compared to existing methods.

MGHRL learns to generate high-level meta strategies for new tasks.

problem Efficiency and generalization in meta-RL for wide task distributions.
method Generates high-level meta strategies over subgoals, leaving subtask learning independent.
result More efficient and generalized meta-learning from past experience.

System classifies Twitter and Reddit posts' stance towards hidden rumour threads.

problem Classifying posts' stance towards hidden rumour threads.
method Used pre-trained deep bidirectional transformers (BERT) for stance classification.
result Reached F1 score of 61.67% on test data, 2nd place in competition.

A new model improves recurrent neural networks' ability to memorize long sequences.

problem Improving recurrent neural networks' ability to memorize long sequences and extract task-relevant features.
method Proposes a Linear Memory Network with an encoding-based memorization component and a specialized training algorithm.
result Improves the final performance of recurrent neural networks when memorizing long sequences is necessary.

The paper tackles class imbalance in deep learning models and proposes a method to enhance feature extraction.

problem Class imbalance affects deep learning models, especially in imbalanced settings.
method The paper introduces an extension of deep over-sampling to use automatically-generated abstract-labels for weak-supervision.
result The proposed framework significantly improves image classification benchmarks with imbalanced classes.

Transformers can generalize to a large task family with only a few demonstrations.

problem Can learning from a small set of tasks generalize to a large task family?
method Investigating autoregressive compositional structure where each task is a composition of TT operations, each from a finite family of DD subtasks.
result Transformers can generalize to DTD^T tasks with only O~(D)\widetilde{O}(D) demonstrations.

Proposes CORAL framework for consistent ordinal regression in neural networks.

problem Inconsistencies in ordinal regression with neural networks.
method Transforms ordinal targets into binary classification subtasks and applies CORAL framework for rank-monotonicity and consistent confidence scores.
result Reduction of prediction error in age prediction tasks.

TIM framework uses LLMs and domain experts to infer DeFi user transaction intents.

problem Challenges in understanding user intent in DeFi transactions due to complex interactions and opaque logs.
method TIM framework leverages a DeFi intent taxonomy, multi-agent LLM system, and a Meta-Level Planner.
result TIM significantly outperforms existing methods in inferring user transaction intents.

Generative models learn from unlabeled videos via object segmentation and scene modeling.

problem Learning generative models from unlabelled videos.
method Decomposed into three subtasks: motion segmentation, background and foreground modeling, and scene sampling.
result Approach allows learning models that generalize beyond occlusions and represent scenes in a modular fashion.

Method learns multi-stage tasks from single video, overcoming challenges of raw pixel learning and insufficient demonstrations.

problem Learning multi-stage vision-based tasks from a single video of a human performing the task.
method Learn primitive behaviors from video demonstrations and dynamically compose them to perform multi-stage tasks.
result Demonstrated learning of various tasks on real robots using raw pixel inputs and minimal demonstrations.

A new training method improves stability and generalization of DeepONets.

problem Training deep operator networks (DeepONets) is challenging due to nonconvex and nonlinear nature.
method Two-step training method: first train trunk network, then branch network. Introduced Gram-Schmidt orthonormalization.
result Generalization error estimate and numerical examples demonstrating effectiveness.

Paper presents UrbanFM and UrbanPy models for inferring fine-grained urban flows.

problem Reduce cost of urban flow monitoring while maintaining data accuracy and granularity.
method Develops UrbanFM and UrbanPy models to infer fine-grained urban flows from coarse-grained observations.
result UrbanPy model demonstrates favorable performance for larger-scale inference tasks.