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.

168,695 papers · 148 categories

Trend · papers per month

275380106 · Jun 202019922001200920172026
48 results for Hierarchical Planning

This work tackles long-term visual planning by goal-conditioned hierarchical predictors.

problem Current learning approaches fail on long-horizon tasks due to lack of goal information and coarse-to-fine planning.
method Formulate goal-conditioned predictors (GCPs) and hierarchical models to predict trajectories between observations.
result GCPs enable effective long-term planning with much longer horizons than before.

HiDe learns hierarchical control for complex tasks by separating planning and control.

problem Solving long horizon control tasks with generalization to unseen scenarios.
method Functional decomposition of state-action spaces, RL-based planner, modular transfer of policy layers.
result Generalizes across unseen test environments and scales to longer horizons.

One of the key challenges in applying reinforcement learning to real-life problems is that the amount of train-and-error required to learn a good policy increases drastically as the task becomes complex. One potential solution to this problem is to combine reinforcement learning with automated symbol planning and utili…

2018-06-28abs ↗pdf ↗

Develops hierarchical reinforcement learning value function approximators.

problem Estimating long-term returns in reinforcement learning with multiple goals.
method Introduces hierarchical universal value function approximators (H-UVFAs) using the options framework.
result Demonstrates generalization and improved performance of H-UVFAs over UVFAs.

We present Multitask Soft Option Learning(MSOL), a hierarchical multitask framework based on Planning as Inference. MSOL extends the concept of options, using separate variational posteriors for each task, regularized by a shared prior. This ''soft'' version of options avoids several instabilities during training in a …

2019-04-01abs ↗pdf ↗

BoTier optimizes experiments by balancing multiple objectives hierarchically.

problem Balancing multiple competing objectives in scientific experiments.
method Composite objective that flexibly represents a hierarchy of preferences over outcomes and parameters.
result Demonstrates robust applicability across various use cases and seamless integration.

This paper proposes a real-time signal plan recommendation system for traffic incidents.

problem Limited effectiveness of traffic incident management due to late response and workload.
method Decomposes recommendation task into real-time traffic prediction and plan association, learning from historical data and metric learning.
result Precision score of 96.75% and recall of 87.5% on testing plan, with 22.5 minutes lead time ahead of Waze alerts.

Hybrid Bayesian-conformal framework improves uncertainty quantification in healthcare predictions.

problem Jointly satisfying distribution-free coverage guarantees and risk-adaptive precision in clinical decision-making.
method Integrates Bayesian hierarchical random forests with group-aware conformal calibration, using posterior uncertainties to weight conformity scores.
result Achieves target coverage (94.3% vs 95% target) with adaptive precision, 21% narrower intervals for low-uncertainty cases.

Potential violent criminals will often need to go through a sequence of preparatory steps before they can execute their plans. During this escalation process police have the opportunity to evaluate the threat posed by such people through what they know, observe and learn from intelligence reports about their activities…

2019-07-03abs ↗pdf ↗

Bayesian models forecast COVID-19 hospitalizations at single sites.

problem Forecasting daily COVID-19 hospitalizations at a single hospital.
method Hierarchical Bayesian models with generalized Poisson likelihood and autoregressive/Gaussian process latent processes.
result Demonstrated superior performance compared to baselines in public datasets.

Paper proposes a new method for predicting DER adoption with hierarchical guarantees.

problem Accurately predicting DER adoption in electric grids with uncertainty and spatial disparity.
method Multivariate Hawkes process for modeling DER adoption dynamics and split conformal prediction algorithm for hierarchical validity.
result Empirical evaluation shows superior predictive accuracy and uncertainty calibration compared to existing methods.

Predicting outcomes and planning interactions with the physical world are long-standing goals for machine learning. A variety of such tasks involves continuous physical systems, which can be described by partial differential equations (PDEs) with many degrees of freedom. Existing methods that aim to control the dynamic…

2020-01-21abs ↗pdf ↗

Time series of counts arise in a variety of forecasting applications, for which traditional models are generally inappropriate. This paper introduces a hierarchical Bayesian formulation applicable to count time series that can easily account for explanatory variables and share statistical strength across groups of rela…

2014-05-15abs ↗pdf ↗

Learning an optimal policy from a multi-modal reward function is a challenging problem in reinforcement learning (RL). Hierarchical RL (HRL) tackles this problem by learning a hierarchical policy, where multiple option policies are in charge of different strategies corresponding to modes of a reward function and a gati…

2017-11-28abs ↗pdf ↗

Conventionally, model-based reinforcement learning (MBRL) aims to learn a global model for the dynamics of the environment. A good model can potentially enable planning algorithms to generate a large variety of behaviors and solve diverse tasks. However, learning an accurate model for complex dynamical systems is diffi…

2019-07-02abs ↗pdf ↗

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

problem Challenging to learn accurate MDPs for high-dimensional states.
method Learn an abstract MDP over low-dimensional coarse states, using an abstraction function.
result Achieves superhuman performance on Pitfall! and higher reward with fewer samples.

PHASE dataset simulates complex social interactions in physical environments.

problem Lack of datasets for evaluating physically grounded perception of complex social interactions.
method Created PHASE dataset of 2D animations with procedural generation and physics engine.
result SIMPLE model outperforms neural networks in recognizing complex social interactions.

Building systems that autonomously create temporal abstractions from data is a key challenge in scaling learning and planning in reinforcement learning. One popular approach for addressing this challenge is the options framework (Sutton et al., 1999). However, only recently in (Bacon et al., 2017) was a policy gradient…

2018-10-27abs ↗pdf ↗

We study a stylized dynamic assortment planning problem during a selling season of finite length TT. At each time period, the seller offers an arriving customer an assortment of substitutable products and the customer makes the purchase among offered products according to a discrete choice model. The goal of the selle…

2018-06-27abs ↗pdf ↗

Learning from demonstration has been widely studied in machine learning but becomes challenging when the demonstrated trajectories are unstructured and follow different objectives. This short-paper proposes PODNet, Plannable Option Discovery Network, addressing how to segment an unstructured set of demonstrated traject…

2019-11-01abs ↗pdf ↗

Future autonomous systems need reliable world models and complex action sequences.

problem Current automated systems lack reliable world models and complex action sequences.
method Introduce energy-based and latent variable models combined in a hierarchical joint embedding predictive architecture (H-JEPA).
result Combining energy-based and latent variable models in H-JEPA can lead to reliable world models and complex action sequences.

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

The composition of elementary behaviors to solve challenging transfer learning problems is one of the key elements in building intelligent machines. To date, there has been plenty of work on learning task-specific policies or skills but almost no focus on composing necessary, task-agnostic skills to find a solution to …

2019-05-25abs ↗pdf ↗

New approach improves black-box planning efficiency by discovering focused macros.

problem Difficulty of deterministic planning increases exponentially with depth.
method Discovering macro-actions with focused effects to improve goal-count heuristics.
result Focused macros dramatically improve black-box planning efficiency.

Selective planning with imperfect models reduces harmful effects of model inadequacy.

problem Harmful effects of using an imperfect model in reinforcement learning.
method Selective planning with heteroscedastic regression to estimate predictive uncertainty from model inadequacy.
result Effective selective planning requires considering both parameter uncertainty and model inadequacy.