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

130259389518 · Jun 202019922001200920172026
48 results for partially observable environments

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

Meta-learners estimate CATE from multiple environments with partial identification.

problem Estimating CATE from observational data across multiple environments with violations of causal assumptions.
method Adapt IV literature for partial identification, propose model-agnostic meta-learners.
result Meta-learners effectively estimate CATE bounds across various experiments.

Recurrent networks learn beliefs from history in partially observable environments.

problem Learning optimal policies in partially observable environments.
method Trained recurrent neural networks to approximate value functions, measuring mutual information between hidden states and beliefs.
result Recurrent networks' hidden states correlate with beliefs of relevant state variables, improving expected return.

The paper develops a method to learn navigation costs from expert demonstrations in partially observable environments.

problem Learning navigation costs from expert demonstrations in partially observable environments.
method Develops a cost function representation composed of a probabilistic occupancy encoder and a cost encoder, optimized by differentiating the error between demonstrated controls and a control policy computed from the cost encoder.
result The method outperforms baseline IRL algorithms in robot navigation tasks, improving both training and test-time efficiency.

Efficient RL in partially observable risk-sensitive environments with hindsight observations.

problem Risk-sensitive reinforcement learning in partially observable environments.
method Integrates hindsight observations into POMDP framework, develops novel RL algorithm.
result Achieves polynomial regret with provable efficiency, outperforming existing methods.

DiffATD efficiently discovers targets in partially observable environments using diffusion dynamics.

problem Efficiently discovering targets in partially observable environments with limited sampling.
method DiffATD uses diffusion dynamics to maintain a belief distribution over unobserved states, balancing exploration and exploitation.
result DiffATD outperforms baselines and supervised methods in diverse domains.

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.

This work studies the problem of batch off-policy evaluation for Reinforcement Learning in partially observable environments. Off-policy evaluation under partial observability is inherently prone to bias, with risk of arbitrarily large errors. We define the problem of off-policy evaluation for Partially Observable Mark…

2019-09-09abs ↗pdf ↗

Deep Reinforcement Learning (RL) recently emerged as one of the most competitive approaches for learning in sequential decision making problems with fully observable environments, e.g., computer Go. However, very little work has been done in deep RL to handle partially observable environments. We propose a new architec…

2018-04-17abs ↗pdf ↗

Algorithm improves imitation learning from visual data in partially observable environments.

problem Imitation learning from visual observations with missing expert actions and partial observability.
method Theoretical analysis and Latent Adversarial Imitation from Observations algorithm combining adversarial and latent representations.
result Latent Adversarial Imitation from Observations achieves state-of-the-art performance in high-dimensional robotic tasks.

A new metric detects non-Markovian states in partially observable environments.

problem Learning state representations in partially observable environments.
method Introducing the λλ-discrepancy metric to detect non-Markovian states.
result The λλ-discrepancy is zero for Markov processes and non-zero for partially observable environments.

Enhances RL in partially observable, noisy environments by uncovering causal states.

problem Making decisions based on incomplete and noisy observations in partially observable Markov decision processes (P2^2OMDPs).
method Causal State Representation under Asynchronous Diffusion Model (CaDiff) framework, incorporating a novel asynchronous diffusion model (ADM) and a new bisimulation metric.
result Enhances returns by at least 14.18% compared to baselines on Roboschool tasks.

Unsupervised representation learning has succeeded with excellent results in many applications. It is an especially powerful tool to learn a good representation of environments with partial or noisy observations. In partially observable domains it is important for the representation to encode a belief state, a sufficie…

2018-11-15abs ↗pdf ↗

We discuss a variant of Thompson sampling for nonparametric reinforcement learning in a countable classes of general stochastic environments. These environments can be non-Markov, non-ergodic, and partially observable. We show that Thompson sampling learns the environment class in the sense that (1) asymptotically its …

2016-02-25abs ↗pdf ↗

Stable Hadamard Memory improves reinforcement learning by efficiently managing memory.

problem Memory models struggle in partially observable reinforcement learning environments.
method Introduces a novel memory model using the Hadamard product for efficient memory management and updates.
result Significantly outperforms state-of-the-art memory-based methods on challenging benchmarks.

This paper is concerned with multi-view reinforcement learning (MVRL), which allows for decision making when agents share common dynamics but adhere to different observation models. We define the MVRL framework by extending partially observable Markov decision processes (POMDPs) to support more than one observation mod…

2019-10-18abs ↗pdf ↗

Many interesting real world domains involve reinforcement learning (RL) in partially observable environments. Efficient learning in such domains is important, but existing sample complexity bounds for partially observable RL are at least exponential in the episode length. We give, to our knowledge, the first partially …

2016-05-25abs ↗pdf ↗

NBF combines deep learning with classical filtering for better belief tracking.

problem Maintaining distributions over hidden states in partially observable systems.
method Trains neural networks to map beliefs to fixed-length vectors, updating them with incoming observations and dynamics.
result NBF efficiently tracks shifting, multimodal beliefs without particle impoverishment.

The paper explores how agents can generalize to new environments with unseen variables.

problem Generalizing to new environments with unseen variables.
method Investigates and proposes a method for efficient re-use of past marginal information to achieve out-of-variable generalization.
result The residual distribution after fitting a classifier reveals partial derivatives of the true generating function with respect to unobserved causal parents.

AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.

problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.

Enhances reinforcement learning with partial state information.

problem Improving learning under partial observability with limited privileged signals.
method Introduced informed asymmetric actor-critic framework that uses arbitrary state-dependent privileged signals.
result Unbiased policy gradient estimates with arbitrary privileged signals.

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.

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

This work uses reinforcement learning to optimize task scheduling and execution in a dynamic multi-agent warehouse environment.

problem Optimizing task scheduling and execution in a dynamic multi-agent warehouse environment with limited observability.
method Deep reinforcement learning to solve both high-level scheduling and low-level multi-agent execution problems.
result Demonstrates the effectiveness of reinforcement learning in optimizing task scheduling and execution in a dynamic multi-agent environment.

RLHF fails when humans only partially observe, leading to inflated or overjustified feedback.

problem Failure of reinforcement learning from human feedback in partially observable environments.
method Formal definition of failure cases, modeling human as Boltzmann rational, analyzing information provided by feedback.
result RLHF can deceptively inflate or overjustify feedback when humans have partial observations.

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.

Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…

2019-04-16abs ↗pdf ↗

FEPS models agents to learn and act in complex environments without deep neural networks.

problem Modeling complex adaptive systems and understanding self-organizing behavior.
method Introducing Free Energy Projective Simulation (FEPS) within the constraints of the free energy principle and active inference.
result FEPS agents resolve ambiguity and infer optimal policies in partially observable environments.

Smart grid uses deep learning to optimize household energy use.

problem Optimizing household energy use under real-time pricing schemes.
method Multi-agent deep actor-critic learning for decentralized agents with partial observability.
result Deep reinforcement learning reduces peak-to-average energy consumption and costs.

Humans achieve efficient learning by relying on prior knowledge about the structure of naturally occurring tasks. There is considerable interest in designing reinforcement learning (RL) algorithms with similar properties. This includes proposals to learn the learning algorithm itself, an idea also known as meta learnin…

2019-05-15abs ↗pdf ↗

Paper introduces MVS to detect non-Markovian observations in reinforcement learning.

problem Real-world sensors violate Markov property, leading to suboptimal reinforcement learning performance.
method Uses prediction-based Markov Violation Score (MVS) combining random forest and ridge regression.
result MVS detects non-Markovian structure in observation trajectories, quantifying its impact.

Improved ExO method achieves near-optimal bounds in both stochastic and adversarial settings.

problem Finding optimal exploration strategies in online decision-making with limited feedback.
method Exploration by Optimization with hybrid regularizers for locally observable games.
result Achieved nearly optimal bounds of O(aeqak2m2logT/Δa)O(\sum_{a eq a^*} k^2 m^2 \log T / Δ_a) in stochastic and adversarial environments.

DPFRL uses particle filters for decision making with complex visual observations.

problem Decision making with partial complex visual observations.
method Discriminative Particle Filter Reinforcement Learning (DPFRL) with a differentiable particle filter in the neural network policy.
result DPFRL outperforms state-of-the-art POMDP RL models in complex visual observation tasks.

A new algorithm trains experts to safely guide agents in partially observed environments.

problem Existing imitation learning methods for POMDPs can lead to sub-optimal or unsafe policies.
method Derive an objective to encourage the expert to maximize the agent's reward, then use it to train both expert and agent.
result The algorithm produces an expert policy that the agent can safely imitate, outperforming fixed expert policies.