3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in decision-making-under-uncertainty
No benchmarks available.
Use these libraries to find decision-making-under-uncertainty models and implementations
Experiments comparing algorithm run times, and results comparing algorithm run times, are published.
Neur2SP is a new method that approximates the expected value function via a neural network to obtain a surrogate model that can be solved more efficiently than the traditional extensive formulation approach, and can be implemented using an off-the-shelf MIP solver.
This work aims for efficient deep BNNs amenable to complex computer vision architectures, and achieves this by leveraging variational autoencoders (VAEs) to learn the interaction and the latent distribution of the parameters at each network layer.
A class of probabilistic neural networks, dubbed natural-parameter networks (NPN), is proposed as a novel and lightweight Bayesian treatment of NN, which allows the usage of arbitrary exponential-family distributions to model the weights and neurons.
Emukit is a highly adaptable Python toolkit for enriching decision making under uncertainty that allows users to use state of the art methods including Bayesian optimization, multi-fidelity emulation, experimental design, Bayesian quadrature and sensitivity analysis.
This paper proposes a novel combination of CNNs with Gaussian processes that considerably outperforms previous approaches on this aspect, while achieving state-of-the-art performance on image classification tasks.
Using a factorization based framework for self-confidence assessment, one component of self- confidence, called `solver-quality', is discussed in the context of Markov decision processes for autonomous systems, and a method for assessing solver quality is derived, drawing inspiration from empirical hardness models.
This work introduces a complete probabilistic model of the Bitcoin Blockchain, setting the basis for follow-up AI applications on Bitcoin transactions and extends the model to include hidden entity attributes such as the functional category of the associated logical agent.
This work enables aProbLog—a probabilistic logical programming approach—to reason in presence of uncertain probabilities represented as Beta-distributed random variables, which achieves the same performance of state-of-the-art algorithms for highly specified and engineered domains, while simultaneously maintaining the flexibility offered by a ProbLog in handling complex relational domains.
Owing to the LDBA-guided exploration and LCRL model-free architecture, robust performance is observed, which also scales well when compared to standard RL approaches (whenever applicable to LTL specifications).
Adding a benchmark result helps the community track progress.