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,657 papers · 148 categories

Trend · papers per month

211422632843 · Jun 202019922001200920172026
48 results for hierarchical value functions

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.

Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby incurring a possibly large representation cost because exit values refer to nonlocal a…

2012-06-27abs ↗pdf ↗

Eikonal-Constrained QRL improves goal-reaching in reinforcement learning.

problem Reward design and out-of-distribution generalization in reinforcement learning.
method Eikonal-Constrained Quasimetric Reinforcement Learning (Eik-QRL) using the Eikonal PDE.
result Eik-QRL achieves state-of-the-art performance in offline goal-conditioned navigation and manipulation tasks.

UNTIE learns representations of coupled categorical data.

problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.

Paper relaxes set-valued prediction in hierarchical classification by considering representation complexity.

problem Uncertainty in class labels in hierarchical multi-class classification problems.
method Introduces representation complexity for predicted sets, proposes three methods for inference.
result Recursive tree search method is computationally more efficient.

With globalization, countries are more connected than before by trading flows, which currently amount to at least 36 trillion dollars. Interestingly, approximately 30-60 percent of global exports consist of intermediate products. Therefore, the trade flow network of a particular product with high added values can be re…

2014-01-14abs ↗pdf ↗

Proposes a nonparametric tensor factorization for sparse data.

problem Handling sparse tensor data with structural and interpretability benefits.
method Hierarchical Gamma processes and Poisson random measures for tensor-valued process, Dirichlet processes for sampling entry indices, Gaussian processes for values.
result Demonstrates superior performance on benchmark datasets.

This work introduces a method for visualizing high-dimensional posteriors using hierarchical tree-valued predictions.

problem Visualizing high-dimensional posterior distributions for complex problems like image restoration.
method A neural network predicts a tree-valued hierarchical summarization of the posterior distribution in a single forward pass.
result The method efficiently summarizes and visualizes posteriors, achieving comparable results to hierarchical clustering but at a much faster speed.

The paper develops a decision support system for hierarchical text classification of conference proceedings.

problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.

We present a numerical method for the frequent pricing of financial derivatives that depends on a large number of variables. The method is based on the construction of a polynomial basis to interpolate the value function of the problem by means of a hierarchical orthogonalization process that allows to reduce the numbe…

2017-01-03abs ↗pdf ↗

New method optimizes hierarchical multi-label classification results.

problem Optimizing classification results respecting class hierarchy and classifier scores.
method Introducing CATCH objective function and mLPR metric to rank multi-label classification results.
result HierRank algorithm optimizes CATCH, improving decision accuracy.

We use splines and the Sasaki metric to analyze and compare manifold-valued trajectories.

problem Analyzing and comparing trajectories on Riemannian manifolds.
method Riemannian hierarchical model, Bézier splines, Sasaki metric.
result Spline-based approaches outperform state-of-the-art methods in intensity classification of trajectories.

TradeR uses RL to execute trades in real markets, minimizing surprise and catastrophe.

problem Minimizing surprise and catastrophe in high-frequency trading.
method Hierarchical RL with energy-based surprise value function.
result TradeR outperforms in abrupt price changes and maintains profitability.

Unified framework for modeling hierarchical spaces in design problems.

problem Challenges in modeling hierarchical, conditional, heterogeneous, or tree-structured domains.
method Unified framework combining feature modeling and graph theory, introducing meta and partially-decreed variables.
result Demonstrated effectiveness on complex system design problems, including neural networks and green-aircraft.

HPPCA improves imputation of longitudinal data with missing values.

problem Handling incomplete, high-dimensional longitudinal data with nested sources of variation and temporal dependency.
method Hierarchical probabilistic principal component analysis (HPPCA) with a two-level latent factor model and Gaussian process.
result HPPCA outperforms standard PPCA and multivariate functional PCA in imputation accuracy, even under heavy missingness and model misspecification.

Reinforcement Learning (RL) algorithms can suffer from poor sample efficiency when rewards are delayed and sparse. We introduce a solution that enables agents to learn temporally extended actions at multiple levels of abstraction in a sample efficient and automated fashion. Our approach combines universal value functio…

2018-05-21abs ↗pdf ↗

The stability of money value is an important requisite for a functioning economy, yet it critically depends on the actions of participants in the market themselves. Here we model the value of money as a dynamical variable that results from trading between agents. The basic trading scenario can be recast into an Ising t…

2001-10-10abs ↗pdf ↗

We introduce the hierarchical compositional network (HCN), a directed generative model able to discover and disentangle, without supervision, the building blocks of a set of binary images. The building blocks are binary features defined hierarchically as a composition of some of the features in the layer immediately be…

2016-11-07abs ↗pdf ↗

BOSH optimizes functions with stochastic evaluations more efficiently and precisely.

problem Optimizing functions with noisy evaluations can lead to suboptimal solutions.
method BOSH uses a hierarchical Gaussian process to generate a growing pool of realizations.
result BOSH provides more efficient and higher-precision optimization than standard BO.

This paper introduces hierarchical quasi-clustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is equivalent to a finite quasi-ultrametric space and study admissibility with respect…

2014-04-17abs ↗pdf ↗

Proposes a hierarchical curriculum loss to improve model accuracy and interpretability.

problem Flat label spaces in classification algorithms fail to capture dependencies in real-world data.
method Introduces hierarchical curriculum loss with two properties: satisfying hierarchical constraints and providing non-uniform label weights.
result The proposed loss function significantly outperforms multiple baselines on real-world image datasets.

This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods that, based on the dissimilarity structure, output hierarchical clusters, i.e., a family of nested partitions indexed by a connectivity parameter. Our construction of hierarchical cl…

2016-07-21abs ↗pdf ↗

Proves deep networks can learn hierarchical structures efficiently.

problem Understanding how deep networks learn hierarchical structures in data.
method Random Hierarchy Models, gradient-based methods, layerwise training.
result Proves deep networks can efficiently learn hierarchical structures.

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 ↗

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.

The paper reviews and extends calibration concepts for classification and regression.

problem Formalizing compatibility between probabilistic predictions and outcomes.
method Review and extension of existing calibration concepts, introduction of new concepts.
result Hierarchical relations between calibration concepts for various data types.

HierarchicalForecast provides a Python framework for coherent hierarchical forecasting.

problem Ensuring forecasts at disaggregate levels add up to aggregate forecasts.
method Preprocessed datasets, evaluation metrics, and statistical baseline models.
result Python-based reference framework for statistical and ML forecasting.

Two new estimators improve VAE training for hierarchical and prior parameters.

problem Efficient gradient estimation for VAEs with hierarchical and prior parameters.
method Developed two generalizations of Doubly-Reparameterized Gradient Estimators (DReGs) for VAEs.
result Improved training of conditional and hierarchical VAEs on image modeling tasks.

New method approximates high-dimensional probability densities efficiently.

problem Approximating high-dimensional probability densities accurately and efficiently.
method Hierarchical tensor-network approach using randomized SVD and linear equations.
result The method effectively approximates high-dimensional densities with linear complexity.

VFG model embeds flow-based models with hierarchical structures using variational inference.

problem Flow-based models struggle with high-dimensional latent spaces and lack of tractable inference for graphical structures.
method Integrates flow-based functions through variational inference with aggregation nodes for hierarchical information integration.
result VFG models achieve improved ELBO and likelihood values on multiple datasets.

Three-layer neural networks learn hierarchical polynomial functions efficiently.

problem Learning hierarchical polynomial functions with three-layer neural networks.
method Layerwise gradient descent on square loss, focusing on feature learning.
result Achieves optimal sample complexity for learning hierarchical polynomials.