The paper calculates the value of information in high-dimensional decision making.
problem Determining the value of acquiring new information in high-dimensional decision problems.
method Using tools from sub-Gaussian processes and generic chaining for asymptotic analysis.
result Asymptotic results on the expected value of information as dimensionality increases.
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(T1/2) regret or O(T1/2)-consistent inference, with trade-off between exploration and exploitation. 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.
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.
New tool helps analyze complex financial data.
problem Difficulty in comprehending high-dimensional financial data.
method Topological Data Analysis Ball Mapper algorithm.
result Shows new way to see detail in financial data.
Lecture notes on reinforcement learning using statistical methods.
problem Addressing the exploration-exploitation dilemma in decision making.
method Frequentist and Bayesian approaches, function approximation, neural networks.
result Unified framework for decision making and estimation.
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-Iteration algorithm for estimating optimal action-state function Q∗. result Significantly improved final learning error of Q∗ function. 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.
Due to the capability of deep learning to perform well in high dimensional problems, deep reinforcement learning agents perform well in challenging tasks such as Atari 2600 games. However, clearly explaining why a certain action is taken by the agent can be as important as the decision itself. Deep reinforcement learni…
We propose a minimax concave penalized multi-armed bandit algorithm under generalized linear model (G-MCP-Bandit) for a decision-maker facing high-dimensional data in an online learning and decision-making process. We demonstrate that the G-MCP-Bandit algorithm asymptotically achieves the optimal cumulative regret in t…
Learning a model of dynamics from high-dimensional images can be a core ingredient for success in many applications across different domains, especially in sequential decision making. However, currently prevailing methods based on latent-variable models are limited to working with low resolution images only. In this wo…
Bayesian optimization improved for high-dimensional outputs using randomized priors.
problem Efficient global optimization of high-dimensional black-box functions.
method Deep learning framework with bootstrapped ensembles of neural architectures with randomized priors.
result Superior performance in tasks with high-dimensional outputs compared to state-of-the-art methods.
Enhances interpretability of functional survival models.
problem Lack of interpretability in functional survival models limits practical use.
method Introduces novel methods to enhance interpretability of FST and explainability of FRSF.
result Proposed methods yield efficient, easy-to-understand decision trees.
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.
Many sequential decision-making tasks require choosing at each decision step the right action out of the vast set of possibilities by extracting actionable intelligence from high-dimensional data streams. Most of the times, the high-dimensionality of actions and data makes learning of the optimal actions by traditional…
We present DCSVM, an efficient algorithm for multi-class classification using Support Vector Machines. DCSVM is a divide and conquer algorithm which relies on data sparsity in high dimensional space and performs a smart partitioning of the whole training data set into disjoint subsets that are easily separable. A singl…
We develop a probabilistic framework for sequential random projection.
problem Challenges of sequential decision-making under uncertainty.
method Novel construction of a stopped process and method of mixtures.
result Achieved a non-asymptotic probability bound for random projection.
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.
A method for fast, accurate cross-temporal forecasts using machine learning.
problem Inconsistent forecasts across different levels of platform data.
method Non-linear hierarchical forecast reconciliation using machine learning.
result Automated direct production of reconciled forecasts for high-frequency decision making.
New framework tackles stochastic latent subgroup heterogeneity in online decision-making.
problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.
Generative model simulates rare events for better decision making.
problem Rare events impact decision making but are hard to sample.
method Normalizing Flow coupled with Importance Sampling.
result Accurate estimation of rare events improves decision outcomes.
The paper introduces CPICFs for better counterfactual explanations in high-dimensional spaces.
problem Creating useful counterfactual explanations for complex machine learning models.
method Modeling individual knowledge and using conformal prediction intervals to identify informative counterfactuals.
result CPICFs provide more informative counterfactuals by considering individual knowledge and prediction uncertainty.
Current end-to-end deep Reinforcement Learning (RL) approaches require jointly learning perception, decision-making and low-level control from very sparse reward signals and high-dimensional inputs, with little capability of incorporating prior knowledge. This results in prohibitively long training times for use on rea…
A new model optimizes portfolios by learning stock return distributions conditioned on factors.
problem Optimizing portfolios with high-dimensional asset-specific factors.
method Conditional Diffusion Transformer architecture linking each asset's return to its factor vector.
result The model outperforms benchmarks in mean-variance and mean-CVaR optimization.
Deep neural networks have proved to be a very effective way to perform classification tasks. They excel when the input data is high dimensional, the relationship between the input and the output is complicated, and the number of labeled training examples is large. But it is hard to explain why a learned network makes a…
Algorithm estimates human decision-making in high-dimensional states with finite-time guarantees.
problem Estimating optimal policies and measures of fit in dynamic decision models with high-dimensional state spaces.
method Single-loop estimation algorithm with stochastic gradient steps for reward maximization.
result Algorithm converges to a stationary solution with finite-time guarantees and approximates maximum likelihood sublinearly.
This paper improves recommender systems by handling dynamic user preferences and item popularity.
problem Dynamic user preferences and changing item popularity in recommender systems.
method Developed a Thompson sampling-based policy for a high-dimensional linear bandit problem, reducing feature vector dimensionality and using exponentially increasing weights.
result Proved a regret bound that scales with the reduced dimension, demonstrating effectiveness in trade-off between computational complexity and regret performance.
New method learns unbiased treatment representations from structured high-dimensional data.
problem Estimating causal effects from high-dimensional, structured treatments.
method Contrastive learning approach to learn unbiased treatment representations.
result The method identifies causal factors and discards non-causal ones, leading to unbiased causal effect estimates.
A new algorithm detects changes in high-dimensional data efficiently under sampling constraints.
problem Real-time monitoring of high-dimensional streaming data with limited sampling.
method Incorporates multi-armed bandit approaches into sequential change-point detection.
result Proposes TSSRP algorithm for efficient detection of changes.
A new approach predicts next observations without explicit decoding for better control.
problem High-dimensional observations and unknown dynamics in real-world control tasks.
method Proposes a novel information-theoretic LCE approach using predictive coding to develop a decoder-free model.
result The model reliably learns a controllable latent space leading to superior performance.
New algorithm reduces regret in bandit optimization for high-dimensional data.
problem Optimizing decisions in uncertain environments with high-dimensional data.
method Inspired by online Newton step, proposes a simple and efficient BCO algorithm.
result Achieves optimal regret bounds for κ-convex functions. Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possibl…
A2MT learns agents to select which modalities to acquire at test time.
problem Learning agents to select modalities for multimodal temporal data acquisition.
method Perceiver IO architecture for active acquisition of multimodal temporal data.
result Agents successfully learn cost-reactive acquisition behavior on real-world datasets.
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.
End-to-end pipeline for data-driven decision making in mixed-integer optimization.
problem Data-driven decision making in mixed-integer optimization with uncertainty.
method Exploiting mixed-integer optimization-representability of machine learning methods, characterizing decision trust regions, and ensembling multiple models.
result Framework generates high-quality prescriptions and controls model robustness.
New method handles uncertainty in causal effect estimation for better decision-making.
problem Handling uncertainty in causal effect estimation, especially in high-dimensional data and covariate shift.
method Integrates uncertainty estimation into neural network methods for individual-level causal estimates.
result Uncertainty-aware methods improve decision-making by alerting when predictions are not reliable.
Proposes a method to enforce fairness in machine learning models without sensitive data.
problem Bias in machine learning models from historical data.
method Infers sensitive attributes from auxiliary features and integrates fairness constraints into model training.
result Mitigates bias while preserving predictive accuracy.
Increasing input dimensionality improves deep RL performance and sample efficiency.
problem Real-world reinforcement learning applications often lack sufficient training data.
method Proposed an online feature extractor network (OFENet) to improve deep RL performance and sample efficiency.
result RL agents learn more efficiently with high-dimensional input representations than with lower-dimensional state observations.
Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.
problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.
CDF uses centroids to split features for high-dimensional classification.
problem High-dimensional classification problems with complex class structures.
method CDF introduces a centroid-driven splitting strategy in decision trees.
result CDF outperforms conventional methods in high-dimensional classification.
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.
Study examines influence diagnostics in high-dimensional M-estimation.
problem Understanding influence diagnostics in high-dimensional settings.
method Characterized the distribution of leave-one-out influences in high-dimensional Gaussian M-estimation.
result The distribution of influences converges to a limiting measure in high-dimensional settings.
New method tackles anomaly detection in video surveillance using continual learning.
problem Challenges in continual learning for high-dimensional applications like video surveillance.
method Transfer learning and continual learning for online anomaly detection.
result Significantly reduces training complexity and continual learning from recent data.
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.
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.
Paper proposes a new RL approach combining IL and RL methods to improve decision-making.
problem Challenges in RL with large state and action spaces, and difficulty in reward determination.
method Combines Imitation Learning and RL methods (SARSA and A3C) to learn sequential decision-making policies.
result Significantly decreases human effort and exploration time in learning decision-making policies.
Learning predictive models from small high-dimensional data sets is a key problem in high-dimensional statistics. Expert knowledge elicitation can help, and a strong line of work focuses on directly eliciting informative prior distributions for parameters. This either requires considerable statistical expertise or is l…
Introduces new gradient-based methods for machine learning problems.
problem New challenges in machine learning due to decision-making and multi-agent problems.
method Gradient-based optimization and variational inequalities.
result Shifts focus from pattern recognition to decision-making and multi-agent problems.