Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

126251377502 · Jun 202019922001200920172026
48 results for Sequential Decision Making

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.

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.

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.

Paper formalizes a reinforcement learning model for complex information structures.

problem Complex interdependence in sequential decision-making problems.
method Formalizes a novel reinforcement learning model with explicit information structure representation.
result Upper bound on sample complexity of learning general sequential decision-making problems.

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.

Unified framework for human-like decision making in various sequential tasks.

problem Real-life decision-making involves diverse strategies leading to similar outcomes.
method Two-stream reward processing mechanism for flexible and unified models.
result Framework unified MAB, CB, and RL with comparable performance.

Develops a new framework for analyzing sequential decision-making problems using information theory.

problem Lack of information-theoretic generalization bounds for sequential decision-making problems.
method Introduces a sequential supersample framework that separates learner filtration from proof-side enlargement, controlling the generalization gap by sequential CMI.
result Establishes a sequential CMI that controls the generalization gap in sequential decision-making problems.

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.

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.

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.

A new MDP with Bandits approach for sequential decision making in linear-flow scenarios.

problem Sequential decision making with limited feedback in a linear-flow context.
method Formulated as an MDP with Bandits, using Thompson sampling for action selection and exact dynamic programming for allocation.
result The proposed MDP with Bandits algorithm outperforms other methods in sequential decision making.

Study shows how AI model can improve decision-making with missing data.

problem Sequential decision-making with missing covariates.
method Introduced model elasticity to quantify imputation discrepancy; used statistical learning and regression for calibration.
result Calibrating pre-trained models can significantly reduce regret in decision-making.

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 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.

Improved distributed learning with reduced communication costs.

problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT)O(\log T), improving significantly on full communication.

We extend CS divergence to conditional distributions and show its advantages in time series data and sequential decision making.

problem Quantifying the closeness between conditional distributions.
method Developed and estimated a conditional Cauchy-Schwarz divergence using kernel density estimation.
result Conditional CS divergence outperforms previous methods in time series clustering and sequential decision making.

Framework for deferring decisions to experts in sequential medical settings.

problem Myopic and non-adaptive decision-making by ML models in sequential medical contexts.
method Sequential Learning-to-Defer (SLTD) framework using model-based reinforcement learning.
result Adaptive deferral policy improves trade-off between long-term outcomes and deferral frequency.

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.

We address challenges in collaborative black-box optimization through three frameworks.

problem Challenges in distributed experimentation, heterogeneity, and privacy in black-box optimization.
method Three unifying frameworks: global, local, and predictive.
result Shift from descriptive/predictive to prescriptive federated learning in black-box optimization.

Meta-KeL learns kernels from offline data to improve sequential decision-making.

problem Adaptive confidence sets for prediction functions in sequential decision-making tasks.
method Meta-KeL: meta-learning a kernel from offline data; structured sparsity estimator for unknown kernel combinations.
result Valid confidence sets that become as tight as those given the true unknown kernel with increasing offline data.

We solve a broad class of sequential decision-making problems with partially observed states.

problem Sequential decision-making under uncertainty with partially observed states.
method Modeling as a partially observed Markov decision process (POMDP) and separating state and modulation process.
result The approach allows for specialized approximate solution procedures.

The paper proposes a fair reinforcement learning framework to prevent healthcare disparities.

problem Unfair reinforcement learning policies in healthcare can lead to socioeconomically-disadvantaged subgroups being underprivileged.
method The paper introduces a counterfactual fairness framework and a sequential data preprocessing algorithm to achieve fair sequential decision making.
result The proposed approach greatly enhances fair access to counseling in a digital health dataset designed to reduce opioid misuse.

New batched Langevin Thompson Sampling reduces communication costs for sequential decision making.

problem Efficiently learning unknown reward distributions and transition dynamics in batched settings.
method Langevin Thompson Sampling with logarithmic communication costs.
result Order-optimal regret guarantees for stochastic MABs and RL.

Paper tackles non-monotonic resource utilization in sequential decision-making.

problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.

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.

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.

Bayesian framework for learning optimal action-value function in MDPs.

problem Uncertainty quantification in MDPs for optimal decision-making strategies.
method Full Bayesian framework including modelling, inference, and decision-making.
result Demonstrates exploration benefits of posterior sampling in MDPs.

We introduce a unified probabilistic framework for solving sequential decision making problems ranging from Bayesian optimisation to contextual bandits and reinforcement learning. This is accomplished by a probabilistic model-based approach that explains observed data while capturing predictive uncertainty during the d…

2019-03-28abs ↗pdf ↗

Bridges uplift modeling and sequential decision-making with online budget allocation.

problem Treatment allocation under budget constraints in digital advertising.
method Budget-Constrained Causal Bandits (BCCB) integrates learning, exploration, and budget pacing.
result Data-efficiency crossover: BCCB operates effectively from the first user, 3-5x lower performance variance.

We describe theoretical bounds and a practical algorithm for teaching a model by demonstration in a sequential decision making environment. Unlike previous efforts that have optimized learners that watch a teacher demonstrate a static policy, we focus on the teacher as a decision maker who can dynamically choose differ…

2012-10-16abs ↗pdf ↗

Proposes a framework to quantify uncertainty in multi-step decision-making by LLMs.

problem Uncertainty quantification in multi-step decision-making scenarios of LLMs.
method A principled, information-theoretic framework decomposing uncertainty into internal and extrinsic components, and proposing UProp for efficient extrinsic uncertainty estimation.
result UProp significantly outperforms existing single-turn UQ baselines in multi-step decision-making benchmarks.

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 UCB algorithm for learning PSRs with tractable computation and accuracy.

problem Learning predictive state representations in sequential decision-making problems.
method Proposes a novel UCB-type algorithm with a bonus term to estimate PSRs accurately and efficiently.
result First known UCB-type approach for PSRs with guaranteed model accuracy and computational tractability.

The paper proposes a method to construct confidence sets using likelihood ratios for sequential decision-making.

problem Constructing valid uncertainty estimates for unknown quantities in sequential decision-making.
method The method uses likelihood ratios to create any-time valid confidence sequences without specialized treatment for each application.
result The proposed confidence sets maintain the prescribed coverage in a model-agnostic manner and their size depends on the choice of estimator sequence.

Study on information cascade fragility under mismatched revealing probabilities.

problem Analyzing the fragility of information cascades in decision-making processes with imperfect knowledge of revealing probabilities.
method Examined sequential decision-making models with players having private information and imitating previous decisions. Studied the effect of a mismatch between players' beliefs and actual revealing probabilities.
result Derived closed-form expressions for optimal learning rates and identified phase transitions in the behavior of asymptotic learning rates.

The paper tackles AI advice giving by considering adherence levels and defer options.

problem Inadequate consideration of human adherence to AI recommendations.
method Sequential decision-making model that considers adherence levels and incorporates a defer option.
result Specialized learning algorithms provide better convergence and empirical performance.

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(logNΔ+ClogNΔ)O(\frac{\log N}{\Delta} + \sqrt{\frac{C \log N}{\Delta}})-regret.

The paper proposes a method to learn and leverage contextual preference distributions for better decision-making.

problem Heterogeneous and context-dependent human preferences in decision-making problems.
method A sequential learning-and-optimization pipeline using a bounded-variance score function gradient estimator to train a predictive model mapping contextual features to preference distributions.
result The approach reduces average post-decision surprise by up to 25 times compared to risk-averse baselines in a ridesharing environment.