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.

169,051 papers · 148 categories

Trend · papers per month

2.2%4.3%6.5%8.6% · Sep 201819922001200920172026
48 results for Visual Memory

ivhd tool efficiently visualizes large high-dimensional data.

problem Interactive visualization of large high-dimensional datasets.
method Minimal memory and computational time requirements for nearest neighbor visualization.
result Significantly reduces computational and memory loads.

Prototype-based memory network learns visual categories from unlabeled data.

problem Learning from nonstationary, unlabeled data with sequential dependencies.
method Online prototype-based memory network with contrastive loss.
result Significantly better category recognition compared to state-of-the-art methods.

This paper explores four different visualization techniques for long short-term memory (LSTM) networks applied to continuous-valued time series. On the datasets analysed, we find that the best visualization technique is to learn an input deletion mask that optimally reduces the true class score. With a specific focus o…

2017-05-23abs ↗pdf ↗

The paper studies scaling laws for associative memory mechanisms.

problem Understanding and optimizing learning and memorization processes.
method High-dimensional matrices of outer products of embeddings, relating to transformer models. Derived scaling laws with sample and parameter sizes. Extensive numerical experiments.
result Precise scaling laws and statistical efficiency of estimators.

SMT improves robotic long-horizon tasks by embedding and utilizing past observations.

problem Long-horizon tasks in partially observable environments require effective long-term memory.
method Scene Memory Transformer (SMT) embeds and uses attention to exploit spatio-temporal dependencies.
result SMT outperforms existing policies in visual navigation tasks.

The study evaluates different probability models for uncertainty visualization using entropy calculations.

problem Choosing the right probability model affects memory use, run time, and accuracy in uncertainty visualization.
method Entropy calculation on ensemble data to compare various probability models (uniform, Gaussian, histogram, quantile).
result Models matching the ensemble data distribution have the lowest entropy, indicating better accuracy.

Enhanced image recognition models learn from human-like memory and shape biases.

problem Improving robustness of image recognition models against various perturbations.
method Integrating human-like episodic memory and shape bias features into image recognition models.
result Combining human-like features improves robustness against both adversarial and natural perturbations.

A novel memory mechanism for reinforcement learning agents that stores past events in human-readable language.

problem Lack of interpretability in reinforcement learning agent's memory mechanisms.
method Uses CLIP to associate visual inputs with language tokens, then feeds these tokens to a pretrained language model.
result Significantly faster convergence on challenging continuous recognition tasks.

Paper develops a framework for generating coherent image captions using visual features and hierarchical topics.

problem Generating semantically coherent paragraphs to describe image content.
method Plug-and-play hierarchical-topic-guided image paragraph generation framework integrating visual extractor and deep topic model.
result Proposed models can distill interpretable multi-layer semantic topics and generate diverse and coherent captions.

The multimodal web elements such as text and images are associated with inherent memory costs to store and transfer over the Internet. With the limited network connectivity in developing countries, webpage rendering gets delayed in the presence of high-memory demanding elements such as images (relative to text). To ove…

2017-11-06abs ↗pdf ↗

Fully convolutional neural networks (FCN) have been shown to achieve state-of-the-art performance on the task of classifying time series sequences. We propose the augmentation of fully convolutional networks with long short term memory recurrent neural network (LSTM RNN) sub-modules for time series classification. Our …

2017-09-08abs ↗pdf ↗

Despite recent advances, large scale visual artifacts are still a common occurrence in images generated by GANs. Previous work has focused on improving the generator's capability to accurately imitate the data distribution pdatap_{data}. In this paper, we instead explore methods that enable GANs to actively avoid errors b…

2017-07-03abs ↗pdf ↗

State-regularized RNNs improve interpretability and performance on long-term memory tasks.

problem RNNs struggle with long-term memory and lack of interpretability.
method Introduce a stochastic state transition mechanism to limit state transitions to a finite set.
result State-regularized RNNs perform better on tasks requiring long-term memory.

Deep Convolutional features extracted from a comprehensive labeled dataset, contain substantial representations which could be effectively used in a new domain. Despite the fact that generic features achieved good results in many visual tasks, fine-tuning is required for pretrained deep CNN models to be more effective …

2018-05-02abs ↗pdf ↗

Compact Recurrent Transformer (CRT) improves Transformer efficiency for long sequences.

problem Efficiently scaling Transformer architecture to long sequences with limited compute resources.
method Combines shallow Transformer models with recurrent neural networks and persistent memory.
result CRT achieves comparable or superior performance to full-length Transformers with shorter segments and reduced FLOPs.

Deep network learns Obstacle Tower challenge without human demonstrations.

problem Master procedurally generated levels that get progressively harder.
method Deep Reinforcement Learning with a simple feed-forward network.
result Performed competitively in a reinforcement learning competition.

Study combines CNNs and LSTMs for ECG classification, improving performance with attention mechanisms.

problem Improving ECG classification accuracy for weakly supervised tasks.
method Investigates ConvLSTM networks and various attention mechanisms to capture both morphological and temporal features.
result Attention mechanisms improve classification performance and provide interpretable saliency maps.

SGM combines deep learning and planning for robust long-horizon tasks.

problem Combining deep learning and planning for robust long-horizon tasks.
method Sparse Graphical Memory (SGM) that stores states and feasible transitions in a sparse memory, aggregating states according to a two-way consistency objective.
result SGM significantly outperforms current state of the art methods on long horizon, sparse-reward visual navigation tasks.

Rewards are sparse in the real world and most of today's reinforcement learning algorithms struggle with such sparsity. One solution to this problem is to allow the agent to create rewards for itself - thus making rewards dense and more suitable for learning. In particular, inspired by curious behaviour in animals, obs…

2018-10-04abs ↗pdf ↗

SELD-TCN improves sound event localization and detection efficiency.

problem Efficient sound event localization and detection on embedded hardware.
method Developed a novel temporal convolutional network (TCN) architecture.
result SELD-TCN outperforms state-of-the-art SELDnet on four datasets.

MixHop learns complex neighborhood relationships in graphs.

problem Existing graph neural networks cannot learn certain neighborhood mixing relationships.
method MixHop repeatedly mixes feature representations of neighbors at various distances.
result MixHop outperforms on challenging baselines and visualizes neighborhood information prioritization.

Two novel search strategies reduce complexity for target localization with size-dependent noise.

problem Target localization with varying measurement noise based on query region size.
method Proposes dyaPMdyaPM and hiePMhiePM strategies with low complexity and connected query geometry.
result Unified analysis shows dyaPMdyaPM asymptotically optimal in search time, hiePMhiePM near-optimal in rate.

Learning goal-oriented dialogues by means of deep reinforcement learning has recently become a popular research topic. However, commonly used policy-based dialogue agents often end up focusing on simple utterances and suboptimal policies. To mitigate this problem, we propose a class of novel temperature-based extension…

2018-07-02abs ↗pdf ↗