Develops new optimization techniques for decision-making under uncertainty.
problem Decision-making under uncertainty with complex cost functions and nested expectations.
method Introduces Multistage Conditional Compositional Optimization (MCCO) and develops multilevel Monte Carlo techniques.
result New optimization techniques reduce scenario complexity from exponential to polynomial growth.
The paper develops algorithms to minimize risk and regret in uncertain decisions.
problem Minimizing risk and regret in multistage decisions under uncertainty.
method Established dual representations and used Lagrangian duality theory to develop progressive hedging algorithms.
result Modified progressive hedging algorithm can handle new linkage constraints.
Bayesian optimization tackles expensive cascade processes.
problem Optimizing multistage decision-making processes with expensive costs.
method Formulated as Bayesian optimization framework with two types of acquisition functions.
result Demonstrated effectiveness through numerical experiments and a solar cell simulator application.
A new method uses active learning to improve bile duct stone evaluation.
problem Efficiently collecting necessary patient data in sequential healthcare decisions.
method Developed an active learning-based multistage sequential decision-making model.
result Improves estimation efficiency by 62%-1838% compared to baseline methods.
The paper introduces new processors for fair credit scoring.
problem Fairness in credit scoring with multiple sensitive variables.
method Logical processors (LP) and Multistage processors (MP).
result Logical processors are effective for handling multiple sensitive variables.
Multistage Defer Trees improve model accuracy while maintaining interpretability.
problem Balancing model accuracy and interpretability, especially in noisy domains.
method A sequence of sparse decision trees that defer predictions to the next tree or a black box.
result Matches the performance of complex tree-based ensembles while using only one or a few sparse trees.
We propose a hybrid algorithmic strategy for complex stochastic optimization problems, which combines the use of scenario trees from multistage stochastic programming with machine learning techniques for learning a policy in the form of a statistical model, in the context of constrained vector-valued decisions. Such a …
Develops a two-level monotonic multistage recommender system for better user-specific prediction.
problem Leveraging user-item-stage dependencies in a monotonic chain of events for enhanced prediction accuracy.
method A multistage recommender system with a two-level monotonic property, using a large-margin classifier based on a nonnegative additive latent factor model.
result The proposed method outperforms existing methods in simulations and an article sharing dataset.
Research in psychology and neuroscience has successfully modeled decision making as a process of noisy evidence accumulation to a decision bound. While there are several variants and implementations of this idea, the majority of these models make use of a noisy accumulation between two absorbing boundaries. A common as…
This paper reviews data-driven optimization techniques for decision-making under uncertainty.
problem Decision-making under uncertainty in the era of big data and deep learning.
method Comprehensive review of data-driven distributionally robust optimization, chance constrained program, robust optimization, and scenario-based optimization.
result Identification of potential research opportunities in closed-loop data-driven optimization and scenario-based optimization leveraging deep learning.
Paper tackles robust optimization under uncertainty using nested distance.
problem Optimizing under distributionally robust uncertainty with nested distance.
method Equivalent recursive and dynamic programming reformulations for tractable optimization.
result Optimal robust policies can be found efficiently using convex optimization.
The paper introduces methods to solve optimization problems with auxiliary data.
problem Solving multistage optimization problems with uncertain data and auxiliary information.
method Utilizes machine learning techniques like kNN, CART, and RF to develop methods for optimization.
result Demonstrates asymptotic and finite sample optimality of the proposed methods.
New algorithm optimally minimizes convex functions with noisy gradients.
problem Minimizing strongly convex, smooth functions with noisy gradient estimates.
method A multistage accelerated stochastic gradient method with restarts.
result Achieves optimal convergence rate in deterministic and stochastic cases.
The paper studies fairness in multi-stage selection problems and introduces a method to compute fair selections.
problem Fairness in multi-stage selection problems with additional features at each stage.
method Introducing fairness notions, proposing a linear program for fair selections, and defining the price of local fairness.
result It is possible to have a selection that has a small price of local fairness and is close to locally fair.
Optimal multistage method solves noisy minimax problems.
problem Minimizing/maximizing in noisy conditions with smooth and strongly convex-strongly concave settings.
method Multistage Stochastic Gradient Descent Ascent (M-GDA) and Optimistic Gradient Descent Ascent (M-OGDA).
result Achieves optimal linear decay rate with respect to initial error and condition number.
Paper proposes RMFN for multimodal language analysis.
problem Modeling interactions between language, visual, and acoustic modalities.
method Recurrent Multistage Fusion Network (RMFN) decomposes fusion into stages focusing on subsets of multimodal signals.
result RMFN achieves state-of-the-art performance across multimodal sentiment analysis, emotion recognition, and speaker traits recognition datasets.
A new method solves complex hydroelectricity planning problems.
problem Solving multistage stochastic linear programming for hydrothermal dispatch planning.
method Regularized Linear Decision Rules (AdaLASSO) to reduce overfitting and improve out-of-sample performance.
result Significant reductions in non-zero coefficients and improved spot-price profiles.
The paper uses causal machine learning to optimize rework decisions in manufacturing.
problem Optimizing rework policies in manufacturing systems to balance yield improvement and rework costs.
method Proposes a causal model using double/debiased machine learning (DML) techniques to estimate conditional treatment effects and derive rework policies.
result Achieved a yield improvement of 2-3% during the color-conversion process of white LEDs.
Learning a distribution conditional on a set of discrete-valued features is a commonly encountered task. This becomes more challenging with a high-dimensional feature set when there is the possibility of interaction between the features. In addition, many frequently applied techniques consider only prediction of the me…
Scaling algorithms improve joint training of deep energy-based models.
problem Joint training of deep energy-based models often fails and delivers worse results.
method Proposed online and offline scaling algorithms to fix joint training.
result Scaling algorithms improve joint training and deliver better results.
We discuss the role of integrated chance constraints (ICC) as quantitative risk constraints in asset and liability management (ALM) for pension funds. We define two types of ICC: the one period integrated chance constraint (OICC) and the multiperiod integrated chance constraint (MICC). As their names suggest, the OICC …
A general duality proof for Wasserstein distributionally robust optimization.
problem Optimizing under uncertainty with Wasserstein distance.
method One-dimensional convex analysis and interchangeability principle.
result General duality result holds for various distributions and costs.
Proposes a new Q-learning method for survival outcomes in clinical trials.
problem Incomplete follow-up data and nonlinear covariate effects in clinical trials.
method Combines Buckley-James boosting with flexible base learners for estimating optimal treatment regimes.
result Improves treatment decision accuracy and stability in longitudinal clinical trials.
The ℓ1-penalized method, or the Lasso, has emerged as an important tool for the analysis of large data sets. Many important results have been obtained for the Lasso in linear regression which have led to a deeper understanding of high-dimensional statistical problems. In this article, we consider a class of weigh…
In both the fields of computer science and medicine there is very strong interest in developing personalized treatment policies for patients who have variable responses to treatments. In particular, I aim to find an optimal personalized treatment policy which is a non-deterministic function of the patient specific cova…
DANCE method improves large-scale learning efficiency via accumulating sample strategy.
problem Efficiently solving large-scale empirical risk minimization problems.
method Distributed Accumulated Newton Conjugate gradient (DANCE) method with multistage approach.
result The method achieves satisfactory statistical accuracy with fewer passes over data.
Improved graph matching algorithm robust to noise.
problem Finding a bijection between vertex sets of two graphs.
method Uses multistage signature vectors to match vertices.
result Recover matching exactly with high probability for α≤1/(loglogn)C. This review explores causal decision-making to improve decision quality.
problem Effective decision-making requires understanding causal relationships.
method Causal structure learning, causal effect learning, and causal policy learning.
result Challenges in causal decision-making are identified and recent advances are discussed.
This paper introduces SDP for optimizing revenue in IM problems.
problem Optimizing revenue in influence maximization problems within online social networks.
method Stochastic Dynamic Programming (SDP) combined with heuristic methods.
result Heuristics like AHC and LDH achieve near-optimal results faster than SDP.
This paper develops a framework for efficient decision-making under time pressure.
problem Efficient decision-making under time pressure and subjective tradeoffs.
method Unified framework for evidence-based decision-making under time pressure.
result Ability to model and understand decision-making behavior under time constraints.
Framework for robust decision making in changing environments with privacy constraints.
problem Interactive decision making in changing environments with constraints.
method Hybrid Decision Making with Structured Observations (hybrid DMSO) framework, local differentially private decision making, query-based learning, robust and smooth decision making.
result Strong connections and bounds derived for DEC, SQ dimension, local minimax complexity, learnability, and joint differential privacy.
Study minimax-optimal rates for offline decision-making with function approximation.
problem Statistical complexity of offline decision-making with function approximation.
method Near minimax-optimal rates for stochastic contextual bandits and Markov decision processes, using pseudo-dimension and behavior policy.
result Established performance limits and new characterization of behavior policy.
Optimizes decision-making with variational Bayesian methods for continuous utilities.
problem Inference approximations for continuous utilities without full posterior knowledge.
method Automatic pipeline that co-opts continuous utilities into variational inference algorithms.
result Consistent improvement in decision-making when calibrating approximations for specific utilities.
Enhanced privacy, utility, and efficiency through MUST subsampling.
problem Balancing privacy, utility, and computational efficiency in data analysis.
method MUltistage Sampling Technique (MUST) for privacy amplification in differential privacy.
result MUST offers stronger privacy guarantees (ϵ) than one-stage subsampling methods while maintaining similar utility and computational efficiency. Local reservoir model explains decision consistency in learning.
problem Understanding decision consistency in learning processes.
method Proposes a local reservoir model to explain decision consistency.
result Size of local reservoir affects decision consistency.
Paper tackles risk-sensitive decision-making under uncertainty.
problem Risk-sensitive decision-making problem under uncertainty.
method Formulated as a stochastic control problem, delineated necessary optimality conditions.
result Illustrative examples from optimal betting and inventory management support the theory.
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.
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.
Corrects approximate Bayesian inference for better decision-making.
problem Sub-optimal decisions due to inaccurate posterior predictive distributions.
method Trains a separate model to correct decision-making under approximate posterior, combining Bayesian modeling with optimization.
result Empirically demonstrates improved predictive accuracy in various problems.
The paper tackles individualized decision-making under unmeasured confounding, providing a novel minimax solution and a paradox.
problem Unmeasured confounding in causal inference leads to biased estimates and affects individualized decision-making.
method The authors establish a formal link between individualized decision-making under partial identification and classical decision theory, providing a minimax solution and a paradox.
result A novel minimax solution for individualized decision-making/policy assignment is provided, and an interesting paradox is drawn.
The Chain-of-Decision approach improves forecasting of financial professionals' trading decisions.
problem Challenges in forecasting professionals' behaviors, especially in trading decisions.
method Integrates an opinion-generator-in-the-loop to provide subjective analysis based on news items.
result Promising improvements in the proposed tasks' performance.
The study examines robust decision-making in volatile financial markets, finding action robustness is more impactful than uncertainty tolerance.
problem Sequential decision making in high-frequency markets under evolving uncertainty.
method Analyzes two dimensions of robustness: uncertainty tolerance and action robustness, using simulations and empirical evidence.
result Action robustness has a larger impact on profitability than uncertainty tolerance, and excessive robustness can reduce profitability in illiquid markets.
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.
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.
Machine learning attacks mimic cellular decision-making, revealing new defense mechanisms.
problem Adversarial perturbations fool machine learning models, similar to how ligands prevent correct signaling in cells.
method Formal analogy between neural networks and cellular decision-making models, applying machine learning techniques to study cellular processes.
result Found two regimes in cellular decision-making models, each with a critical point that shapes the loss landscape and defense mechanisms.
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.
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.