Enhanced feedback model improves sample-efficiency in POMDPs.
problem Exponential hardness of learning in POMDPs.
method Multiple observations in hindsight feedback model.
result Sample-efficient learning possible for new subclasses of POMDPs.
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
48 results for “POMDP”
New method approximates POMDPs with PB-MDPs, providing error bounds and practical algorithms.
problem Difficulty in solving POMDPs with continuous or hybrid state and observation spaces.
method Bounding particle filtering error and adapting MDP algorithms to POMDPs.
result General theory and practical algorithms for POMDPs with no direct dependence on state and observation space sizes.
PS4POMDPs algorithm simplifies online learning for episodic POMDPs with unknown models.
problem Learning in POMDPs is harder than in MDPs; online learning is especially challenging.
method Posterior Sampling-based reinforcement learning algorithm (PS4POMDPs)
result Bayesian regret scales as √number of episodes and is polynomial in other parameters.
Dynamical-VAE learns causal dynamics from POMDPs using future information.
problem Learning accurate state representations from partial observations in POMDPs.
method Dynamical Variational Auto-Encoder (DVAE) with hindsight framework.
result DVAE uncovers causal graph more effectively than history-based methods.
This research develops an efficient reinforcement learning method for undercomplete POMDPs.
problem Learning undercomplete Partially Observable Markov Decision Processes (POMDPs) is computationally hard.
method OOM-UCB algorithm for episodic finite undercomplete POMDPs.
result Achieves optimal sample complexity of for finding an -optimal policy.
New algorithms learn POMDPs efficiently with hindsight observability.
problem Hardness of learning in POMDPs due to partial observability.
method Hindsight Observable Markov Decision Process (HOMDP) and new algorithms for tabular and function approximation settings.
result Sample-efficient learning in POMDPs with optimal dependence on latent state and observation cardinalities.
Solves POMDPs with recurrent neural networks and natural policy gradient.
problem Non-stationarity in optimal policies of POMDPs.
method Integrates recurrent neural networks into natural policy gradient and temporal difference learning.
result Non-asymptotic theoretical guarantees for global optimality up to function approximation.
New algorithm learns POMDPs without computational oracles.
problem Learning near-optimal policies in POMDPs with computationally hard oracles.
method Quasipolynomial-time algorithm using barycentric spanners for policy covers.
result First oracle-free learning algorithm for observable POMDPs.
New algorithm proves RL from partial obs is feasible.
problem Difficulty in learning from partial observability.
method Optimism combined with MLE for weakly revealing POMDPs.
result Simple algorithm guarantees polynomial sample efficiency.
We solve POMDPs by approximating them as finite-state MDPs.
problem Computational challenges in learning optimal policies for POMDPs.
method Transform POMDP into a Superstate MDP, apply TD-learning and policy optimization.
result Finite-time bounds on TD-learning error for non-Markovian dynamics.
New algorithm for planning in observable POMDPs in quasi-polynomial time.
problem Planning in POMDPs is computationally hard.
method Assumption of well-separated distributions on states and observations leads to quasi-succinct descriptions of near-optimal policies.
result Quasipolynomial-time algorithm for planning in observable POMDPs.
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…
We propose a new reinforcement learning algorithm for partially observable Markov decision processes (POMDP) based on spectral decomposition methods. While spectral methods have been previously employed for consistent learning of (passive) latent variable models such as hidden Markov models, POMDPs are more challenging…
We propose a new reinforcement learning algorithm for partially observable Markov decision processes (POMDP) based on spectral decomposition methods. While spectral methods have been previously employed for consistent learning of (passive) latent variable models such as hidden Markov models, POMDPs are more challenging…
New method optimizes decision-making in uncertain environments.
problem Optimal decision-making under partial observability.
method Nested sequential Monte Carlo algorithm for continuous POMDPs.
result Demonstrated effectiveness on continuous POMDP benchmarks.
New method for off-policy evaluation in POMDPs using future-dependent value functions.
problem Curse of horizon in off-policy evaluation for POMDPs.
method Develops future-dependent value functions and minimax learning method.
result PAC result and Bellman completeness for the proposed OPE estimator.
Paper proposes a policy gradient method for confounded POMDPs.
problem Estimating policy gradients for confounded POMDPs with continuous state and observation spaces.
method Developed a novel identification result to estimate policy gradients using offline data, solved conditional moment restrictions, and applied min-max learning with function approximation.
result Showed global convergence of the proposed algorithm in finding the optimal policy.
New algorithm learns POMDPs with known observation model efficiently.
problem Learning POMDPs with unknown transition model in average-reward setting.
method OAS estimation technique and OAS-UCRL algorithm balancing exploration-exploitation.
result Regret guarantee of order for OAS-UCRL algorithm.
New framework learns policies for partially observable systems.
problem Learning policies in partially observable dynamical systems.
method Partially Observable Bilinear Actor-Critic framework.
result Algorithm can learn against optimal policies in certain cases.
Efficient RL in large POMDPs with latent determinism and embeddings.
problem Efficient reinforcement learning in large-scale POMDPs with latent states and observations.
method Conditional Hilbert space embeddings, linear optimal -function, deterministic latent transitions, gap assumption.
result Computationally and statistically efficient algorithm for exact optimal policy.
A major difficulty of solving continuous POMDPs is to infer the multi-modal distribution of the unobserved true states and to make the planning algorithm dependent on the perceived uncertainty. We cast POMDP filtering and planning problems as two closely related Sequential Monte Carlo (SMC) processes, one over the real…
FORBES learns flexible belief states for POMDPs using normalizing flows.
problem Accurately modeling belief states in POMDPs for high-dimensional, continuous spaces.
method Integrates normalizing flows into variational inference for continuous belief state learning.
result FORBES learns flexible belief states that enable multi-modal predictions and high-quality reconstructions.
Partially observable Markov decision processes (POMDPs) are a powerful abstraction for tasks that require decision making under uncertainty, and capture a wide range of real world tasks. Today, effective planning approaches exist that generate effective strategies given black-box models of a POMDP task. Yet, an open qu…
Expectation maximization (EM) has recently been shown to be an efficient algorithm for learning finite-state controllers (FSCs) in large decentralized POMDPs (Dec-POMDPs). However, current methods use fixed-size FSCs and often converge to maxima that are far from optimal. This paper considers a variable-size FSC to rep…
This paper establishes strong lower bounds for learning in revealing POMDPs.
problem Understanding the fundamental limits of reinforcement learning in revealing partially observable Markov Decision Processes (POMDPs).
method Develops strong PAC and regret lower bounds for learning in revealing POMDPs using multi-step revealing POMDPs as a case study.
result Strong polynomial lower bounds for learning in revealing POMDPs, achieving significantly smaller gaps against current upper bounds.
We consider the problem of imitation learning from expert demonstrations in partially observable Markov decision processes (POMDPs). Belief representations, which characterize the distribution over the latent states in a POMDP, have been modeled using recurrent neural networks and probabilistic latent variable models, …
We solve a broad class of sequential decision-making problems with partially observed states.
problem Sequential decision-making under uncertainty with partially observed states.
method Modeling as a partially observed Markov decision process (POMDP) and separating state and modulation process.
result The approach allows for specialized approximate solution procedures.
Study on natural actor-critic for POMDPs with finite memory.
problem Learning in partially observed Markov decision processes with noisy observations.
method Finite actor-critic method with multi-step temporal difference learning.
result First non-asymptotic global convergence for POMDPs with function approximation.
The paper develops methods to estimate POMDPs from partial information.
problem Making decisions under partial information about state variables.
method Structural estimation of POMDP primitives using observable history.
result Conditions for model identifiability without state dynamics knowledge.
RL struggles with generalization due to implicit partial observability.
problem Generalization in RL is difficult due to implicit partial observability.
method Re-cast RL problem as solving epistemic POMDPs and propose ensemble-based techniques.
result Simple ensemble-based technique achieves significant generalization gains.
Hidden Markov Model Estimation-Based Q-learning for Partially Observable Markov Decision Processcs.LG
The objective is to study an on-line Hidden Markov model (HMM) estimation-based Q-learning algorithm for partially observable Markov decision process (POMDP) on finite state and action sets. When the full state observation is available, Q-learning finds the optimal action-value function given the current action (Q func…
Embed to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiencycs.LG
ETC learns minimal representations for reinforcement learning in POMDPs.
problem Sample complexity challenges in reinforcement learning for POMDPs.
method ETC learns low-dimensional features and embeddings at two levels, optimizing policy.
result ETC achieves polynomial sample complexity for POMDPs with low-rank transition kernels.
We consider the estimation of the policy gradient in partially observable Markov decision processes (POMDP) with a special class of structured policies that are finite-state controllers. We show that the gradient estimation can be done in the Actor-Critic framework, by making the critic compute a "value" function that …
In Passive POMDPs actions do not affect the world state, but still incur costs. When the agent is bounded by information-processing constraints, it can only keep an approximation of the belief. We present a variational principle for the problem of maintaining the information which is most useful for minimizing the cost…
Paper introduces a new framework to improve sample efficiency in POMDPs learning.
problem Challenges in off-policy evaluation for POMDPs, especially with hidden states.
method Exploits the metric structure of belief space to relax coverage assumptions.
result Unified analysis technique yields tighter error bounds and sample efficiency improvements.
RL approach for target tracking with unknown dynamics and sensor control.
problem Tracking an unknown target with sensor control.
method Track-MDP formulation for RL, compared with POMDP.
result Optimal RL policy tracks all target paths with certainty.
Bayesian reinforcement learning (BRL) encodes prior knowledge of the world in a model and represents uncertainty in model parameters by maintaining a probability distribution over them. This paper presents Monte Carlo BRL (MC-BRL), a simple and general approach to BRL. MC-BRL samples a priori a finite set of hypotheses…
Paper solves POMDPs in continuous time and discrete spaces.
problem Optimal decision making in discrete state and action space systems under partial observability.
method Combining optimal filtering theory and deep learning to solve a Hamilton-Jacobi-Bellman equation.
result Derives a mathematical description and solution approach for continuous-time POMDPs.
This paper advances sample-efficient learning for partially observable RL by introducing B-stability and new algorithms.
problem Hard sample complexity for learning near-optimal policies in partially observable RL.
method Proposes B-stability as a unified structural condition and develops new algorithms for sample-efficient learning.
result Any B-stable PSR can be learned with polynomial samples, improving over current best complexities.
In real-world scenarios, the observation data for reinforcement learning with continuous control is commonly noisy and part of it may be dynamically missing over time, which violates the assumption of many current methods developed for this. We addressed the issue within the framework of partially observable Markov Dec…
Improved POMDP regret to sqrt(T) with known observation model.
problem Average-reward POMDPs with unknown transition model but known observation model.
method Optimistic algorithm using deterministic policies and novel estimation techniques.
result First approach with regret guarantee of sqrt(T) against optimal policy.
Unified framework for efficient RL in MDP, POMDP, and PSR.
problem Sample efficient reinforcement learning under various decision-making frameworks.
method Proposed GEC complexity measure and a posterior sampling algorithm.
result Sample efficient learning achieved with sublinear regret bound in terms of GEC.
Describes state variables in sequential decision problems, linking them to Markovian and non-Markovian models.
problem Sequential decision problems, especially in active learning and POMDPs, where decisions affect what is observed and learned.
method Canonical framework and novel two-agent perspective of POMDPs, defining state variables to claim Markovian or non-Markovian models.
result Properly modeled sequential decision problems are Markovian, while real decision problems are often non-Markovian.
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 …
A nonparametric approach for policy learning for POMDPs is proposed. The approach represents distributions over the states, observations, and actions as embeddings in feature spaces, which are reproducing kernel Hilbert spaces. Distributions over states given the observations are obtained by applying the kernel Bayes' …
Efficient integration of uncertain observations with decision-making optimization is key for prescribing informed intervention actions, able to preserve structural safety of deteriorating engineering systems. To this end, it is necessary that scheduling of inspection and monitoring strategies be objectively performed o…
We characterize value functions in partially observable MDPs as semi-algebraic sets.
problem Understanding feasible value functions in partially observable Markov decision processes.
method Characterization of feasible value functions as semi-algebraic sets defined by polynomial inequalities.
result The feasible set of value functions in POMDPs is a semi-algebraic set, not a polytope as in MDPs.
Partially observable Markov decision processes (POMDPs) with continuous state and observation spaces have powerful flexibility for representing real-world decision and control problems but are notoriously difficult to solve. Recent online sampling-based algorithms that use observation likelihood weighting have shown un…