activity
20232026
most citedNo Compromise in Solution Quality: Speeding Up Belief-dependent Continuous POMDPs via Adaptive Multilevel Simplification

1 citations · 1 across the 17 of their papers we have counts for

collaborators
Showing 2026Show all

7 papers · 1 filter

math.AP2026

Classification of minimal-mass blowup solutions to the mass-critical Hartree equation at the -critical level

Zuyu Ma, Changxing Miao, Jiqiang Zheng

In this paper, we study the focusing mass-critical Hartree equation \[ iu_t+Δu=-\bigl(|x|^{-2}*|u|^2\bigr)u \] at the ground-state mass . We prove that, up to the symmetries…

cs.AI2026

Risk-Averse Online POMDP Planning via CVaR of the Immediate Cost with Performance Guarantees

Yaacov Pariente, Vadim Indelman

Online POMDP planners optimize the expected cumulative cost, which can mask dangerous states when the belief places significant mass on high-cost states. Existing risk-averse metho…

cs.AI2026

Graph Sparse Sampling: Breaking the Curse of the Horizon in Continuous MDP Planning

Idan Lev-Yehudi, Vadim Indelman

Planning under uncertainty in continuous domains is essential for autonomous systems, yet computationally demanding. Tree-based search methods such as Monte Carlo Tree Search (MCTS…

cs.AI2026

Finite-Time Analysis of MCTS in Continuous POMDP Planning

Da Kong, Vadim Indelman

This paper presents a finite-time analysis for Monte Carlo Tree Search (MCTS) in Partially Observable Markov Decision Processes (POMDPs), with probabilistic concentration bounds in…

cs.RO2026

Open-loop POMDP Simplification and Safe Skipping of Replanning with Formal Performance Guarantees

Da Kong, Vadim Indelman

Partially Observable Markov Decision Processes (POMDPs) provide a principled mathematical framework for decision-making under uncertainty. However, the exact solution to POMDPs is…

math.ST2026

Accelerated Online Risk-Averse Policy Evaluation in POMDPs with Theoretical Guarantees and Novel CVaR Bounds

Yaacov Pariente, Vadim Indelman

Risk-averse decision-making under uncertainty in partially observable domains is a central challenge in artificial intelligence and is essential for developing reliable autonomous…

cs.AI2026

Online Risk-Averse Planning in POMDPs Using Iterated CVaR Value Function

Yaacov Pariente, Vadim Indelman

We study risk-sensitive planning under partial observability using the dynamic risk measure Iterated Conditional Value-at-Risk (ICVaR). A policy evaluation algorithm for ICVaR is d…