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

22456789 · Jun 202019922001200920172026
48 results for Temporal Imagination

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 ↗

While traditional methods for instruction-following typically assume prior linguistic and perceptual knowledge, many recent works in reinforcement learning (RL) have proposed learning policies end-to-end, typically by training neural networks to map joint representations of observations and instructions directly to act…

2020-01-25abs ↗pdf ↗

Conventional wisdom holds that model-based planning is a powerful approach to sequential decision-making. It is often very challenging in practice, however, because while a model can be used to evaluate a plan, it does not prescribe how to construct a plan. Here we introduce the "Imagination-based Planner", the first m…

2017-07-19abs ↗pdf ↗

This document consists of the collection of handouts for a two-week summer workshop entitled 'Geometry and the Imagination', led by John Conway, Peter Doyle, Jane Gilman and Bill Thurston at the Geometry Center in Minneapolis, June 17-28, 1991. The workshop was based on a course `Geometry and the Imagination' which we …

2018-04-09abs ↗pdf ↗

Novel deep learning architecture decodes imagined speech from EEG.

problem Insufficient training samples for deep learning in decoding imagined speech.
method Employed a novel deep learning architecture with CSP for feature selection, DWT for feature extraction, and majority voting for classification.
result Achieved accuracies comparable to state-of-the-art results.

This paper improves robot grasping by integrating meta-control and latent-space imagination.

problem Dual-system approaches fail to consider the reliability of the learned model when making multiple-step predictions.
method A meta-controller arbitrates between model-based and model-free decisions based on local reliability, encouraging actions that improve the model and generating imagined experiences for additional training.
result Our approach learns near-optimal grasping policies in dense- and sparse-reward environments, outperforming baseline and state-of-the-art methods.

It is easy for people to imagine what a man with pink hair looks like, even if they have never seen such a person before. We call the ability to create images of novel semantic concepts visually grounded imagination. In this paper, we show how we can modify variational auto-encoders to perform this task. Our method use…

2017-05-30abs ↗pdf ↗

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.

We introduce Imagination-Augmented Agents (I2As), a novel architecture for deep reinforcement learning combining model-free and model-based aspects. In contrast to most existing model-based reinforcement learning and planning methods, which prescribe how a model should be used to arrive at a policy, I2As learn to inter…

2017-07-19abs ↗pdf ↗

Deep imagination optimizes decision-making in large trees with limited resources.

problem Optimal planning in large decision trees with limited resources and time.
method Analytical solutions and numerical analysis of sampling capacity allocation.
result Optimal policy is to allocate few samples per level for deep exploration, favoring depth over breadth.

A new method for robot manipulation tasks using imagined object goals.

problem Learning robot manipulation in sparse reward environments.
method Train objects to reach target positions, then use predictions to create a curriculum of tasks.
result Higher success rates in challenging learning scenarios compared to alternatives.

The goal of the IARAI competition traffic4cast was to predict the city-wide traffic status within a 15-minute time window, based on information from the previous hour. The traffic status was given as multi-channel images (one pixel roughly corresponds to 100x100 meters), where one channel indicated the traffic volume, …

2019-10-27abs ↗pdf ↗

In recent years, deep generative models have been shown to 'imagine' convincing high-dimensional observations such as images, audio, and even video, learning directly from raw data. In this work, we ask how to imagine goal-directed visual plans -- a plausible sequence of observations that transition a dynamical system …

2018-07-24abs ↗pdf ↗

An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of strings is countable.

2017-04-09abs ↗pdf ↗

UWM-JEPA predicts future scenarios in belief space, improving accuracy in partially observed environments.

problem Predicting future scenarios in partially observed environments with uncertainty.
method Introduces UWM-JEPA, a JEPA world model with a density-matrix latent and learned unitary predictor.
result UWM-JEPA achieves 0.77 accuracy on a hidden-velocity indicator task, outperforming LSTM-JEPA.

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 ↗

For an autonomous agent to fulfill a wide range of user-specified goals at test time, it must be able to learn broadly applicable and general-purpose skill repertoires. Furthermore, to provide the requisite level of generality, these skills must handle raw sensory input such as images. In this paper, we propose an algo…

2018-07-12abs ↗pdf ↗

Model predicts multi-agent trajectories using a differentiable simulator.

problem Predicting future positions of multiple interacting agents.
method Conditional recurrent variational neural networks (CVRNNs) with a kinematic bicycle model.
result Achieves state-of-the-art results on INTERACTION dataset.

Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…

2019-04-09abs ↗pdf ↗

REFIL learns from imagined sub-group interactions to improve multi-agent reinforcement learning.

problem Learning efficiency in multi-agent reinforcement learning settings.
method Randomized Entity-wise Factorization (REFIL) approach.
result REFIL outperforms all strong baselines in challenging multi-task StarCraft settings.

Models necessarily capture only parts of a reality. Prediction models aim at capturing a future reality. In this paper we address the question of how the future is constructed (or: imagined) in an investment context where market participants form expectations on the returns of a risky investment. We observe that the pa…

2019-12-23abs ↗pdf ↗

Consider a set of latent factors whose observable effect of activation is caught on a measure space that appears as a grid of bits tacking value in {0,1}\{0, 1 \}. This paper intend to deliver a theoretical and practical answer to the question: Given that we have access to a perfect indicator of the activation of latent f…

2019-09-20abs ↗pdf ↗

Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for nodes in a graph. By imagining the embeddings as independent coin flips of varying b…

2018-03-25abs ↗pdf ↗

We demonstrate a conditional autoregressive pipeline for efficient music recomposition, based on methods presented in van den Oord et al.(2017). Recomposition (Casal & Casey, 2010) focuses on reworking existing musical pieces, adhering to structure at a high level while also re-imagining other aspects of the work. This…

2018-11-18abs ↗pdf ↗

Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…

2015-01-25abs ↗pdf ↗

New model explains how concepts grow based on experience.

problem Existing models assume fixed representation; new model allows for growth.
method Geometric framework with MDL criterion for basis extension.
result Conceptual growth is selective and conservative, exposing or amplifying residual error.

How technology affects growth or employment has long been debated. With a hiatus, the debate revived once again in the form of how Information and Communications Technology, as a form of new technology, exerts on productivity and employment. Information and Communications Technology perceived as General Purpose Technol…

2017-04-05abs ↗pdf ↗

Study improves forecast accuracy of daily volatility to enhance portfolio performance.

problem Improving predictability of realized variance from market views.
method High-dimensional machine learning models and low-dimensional factor models used to forecast firm-level volatility.
result Marginal improvements in forecast error lead to significant gains in portfolio performance.

If a document is about travel, we may expect that short snippets of the document should also be about travel. We introduce a general framework for incorporating these types of invariances into a discriminative classifier. The framework imagines data as being drawn from a slice of a Levy process. If we slice the Levy pr…

2016-03-21abs ↗pdf ↗