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

67134200267 · Jun 202019922001200920172026
48 results for Hierarchical Control

Method solves learning problem with hierarchical control objectives.

problem Learning high-dimensional nonlinear functions with model validation accuracy.
method Successive approximation method in functional spaces for hierarchical optimal control.
result Nested algorithm for solving optimal control problem.

Autonomous agents can learn by imitating teacher demonstrations of the intended behavior. Hierarchical control policies are ubiquitously useful for such learning, having the potential to break down structured tasks into simpler sub-tasks, thereby improving data efficiency and generalization. In this paper, we propose a…

2019-12-29abs ↗pdf ↗

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.

Hierarchical-CPI improves variable importance measurement for medical data.

problem Limited interpretability of complex medical models.
method Hierarchical-CPI measures conditional variable importance with statistical control, handling correlated data.
result Hierarchical-CPI outperforms existing methods in medical datasets.

We introduce agents that use object-oriented reasoning to consider alternate states of the world in order to more quickly find solutions to problems. Specifically, a hierarchical controller directs a low-level agent to behave as if objects in the scene were added, deleted, or modified. The actions taken by the controll…

2019-10-31abs ↗pdf ↗

Hyperbolic space outperforms Euclidean in learning hierarchical data.

problem Learning hierarchical data in Euclidean space requires exponentially many samples.
method Established geometric obstruction in Euclidean space and showed hyperbolic space's advantage.
result Hyperbolic space enables learning with O(mRlogm)O(mR \log m) samples, matching information-theoretic optimum.

Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.

problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.

Unified theory for neural scaling laws in hierarchically compositional data.

problem Understanding neural scaling laws in hierarchically compositional data.
method Probabilistic context-free grammars and power-law distributed production rules.
result Unified learning curve behavior for classification and next-token prediction tasks.

The paper offers a method to create prediction sets with uncertainty control.

problem Calibrating and communicating uncertainty in machine learning predictions.
method Distribution-free, risk-controlling prediction sets using a holdout set to calibrate set sizes.
result Explicit finite-sample guarantees for error control in various machine learning tasks.

A deep learning approach classifies medical images hierarchically.

problem Limitations of traditional supervised classifiers in medical image classification.
method Hierarchical Medical Image Classification (HMIC) using deep learning models.
result HMIC achieved better performance in classifying medical images hierarchically.

A novel unsupervised domain adaptation method using hierarchical optimal transport.

problem Unsupervised domain adaptation between source and target domains.
method Hierarchical optimal transport, leveraging class labels for structure formation in the source domain and learning probability measures in the target domain.
result The proposed HOT-DA method outperforms state-of-the-art approaches on various datasets.

Hierarchical reinforcement learning is a promising approach to tackle long-horizon decision-making problems with sparse rewards. Unfortunately, most methods still decouple the lower-level skill acquisition process and the training of a higher level that controls the skills in a new task. Leaving the skills fixed can le…

2019-06-13abs ↗pdf ↗

Deep networks learn hierarchical functions more efficiently than shallow ones.

problem Understanding the advantage of deep neural networks over shallow models.
method Analytical study of learning dynamics and generalization performance of deep networks compared to shallow ones.
result Deep networks reduce effective dimensionality, enabling learning with fewer samples.

Study on infinitely-wide CNNs and their adaptability to function spatial scales.

problem Understanding how CNNs efficiently learn high-dimensional functions and their adaptability to function spatial scales.
method Study infinitely-wide deep CNNs in the kernel regime, characterizing their spectrum and using generalisation bounds to prove adaptability.
result Deep CNNs adapt to the spatial scale of the target function, with error decay controlled by the effective dimensionality of function subsets.

Classification with Costly Features (CwCF) is a classification problem that includes the cost of features in the optimization criteria. Individually for each sample, its features are sequentially acquired to maximize accuracy while minimizing the acquired features' cost. However, existing approaches can only process da…

2019-11-20abs ↗pdf ↗

This paper uses NLDT to find interpretable control rules from complex DRL policies.

problem Complex, non-interpretable policies from black-box AI methods.
method Evolutionary optimization of NLDT for hierarchical control rules.
result Interpretable control rules with similar performance to black-box DRL.

Centralised training with decentralised execution is an important setting for cooperative deep multi-agent reinforcement learning due to communication constraints during execution and computational tractability in training. In this paper, we analyse value-based methods that are known to have superior performance in com…

2019-10-16abs ↗pdf ↗

Hierarchical AI multi-agent framework optimizes equity portfolios in China's A-share market.

problem Optimizing equity portfolios in China's A-share market using AI and multi-agent systems.
method A hierarchical multi-agent design integrating macro, firm-level, and reinforcement learning approaches.
result Consistently outperforms benchmarks and state-of-the-art systems on risk-adjusted returns and drawdown control.

AIRL learns robust, generalizable reward functions from demonstrations.

problem Learning robust reward functions from demonstrations for changing environments.
method Adversarial Inverse Reinforcement Learning (AIRL) with hierarchical disentangled rewards.
result Generalizable policies and comparable results to state-of-the-art methods.

Robot learns multiple tasks hierarchically by transferring knowledge.

problem Learning multiple complex tasks in open-ended environments.
method Task-oriented procedures, goal-babbling, imitation learning, active learning, intrinsic motivation.
result Robots can learn complex tasks more efficiently by transferring knowledge from simpler ones.

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 ↗

The paper introduces an adjacency constraint to improve goal-conditioned HRL.

problem Training inefficiency in goal-conditioned HRL due to large action space.
method Restricting the high-level action space to a k-step adjacent region of the current state.
result The adjacency constraint preserves optimal hierarchical policies and improves HRL performance.

In this paper, we present Gamma-LSTM, an enhanced long short term memory (LSTM) unit, to enable learning of hierarchical representations through multiple stages of temporal abstractions. Gamma memory, a hierarchical memory unit, forms the central memory of Gamma-LSTM with gates to regulate the information flow into var…

2019-10-25abs ↗pdf ↗

We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree rr polynomial which depends on at most kk inputs, counting at most \ell monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns w…

2017-09-28abs ↗pdf ↗

The paper monitors stock market relationships using network analysis and statistical control charts.

problem Detecting abnormal changes in the financial market network structure.
method Network construction using distance methods, hierarchical clustering, and Shewhart control charts.
result Abnormal changes in financial market relationships can be detected using statistical process control.

A new method for optimizing hierarchical multi-objective problems.

problem Symmetry and neglect of objective hierarchy in existing multi-objective methods.
method Priority-Constrained Descent (PCD) framework exploiting hierarchical objective structures.
result Pareto dominance and better per-objective performance with secondary progress guarantees.

LineFlow is a framework for training RL agents to control production lines.

problem Designing control systems for production lines is challenging.
method Introduces LineFlow, an extensible Python framework for simulating and training RL agents.
result RL agents approach optimal performance in well-understood scenarios but face challenges in complex industrial lines.

In supervised clustering, standard techniques for learning a pairwise dissimilarity function often suffer from a discrepancy between the training and clustering objectives, leading to poor cluster quality. Rectifying this discrepancy necessitates matching the procedure for training the dissimilarity function to the clu…

2019-06-19abs ↗pdf ↗

NeurT-FDR controls FDR by incorporating feature hierarchy.

problem Controlling FDR in complex, large-scale hypothesis testing problems.
method NeurT-FDR uses a neural network to parametrize test-level covariates and a regression framework to adjust feature hierarchy.
result NeurT-FDR makes substantially more discoveries than competitive baselines.

Policy-gradient method controls multiple non-cohesive targets.

problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.

HKT improves sequence processing with multi-scale attention and kernel analysis.

problem Processing sequences at multiple scales with efficient attention mechanisms.
method Trainable causal downsampling and convex weights for level-specific score matrices.
result HKT achieves consistent gains over standard attention across various tasks.