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

9.2%18.5%27.7%36.9% · Jun 202019922001200920172026
48 results for neural episodic control

Deep reinforcement learning methods attain super-human performance in a wide range of environments. Such methods are grossly inefficient, often taking orders of magnitudes more data than humans to achieve reasonable performance. We propose Neural Episodic Control: a deep reinforcement learning agent that is able to rap…

2017-03-06abs ↗pdf ↗

New algorithm learns reward signals from episodic returns for better reinforcement learning.

problem Difficulty in designing reward functions for real-world reinforcement learning tasks.
method Introduces a new algorithm that decomposes episodic returns into time-step rewards using deep neural networks.
result Learning reward signals from episodic returns improves reinforcement learning efficiency.

MEMEC improves sample efficiency in reinforcement learning.

problem Lack of sample efficiency in reinforcement learning.
method Proposes MEMEC, a Boltzmann policy with state-dependent temperature for more principled exploration.
result MEMEC outperforms other methods on classic RL environments and Atari games.

State of the art deep reinforcement learning algorithms take many millions of interactions to attain human-level performance. Humans, on the other hand, can very quickly exploit highly rewarding nuances of an environment upon first discovery. In the brain, such rapid learning is thought to depend on the hippocampus and…

2016-06-14abs ↗pdf ↗

AE-DDPG improves DDPG for continuous control in complex environments with less data and time.

problem Data insufficiency and training inefficiency in DDPG for complex environments.
method Asynchronous episodic data collection, modified experience replay, and new action noise.
result AE-DDPG achieves higher rewards and less training time in complex environments.

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

Control of non-episodic, finite-horizon dynamical systems with uncertain dynamics poses a tough and elementary case of the exploration-exploitation trade-off. Bayesian reinforcement learning, reasoning about the effect of actions and future observations, offers a principled solution, but is intractable. We review, then…

2015-10-13abs ↗pdf ↗

Efficiently stores and retrieves past states for faster learning in reinforcement learning.

problem Data inefficiency and memory limitations in reinforcement learning.
method Dynamic online k-means for state clustering and prioritization.
result Dynamic online k-means improves performance with smaller memory sizes.

NIPA aims to translate brain learning mechanisms into scalable Bayesian inference.

problem Scalable Bayesian inference for large-scale statistical machine learning problems.
method Neural-inspired algorithm combining model-based, model-free, and episodic-control modules.
result Advances Bayesian methods and facilitates their application to deep learning.

Bootstrap method for Markov chains in reinforcement learning.

problem Distributional consistency in finite controlled Markov chains with unknown control policies.
method Model-based bootstrap with novel LLN and CLT for visitation counts and transition increments.
result Asymptotically valid confidence intervals for value and QQ-functions in offline RL.

Study shows how to control jump-diffusion processes with stable feedback controls in reinforcement learning.

problem Control jump-diffusion processes with unknown coefficients in reinforcement learning.
method Lipschitz continuous optimal feedback controls, stability analysis of forward-backward SDEs, least-squares algorithm.
result Achieves O(NlnN)O(\sqrt{N\ln N}) regret for linear-convex learning problems with jumps.

A new method learns from multi-modal sequences with external memory.

problem Learning new modes in a dynamic environment without prior knowledge.
method Maintains a neural episodic memory with a Dirichlet Process prior to store mode descriptors and transfers knowledge through retrieval.
result Performs continual learning favorably compared to mainstream approaches.

Proposes a new resampling method for off-policy evaluation in stochastic control.

problem Estimating policy performance from data generated under a different policy.
method K-nearest neighbor resampling procedure for off-policy evaluation.
result Statistical consistency results for the proposed method under weak conditions.

New schemes improve lifelong learning by balancing old and new tasks.

problem Catastrophic forgetting in deep neural networks when learning multiple tasks.
method Unified optimization perspective of episodic memory based approaches, introducing MEGA-I and MEGA-II schemes.
result Significant improvement in lifelong learning benchmarks, reducing error by up to 18%.

Deep RNN detects FoG episodes in Parkinson's disease with high accuracy.

problem Detecting freezing episodes in Parkinson's disease patients.
method Deep Recurrent Neural Network (RNN) with Long Short-Term Memory cells on 3D-accelerometer measurements.
result Frequency domain features from trunk sensor achieve an AUC score of 93% in subject-independent method.

When applied to training deep neural networks, stochastic gradient descent (SGD) often incurs steady progression phases, interrupted by catastrophic episodes in which loss and gradient norm explode. A possible mitigation of such events is to slow down the learning process. This paper presents a novel approach to contro…

2017-09-05abs ↗pdf ↗

New framework for RL with linear-convex models reduces performance gap.

problem Continuous-time episodic reinforcement learning with unknown coefficients and convex objectives.
method Probabilistic framework and phase-based learning algorithm for optimal exploration-exploitation trade-off.
result Sublinear regrets achieved, matching best possible results in literature.

Protocol diagnoses neural HJB-PIDE solvers for Lévy jumps, revealing a missing factor in their importance-proposal density.

problem Neural PDE solvers can match scalar diagnostics but miscompute operators, leading to systematic errors.
method Five-step diagnostic protocol decomposes neural solve into components, compares them with independent reference solutions.
result Corrected a missing 1/2-mixture factor in the neural method's importance-proposal density, improving control accuracy.

Reinforcement learning (RL) algorithms have made huge progress in recent years by leveraging the power of deep neural networks (DNN). Despite the success, deep RL algorithms are known to be sample inefficient, often requiring many rounds of interaction with the environments to obtain satisfactory performance. Recently,…

2018-05-19abs ↗pdf ↗

We investigate different strategies for active learning with Bayesian deep neural networks. We focus our analysis on scenarios where new, unlabeled data is obtained episodically, such as commonly encountered in mobile robotics applications. An evaluation of different strategies for acquisition, updating, and final trai…

2017-03-21abs ↗pdf ↗

Study of multidimensional control problems with reflection controls.

problem Solving control problems with reflection controls in multidimensional settings.
method Gradient descent algorithm for polytope approximations, data-driven domain estimator, episodic learning algorithm.
result Data-driven solutions for unknown diffusion dynamics with sublinear regret.

New Q-learning algorithms reduce regret in inventory control problems.

problem Efficiently learning optimal policies in inventory control problems with limited feedback.
method Proposed Elimination-Based Half-Q-Learning (HQL) and Full-Q-Learning (FQL) algorithms with theoretical regret bounds.
result HQL incurs ildeO(H3T) ilde{\mathcal{O}}(H^3\sqrt{ T}) regret, FQL incurs ildeO(H2T) ilde{\mathcal{O}}(H^2\sqrt{ T}) regret, independent of state and action space sizes.

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

Proposes PIC and POIC for measuring task difficulty in RL.

problem Lack of metrics to measure task difficulty in RL.
method Introduces policy information capacity (PIC) and policy-optimal information capacity (POIC) as metrics based on mutual information.
result Empirically shows PIC and POIC correlate with task solvability better than alternatives.

Representing a dialog policy as a recurrent neural network (RNN) is attractive because it handles partial observability, infers a latent representation of state, and can be optimized with supervised learning (SL) or reinforcement learning (RL). For RL, a policy gradient approach is natural, but is sample inefficient. I…

2016-12-18abs ↗pdf ↗

Meta-learning agents excel at rapidly learning new tasks from open-ended task distributions; yet, they forget what they learn about each task as soon as the next begins. When tasks reoccur - as they do in natural environments - metalearning agents must explore again instead of immediately exploiting previously discover…

2018-05-24abs ↗pdf ↗

The success of popular algorithms for deep reinforcement learning, such as policy-gradients and Q-learning, relies heavily on the availability of an informative reward signal at each timestep of the sequential decision-making process. When rewards are only sparsely available during an episode, or a rewarding feedback i…

2018-05-25abs ↗pdf ↗

Paper proposes an intersection decision algorithm for autonomous vehicles.

problem Navigating intersections with non-automated vehicles.
method Combines reinforcement learning for high-level decisions and model predictive control for low-level planning.
result The proposed algorithm outperforms another controller in success rate and training episodes.

A novel approach stores encoded images as centroids and covariance matrices to improve classification accuracy with less memory.

problem Catastrophic forgetting and memory limitations in continual learning.
method Trains autoencoders with Neural Style Transfer to encode images, replay encoded episodes to avoid forgetting, and use centroids and covariance matrices for pseudo-images when memory is full.
result Increases classification accuracy by 13-17% over state-of-the-art methods on benchmark datasets, while requiring 78% less storage space.

New approach uses Gaussian processes to learn and track complex systems with guaranteed accuracy.

problem Inaccurate first principle models for complex systems due to data complexity.
method Bayesian prediction error bound for Gaussian process regression, derived from kernel-based data density.
result Achieves vanishing tracking error with increasing data density, providing time-varying accuracy guarantees.

New algorithm reduces regret in stochastic shortest path problems.

problem Planning and control in environments with unknown dynamics and variable episode lengths.
method Developed an algorithm with a new regret bound of O(BSAK)O(B_\star |S| \sqrt{|A| K}).
result Guaranteed a significant reduction in regret compared to previous methods.

New RL algorithm achieves nearly optimal performance for linear MDPs.

problem Optimal reinforcement learning for episodic linear MDPs.
method Weighted linear regression with variance estimator and rare-switching policy.
result Achieves nearly minimax optimal regret ildeO(dH3K) ilde O(d\sqrt{H^3K}).

This work optimizes RL algorithms using entropy regularisation for continuous-time LQ problems.

problem Designing RL algorithms to balance exploration and exploitation in noisy environments.
method Entropy regularisation in two formulations: exploratory control and proximal policy update.
result Regret of O(N)\mathcal{O}(\sqrt{N}) for both learning algorithms over NN episodes.

TapNet uses neural networks with task-adaptive projection for improved few-shot learning.

problem Handling previously unseen tasks with limited training examples.
method Meta-learning strategy with episode-based training, task-adaptive projection.
result State-of-the-art classification accuracies on various few-shot learning datasets.

Study nonparametric estimator for Markov chain transition matrices in offline setting.

problem Estimating transition matrices of finite controlled Markov chains from logged data.
method Developed sample complexity bounds and conditions for minimaxity.
result Achieving certain statistical risk requires balancing mixing properties and sample size.