Framework adds human knowledge to AI decisions to improve outcomes.
problem Conflict between AI recommendations and human insights.
method Develops a framework for integrating human knowledge as a guardrail for AI decisions.
result Human knowledge can improve AI decisions, especially in specific pitfalls.
An online decision-making algorithm using stochastic gradient descent for big data.
problem Efficiently updating decision rules in online decision making with big data.
method Stochastic gradient descent for online updates, asymptotic normality of estimators.
result Asymptotic normality of parameter and value estimators, enabling statistical inference.
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.
A new fairness metric for decision-making algorithms, conditioning on known fair variables.
problem Fairness issues in decision-making systems.
method Conditional fairness metric, Derivable Conditional Fairness Regularizer (DCFR), adversarial representation.
result Traditional fairness notations are special cases of the new conditional fairness notation.
Combines offline causal inference and online bandit learning for better decision-making.
problem Making adaptive decisions using both logged and streaming data to avoid user harm.
method Unified offline causal inference and online learning algorithms, deriving bounds on decision accuracy.
result First upper regret bound for forest-based online bandit algorithms.
Machine learning based decision making systems are increasingly affecting humans. An individual can suffer an undesirable outcome under such decision making systems (e.g. denied credit) irrespective of whether the decision is fair or accurate. Individual recourse pertains to the problem of providing an actionable set o…
Develops methods for finding counterfactual explanations in sequential decision making.
problem Finding counterfactual explanations for sequential decision making processes.
method Formal characterization of sequential actions and states using Markov decision processes and Gumbel-Max structural causal model. Introduces a polynomial time algorithm based on dynamic programming.
result Algorithm finds optimal counterfactual explanations for sequential decision making.
LinearAPT optimizes decision-making under resource constraints for a linear threshold problem.
problem Optimizing sequential decisions with a linear threshold under resource limitations.
method LinearAPT, an adaptive algorithm for fixed-budget TLB problem.
result LinearAPT achieves theoretical upper bounds and robust performance on various datasets.
Improved model-free reinforcement learning with decision-estimation coefficient.
problem Interactive decision making, including structured bandits and reinforcement learning.
method Combining Estimation-to-Decisions with optimistic estimation to achieve better regret bounds.
result Regret bounds for model-free reinforcement learning with value function approximation.
Machine learning algorithms are now frequently used in sensitive contexts that substantially affect the course of human lives, such as credit lending or criminal justice. This is driven by the idea that `objective' machines base their decisions solely on facts and remain unaffected by human cognitive biases, discrimina…
The study assesses the relative value of prediction in algorithmic decision making.
problem Improving welfare through better predictions versus other policy levers.
method Theoretical analysis of statistical models.
result Simple conditions determining the relative value of prediction.
The paper explores how different loss functions impact reinforcement learning algorithms.
problem Improving reinforcement learning algorithms by optimizing loss functions.
method Comprehensive survey on loss functions in reinforcement learning, proving the benefits of specific loss functions.
result Binary cross-entropy loss leads to first-order bounds and is more efficient than squared loss.
This review analyzes RL in finance, highlighting its advantages and challenges.
problem Complex financial decision-making problems where traditional methods fail.
method Systematic review of 167 articles from 2017-2025, focusing on market making, portfolio optimization, and algorithmic trading.
result RL offers advantages over traditional methods, particularly in market making, but challenges remain.
We study the explore-exploit tradeoff in distributed cooperative decision-making using the context of the multiarmed bandit (MAB) problem. For the distributed cooperative MAB problem, we design the cooperative UCB algorithm that comprises two interleaved distributed processes: (i) running consensus algorithms for estim…
Introduces principal fairness for fair decision-making.
problem Discrimination among similarly affected individuals.
method Uses principal stratification from causal inference.
result Explicitly accounts for decision impacts, not just protected attributes.
New complexity measure for interactive learning reduces regret to near-optimal levels.
problem Challenges in sample-efficient, adaptive learning algorithms for interactive decision making.
method Introduces the Decision-Estimation Coefficient and the Estimation-to-Decisions (E2D) principle.
result Unified algorithm design principle E2D achieves optimal sample-efficient learning.
New algorithm tracks COVID-19 outbreak phases.
problem Decision-making in pandemic data.
method Developed a new algorithm (BLLR) based on decision theory.
result Demonstrated ability to track different phases of the COVID-19 outbreak.
New method estimates stochastic intervention effects in decision-making domains.
problem Current causal inference methods are limited to deterministic treatment, unable to handle stochastic policies.
method Developed a new stochastic propensity score and stochastic intervention effect estimator (SIE) with a customized genetic algorithm (Ge-SIO).
result Empirical study shows significant performance improvement over state-of-the-art baselines.
We summarize the potential impact that the European Union's new General Data Protection Regulation will have on the routine use of machine learning algorithms. Slated to take effect as law across the EU in 2018, it will restrict automated individual decision-making (that is, algorithms that make decisions based on user…
Post-processing predictors reduces calibration errors for decision-making.
problem Predictors with low calibration error for machine learning may have high error for decision-making.
method Post-processing with ε distance to calibration adds noise to make predictions differentially private.
result Post-processing achieves O(√ε) ECE and CDL, asymptotically optimal.
Novel algorithm reduces feature inclusion in online decision-making.
problem Optimizing decision-making for personalized user experiences with fairness.
method Online Batched Sequential Inclusion (OBSI) algorithm for sequential feature inclusion.
result OBSI outperforms other algorithms in terms of regret, relevance of features, and compute.
IDS algorithm optimizes sequential decisions in various monitoring settings.
problem Optimizing sequential decisions in complex monitoring scenarios.
method Information-directed sampling (IDS) algorithm for linear partial monitoring.
result IDS achieves nearly worst-case rate optimality in finite-action games.
Algorithm reduces decision-making errors in multi-agent bandit problems.
problem Minimizing decision errors in multi-agent multi-armed bandit problems.
method RBO-Coop-UCB algorithm with Bayesian change point detection.
result Expected group regret is upper bounded by O ( K N M log T + K M T log T ) \mathcal{O}(KNM\log T + K\sqrt{MT\log T}) O ( K N M log T + K M T log T ) . The paper addresses private and Byzantine-proof cooperative decision-making in multi-agent systems.
problem Designing algorithms for multi-agent decision-making that are private and resilient to faulty agents.
method Upper-confidence bound algorithms for stochastic bandit problems under privacy and Byzantine conditions.
result Optimal regret achieved in both private and Byzantine-tolerant settings.
New algorithm reduces online decision-making regret with efficient LP re-solving and parallel first-order method.
problem Worse regret guarantees and high computational cost of LP-based OLP algorithms.
method Combines LP-based and first-order OLP methods, re-solving LP subproblems periodically and using parallel first-order method.
result Achieves O ( log ( T / f ) + f ) \mathscr{O}(\log (T/f) + \sqrt{f}) O ( log ( T / f ) + f ) regret, balancing computational efficiency and superior regret guarantee. In most real-world settings such as recommender systems, finance, and healthcare, collecting useful information is costly and requires an active choice on the part of the decision maker. The decision-maker needs to learn simultaneously what observations to make and what actions to take. This paper incorporates the info…
New research shows machine-assisted decisions can still be unfair even when the algorithm is fair.
problem Ensuring fairness in decisions made with machine-assisted human input.
method Formal model and lab experiment to analyze how machine predictions affect human decisions.
result Excluding information about protected groups from machine predictions can increase disparities.
New algorithm improves knowledge transfer in dynamic decision-making.
problem Utilizing data from existing ventures to improve decision-making in new ventures.
method Proposes Transferred Fitted Q Q Q -Iteration algorithm for estimating optimal action-state function Q ∗ Q^* Q ∗ . result Significantly improved final learning error of Q ∗ Q^* Q ∗ function. As algorithms are increasingly used to make important decisions that affect human lives, ranging from social benefit assignment to predicting risk of criminal recidivism, concerns have been raised about the fairness of algorithmic decision making. Most prior works on algorithmic fairness normatively prescribe how fair …
Bayesian decision theory outlines a rigorous framework for making optimal decisions based on maximizing expected utility over a model posterior. However, practitioners often do not have access to the full posterior and resort to approximate inference strategies. In such cases, taking the eventual decision-making task i…
Paper addresses regret minimization and inference in high-dimensional online decision-making.
problem Regret minimization and statistical inference in high-dimensional online decision-making.
method Integrates ε-greedy bandit algorithm with hard thresholding for sparse bandit parameters and debiasing method for inference.
result Achieves either O ( T 1 / 2 ) O(T^{1/2}) O ( T 1/2 ) regret or O ( T 1 / 2 ) O(T^{1/2}) O ( T 1/2 ) -consistent inference, with trade-off between exploration and exploitation. It has recently been shown that if feedback effects of decisions are ignored, then imposing fairness constraints such as demographic parity or equality of opportunity can actually exacerbate unfairness. We propose to address this challenge by modeling feedback effects as Markov decision processes (MDPs). First, we prop…
Improving cancer treatment decisions requires considering causal effects, not just model accuracy.
problem Cancer outcome prediction models may cause harm when used for treatment decisions.
method Explains the importance of considering causal effects in model validation and provides guidelines.
result Building and validating models that are useful for decision making requires considering causal effects.
The paper tackles decision making problems with funnel structure in email marketing campaigns.
problem Decision making challenges in systems with funnel structure, where fewer observations are received from deeper layers.
method Formulated as a contextual bandit with funnel structure and developed a multi-task learning algorithm.
result Our algorithms offer significant improvement over previous methods in email marketing campaigns.
A new algorithm reduces communication costs for collaborative decision-making across clients.
problem Collaborative decision-making with sparse rewards and heterogeneous contexts.
method Federated Lasso algorithm for sparse linear contextual bandits.
result Achieves near-optimal regret with logarithmic communication costs.
This work surveys algorithmic recourse, aiming to clarify definitions and solutions.
problem Providing explanations and recommendations to individuals affected by automated decisions.
method Literature review and unified definitions, formulations, and solutions.
result Unified definitions and solutions for algorithmic recourse.
New algorithms for batch decision-making with high-dimensional user data.
problem Maximizing treatment efficacy in groups of users.
method Teamwork LASSO Bandit algorithm, switching between teamwork and selfish stages.
result Upper bound on expected cumulative regret for the proposed algorithm.
Societies often rely on human experts to take a wide variety of decisions affecting their members, from jail-or-release decisions taken by judges and stop-and-frisk decisions taken by police officers to accept-or-reject decisions taken by academics. In this context, each decision is taken by an expert who is typically …
The paper introduces a new algorithm for fair decision-making in outcome control tasks.
problem Fair and equitable automated decision-making in outcome control tasks.
method Causal analysis and optimization to ensure fairness in decision-making.
result Developed an algorithm for maximizing Y Y Y while ensuring causal fairness. OMLE combines optimism and MLE for efficient sequential decision making.
problem Efficiently solving sequential decision making problems, especially in partially observable settings.
method Combines optimism for exploration and maximum likelihood estimation for model learning.
result OMLE learns near-optimal policies for a wide range of sequential decision making problems.
Unified framework for constrained online decision-making.
problem Sequential decisions under stage-wise feasibility constraints.
method Upper counterfactual confidence bounds and generalized eluder dimension.
result Principled foundation for constrained sequential decision-making.
Survey of RL in finance, tackling complex decision-making.
problem Complex financial decision-making problems with limited model assumptions.
method Value and policy-based RL algorithms, neural networks, deep RL.
result Improved financial decision-making with less model assumptions.
New method learns decisions from collective preferences without individual covariates.
problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.
Study on multi-agent decision making complexity, showing sample efficiency gaps.
problem Understanding sample efficiency in multi-agent decision making.
method General framework for interactive decision making, focusing on equilibrium computation.
result No 'reasonable' complexity measure can close gaps between single and multiple agents.
Unified framework for lower bounds in interactive decision making.
problem Challenges in interactive decision making, especially bandits and reinforcement learning.
method Interactive Fano method and Fractional Covering Number.
result Unified characterization of learnability for stochastic bandit problems and tight lower bounds for interactive decision making.
New approach calibrates predictions for better decision-making.
problem Achieving reliable predictions for multi-class problems is hard.
method Introduces decision calibration, a new approach to calibrate predictions.
result Designs a recalibration algorithm that makes predictions reliable for decision-making.
We present a formal model of human decision-making in explore-exploit tasks using the context of multi-armed bandit problems, where the decision-maker must choose among multiple options with uncertain rewards. We address the standard multi-armed bandit problem, the multi-armed bandit problem with transition costs, and …
Paper offers a fast convergence theory for offline decision making.
problem Offline decision making problems, including reinforcement learning and off-policy evaluation.
method Introduces a framework (DMOF) and algorithm (EDD) with a fast convergence guarantee.
result Demonstrates a fast convergence guarantee with a lower bound complement.