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,695 papers · 148 categories

Trend · papers per month

111221332442 · Jun 202019922001200920172026
48 results for Risk-Based Decision Making

The paper addresses sampling bias in risk-based active learning.

problem Sampling bias in active learning leads to poor decision-making performance.
method The paper uses a semi-supervised Gaussian mixture model with an EM algorithm to counteract sampling bias.
result The EM algorithm effectively incorporates pseudo-labels for unlabelled data, reducing sampling bias.

Proposes a method to quantify uncertainty in DNN models for discrete inputs.

problem Uncertainty quantification for DNN models with categorical and discrete feature variables.
method Develops a mathematical framework to quantify prediction uncertainty from discrete input noise and model parameters.
result Identifies risk-sensitive cases prone to misclassification due to discrete predictor errors.

GAICF proposes a framework for governing generative AI in banking.

problem Generative AI's impact on financial decision-making and governance.
method SR 26-2-compatible governance framework for generative AI applications.
result GAICF aligns generative AI practices with SR 26-2 supervisory expectations.

GAICF proposes a framework for managing generative AI risks in banking.

problem Generative AI's impact on financial decision-making and governance.
method SR 26-2-compatible governance framework for generative AI.
result GAICF aligns generative AI practices with SR 26-2 supervisory expectations.

The paper studies risk-based prices in financial markets under volatility uncertainty.

problem Risk-based indifference prices in financial markets under volatility uncertainty.
method Asymptotic analysis of risk-based prices in discrete-time financial markets.
result Risk-based prices form a strongly continuous convex monotone semigroup.

A major source of risk in project management is inaccurate forecasts of project costs, demand, and other impacts. The paper presents a promising new approach to mitigating such risk, based on theories of decision making under uncertainty which won the 2002 Nobel prize in economics. First, the paper documents inaccuracy…

2013-02-14abs ↗pdf ↗

A new game-theoretic approach balances downside risk with expected reward.

problem Traditional game theory views risk only from the upside perspective, ignoring downside risk.
method Introduces downside risk aware equilibria (DRAE) based on lower partial moments.
result Successfully finds equilibria that balance downside risk with expected reward.

Optimizes insurance pricing by accounting for policyholders' price sensitivity.

problem Traditional insurance pricing does not consider policyholders' price sensitivity.
method Formulates insurance pricing as a decision-making problem and uses off-policy evaluation and stochastic control.
result Neural networks outperform existing techniques for policy optimization.

AACE learns treatment policies from EHRs using annotations to improve accuracy.

problem Learning treatment policies from multimodal EHRs with bias and inefficiency.
method Annotation-assisted coarsened effects (AACE) method.
result AACE outperforms existing methods in predicting treatment benefit from multimodal EHRs.

We advocate the use of Agnostic Allocation for the construction of long-only portfolios of stocks. We show that Agnostic Allocation Portfolios (AAPs) are a special member of a family of risk-based portfolios that are able to mitigate certain extreme features (excess concentration, high turnover, strong exposure to low-…

2019-06-12abs ↗pdf ↗

Risk-only investment strategies have been growing in popularity as traditional in- vestment strategies have fallen short of return targets over the last decade. However, risk-based investors should be aware of four things. First, theoretical considerations and empirical studies show that apparently dictinct risk-based …

2013-06-29abs ↗pdf ↗

This work tackles maintenance planning with deep reinforcement learning under uncertainty.

problem Optimizing inspection and maintenance policies in deteriorating environments with incomplete information and constraints.
method Joint framework of constrained POMDPs and multi-agent DRL addressing challenges of state/action space, history, uncertainty, and constraints.
result The proposed framework outperforms existing methods in resource and risk-aware decision-making.

This paper proposes a deep learning model combining CNN and Transformer for improved credit default prediction.

problem Traditional machine learning models struggle with complex financial data and risk patterns.
method Combines CNN for local feature extraction and Transformer for global dependency modeling.
result The CNN+Transformer model outperforms traditional models in accuracy, AUC, and KS value.

AI systems need reliable testing to ensure safety and trustworthiness.

problem Current AI Act lacks functional trustworthiness for AI systems.
method Define technical application distribution, set risk-based performance, and conduct statistically valid testing.
result Reliable functional trustworthiness is essential for AI systems.

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.

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.

MPM uses machine learning to switch between two portfolio strategies for better risk management.

problem Adaptive portfolio strategy selection for improved risk management.
method XGBoost learns to switch between HRP and NRP strategies.
result MPM outperforms both HRP and NRP in risk-reward profile and interpretability.

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.

This study improves audit sampling by using sequential procedures with statistical guarantees.

problem Improving audit efficiency and reliability with statistical methods.
method Formulated as a sequential testing problem, defining null and alternative hypotheses, stopping and decision rules, and exact boundary conditions.
result Exact design yields ex ante control of decision error probabilities, and simulation-based implementation approximates this design.

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.

Decision making based on behavioral and neural observations of living systems has been extensively studied in brain science, psychology, and other disciplines. Decision-making mechanisms have also been experimentally implemented in physical processes, such as single photons and chaotic lasers. The findings of these exp…

2018-04-12abs ↗pdf ↗

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.

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.

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.

Paper offers a fast convergence theory for offline decision making.

problem Offline decision making problems, including reinforcement learning and off-policy evaluation.
method Introduces a framework (DMOF) and algorithm (EDD) with a fast convergence guarantee.
result Demonstrates a fast convergence guarantee with a lower bound complement.

New bounds show complexity of adversarial decision making.

problem Understanding sample efficiency in adversarial decision making.
method New upper and lower bounds on Decision-Estimation Coefficient.
result Decision-Estimation Coefficient is necessary and sufficient for low regret in adversarial decision making.

Bayesian decision theory outlines a rigorous framework for making optimal decisions based on maximizing expected utility over a model posterior. However, practitioners often do not have access to the full posterior and resort to approximate inference strategies. In such cases, taking the eventual decision-making task i…

2019-02-02abs ↗pdf ↗

Improved model-free reinforcement learning with decision-estimation coefficient.

problem Interactive decision making, including structured bandits and reinforcement learning.
method Combining Estimation-to-Decisions with optimistic estimation to achieve better regret bounds.
result Regret bounds for model-free reinforcement learning with value function approximation.

New method learns decisions from collective preferences without individual covariates.

problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.

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.

A new fairness metric for decision-making algorithms, conditioning on known fair variables.

problem Fairness issues in decision-making systems.
method Conditional fairness metric, Derivable Conditional Fairness Regularizer (DCFR), adversarial representation.
result Traditional fairness notations are special cases of the new conditional fairness notation.