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.
Boosted decision stumps and trees are made robust against adversarial attacks efficiently.
problem Efficiently making boosted decision stumps and trees robust against adversarial attacks.
method Exact min-max robust loss and test error computation for decision stumps, upper bound optimization for trees.
result State-of-the-art robust test error rates for boosted trees on various datasets.
Paper introduces novel model selection for CRO to balance robustness and decision risk.
problem Balancing robustness and decision risk in CRO.
method Conformalized Robust Optimization with Model Selection (CROMS) framework.
result Significant improvements in decision efficiency across various applications.
PDTS improves robustness in sequential decision-making.
problem Robust active task sampling for efficient and reliable decision-making.
method Characterizes robust active task sampling as a Markov decision process, proposes PDTS method.
result Significantly improves zero-shot and few-shot adaptation robustness.
New framework calibrates decision robustness using inverse conformal risk control.
problem Inadequate robustness levels in decision-making due to ad hoc choices.
method Constructs valid estimators to trace miscoverage-regret Pareto frontier.
result Provides distribution-free, finite-sample guarantees on robustness levels.
Study explores loss design for decision trees to improve robustness against noisy labels.
problem Improving decision tree robustness to noisy labels.
method Investigated loss correction and symmetric losses, found ineffective.
result Other loss design directions need exploration for robust decision trees.
The paper connects decision tree interpretability and robustness through separation.
problem Empirical observation of a connection between robustness and interpretability in decision trees.
method Investigation of the connection through decision trees and l ∞ l_{\infty} l ∞ -perturbation robustness, proving bounds on tree size. result First algorithm with guarantees on robustness, interpretability, and accuracy for decision trees.
RISE learns decisions with sensitive variables, improving worst-case outcomes.
problem Uncertainty and bias in decisions due to delayed sensitive variable data.
method Incorporates sensitive variables offline but not at deployment, using quantile or infimum optimization.
result Improves worst-case outcomes for individuals affected by unavailable sensitive variables.
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.
New algorithm solves uncertain Markov decision processes using Wasserstein uncertainty.
problem Solving Markov decision processes with uncertain transition probabilities.
method Distributionally robust Q Q Q -learning algorithm for Wasserstein uncertainty. result Convergence of the algorithm proved and demonstrated with real data.
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.
Develops scenario theory for multi-criteria decision making.
problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.
The paper develops a method to learn robust decision policies from observational data, reducing high-cost outcomes.
problem Learning safe decision policies from observational data with high-risk outcomes.
method Develops a method to learn policies that reduce high-cost outcomes, valid under finite samples and uneven feature overlap.
result Validates the method with real and synthetic data, providing statistical bounds on decision costs.
The paper tackles robust policy learning in MDPs using statistical methods.
problem Offline data-driven sequential decision making in MDPs.
method Evaluates policies using average rewards centered at policy-induced stationary distributions. Developed a statistically efficient method for estimating robust optimal policies.
result Established a rate-optimal regret bound up to a logarithmic factor.
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.
This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.
problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.
Novel loss functions improve decision tree learning from noisy data.
problem Training decision trees with noisy labels.
method Introducing distribution losses and a new negative exponential loss.
result The negative exponential loss leads to efficient and robust decision tree learning.
Paper tackles robust decision-making from multiple sites with shared structure.
problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.
Connects robust optimization to conformal prediction for uncertainty sets.
problem Decision-making under uncertainty in sensitive data.
method Defines Mahalanobis distance as a conformity score and generates conformal uncertainty sets.
result Conformal uncertainty sets provide valid and conservative ellipsoidal regions.
New method estimates policy performance under unobserved confounding.
problem Estimating policy performance when decisions depend on unobserved variables.
method Developed worst-case bounds for robust OPE under unobserved confounding.
result Efficient procedure for computing worst-case bounds, proving statistical consistency.
Discussing issues in robust clustering, especially with Gaussian models.
problem Handling outliers and ambiguity in clustering groups.
method Focus on Gaussian mixture model, examining formal definitions, interactions, and tuning decisions.
result Outliers can confuse clustering groups and existing stability measures fail with them.
New methods improve robust decision-making under uncertainty in off-policy evaluation.
problem Statistical uncertainty and causal considerations in off-policy evaluation.
method Marginal Ratio (MR) estimator, Conformal Off-Policy Prediction (COPP), causal bounds.
result Improved robustness and uncertainty quantification in off-policy decision-making.
New algorithms solve robust MDPs efficiently, significantly faster than existing methods.
problem Computing robust MDP solutions with uncertainty in transition probabilities is computationally expensive.
method Partial policy iteration and fast robust Bellman operator computation methods.
result The proposed methods are many orders of magnitude faster than state-of-the-art approaches.
The paper addresses decision making with partially calibrated forecasts, offering a robust approach.
problem Developing a decision-making strategy for forecasts that are only partially calibrated.
method A minimax approach to mapping predictions to actions, considering worst-case distributions.
result The minimax optimal decision rule is to trust predictions and act accordingly, even for partially calibrated forecasts.
New algorithms improve on consistency and robustness in convex function chasing with black-box advice.
problem Minimizing cost in normed vector space with black-box advice for convex function chasing.
method Two novel algorithms: INTERP and BDINTERP, exploiting convexity to achieve improved consistency and robustness.
result BDINTERP achieves near-optimal consistency-robustness trade-off for α-polyhedral cost functions.
Paper shows how noisy data can improve robust decision-making.
problem The challenge of noisy data in decision-making.
method Distributionally robust optimization (DRO) with a novel ambiguity set construction.
result Noisy data can lead to more robust and equitable decisions.
Proposes CPO framework for robust decision-making with explainable uncertainty regions.
problem Overly conservative uncertainty regions in data-driven optimization lead to suboptimal decisions.
method Conformal-Predict-Then-Optimize (CPO) framework using conditional generative models and visual summaries.
result Demonstrates improved robustness and explainability in decision-making.
New algorithm speeds up robustness verification for tree-based models.
problem Formal robustness verification of tree-based models, especially ensembles.
method Reformulated as max-clique problem on a multi-partite graph with bounded boxicity; developed efficient multi-level verification algorithm.
result Tight lower bounds on robustness of decision tree ensembles, hundreds of times faster than previous approach.
Improves DRO with Bayesian Ambiguity Sets for model misspecification.
problem Overly conservative decisions due to misspecified models in DRO.
method Introduces DRO-RoBAS with robust posterior predictive distribution.
result Outperforms other Bayesian and empirical DRO approaches in out-of-sample performance.
New research shows strategic classification harms individuals and society.
problem Strategic behavior in decision-making leads to unfair outcomes.
method Introducing a social burden metric, the study quantifies the negative externalities of strategic classification.
result Any increase in institutional utility leads to a corresponding increase in social burden.
Enhances GBDT robustness with one-hot encoding and regularization.
problem Low robustness of GBDT models against covariate perturbation.
method One-hot encoding to linear framework, risk decomposition, L 1 L_1 L 1 or L 2 L_2 L 2 regularization. result Regularization enhances GBDT robustness.
GPs' decisions can vary significantly with different kernels, even if kernels are qualitatively similar.
problem Robustness of GP decisions to kernel choice.
method Solved a constrained optimization problem over a finite-dimensional space to identify changes in GP decisions.
result Decisions made with a GP can be non-robust to kernel choice, even with qualitatively similar kernels.
Non-parametric bootstrap improves robust portfolio and trading strategy optimization.
problem Mitigating uncertainty in expected returns and covariances in financial decision-making.
method Non-parametric bootstrap framework for robust optimization without distributional assumptions.
result Improved out-of-sample performance with smoother, more stable results.
Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.
problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.
Proposes a method to learn adaptive ambiguity sets for robust optimization.
problem Misspecification in distributionally robust optimization (DRO).
method Learned predictive ambiguity sets (LPAS) using deep contextual models.
result Significantly improves portfolio optimization performance compared to baselines.
DRO optimizes decisions under uncertain distributions, considering worst-case scenarios.
problem Optimizing decisions when the distribution of uncertainties is itself uncertain.
method Defines ambiguity sets and seeks decisions optimal under the worst-case distribution.
result DRO models can be connected to regularization techniques and machine learning.
DR-RPO optimizes robust policies in RL with limited interaction, achieving sublinear regret.
problem Policy optimization in RL under distribution shift and adversarial dynamics.
method DR-RPO algorithm incorporating reference-policy regularization and upper confidence bonus for exploration.
result DR-RPO achieves sublinear regret and polynomial suboptimality bounds in robust RL.
Wasserstein DR optimizes decisions under uncertain distributions.
problem Learning decisions from uncertain data with limited samples.
method Wasserstein distributionally robust optimization (DR) approach.
result Optimal decisions can be computed efficiently and have strong guarantees.
New priors improve robustness and interpretability in penalized regression.
problem Improper priors in penalized regression lead to suboptimal solutions.
method Developed non-zero priors inspired by human decision heuristics.
result Robust priors yield excellent worst-case performance across various tasks.
Deep networks have recently been shown to be vulnerable to universal perturbations: there exist very small image-agnostic perturbations that cause most natural images to be misclassified by such classifiers. In this paper, we propose the first quantitative analysis of the robustness of classifiers to universal perturba…
New approach verifies tree ensembles efficiently, making them more robust.
problem Verifying robustness of decision tree ensembles against evasion attacks is NP-hard.
method Identified large-spread ensembles, proposed verifiable learning, designed training algorithm.
result Large-spread ensembles can be verified in polynomial time and are more robust.
The paper shows optimal robustness against adversarial corruption in sequential decision-making problems.
problem Optimal robustness to adversarial corruption in online decision-making problems.
method Investigates prediction with expert advice and multi-armed bandit problems, focusing on algorithms with decreasing learning rates and second-order regret bounds.
result Optimal robustness can be expressed by a square-root dependency on the amount of corruption, achieving O ( log N Δ + C log N Δ ) O(\frac{\log N}{\Delta} + \sqrt{\frac{C \log N}{\Delta}}) O ( Δ l o g N + Δ C l o g N ) -regret. We study the robustness of classifiers to various kinds of random noise models. In particular, we consider noise drawn uniformly from the ℓ _ p \ell\_p ℓ _ p ball for p ∈ [ 1 , ∞ ] p \in [1, \infty] p ∈ [ 1 , ∞ ] and Gaussian noise with an arbitrary covariance matrix. We characterize this robustness to random noise in terms of the distance to the decisio…
Enhances deep networks' robustness against adversarial attacks.
problem Vulnerability of deep neural networks to adversarial examples.
method Boundary Conditional GAN, generating boundary samples near decision boundary.
result Significant improvement in robustness against various adversarial attacks.
New method removes oracle and reduces memory usage for robust MDPs.
problem Applying robust MDPs in practice due to model estimation and oracle requirements.
method Transformed robust MDPs into an alternative form allowing stochastic gradient methods and model-free approach.
result Sample-efficient algorithm with lower storage requirement and no oracle.
Develops robust MDPs for unknown disturbances with performance guarantees.
problem Unknown disturbance distribution in MDPs.
method Empirical distribution, sublevel set of distance function, weak convergence, concentration inequality.
result Robust optimal value function converges to true optimal value function with increasing sample sizes.
Improved neural networks resist adversarial attacks and explain decisions better.
problem Neural networks are vulnerable to adversarial examples that alter their outputs.
method Introduced a novel regularization technique inspired by the Lipschitz constraint.
result Demonstrated a neural network with an ARA of 0.0053, 2.4x better than previous state of the art.
SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.
problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.