Decision Machines embeds decision trees into vector spaces for improved optimization.
problem Overfitting and difficulty in finding optimal decision tree structure.
method Embedding Boolean tests into a binary vector space and representing tree structure as matrices.
result Optimized decision trees with enhanced predictive power.
Graph-based NAS improves sample efficiency in architecture design.
problem Current NAS search spaces are static sequences, limiting expressiveness.
method Proposed graph-based search space with vertices and edges for iterative and branching decisions.
result Graph representation improves sample efficiency in architecture design.
New algorithms learn in complex decision-making problems with smooth transitions.
problem Learning in complex decision-making problems with smooth transitions.
method UCB and PSRL philosophies applied to episodic Markov decision processes with kernel approximation.
result Low regret learning achieved in continuous state and action spaces.
Invertible networks help explain decisions and identify important features.
problem Interpreting and explaining the decisions of black-box neural networks.
method Two-stage approach: invertible transformation to feature space and linear classifier. Determining decision boundaries and feature importance using local linear models.
result Ability to explain decisions and identify important features in neural networks.
Convex polytope trees expand decision trees with interpretable boundaries.
problem High accuracy often requires many nodes in decision trees, reducing interpretability.
method CPT uses logical disjunction of weighted linear decision-makers, geometrically a convex polytope.
result CPT achieves high accuracy with fewer nodes compared to existing methods.
The paper explores the complexities of algorithmic fairness and the assumptions needed for different fairness mechanisms.
problem The lack of a unified understanding of algorithmic fairness across different papers.
method Introducing a mathematical framework that includes the observed space, decision space, and construct space to analyze fairness mechanisms.
result Different fairness mechanisms require different assumptions about the relationship between unobservable variables (construct space) and observable variables (observed space).
This paper optimizes slate decision systems for large action spaces.
problem Optimizing large-scale decision systems with arbitrary reward functions.
method A policy optimization framework with a novel relaxation of decision functions.
result Demonstrates the effectiveness of the proposed method on large action spaces.
New method improves neural network robustness without adversarial training.
problem Adversarial robustness of neural networks under flat loss surface.
method Visualizing decision surfaces in input space to assess robustness.
result Decision surface geometry in input space correlates with adversarial robustness.
Adversarial attacks on probabilistic state-space models affect latent state and policy decisions.
problem Robust reinforcement learning under adversarial observability.
method Analyzing adversarial attacks on linear probabilistic state-space models.
result Demonstrating the influence of adversarial observations on latent state and policy decisions.
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.
InfoBot learns decision states from prior experience to guide exploration.
problem Discovering effective policies in sparse reward environments.
method InfoBot uses an information bottleneck to learn decision states from prior experience.
result InfoBot effectively identifies decision states, even in partially observed settings.
Improves decision tree methods for high-dimensional, sparse input spaces.
problem Scalable supervised learning for high-dimensional, sparse inputs and large datasets.
method Random Forest and Gradient Boosting with random projections and sparsity.
result Improved accuracy and efficiency in multi-label and multi-output learning.
New method optimizes individualized decision rules for precision medicine.
problem Heterogeneous patient responses to treatments.
method Proposes a decision-rule based optimized covariates dependent equivalent (CDE) for individualized decision making.
result Numerical experiments show improved performance in estimating optimal IDRs.
Introduces DF framework for sampling decisions from target distributions.
problem Sampling from target distributions with additional guidance.
method DF framework based on MDP and Path Integral Diffusion.
result DF enhances guided sampling across various applications.
Paper proposes a new classifier for hyperbolic spaces using horospherical boundaries.
problem Optimization of large margin classifiers in hyperbolic spaces.
method Horospherical decision boundaries for geodesically convex optimization.
result Geodesically convex optimization leads to globally optimal solutions.
New algorithms achieve decision calibration without sample complexity dependent on feature dimension.
problem Achieving decision calibration for nonlinear loss functions with polynomial sample complexity.
method Developed smooth relaxation of decision calibration, enabling dimension-free algorithms.
result Efficient algorithms post-process predictors to satisfy decision calibration without worsening accuracy.
Random Forest proximity distances reveal feature contributions in black-box models.
problem Understanding feature contributions in complex, opaque machine learning models.
method Observing changes in input affecting proximity distances and instance movement in decision space.
result Each feature's independent contribution to model decisions can be calculated and analyzed.
Unified framework models neural decision-making, improving accuracy.
problem Limitations in modeling neural activity during decision-making.
method Unifying framework based on state-space models with scalable inference.
result Two-dimensional accumulator better captures neural responses.
New method minimizes decision errors in large treatment spaces.
problem Improving decision-making in large treatment spaces with biased observational data.
method Loss minimizes classification error of actions in large action space.
result Proves improved decision-making performance in large combinatorial action spaces.
Efficient Bayesian decision-making with intractable likelihoods.
problem Bayesian decision-making under intractable likelihoods.
method Learning surrogate models and using simulation-based inference and Bayesian optimization.
result Optimal actions can be learned with fewer simulations than posterior inference.
The paper tackles finding optimal treatment sequences in continuous state spaces.
problem Finding counterfactually optimal action sequences in continuous state spaces.
method Formalizes the problem using finite horizon Markov decision processes and structural causal models. Develops a search method based on the A* algorithm.
result The method can find optimal action sequences in polynomial time under certain conditions.
Paper introduces CageBO for optimizing complex public policy problems.
problem Complex decision-making and implicit constraints in public policy.
method CageBO framework using conditional variational autoencoder.
result CageBO outperforms baselines in optimizing large-scale police redistricting.
Automates cost-effective treatment recommendations using decision lists.
problem Making cost-effective treatment decisions for patients.
method Formulated as a Markov Decision Process (MDP) and used UCT strategy for decision list construction.
result Demonstrated effectiveness on real-world data for bail decisions and asthma treatment.
Quantum mechanics models economic decisions under uncertainty.
problem Uncertainty in human decision-making, especially in risky situations.
method Applied quantum mechanics to model human decision-making.
result Quantum probability provides a better fit for experimental data.
Gradient methods solve Stackelberg games in high-dimensional, continuous decision spaces.
problem Solving Stackelberg games with continuous, high-dimensional decisions.
method Gradient methods for searching numerical solutions.
result Time and space scalability of gradient methods discussed.
Extends reinforcement learning to continuous state spaces with safety constraints.
problem Safety-critical reinforcement learning in continuous state spaces with unknown dynamics.
method Introduces a novel Budgeted Bellman Optimality operator and applies it to continuous state spaces.
result Validated on spoken dialogue and autonomous driving applications.
Stochastic domains often involve risk-averse decision makers. While recent work has focused on how to model risk in Markov decision processes using risk measures, it has not addressed the problem of solving large risk-averse formulations. In this paper, we propose and analyze a new method for solving large risk-averse …
A principle for specialized decision-making divides complex problems into manageable parts.
problem Complex decision-making problems beyond individual capabilities.
method An on-line learning rule that learns a partitioning of the problem space for specialized linear policies.
result The approach solves problems that exceed individual decision-makers' capabilities.
This paper solves the open problem of computing Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.
problem Computing the Bayes optimal prediction for decision trees is infeasible due to an infeasible summation over all division patterns of a feature space.
method Solved the open problem using a Markov chain Monte Carlo method with adaptively tuned step size.
result Computed the Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.
A new Bayesian Decision Tree algorithm for regression and classification.
problem Costly construction of Bayesian Decision Trees.
method General Bayesian Decision Tree algorithm without Markov Chain Monte Carlo or pruning.
result Greedy-modal tree explains most of the information in numerical examples.
New algorithm finds optimal decision trees for binary variables.
problem Greedy decision tree algorithms often produce suboptimal models.
method Analytical bounds and modern systems techniques co-designed for efficient search space reduction.
result First practical algorithm for optimal decision trees for binary variables.
Deep learning models generalize by extending decision boundaries outside the convex hull of training data.
problem Understanding how deep learning models generalize beyond their training data.
method Investigation of decision boundaries inside and outside the convex hull of training sets, using various neural network architectures and training regimes.
result Over-parameterization is necessary for deep learning models to extend decision boundaries outside the convex hull of their training data.
Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using…
Decision forests learn to model text by evaluating categorical-set conditions.
problem Decision forests cannot directly model text features.
method Defined and learned conditions for categorical-set features, enabling efficient text modeling.
result Decision forests can now directly model text features.
This paper simplifies OPE in large state spaces using state abstractions.
problem Accurately evaluating policies offline in large state spaces.
method Developed a backward-model-irrelevance condition and an iterative state abstraction procedure.
result Deeply-abstracted states substantially simplify OPE sample complexity.
Characterizes preferences for decision-making under uncertainty using a leader-follower game model.
problem Decision-making under uncertainty and ambiguity aversion.
method Characterizes niveloidal preferences through a leader-follower game model, satisfying specific axioms.
result The leader's strategy space can serve as an ambiguity aversion index.
Automates treatment recommendation decisions by learning cost-effective and interpretable rules.
problem Making optimal treatment decisions for patients based on diagnostic test results.
method Formulated as a decision list problem, optimized using a Markov Decision Process and UCT strategy.
result Demonstrated effectiveness in real-world asthma patient data.
New algorithms for fast online decision making using neural networks and martingale posteriors.
problem Online sequential decision making under uncertainty.
method Martingale posterior neural networks for fast online learning and decision making.
result Achieves competitive performance-speed trade-offs in non-stationary contextual bandits and Bayesian optimization.
Optimizes decisions from observational data with a novel algorithm.
problem Optimizing uncertain objectives over continuous, multi-dimensional spaces with limited data.
method Proposes a novel algorithm that combines predictive machine learning with uncertainty information.
result Demonstrates superior performance compared to existing methods on various data sets.
Generative models help make decisions under changing data distributions.
problem Making decisions based on historical data when the actual data distribution changes.
method Flow- and score-based generative models to represent and transform distributions.
result Generative models can learn nominal uncertainty, create stressed distributions, and produce conditional distributions.
Bayes-CPACE optimally explores continuous BAMDPs.
problem Model uncertainty in continuous state and action spaces.
method Covering state-belief-action space with samples, exploiting Lipschitz continuity.
result Near-optimal value function computed efficiently.
We develop robust Markov Decision Processes with risk measures for uncertain environments.
problem Uncertainty in Markov Decision Processes and its impact on risk measures.
method Formulation as a Stackelberg game, robust cost and value iterations, existence of optimal policies.
result Existence of deterministic optimal policies for robust optimization and risk measures.
We enhance conformal prediction for risk-averse decisions with action-conditional guarantees.
problem Uncertainty quantification and safety guarantees for machine learning decisions.
method Action-conditional conformal prediction, pinball-loss minimization.
result Action-conditional prediction sets optimize risk-averse decision-making.
Enhanced ODT with Feature Concatenation boosts learning efficiency.
problem Insufficient learning efficiency of ODT due to linear projections not being transmitted to child nodes.
method Feature Concatenation ( exttt{FC-ODT}) to transmit linear projections along decision paths.
result Experiments show exttt{FC-ODT} outperforms state-of-the-art decision trees with a limited tree depth.
AI learns to design chemical processes efficiently.
problem Designing efficient chemical processes.
method Hierarchical reinforcement learning and graph neural networks.
result Quick learning in various decision spaces.
The paper improves decision tree stability for health care applications.
problem Stability of decision trees in health care applications.
method Introducing a new distance metric to determine tree stability and proposing a novel training methodology.
result On average, a 4.6% decrease in predictive power yields a 38% increase in model stability.
VIPER learns verifiable decision tree policies from deep reinforcement learning.
problem Ensuring safety of learned reinforcement learning policies.
method VIPER combines model compression and imitation learning to train decision tree policies.
result VIPER learns decision tree policies that are provably robust and stable.
Gaussian processes adapted for non-Euclidean spaces enhance decision-making.
problem Applying Gaussian processes in non-Euclidean spaces.
method Developed pathwise conditioning and Gaussian process models over non-Euclidean spaces.
result Efficient Gaussian process models for non-Euclidean spaces.