Planning with Dynamically Estimated Action Costs
- URL: http://arxiv.org/abs/2206.04166v3
- Date: Wed, 19 Jul 2023 12:19:51 GMT
- Title: Planning with Dynamically Estimated Action Costs
- Authors: Eyal Weiss and Gal A. Kaminka
- Abstract summary: Information about action costs is critical for real-world AI planning applications.
Recent approaches use black-box external action cost estimators, often learned from data, that are applied during the planning phase.
We suggest a generalization of deterministic planning with action costs that allows selecting between multiple estimators for action cost.
- Score: 2.8326418377665346
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Information about action costs is critical for real-world AI planning
applications. Rather than rely solely on declarative action models, recent
approaches also use black-box external action cost estimators, often learned
from data, that are applied during the planning phase. These, however, can be
computationally expensive, and produce uncertain values. In this paper we
suggest a generalization of deterministic planning with action costs that
allows selecting between multiple estimators for action cost, to balance
computation time against bounded estimation uncertainty. This enables a much
richer -- and correspondingly more realistic -- problem representation.
Importantly, it allows planners to bound plan accuracy, thereby increasing
reliability, while reducing unnecessary computational burden, which is critical
for scaling to large problems. We introduce a search algorithm, generalizing
$A^*$, that solves such planning problems, and additional algorithmic
extensions. In addition to theoretical guarantees, extensive experiments show
considerable savings in runtime compared to alternatives.
Related papers
- MEXGEN: An Effective and Efficient Information Gain Approximation for Information Gathering Path Planning [3.195234044113248]
Planning algorithms for autonomous robots need to solve sequential decision making problems under uncertainty.
We develop a computationally efficient and effective approximation for the difficult problem of predicting the likely sensor measurements from uncertain belief states.
We demonstrate improved performance gains in radio-source tracking and localization problems using extensive simulated and field experiments with a multirotor aerial robot.
arXiv Detail & Related papers (2024-05-04T08:09:16Z) - EERO: Early Exit with Reject Option for Efficient Classification with
limited budget [0.0]
We propose EERO, a new methodology to translate the problem of early exiting to a problem of using multiple classifiers with reject option.
We calibrate the probabilities of exiting at the different heads using aggregation with exponential weights to guarantee a fixed budget.
Experimental results, conducted using a ResNet-18 model and a ConvNext architecture on Cifar and ImageNet datasets, demonstrate that our method not only effectively manages budget allocation but also enhances accuracy in overthinking scenarios.
arXiv Detail & Related papers (2024-02-06T07:50:27Z) - Triple Simplex Matrix Completion for Expense Forecasting [11.52704888524571]
This paper proposes a constrained non-negative matrix completion model that predicts expenses by learning the likelihood of the project correlating with certain expense patterns in the latent space.
Results from two real datasets demonstrate the effectiveness of the proposed method in comparison to state-of-the-art algorithms.
arXiv Detail & Related papers (2023-10-23T18:25:33Z) - Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision
Processes [80.89852729380425]
We propose the first computationally efficient algorithm that achieves the nearly minimax optimal regret $tilde O(dsqrtH3K)$.
Our work provides a complete answer to optimal RL with linear MDPs, and the developed algorithm and theoretical tools may be of independent interest.
arXiv Detail & Related papers (2022-12-12T18:58:59Z) - Quantization for decentralized learning under subspace constraints [61.59416703323886]
We consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints.
We propose and study an adaptive decentralized strategy where the agents employ differential randomized quantizers to compress their estimates.
The analysis shows that, under some general conditions on the quantization noise, the strategy is stable both in terms of mean-square error and average bit rate.
arXiv Detail & Related papers (2022-09-16T09:38:38Z) - How Much More Data Do I Need? Estimating Requirements for Downstream
Tasks [99.44608160188905]
Given a small training data set and a learning algorithm, how much more data is necessary to reach a target validation or test performance?
Overestimating or underestimating data requirements incurs substantial costs that could be avoided with an adequate budget.
Using our guidelines, practitioners can accurately estimate data requirements of machine learning systems to gain savings in both development time and data acquisition costs.
arXiv Detail & Related papers (2022-07-04T21:16:05Z) - Neural Optimal Transport with General Cost Functionals [66.41953045707172]
We introduce a novel neural network-based algorithm to compute optimal transport plans for general cost functionals.
As an application, we construct a cost functional to map data distributions while preserving the class-wise structure.
arXiv Detail & Related papers (2022-05-30T20:00:19Z) - Adaptive Information Belief Space Planning [9.365993173260316]
We focus on making informed decisions efficiently, using reward functions that explicitly deal with uncertainty.
We derive bounds on the expected information-theoretic reward function and, as a consequence, on the value function.
We then propose a method to refine aggregation to achieve identical action selection with a fraction of the computational time.
arXiv Detail & Related papers (2022-01-14T21:12:00Z) - Uncertainty-aware Remaining Useful Life predictor [57.74855412811814]
Remaining Useful Life (RUL) estimation is the problem of inferring how long a certain industrial asset can be expected to operate.
In this work, we consider Deep Gaussian Processes (DGPs) as possible solutions to the aforementioned limitations.
The performance of the algorithms is evaluated on the N-CMAPSS dataset from NASA for aircraft engines.
arXiv Detail & Related papers (2021-04-08T08:50:44Z) - Present-Biased Optimization [8.775878711928591]
The paper extends the framework proposed by Akerlof (1991) for studying various aspects of human behavior related to time-inconsistent planning.
We show that the ratio between the cost of the solutions computed by present-biased agents and the cost of the optimal solutions may differ significantly depending on the problem constraints.
arXiv Detail & Related papers (2020-12-29T12:40:59Z) - Combining Deep Learning and Optimization for Security-Constrained
Optimal Power Flow [94.24763814458686]
Security-constrained optimal power flow (SCOPF) is fundamental in power systems.
Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs.
This paper proposes a novel approach that combines deep learning and robust optimization techniques.
arXiv Detail & Related papers (2020-07-14T12:38:21Z)
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.