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

90180270360 · Jun 202019922001200920172026
48 results for Abstract Representations

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.

Math theory explains how neural networks learn abstract representations.

problem Understanding how neural networks learn abstract representations.
method Mathematical theory reformulating network optimization into mean field optimization over neural preactivations.
result Abstract representations of latent variables are guaranteed to appear in neural networks trained on tasks that depend on these variables.

Can simple algorithms with a good representation solve challenging reinforcement learning problems? In this work, we answer this question in the affirmative, where we take "simple learning algorithm" to be tabular Q-Learning, the "good representations" to be a learned state abstraction, and "challenging problems" to be…

2020-02-08abs ↗pdf ↗

The paper introduces a method to learn Markov state abstractions for reinforcement learning.

problem Learning Markov state representations in complex environments.
method The paper introduces a novel set of conditions and a training procedure combining inverse model estimation and temporal contrastive learning.
result The approach learns representations that capture the underlying structure of the domain and improve sample efficiency.

This paper improves disentanglement in VAEs by progressively learning hierarchical representations.

problem Compromised disentanglement in VAEs due to high-level abstraction extraction.
method Progressive learning of independent hierarchical representations from high to low levels.
result Improved disentanglement demonstrated on two benchmark datasets using new metrics.

Constellation learns group-level visual relationships for abstract reasoning.

problem Learning configurational properties of entire groups of objects.
method Introduces Constellation, a network that learns relational abstractions over static visual scenes.
result Offers a basis for abstract relational reasoning and sensory imagination.

XIMP improves molecular property prediction by integrating multiple graph representations.

problem Graph neural networks struggle in data-scarce regimes and fail to surpass traditional methods.
method Cross-graph inter-message passing with multiple graph abstractions.
result XIMP outperforms state-of-the-art baselines across diverse molecular property tasks.

Representation costs in data science: Unifying function-space views of parametric methods

problem Analyzing representation costs of parametric data-fitting methods
method Developing a general framework for analyzing representation costs through parameter-space regularizers
result Proving that many natural results hold in this abstract setting, including representer theorems for parametric methods on their native spaces

COTA learns abstraction maps from data without complete SCM knowledge.

problem Learning causally consistent representations at different resolutions.
method Multi-marginal Optimal Transport (OT) with do-calculus constraints and interventional cost.
result COTA outperforms non-causal and independent formulations on synthetic and real-world problems.

SPEDER extracts state-action abstraction from dynamics for reinforcement learning.

problem Curse of dimensionality and limited applicability of spectral methods.
method Spectral Decomposition Representation (SPEDER) that extracts state-action abstraction from dynamics without policy dependence.
result Theoretical analysis establishes sample efficiency in online and offline settings.

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.

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.

VQShape learns interpretable time-series representations and achieves comparable performance to specialist models.

problem Lack of interpretability in existing time-series models.
method Vector quantization of time-series data into abstracted shapes.
result VQShape achieves comparable performance to specialist models in classification tasks.

Deep neural network learns discrete state abstractions for efficient planning.

problem Efficient sequential decision making in large state spaces.
method Information bottleneck method for learning approximate bisimulations using deep neural encoders and action-conditioned HMM.
result Trained method efficiently plans for unseen goals in multi-goal reinforcement learning.

In the quest for efficient and robust reinforcement learning methods, both model-free and model-based approaches offer advantages. In this paper we propose a new way of explicitly bridging both approaches via a shared low-dimensional learned encoding of the environment, meant to capture summarizing abstractions. We sho…

2018-09-12abs ↗pdf ↗

Paper learns meaningful state and action representations from MDP trajectories.

problem Learning good state and action representations from MDP trajectories.
method Tensor decomposition, kernelization, importance sampling, low-Tucker-rank approximation.
result The learned state/action abstractions provide accurate approximations to latent block structures.

Autoregressive generative models of images tend to be biased towards capturing local structure, and as a result they often produce samples which are lacking in terms of large-scale coherence. To address this, we propose two methods to learn discrete representations of images which abstract away local detail. We show th…

2019-03-06abs ↗pdf ↗

UniNet efficiently learns network representations from large graphs.

problem Efficiently learning network representations from large graphs.
method Metropolis-Hastings sampling for efficient edge sampling and random walk model abstraction.
result UniNet outperforms existing NRL models on billion-edge networks.

Resolving abstract anaphora is an important, but difficult task for text understanding. Yet, with recent advances in representation learning this task becomes a more tangible aim. A central property of abstract anaphora is that it establishes a relation between the anaphor embedded in the anaphoric sentence and its (ty…

2017-06-07abs ↗pdf ↗

This work abstracts deep neural networks into concept graphs for better interpretability in medical tasks.

problem Lack of interpretability in deep learning models, especially in medical domains.
method Developed a graphical representation of medical image processing models to understand concept-based reasoning.
result Extracted a concept-level graph that reveals the decision-making process of deep learning models.

The success of various applications including robotics, digital content creation, and visualization demand a structured and abstract representation of the 3D world from limited sensor data. Inspired by the nature of human perception of 3D shapes as a collection of simple parts, we explore such an abstract shape represe…

2017-08-04abs ↗pdf ↗

This paper tests the hypothesis that modeling a scene in terms of entities and their local interactions, as opposed to modeling the scene globally, provides a significant benefit in generalizing to physical tasks in a combinatorial space the learner has not encountered before. We present object-centric perception, pred…

2019-10-28abs ↗pdf ↗

We present a new recurrent neural network topology to enhance state-of-the-art machine learning systems by incorporating a broader context. Our approach overcomes recent limitations with extended narratives through a multi-layered computational approach to generate an abstract context representation. Therefore, the dev…

2018-07-27abs ↗pdf ↗

MXGNet tackles visual reasoning tasks using graph neural networks.

problem Abstract reasoning, especially in the visual domain, is challenging for AI.
method Combines object-level representations, graph neural networks, and multiplex graphs.
result Achieves state-of-the-art accuracy on Euler Diagram Syllogisms and outperforms state-of-the-art models on RPM datasets.

We introduce a variational approach to learning and inference of temporally hierarchical structure and representation for sequential data. We propose the Variational Temporal Abstraction (VTA), a hierarchical recurrent state space model that can infer the latent temporal structure and thus perform the stochastic state …

2019-10-02abs ↗pdf ↗

We present a framework for autonomously learning a portable representation that describes a collection of low-level continuous environments. We show that these abstract representations can be learned in a task-independent egocentric space specific to the agent that, when grounded with problem-specific information, are …

2019-05-28abs ↗pdf ↗

Though reinforcement learning has greatly benefited from the incorporation of neural networks, the inability to verify the correctness of such systems limits their use. Current work in explainable deep learning focuses on explaining only a single decision in terms of input features, making it unsuitable for explaining …

2019-05-28abs ↗pdf ↗

A discrete system's heterogeneity is measured by the Rényi heterogeneity family of indices (also known as Hill numbers or Hannah--Kay indices), whose units are {the numbers equivalent}. Unfortunately, numbers equivalent heterogeneity measures for non-categorical data require {a priori} (A) categorical partitioning and …

2019-12-10abs ↗pdf ↗

Framework detects anomalies in industrial processes using deep learning.

problem Detect anomalies in complex industrial processes.
method Causal-based framework with unsupervised deep learning.
result Successfully validated abstract contexts of blast furnace assets.

Ideal attribution mechanisms track model interactions for faithful watermarks.

problem Ensuring models provide transparent and fair attribution decisions.
method Introducing ideal attribution mechanisms and a ledger for tracking model interactions.
result A unified framework for evaluating watermarking schemes, clarifying attainable guarantees.

To act and plan in complex environments, we posit that agents should have a mental simulator of the world with three characteristics: (a) it should build an abstract state representing the condition of the world; (b) it should form a belief which represents uncertainty on the world; (c) it should go beyond simple step-…

2018-06-08abs ↗pdf ↗

Although deep reinforcement learning has advanced significantly over the past several years, sample efficiency remains a major challenge. Careful choice of input representations can help improve efficiency depending on the structure present in the problem. In this work, we present an attention-based method to project i…

2019-05-07abs ↗pdf ↗