Proposes a method to learn from historical data for personalized decision-making.
problem Sample hunger in sequential decision-making algorithms for personalized medicine.
method Identifiable latent bandit framework using nonlinear independent component analysis.
result Optimal decision-making with shorter exploration time than classical bandits.
IRL models human risk decisions based on past outcomes.
problem Understanding human risk decisions under risk.
method Inverse Reinforcement Learning (IRL) with features reflecting state history.
result Human reward function explains risk-prone and risk-averse decisions.
Active learning improves decision-making from imbalanced observational data.
problem Reliability of prediction-based decisions in imbalanced observational data.
method Estimate Type S error rate to assess reliability, use active learning to collect new data.
result Active learning improves decision-making reliability in imbalanced data.
Proposes a new criterion for selecting Nash equilibria considering both utility and inequality.
problem Finding a fair Nash equilibrium in group decision-making.
method Introduces entropy-norm space for geometric selection of strict Nash equilibria.
result The closest entropy-norm pair to the largest entropy-norm pair in rescaled space is the most suitable equilibrium.
A new framework designs experiments for better decision-making.
problem Suboptimal experimental designs for downstream decision-making.
method Amortized decision-aware Bayesian Experimental Design (BED) with Transformer Neural Decision Process (TNDP).
result TNDP effectively designs experiments and facilitates accurate decision-making.
Personalized explanations improve understanding of machine learning models.
problem Improving human understanding of machine learning models and decisions.
method Deriving a conceptualization of personalized explanation, categorizing explainee data, identifying key properties, and introducing new measures.
result Identification of three key properties amendable to personalization: complexity, decision information, and presentation.
Efficient algorithm for learning from indirect feedback in complex decision-making scenarios.
problem Learning from indirect feedback in realistic scenarios with personalized mechanisms.
method IGW algorithm for policy optimization, extending reward-estimator construction from single-step to multi-step.
result Achieves sublinear regret guarantee for contextual episodic MDPs with personalized feedback.
Study uses FDA to analyze discount functions of different temperaments.
problem Traditional finance models fail to capture individual differences in investment choices.
method Functional Data Analysis (FDA) to investigate temporal discounting behaviors.
result Heterogeneity within each temperament revealed, suggesting diverse investor profiles.
The paper proposes a policy learning framework for interpretable personalization.
problem Effective personalization of goods and services to improve revenues and maintain competitive edge.
method Policy learning with linear decision boundaries using causal inference and Bayesian optimization.
result The learned policy improves net sales revenue by 88.2% and provides insights into important features.
Improves personalized treatment selection using covariates.
problem Ranking and selecting the best alternative based on covariates.
method Linear model for covariate effects, two-stage procedures for error types, generalized slippage configuration.
result Procedures provide statistical guarantees for correct selection.
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.
Bayesian Supervised Causal Clustering identifies patient subgroups for personalized decision-making.
problem Finding patient subgroups with similar characteristics for personalized decision-making.
method Bayesian Supervised Causal Clustering (BSCC) that identifies homogenous subgroups based on treatment effects.
result BSCC identifies subgroups with similar covariate profiles and treatment effects.
GEAR uses auxiliary data to estimate optimal decisions in studies with limited primary outcomes.
problem Estimating optimal decisions when primary outcomes are not available in experimental samples.
method GEAR uses augmented inverse propensity weighting to estimate optimal decisions based on auxiliary data.
result GEAR estimators and value estimators have established asymptotic properties and are validated in simulations and a real application.
Method constructs prediction intervals for time-varying individual treatment effects.
problem Accurately quantify uncertainty of individual treatment effects across multiple decision points.
method Conformal inference techniques for time-varying ITEs with weaker assumptions.
result Guaranteed lower bound for coverage dependent on data non-exchangeability.
AI enhances personalized drug development and decision-making in pharma.
problem Traditional drug development lacks personalized treatment plans.
method Application of AI in drug discovery, clinical trials, and post-marketing assessment.
result AI improves personalized medicine, optimizing health outcomes.
RLMM extends psychometric models to larger tasks.
problem Sequential process data from interactive assessments are not well handled by conventional models.
method RLMM decouples person-level choice sensitivity from task-level value representation through a shared parametric action-value function.
result RLMM achieves higher estimation accuracy and lower runtime than MDP-MM in peg-solitaire simulations and AQUALAB gameplay logs.
AI models assess psychological risks in currency trading.
problem Identifying psychological risks in currency traders.
method Developed a decision tree model to identify patterns in historical data.
result Enhanced decision-making through real-time alerts.
We introduce a class of financial contracts involving several parties by extending the notion of a two-person game option (see Kifer (2000)) to a contract in which an arbitrary number of parties is involved and each of them is allowed to make a wide array of decisions at any time, not restricted to simply `exercising t…
New algorithms protect user data while optimizing personalized decisions.
problem Personalized decision-making with private user data.
method Developed LDP algorithms for stochastic generalized linear bandits using SGD and OLS.
result Achieved the same regret bound as non-privacy settings with LDP.
Causal ML predicts treatment outcomes, aiding personalized medicine.
problem Predicting individualized treatment effects for personalized medicine.
method Flexible, data-driven methods using causal inference with clinical trial and real-world data.
result Causal ML allows for estimating individualized treatment effects.
New active learning strategy improves decision-making accuracy.
problem Maximizing decision-making accuracy in sequential data acquisition.
method Introduces a novel active learning criterion that maximizes expected information gain on the posterior decision distribution.
result Improved performance in decision-making accuracy compared to existing alternatives.
OTSS learns personalized decision weights from logged decisions and outputs.
problem Learning context-specific decision weights from logged decisions and outputs.
method Output-targeted soft-segmentation model that deploys personalized decision-ready weight vectors.
result OTSS achieves the lowest mean regret in benchmark settings.
Study assesses whether RL algorithm personalizes treatment sequences.
problem Evaluate if RL algorithm truly personalizes treatment sequences.
method Resampling-based methodology to investigate personalization.
result RL algorithm's personalization may be due to stochasticity.
Paper develops privacy-preserving dynamic pricing policy for e-commerce.
problem Protecting customer privacy in dynamic pricing with personalized information.
method Uses differential privacy framework to develop a privacy-preserving policy.
result Achieves both privacy and performance guarantees in dynamic pricing.
SPARKLE handles high-dimensional covariates for online decision-making.
problem Complex reward-covariate relationships in high-dimensional settings.
method SPARKLE uses a sparse additive reward model with doubly penalized estimator and adaptive screening.
result SPARKLE achieves sublinear regret bound logarithmic in covariate dimensionality.
Develops algorithms to balance personalization and statistical power in mobile health studies.
problem Balancing personalization and statistical power in mobile health studies.
method Develops general meta-algorithms to modify existing bandit algorithms.
result Guarantees sufficient power while improving user well-being.
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.
Paper uses stats to predict treatment choice based on illness probability.
problem Improving treatment decision-making in personalized medicine.
method Statistical decision theory with maximum regret evaluation.
result Estimates illness probability for better treatment choice.
AI framework uses multi-omics data to personalize cancer treatment suggestions.
problem Leveraging AI for personalized cancer treatment based on complex patient characteristics.
method Modular machine learning framework trained on diverse multi-omics technologies.
result Superior performance in personalized counterfactual treatment suggestions.
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.
Study examines how people perceive fairness in criminal risk prediction algorithms.
problem Concerns about fairness in algorithmic decision making, especially in criminal risk prediction.
method Survey of 576 people to understand perceptions of fairness in algorithmic decision making.
result People's fairness judgments are influenced by eight latent properties of features in algorithms.
Proposes a recourse algorithm for machine learning decisions.
problem Individuals can suffer unfair outcomes in black-box systems.
method Models data distribution, generates smallest changes for improvement.
result Algorithm applicable to supervised and causal systems.
Aims to improve personalized treatment decisions through Bayesian experimental design.
problem Evaluating and improving personalized treatment decisions in contexts like customer service.
method Model-agnostic Bayesian Experimental Design to efficiently gather data and avoid highly sub-optimal treatments.
result Our method achieves superior performance in evaluating and improving treatment decisions compared to traditional approaches.
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.
A new algorithm learns optimal personalized treatment plans online with low regret.
problem Learning optimal dynamic treatment regimes in an online setting.
method Developed a novel algorithm balancing exploration and exploitation for rate-optimal regret.
result Guaranteed rate-optimal regret for linear transition and reward models.
Framework improves health by planning actionable treatment processes.
problem Developing objective treatment processes in clinical settings.
method Surrogate Bayesian model combined with ML for personalized health improvement.
result Computed treatment processes are actionable and consistent with clinical knowledge.
Private RL algorithm with privacy guarantees for personalized medicine decisions.
problem Privacy-preserving reinforcement learning for personalized medicine decisions.
method Developed a private optimism-based RL algorithm using joint differential privacy (JDP).
result Achieved strong PAC and regret bounds with a privacy guarantee.
PNNs improve personalized healthcare policies using mixed integer programming.
problem Learning treatment policies for patients with limited data.
method Prescriptive networks (PNNs) trained with mixed integer programming.
result PNNs outperform existing methods in reducing peak blood pressure.
The paper aims to reduce bias in online decision-making by optimizing fairness and regret.
problem Achieving fair and justified real-time decisions in online systems.
method Adapting the learning-from-experts scheme to optimize fairness and regret for multiple label classes and sensitive groups.
result Approximately equalized odds can be achieved without significant loss in regret.
Protects user privacy in models using optional personal data.
problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.
Interpretability of ML models improves healthcare decisions.
problem Ensuring machine learning models are understandable for healthcare users.
method Classifying interpretability into local and global approaches, and model-specific vs. model-agnostic methods.
result Examples of practical interpretability in healthcare, including prediction and treatment optimization.
Combines machine learning and optimization for real-time decision-making.
problem Optimizing decisions in contextually constrained problems.
method Generative model combining interior point methods and adversarial learning.
result Generative model produces optimal decisions with in-sample and out-of-sample guarantees.
Guarantees for third-person imitation learning from offline data.
problem Improving generalizability in imitation learning.
method Problem-dependent statistical learning guarantees for third-person imitation from offline observation.
result Strong performance guarantees for transferred policies in the offline setting.
Automated decision making is used routinely throughout our everyday life. Recommender systems decide which jobs, movies, or other user profiles might be interesting to us. Spell checkers help us to make good use of language. Fraud detection systems decide if a credit card transactions should be verified more closely. M…
New algorithm learns from sparse data to make decisions in high dimensions.
problem Learning optimal actions from high-dimensional data streams.
method Structured contextual multi-armed bandit (CMAB) with relevance learning.
result Time-averaged regret goes to zero with smooth reward dependence.
Framework generates personalized insulin treatment strategies using deep models.
problem Developing optimal personalized treatment strategies for diabetes patients.
method Combines deep generative time series models with decision theory.
result Demonstrated improved personalized insulin treatment strategies for diabetes patients.
Bayesian framework infers personalized embeddings for diverse human demonstrations.
problem Lack of personalized models for diverse human behaviors.
method Bayesian LfD framework inferring human-specific embeddings.
result Outperforms state-of-the-art techniques on synthetic and real-world data.
IntelligentPooling improves treatment decisions in mHealth.
problem Optimizing treatment decisions in mobile health with limited data and non-stationary responses.
method Generalized Thompson-Sampling bandit algorithms to IntelligentPooling, addressing differential response, limited data, and non-stationary responses.
result IntelligentPooling achieves 26% lower regret compared to state-of-the-art methods.