Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertainty

• URL: http://arxiv.org/abs/2105.05789v1
• Date: Wed, 12 May 2021 17:02:01 GMT
• Title: Probabilistic Loss and its Online Characterization for Simplified Decision Making Under Uncertainty
• Abstract summary: We extend the decision making mechanism to the whole by removing standard approximations and considering all previously suppressed sources of variability. We present novel bounds on the return and characterize online the effect of simplification using this framework on a particular simplification technique.
• Score: 13.807859854345834
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: It is a long-standing objective to ease the computation burden incurred by the decision making process. Identification of this mechanism's sensitivity to simplification has tremendous ramifications. Yet, algorithms for decision making under uncertainty usually lean on approximations or heuristics without quantifying their effect. Therefore, challenging scenarios could severely impair the performance of such methods. In this paper, we extend the decision making mechanism to the whole by removing standard approximations and considering all previously suppressed stochastic sources of variability. On top of this extension, our key contribution is a novel framework to simplify decision making while assessing and controlling online the simplification's impact. Furthermore, we present novel stochastic bounds on the return and characterize online the effect of simplification using this framework on a particular simplification technique - reducing the number of samples in belief representation for planning. Finally, we verify the advantages of our approach through extensive simulations.

Related papers

• Maturing Markov Decision Processes: Decision Making under Increasing Information and Shrinking Action Sets [10.02149184877298]
  Sequential decision problems often exhibit an asymmetric evolution of information and decision flexibility.<n>We introduce Maturing Markov Decision Processes (MMDPs), a formulation built around this information--action asymmetry.<n>We develop a structure-aware reinforcement learning framework with stage-aware policy design, expiring-action abstraction, and search-augmented learning with distillation.
  arXiv  Detail & Related papers  (2026-06-17T08:41:55Z)
• Non-Parametric Rehearsal Learning via Conditional Mean Embeddings [88.89267783967263]
  We propose a non-parametric rehearsal learning approach for textitavoiding undesired future (AUF) problems.<n>Specifically, we use kernel machinery to reformulate the AUF objective into a unified representation that disentangles desirability modeling from action-induced distributional changes.
  arXiv  Detail & Related papers  (2026-05-09T15:30:52Z)
• Foresighted Online Policy Optimization with Interference [7.075948680027319]
  We introduce the foresighted online policy with interference (FRONT), that innovatively considers the long-term impact of the current decision on subsequent decisions and rewards.<n>FRONT attains sublinear regret under two distinct definitions, capturing both the immediate and consequential impacts of decisions.<n>We show that FRONT attains sublinear regret through extensive simulations and a real-world application to urban hotel profits.
  arXiv  Detail & Related papers  (2025-10-17T03:32:06Z)
• On the System Theoretic Offline Learning of Continuous-Time LQR with Exogenous Disturbances [3.701656361145375]
  We analyze offline designs of linear quadratic regulator (LQR) strategies with uncertain disturbances.<n>Our approach builds on the fundamental learning-based framework of adaptive dynamic programming.
  arXiv  Detail & Related papers  (2025-09-20T17:14:27Z)
• Transfer Learning for Classification under Decision Rule Drift with Application to Optimal Individualized Treatment Rule Estimation [50.34670342434884]
  We propose a novel methodology for modeling posterior drift through Bayes decision rules.<n>Under mild regularity conditions, we establish the consistency of our estimators and derive the risk bounds.<n>We illustrate the broad applicability of our method by adapting it to the estimation of optimal individualized treatment rules.
  arXiv  Detail & Related papers  (2025-08-28T16:03:06Z)
• Statistical Proof of Execution (SPEX) [0.0]
  Real-world applications are increasingly incorporating automated decision-making, driven by the widespread adoption of ML/AI inference for planning and guidance. This study examines the growing need for verifiable computing in autonomous decision-making. We introduce a sampling-based protocol that is significantly faster, more cost-effective, and simpler than existing methods.
  arXiv  Detail & Related papers  (2025-03-24T17:13:25Z)
• Unifying Perplexing Behaviors in Modified BP Attributions through Alignment Perspective [61.5509267439999]
  We present a unified theoretical framework for methods like GBP, RectGrad, LRP, and DTD. We demonstrate that they achieve input alignment by combining the weights of activated neurons. This alignment improves the visualization quality and reduces sensitivity to weight randomization.
  arXiv  Detail & Related papers  (2025-03-14T07:58:26Z)
• Sample Complexity of Linear Quadratic Regulator Without Initial Stability [11.98212766542468]
  Inspired by REINFORCE, we introduce a novel receding-horizon algorithm for the Linear Quadratic Regulator (LQR) problem with unknown parameters. Unlike prior methods, our algorithm avoids reliance on two-point gradient estimates while maintaining the same order of sample complexity.
  arXiv  Detail & Related papers  (2025-02-20T02:44:25Z)
• Know Where You're Uncertain When Planning with Multimodal Foundation Models: A Formal Framework [54.40508478482667]
  We present a comprehensive framework to disentangle, quantify, and mitigate uncertainty in perception and plan generation. We propose methods tailored to the unique properties of perception and decision-making. We show that our uncertainty disentanglement framework reduces variability by up to 40% and enhances task success rates by 5% compared to baselines.
  arXiv  Detail & Related papers  (2024-11-03T17:32:00Z)
• Rethinking State Disentanglement in Causal Reinforcement Learning [78.12976579620165]
  Causality provides rigorous theoretical support for ensuring that the underlying states can be uniquely recovered through identifiability. We revisit this research line and find that incorporating RL-specific context can reduce unnecessary assumptions in previous identifiability analyses for latent states. We propose a novel approach for general partially observable Markov Decision Processes (POMDPs) by replacing the complicated structural constraints in previous methods with two simple constraints for transition and reward preservation.
  arXiv  Detail & Related papers  (2024-08-24T06:49:13Z)
• Disparate Impact on Group Accuracy of Linearization for Private Inference [48.27026603581436]
  We show that reducing the number of ReLU activations disproportionately decreases the accuracy for minority groups compared to majority groups. We also show how a simple procedure altering the fine-tuning step for linearized models can serve as an effective mitigation strategy.
  arXiv  Detail & Related papers  (2024-02-06T01:56:29Z)
• Decomposing Counterfactual Explanations for Consequential Decision Making [11.17545155325116]
  We develop a novel and practical recourse framework that bridges the gap between the IMF and the strong causal assumptions. texttt generates recourses by disentangling the latent representation of co-varying features. Our experiments on real-world data corroborate our theoretically motivated recourse model and highlight our framework's ability to provide reliable, low-cost recourse.
  arXiv  Detail & Related papers  (2022-11-03T21:26:55Z)
• Offline Policy Optimization with Eligible Actions [34.4530766779594]
  offline policy optimization could have a large impact on many real-world decision-making problems. Importance sampling and its variants are a commonly used type of estimator in offline policy evaluation. We propose an algorithm to avoid this overfitting through a new per-state-neighborhood normalization constraint.
  arXiv  Detail & Related papers  (2022-07-01T19:18:15Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)
• Error-based Knockoffs Inference for Controlled Feature Selection [49.99321384855201]
  We propose an error-based knockoff inference method by integrating the knockoff features, the error-based feature importance statistics, and the stepdown procedure together. The proposed inference procedure does not require specifying a regression model and can handle feature selection with theoretical guarantees.
  arXiv  Detail & Related papers  (2022-03-09T01:55:59Z)
• Provable Guarantees on the Robustness of Decision Rules to Causal Interventions [20.27500901133189]
  Robustness of decision rules to shifts in the data-generating process is crucial to the successful deployment of decision-making systems. We consider causal Bayesian networks and formally define the interventional robustness problem. We provide efficient algorithms for computing guaranteed upper and lower bounds on the interventional probabilities.
  arXiv  Detail & Related papers  (2021-05-19T13:09:47Z)
• Stein Variational Model Predictive Control [130.60527864489168]
  Decision making under uncertainty is critical to real-world, autonomous systems. Model Predictive Control (MPC) methods have demonstrated favorable performance in practice, but remain limited when dealing with complex distributions. We show that this framework leads to successful planning in challenging, non optimal control problems.
  arXiv  Detail & Related papers  (2020-11-15T22:36:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.