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

117234350467 · Jun 202019922001200920172026
48 results for decision-making process

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.

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.

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.

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.

Gaussian processes adapted for non-Euclidean spaces enhance decision-making.

problem Applying Gaussian processes in non-Euclidean spaces.
method Developed pathwise conditioning and Gaussian process models over non-Euclidean spaces.
result Efficient Gaussian process models for non-Euclidean spaces.

Dynamic probabilistic forecasts guide optimal decisions in uncertain processes.

problem Optimal decision making in processes influenced by uncertain random factors.
method Stochastic models for probabilistic forecast evolution, calibrated from ensemble forecasts.
result Optimal decision strategies determined using dynamic probabilistic forecasts.

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 proposes explainable analytics for manufacturing process planning.

problem Improving data-driven decision-making in manufacturing.
method Combines process mining, machine learning, and XAI. Uses deep learning for prediction and Shapley values/ICE plots for explanations.
result Enhanced decision-making capabilities through local post-hoc explanations.

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.

New method improves decision-making accuracy without complex calculations.

problem Improving decision-making accuracy in machine learning.
method Introducing a new measure called calibration decision loss (CDLK\mathsf{CDL}_K) for structured families of post-processing functions.
result Proves upper and lower bounds for natural classes KK of post-processing functions.

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.

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.

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 QQ-Iteration algorithm for estimating optimal action-state function QQ^*.
result Significantly improved final learning error of QQ^* function.

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.

A new SNN model explains decision-making with learning and spiking neurons.

problem Lack of learning mechanism in existing models for decision-making.
method Proposes a Spiking Neural Network (SNN) model that incorporates a learning mechanism and uses multivariate Hawkes processes.
result Shows a coupling between DDM and Poisson counter models and derives a DDM from a Hawkes network of spiking neurons.

Consider a binary decision making process where a single machine learning classifier replaces a multitude of humans. We raise questions about the resulting loss of diversity in the decision making process. We study the potential benefits of using random classifier ensembles instead of a single classifier in the context…

2017-06-30abs ↗pdf ↗

Paper proposes a method to quantify and explain machine learning uncertainty in predictive process monitoring.

problem Neglect of data-driven estimation, point forecasts without model uncertainty, and lack of explanations.
method Quantile Regression Forests for interval predictions and SHapley Additive Explanations for uncertainty.
result Effective handling of model uncertainty in predictive process monitoring.

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 ↗

We study the explore-exploit tradeoff in distributed cooperative decision-making using the context of the multiarmed bandit (MAB) problem. For the distributed cooperative MAB problem, we design the cooperative UCB algorithm that comprises two interleaved distributed processes: (i) running consensus algorithms for estim…

2015-12-21abs ↗pdf ↗

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.

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 method optimizes Gaussian process allocation for BO.

problem Existing methods for inducing point allocation in BO hinder performance.
method Proposes a new allocation strategy using quality-diversity decomposition.
result Demonstrates improved BO performance through local high-fidelity modeling.

New online GP algorithm offers performance guarantees for streaming data.

problem Training and inference of GPs require all historic data, limiting online decision-making.
method Developed a new theoretical framework based on PAC-Bayes theory, optimizing empirical risk and parameter divergence.
result Offers both a guarantee of generalized performance and good accuracy.

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.

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.

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.

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.

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.

The algorithmic trading comes from digitalisation of the processing of trading assets on financial markets. Since 1980 the computerization of the stock market offers real time processing of financial information. This technological revolution has offered processes and mathematic methods to identify best return on trans…

2008-10-22abs ↗pdf ↗

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.

Extends expected value framework for cost-sensitive causal decision-making.

problem Optimizing operational decision-making with cost-sensitive causal classification.
method Introduces a cost-sensitive decision boundary based on estimated individual treatment effects, positive outcome probability, and cost parameters.
result Effective in maximizing expected causal profit, outperforming cost-insensitive ranking approach.

FinVision uses LLM agents to predict stock markets by processing various financial data types.

problem Challenges in integrating diverse financial data for accurate stock market prediction.
method Multi-agent framework with LLMs specialized in different financial data types and a reflection module.
result The reflection module enhances decision-making capabilities for financial trading.

Bounded rationality investigates utility-optimizing decision-makers with limited information-processing power. In particular, information theoretic bounded rationality models formalize resource constraints abstractly in terms of relative Shannon information, namely the Kullback-Leibler Divergence between the agents' pr…

2018-09-04abs ↗pdf ↗

Bayesian models quantify uncertainty and facilitate optimal decision-making in downstream applications. For most models, however, practitioners are forced to use approximate inference techniques that lead to sub-optimal decisions due to incorrect posterior predictive distributions. We present a novel approach that corr…

2019-09-11abs ↗pdf ↗

A green simulation-assisted reinforcement learning method for biomanufacturing.

problem Complexity, high variability, lead time, and limited historical data in biopharmaceutical manufacturing.
method Quantifies model risk, uses posterior distribution, and selectively reuses simulation data.
result Demonstrates promising performance in online learning and decision making.