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

Trend · papers per month

19375674 · Jun 202019922001200920172026
48 results for Hierarchical Affordances

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.

The paper introduces affordances for reinforcement learning, improving planning and learning efficiency.

problem Reinforcement learning assumes all actions are available, but real-world agents face limited action spaces.
method Developed a theory of affordances for Markov Decision Processes, proposing methods to learn and use affordances.
result Affordances improve planning speed and learning efficiency, leading to simpler and better generalizing transition models.

The problem of accelerating drug discovery relies heavily on automatic tools to optimize precursor molecules to afford them with better biochemical properties. Our work in this paper substantially extends prior state-of-the-art on graph-to-graph translation methods for molecular optimization. In particular, we realize …

2019-06-11abs ↗pdf ↗

One of the open challenges in designing robots that operate successfully in the unpredictable human environment is how to make them able to predict what actions they can perform on objects, and what their effects will be, i.e., the ability to perceive object affordances. Since modeling all the possible world interactio…

2018-04-09abs ↗pdf ↗

In this paper we explore the richness of information captured by the latent space of a vision-based generative model. The model combines unsupervised generative learning with a task-based performance predictor to learn and to exploit task-relevant object affordances given visual observations from a reaching task, invol…

2019-09-30abs ↗pdf ↗

New PCGML approach generates novel game content across multiple platformer domains.

problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.

Adaptive anomaly detection for IoT data reduces delay without sacrificing accuracy.

problem Real-time anomaly detection for IoT data in distributed edge computing systems.
method Adaptive anomaly detection approach using contextual bandit and reinforcement learning.
result Significantly reduces detection delay (e.g., 71.4% for univariate data) without sacrificing accuracy.

Propagates adversarial robustness in federated learning.

problem Heterogeneous federated users with non-iid data and limited resources.
method Adversarial robustness propagation through batch-normalization.
result Federated models achieve remarkable robustness even with limited adversarial training.

New method smooths integrands for efficient option pricing.

problem Improving numerical performance of option pricing methods.
method Combining hierarchical adaptive sparse grids, quasi-Monte Carlo, and numerical smoothing.
result Improved efficiency of ASGQ and QMC methods for high-dimensional problems.

We present a reinforcement learning approach for detecting objects within an image. Our approach performs a step-wise deformation of a bounding box with the goal of tightly framing the object. It uses a hierarchical tree-like representation of predefined region candidates, which the agent can zoom in on. This reduces t…

2018-10-15abs ↗pdf ↗

A new method optimizes complex engineering designs under uncertainty efficiently.

problem Optimizing large, uncertain engineering designs with limited resources.
method Multi-level informed optimization via decomposed Kriging.
result Significantly faster and more accurate optimization compared to state-of-the-art methods.

The study uses machine learning to analyze office floor plans and predict function based on geometry.

problem Lack of formalisms to describe spatial affordance in automated floor-plan generation tools.
method Supervised and unsupervised data mining techniques, including J48 algorithm, were used to analyze office floor plans.
result J48 algorithm can predict class performance on unseen examples up to 79.5% for office dataset.

In this paper we introduce score embedding, a neural network based model to learn interpretable vector representations for words. Score embedding is a supervised method that takes advantage of the labeled training data and the neural network architecture to learn interpretable representations for words. Health care has…

2019-08-19abs ↗pdf ↗

We define a finite-dimensional cubic quotient of the group algebra of the braid group, endowed with a (essentially unique) Markov trace which affords the Links-Grould invariant of knots and links. We investigate several of its properties, and state several conjectures about its structure.

2012-03-27abs ↗pdf ↗

We present a survey of the calibrated geometries arising in the study of the local singularity structure of supersymmetric fivebranes in M-theory. We pay particular attention to the geometries of 4-planes in eight dimensions, for which we present some new results as well as many details of the computations. We also ana…

1998-06-04abs ↗pdf ↗

Data analytics using machine learning (ML) has become ubiquitous in science, business intelligence, journalism and many other domains. While a lot of work focuses on reducing the training cost, inference runtime and storage cost of ML models, little work studies how to reduce the cost of data acquisition, which potenti…

2018-05-26abs ↗pdf ↗

We consider composite loss functions for multiclass prediction comprising a proper (i.e., Fisher-consistent) loss over probability distributions and an inverse link function. We establish conditions for their (strong) convexity and explore the implications. We also show how the separation of concerns afforded by using …

2012-06-18abs ↗pdf ↗

AdvImmune improves certifiable robustness of GNNs against adversarial attacks.

problem Vulnerability of graph neural networks to adversarial attacks.
method Proposes AdvImmune, an algorithm that optimizes with meta-gradient to improve certifiable robustness.
result Remarkably improves the ratio of robust nodes by 12%, 42%, 65% with an affordable immune budget of only 5% edges.

Graph-based methods pervade the inference toolkits of numerous disciplines including sociology, biology, neuroscience, physics, chemistry, and engineering. A challenging problem encountered in this context pertains to determining the attributes of a set of vertices given those of another subset at possibly different ti…

2016-12-12abs ↗pdf ↗

This study compares hierarchical and non-hierarchical models for open-domain multi-turn dialog generation.

problem Which kind of models (hierarchical or non-hierarchical) is better for open-domain multi-turn dialog generation?
method Systematically compared nearly all representative hierarchical and non-hierarchical models over the same experimental settings.
result Nearly all hierarchical models are worse than non-hierarchical models in open-domain multi-turn dialog generation, except for HRAN.

We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…

2011-04-30abs ↗pdf ↗

Paper proposes a Renyi entropy-based method for tuning hierarchical topic models.

problem Tuning hierarchical topic models, especially determining the number of topics at each level, is challenging.
method The paper introduces a Renyi entropy-based metric for quality assessment and a practical tuning concept.
result The proposed method can estimate the number of topics for two hierarchical levels in hARTM model.

Neural NMF discovers hierarchical topics in multilayer data.

problem Detecting latent hierarchical structure in multilayer data.
method Recursive application of nonnegative matrix factorization (NMF) in layers with backpropagation optimization.
result Neural NMF outperforms other hierarchical NMF methods in synthetic and real-world datasets.

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.

This paper considers options pricing when the assumption of normality is replaced with that of the symmetry of the underlying distribution. Such a market affords many equivalent martingale measures (EMM). However we argue (as in the discrete-time setting of Klebaner and Landsman, 2007) that an EMM that keeps distributi…

2014-02-07abs ↗pdf ↗

Bayesian Hierarchical Invariant Prediction refines ICP for better scalability and prior integration.

problem Improving computational scalability and invariance testing for causal inference.
method Bayesian Hierarchical structure to test invariance under heterogeneous data.
result Demonstrated improved scalability and potential as an alternative to ICP.

Hierarchical causal models help understand cause and effect in nested data.

problem Learning cause and effect from nested hierarchical data.
method Extend structural causal models and causal graphical models with inner plates, develop graphical identification technique and estimation methods.
result Hierarchical data can enable causal identification even when non-hierarchical data cannot.

Posterior regularization enhances Bayesian hierarchical mixture clustering by improving node separation.

problem High nodal variance in BHMC trees, leading to weak separation between nodes at higher levels.
method Employing Posterior Regularization to impose max-margin constraints on nodes at every level.
result Improves cluster separation in BHMC models, enhancing overall model performance.

Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.

problem Learning dependencies in hierarchical feature spaces.
method Exploits hierarchical parent-child relationships as constraints to learn a dependency tree.
result Hie-TAN-Lite outperforms Hie-TAN and other methods in predictive accuracy.

Curious hierarchical reinforcement learning improves learning performance.

problem Combining hierarchical abstraction and curiosity-driven exploration in reinforcement learning.
method Developed a method that combines hierarchical reinforcement learning with curiosity.
result Curiosity can more than double learning performance and success rates.