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

Trend · papers per month

8162331 · Nov 201919922001200920172026
48 results for higher-level abstraction

A network supporting deep unsupervised learning is presented. The network is an autoencoder with lateral shortcut connections from the encoder to decoder at each level of the hierarchy. The lateral shortcut connections allow the higher levels of the hierarchy to focus on abstract invariant features. While standard auto…

2014-11-28abs ↗pdf ↗

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 ↗

In this paper, we propose a new deep feature selection method based on deep architecture. Our method uses stacked auto-encoders for feature representation in higher-level abstraction. We developed and applied a novel feature learning approach to a specific precision medicine problem, which focuses on assessing and prio…

2017-04-20abs ↗pdf ↗

Introduces Motion Programs for better video analysis of human motion.

problem Current video analysis focuses on raw pixels or keypoints, missing higher-level motion primitives.
method Introduces Motion Programs as a neuro-symbolic representation of motions as a composition of high-level primitives.
result Motion Programs accurately describe diverse human motions and improve downstream tasks.

A new method for solving complex sequential decision-making problems by decomposing them into multiple levels.

problem Sequential decision-making with natural multi-level structure.
method Multi-level meta-reinforcement learning with skill-based curriculum.
result Efficiently reduces stochasticity and policy search space, leading to fewer iterations and computations.

Transformers have been successfully applied to sequential, auto-regressive tasks despite being feedforward networks. Unlike recurrent neural networks, Transformers use attention to capture temporal relations while processing input tokens in parallel. While this parallelization makes them computationally efficient, it r…

2020-02-21abs ↗pdf ↗

In complex transfer learning scenarios new tasks might not be tightly linked to previous tasks. Approaches that transfer information contained only in the final parameters of a source model will therefore struggle. Instead, transfer learning at a higher level of abstraction is needed. We propose Leap, a framework that …

2018-12-03abs ↗pdf ↗

This research explores inductive biases for deep learning to improve AI's higher-level cognition.

problem Current AI struggles with flexible out-of-distribution and systematic generalization.
method Examines and proposes new inductive biases for deep learning.
result Identifies specific inductive biases for higher-level sequential processing.

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 ↗

Unified multilinear model for causal factor disentanglement.

problem Disentangling causal factors from complex data without direct manipulation.
method Hierarchical block multilinear factorization (M-mode Block SVD) and incremental approach.
result Interpretable object representation robust to occlusion and reduced training data.

While perception tasks such as visual object recognition and text understanding play an important role in human intelligence, the subsequent tasks that involve inference, reasoning and planning require an even higher level of intelligence. The past few years have seen major advances in many perception tasks using deep …

2016-08-24abs ↗pdf ↗

We discuss here the mean-field theory for a cellular automata model of meta-learning. The meta-learning is the process of combining outcomes of individual learning procedures in order to determine the final decision with higher accuracy than any single learning method. Our method is constructed from an ensemble of inte…

2009-07-27abs ↗pdf ↗

We address the problem of learning hierarchical deep neural network policies for reinforcement learning. In contrast to methods that explicitly restrict or cripple lower layers of a hierarchy to force them to use higher-level modulating signals, each layer in our framework is trained to directly solve the task, but acq…

2018-04-09abs ↗pdf ↗

Proposes new methods for interpreting document classification models.

problem Interpretation fragility of attention-based neural networks.
method Corpus-level and concept-based explanation methods using attention weights.
result Extracts semantically meaningful keywords and concepts for model predictions.

Dramatic advances in generative models have resulted in near photographic quality for artificially rendered faces, animals and other objects in the natural world. In spite of such advances, a higher level understanding of vision and imagery does not arise from exhaustively modeling an object, but instead identifying hi…

2019-04-04abs ↗pdf ↗

A new framework SIMBA improves graph classification performance on size-imbalanced datasets.

problem Size imbalance in graph classification leads to poor model performance.
method Energy-guided structural smoothing between head and tail graphs, re-weighting based on energy propagation.
result SIMBA outperforms existing methods in size-imbalanced graph classification tasks.

Factor analysis provides linear factors that describe relationships between individual variables of a data set. We extend this classical formulation into linear factors that describe relationships between groups of variables, where each group represents either a set of related variables or a data set. The model also na…

2014-11-21abs ↗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.

New approach to abstract neural network representations using renormalization group.

problem Developing truly abstract representations in neural networks.
method Renormalization group approach to expand representations to encompass broader data sets.
result Representations in neural networks become more abstract as data breadth increases and depth increases.

Study investigates how simple speech sounds can form abstract categories.

problem How do abstract categories like phonemes emerge from speech exposure?
method Used modeling techniques to test Memory-Based Learning and Error-Correction Learning.
result Error-Correction Learning models can learn abstractions, identifying phone inventory and grouping.

Algorithm finds latent structure in value functions for improved reinforcement learning.

problem Finding latent structure in value functions for efficient reinforcement learning.
method Proposes a practical algorithm using two posterior distributions over state abstractions and abstract-state values.
result Substantial performance gains in multi-task settings where tasks share a common, low-dimensional representation.

A collection of the accepted abstracts for the Machine Learning for Health (ML4H) workshop at NeurIPS 2019. This index is not complete, as some accepted abstracts chose to opt-out of inclusion.

2020-02-05abs ↗pdf ↗

The paper proposes a principle for dynamically adjusting the granularity of reinforcement learning abstractions.

problem Lack of general principles for dynamically adjusting the granularity of reinforcement learning abstractions.
method The paper proposes a principle based on rate-distortion theory, formalized through a performance certificate decomposing value error into learning and abstraction error bounds.
result Soft state-action abstractions can achieve near-optimal performance under substantial lossy compression of state and action information.

We prove a definable version of the Whitney embedding theorem for abstract-definable Cp\mathcal{C}^p manifolds with 1p<1\leq p<\infty, namely: every abstract-definable Cp\mathcal{C}^p manifold is abstract-definable CpC^p embedded into RNR^N, for some positive integer NN. As a consequence, we show that every abstract-de…

2019-04-10abs ↗pdf ↗

A comprehensive artificial intelligence system needs to not only perceive the environment with different `senses' (e.g., seeing and hearing) but also infer the world's conditional (or even causal) relations and corresponding uncertainty. The past decade has seen major advances in many perception tasks such as visual ob…

2016-04-06abs ↗pdf ↗

This work improves generative models by using feedback from multiple dependent models.

problem Improving the performance of generative models in multi-agent systems.
method Building a hierarchical set-up of multiple dependent generative models and using feedback to improve lower-level models.
result The technique improves the performance of lower-level generative models under certain conditions.

This paper simplifies OPE in large state spaces using state abstractions.

problem Accurately evaluating policies offline in large state spaces.
method Developed a backward-model-irrelevance condition and an iterative state abstraction procedure.
result Deeply-abstracted states substantially simplify OPE sample complexity.