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

82165247329 · Jun 202019922001200920172026
48 results for continuing environments

PSRL extension for continuing environments reduces regret.

problem Formalizing and analyzing resampling approach for reinforcement learning.
method Continuing PSRL maintains a model of the environment and replaces it with samples from the posterior distribution.
result Established an ildeO(τSAT) ilde{O}(τS \sqrt{A T}) bound on Bayesian regret.

Neural Laplace Control tackles offline RL for continuous-time delayed systems with irregular observations.

problem Offline reinforcement learning problems involving continuous-time environments with delays and irregular observations.
method Combines a Neural Laplace dynamics model with a model predictive control (MPC) planner.
result Achieves near expert policy performance on continuous-time delayed environments.

A new buffer system improves continual learning in RL agents by adapting to changing environments.

problem Improving RL agents' ability to learn from changing environments over time.
method Multi-timescale replay buffer combined with invariant risk minimization.
result The method shows improvement over baselines in continual learning settings.

Paper formalizes continual learning, proposing a feature extraction approach.

problem Learning from multiple environments without forgetting previous ones.
method Feature extraction framework and gradient-based algorithm DPGD.
result Efficient algorithm DPGD avoids catastrophic forgetting.

Bayesian Federated Learning improves model reliability in dynamic environments.

problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.

A fundamental challenge in artificial intelligence is to build an agent that generalizes and adapts to unseen environments. A common strategy is to build a decoder that takes the context of the unseen new environment as input and generates a policy accordingly. The current paper studies how to build a decoder for the f…

2019-10-30abs ↗pdf ↗

Paper tackles sim-to-real transfer in continuous domains with partial observations.

problem Lack of theoretical foundation for sim-to-real transfer in continuous domains with partial observations.
method Developed a new algorithm for infinite-horizon average-cost LQGs and established a regret bound.
result A popular robust adversarial training algorithm can learn competitive policies from simulation to real-world environments.

A new method optimizes in nonstationary environments with many arms efficiently.

problem Optimizing in nonstationary environments with a large number of arms.
method Gaussian interpolation to learn continuous Lipschitz reward functions in nonstationary environments.
result Efficiently learns continuous Lipschitz reward functions with O(T)\mathcal{O}^*(\sqrt{T}) cumulative regret.

OSAMD adapts online to changing distributions with limited labels.

problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.

Paper tackles overestimation bias in continuous control, improving performance by 25%.

problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.

The utility of learning a dynamics/world model of the environment in reinforcement learning has been shown in a many ways. When using neural networks, however, these models suffer catastrophic forgetting when learned in a lifelong or continual fashion. Current solutions to the continual learning problem require experie…

2019-03-06abs ↗pdf ↗

High-dimensional always-changing environments constitute a hard challenge for current reinforcement learning techniques. Artificial agents, nowadays, are often trained off-line in very static and controlled conditions in simulation such that training observations can be thought as sampled i.i.d. from the entire observa…

2019-05-24abs ↗pdf ↗

This paper tackles continuous domain adaptation with a new approach.

problem Learning in non-stationary environments, especially domain drift.
method Variational domain-agnostic feature replay, composed of inference, generative, and solver modules.
result Demonstrates the effectiveness of the proposed approach for practical usage.

The paper tackles finding optimal treatment sequences in continuous state spaces.

problem Finding counterfactually optimal action sequences in continuous state spaces.
method Formalizes the problem using finite horizon Markov decision processes and structural causal models. Develops a search method based on the A* algorithm.
result The method can find optimal action sequences in polynomial time under certain conditions.

This research introduces an autonomous robot navigation method using reinforcement learning.

problem Improving robot navigation in complex environments.
method Deep Q Network (DQN) and Proximal Policy Optimization (PPO) models for path planning and decision-making.
result The models enhance robot navigation ability and adaptive learning in unknown environments.

This paper describes a reference architecture for self-maintaining systems that can learn continually, as data arrives. In environments where data evolves, we need architectures that manage Machine Learning (ML) models in production, adapt to shifting data distributions, cope with outliers, retrain when necessary, and …

2019-03-12abs ↗pdf ↗

Study robust control for systems with continuous states using adversarial perturbations.

problem Fragile policies in Markov control models under internal or external perturbations.
method Distributionally robust stochastic control with adaptive adversarial perturbations.
result Optimal robust policies for continuous state systems with uniform learning guarantees.

AIRL learns robust, generalizable reward functions from demonstrations.

problem Learning robust reward functions from demonstrations for changing environments.
method Adversarial Inverse Reinforcement Learning (AIRL) with hierarchical disentangled rewards.
result Generalizable policies and comparable results to state-of-the-art methods.

New model-based methods adapt pre-trained policies to unseen environments efficiently.

problem High sample complexity in reinforcement learning limits practical applications.
method Combines online learning and adaptive control to adapt policies in unseen environments.
result Proves policies can quickly recover trajectories from source to target environments.

Adversarial methods for imitation learning have been shown to perform well on various control tasks. However, they require a large number of environment interactions for convergence. In this paper, we propose an end-to-end differentiable adversarial imitation learning algorithm in a Dyna-like framework for switching be…

2019-03-08abs ↗pdf ↗

A core aspect of human intelligence is the ability to learn new tasks quickly and switch between them flexibly. Here, we describe a modular continual reinforcement learning paradigm inspired by these abilities. We first introduce a visual interaction environment that allows many types of tasks to be unified in a single…

2017-11-20abs ↗pdf ↗

This research proposes a CL model for RNNs to handle sequential data without forgetting.

problem Learning in dynamic environments without forgetting previous knowledge for sequential data.
method A Recurrent Neural Network (RNN) model with Elastic Weight Consolidation (EWC) for CL.
result The proposed model outperforms EWC and RNNs on CL benchmarks for sequential data.

We present a new method of learning a continuous occupancy field for use in robot navigation. Occupancy grid maps, or variants of, are possibly the most widely used and accepted method of building a map of a robot's environment. Various methods have been developed to learn continuous occupancy maps and have successfull…

2019-10-18abs ↗pdf ↗

The creation of machine learning algorithms for intelligent agents capable of continuous, lifelong learning is a critical objective for algorithms being deployed on real-life systems in dynamic environments. Here we present an algorithm inspired by neuromodulatory mechanisms in the human brain that integrates and expan…

2020-01-27abs ↗pdf ↗

We solve continuous-time latent SDE identifiability using diffusion shifts.

problem Identifiability of latent SDEs in continuous-time time series.
method Environment-induced shifts in diffusion covariance for additive-noise latent SDEs.
result Two diagonal diffusion regimes with distinct variance ratios identify latent coordinates up to permutation and scaling.

SyMPLER improves time series forecasting in nonstationary environments with explainable models.

problem Nonstationary time series forecasting with limited interpretability.
method Dynamic piecewise-linear approximations based on Statistical Learning Theory generalization bounds.
result SyMPLER achieves comparable performance to black-box and explainable models while maintaining interpretability.

New model learning objective improves continuous control tasks.

problem Challenges in solving continuous control tasks using model-based reinforcement learning.
method Derived a novel value-aware model learning objective and identified and addressed stale value estimates issue.
result Value-aware objectives can be successfully deployed in solving continuous control tasks without tuning hyper-parameters.