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

52103155206 · Jun 202019922001200920172026
48 results for uncertain decisions

IDT learns human preferences from uncertain decisions, even when humans are suboptimal.

problem Learning human preferences from uncertain and suboptimal decisions.
method Inverse decision theory (IDT) framework, statistical analysis of IDT, characterizing sample complexity.
result Learning preferences is easier when decisions are more uncertain, even if humans are suboptimal.

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.

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

Framework for games with uncertain parameters, ensuring no player can improve by changing strategy.

problem Non-cooperative games with globally uncertain parameters and no common prior.
method Mixed strategies and subjective priors, Extended Equilibrium defined by fixed-point argument.
result Existence of Extended Equilibrium under certain conditions.

Optimizes decision-making with uncertain variables using auxiliary observations.

problem Contextual stochastic optimization problems with uncertain variables and rich auxiliary observations.
method Trains forest decision policies by growing trees that optimize downstream decision quality, using optimization perturbation analysis for efficient approximations.
result Proves asymptotic optimality and empirical validation of the method's performance and efficiency.

Develops a framework for quantifying agentic AI model risk using LLM-inferred Bayesian state filters.

problem Quantifying the risk of agentic AI systems due to uncertain beliefs and actions.
method Representing the system as a partially observed Markov decision process with latent states, Bayesian belief updates, control-dependent losses, and tail-risk functionals.
result Develops a rigorous framework for separating uncertainty quantification from risk measurement.

Study preferences over uncertain time payments, finds growth-optimality better than expected utility theory.

problem Understanding how people make decisions with uncertain timing of payments.
method Normative model of growth-optimality, revisiting experimental evidence on time lotteries.
result Growth-optimality better explains experimental data on time lotteries than expected discounted utility theory.

The paper tackles uncertainty in multi-objective decision-making.

problem Learning Pareto-efficient decisions with statistical confidence in uncertain outcomes.
method Adapting Pareto-efficient decisions to uncertainty, using conformal prediction.
result Statistical guarantees for efficient decisions in uncertain contexts.

MCU-Net combines U-Net and Monte Carlo Dropout for uncertainty in medical image segmentation.

problem Lack of uncertainty representation in deep learning methods for patient-centered healthcare decisions.
method MCU-Net framework using U-Net and Monte Carlo Dropout with four uncertainty metrics.
result MCU-Net maximizes automated performance and refers truly uncertain cases.

The paper tackles mean-variance analysis in Bayesian optimization under uncertainty.

problem Optimizing decisions in uncertain environments considering trade-offs between average and variance of risk.
method Developed bounds for mean and variance risk measures in Gaussian Process models and proposed AL algorithms for multi-task, multi-objective, and constrained optimization scenarios.
result Proposed AL algorithms effectively address the mean-variance trade-off in uncertain optimization scenarios.

Novel framework for risk-sensitive reinforcement learning using martingale decomposition.

problem Risk sensitivity in sequential decision-making with uncertain rewards.
method Martingale decomposition and chaotic variation for reward uncertainty, integrated into model-free reinforcement learning algorithms.
result Demonstrated relevance of risk-sensitive reinforcement learning in grid world and portfolio optimization problems.

Paper proposes online optimization for uncertain systems using machine learning and DRO.

problem Optimization of uncertain dynamical systems with distributional uncertainty.
method Combines machine learning with Distributional Robust Optimization (DRO) to handle uncertainty.
result Online solutions with probabilistic regret bounds for uncertain systems.

A method for dynamic portfolio choice with uncertain parameters using Pontryagin projection.

problem Continuous-time CRRA portfolio choice in markets with estimated and uncertain coefficients.
method Simulation-based two-stage solver (DPO + Pontryagin projection) to maximize ex-ante objective.
result Projection stabilizes learning and accurately recovers analytic decisions, improving over model-free PPO.

New algorithm solves uncertain Markov decision processes using Wasserstein uncertainty.

problem Solving Markov decision processes with uncertain transition probabilities.
method Distributionally robust QQ-learning algorithm for Wasserstein uncertainty.
result Convergence of the algorithm proved and demonstrated with real data.

This study investigates how Decision-Focused Learning improves stock return predictions for better portfolio optimization.

problem The challenge of precise expected returns estimation in mean-variance optimization.
method Investigates Decision-Focused Learning (DFL) to adjust stock return prediction models for MVO.
result DFL tilts prediction errors by the inverse covariance matrix, leading to systematic prediction biases in portfolio optimization.

Study on learning strategies in matching markets with uncertain preferences.

problem Decision-making in scarcity of shared resources with unknown agent preferences.
method Representation of preferences in a reproducing kernel Hilbert space, learning algorithm for uncertainty.
result Optimal strategies derived to maximize agents' expected payoffs, with stability and fairness properties.

A new method for decision-focused learning reduces computational cost.

problem Efficiently solving combinatorial problems with uncertain parameters.
method Reframed as cost-sensitive multi-output regression, with novel loss components.
result Comparable downstream task quality with reduced computational cost.

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.

TIP-Search optimizes market prediction accuracy and timeliness under uncertain load.

problem Real-time market prediction requires accurate predictions before a deadline.
method Filters feasible models, dispatches workers, trades accuracy for deadline risk.
result Optimized pool achieves 0.991 timely accuracy and 0.994 raw accuracy.

Develops new methods for risk-aware decision-making in medical bandits.

problem Risk-averse decision-making in medical contexts with limited data.
method Safe, anytime-valid concentration bounds, risk-aware contextual bandits, nonparametric algorithms.
result Improved decision-making algorithms for postoperative patient follow-up.

Paper proposes efficient method for estimating risk measures in complex models.

problem Accurately estimating distortion risk measures in computationally expensive models.
method Integrates importance sampling and machine learning for efficient Monte Carlo estimation.
result Demonstrates significant reduction in computational cost for estimating risk measures.

Existing uncertainty modeling approaches try to detect an out-of-distribution point from the in-distribution dataset. We extend this argument to detect finer-grained uncertainty that distinguishes between (a). certain points, (b). uncertain points but within the data distribution, and (c). out-of-distribution points. O…

2020-02-11abs ↗pdf ↗

Study integrates machine learning with SAA for optimizing decisions based on uncertain parameters and covariates.

problem Optimizing decisions under uncertain parameters and covariates.
method Data-driven frameworks integrating machine learning prediction models within SAA for scenario generation.
result Consistent and asymptotically optimal solutions under certain conditions, with finite sample guarantees.

Diffusion approximations optimize sequential experimentation for uncertain parameters.

problem Maximizing reward from unknown parameter Θ with delayed action.
method Bayesian sequential experimentation framework, dynamic programming, diffusion asymptotics.
result Derives diffusion approximation for optimal experimentation strategy.

The paper tackles robust design selection for online experiments under uncertain interference mechanisms.

problem Designing experiments in ads, recommendations, and member-experience systems when interference mechanisms are unknown.
method Formulates the problem as robust design selection over uncertain exposure mechanisms. Compares designs by worst-case planning risk over an ambiguity set combining various factors.
result Develops a geometry-aware guarantee and robust selector theorem with excess-risk control, exact recovery under separation, and certified shortlists when the risk surface is flat.

New bounds assess policy evaluation under unobserved confounders, showing model-based methods are more effective.

problem Policy evaluation under unobserved confounders in uncertain causal environments.
method Developed worst-case bounds for sensitivity to unobserved confounders, demonstrating model-based methods are more effective.
result Model-based approaches with robust MDPs provide sharper lower bounds for policy evaluation.

In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift ambiguity for one-dimensional diffusion processes. Analogously to the case of ordinary o…

2011-10-18abs ↗pdf ↗

Framework for responsible LLM deployment with human involvement and decentralized technologies.

problem Challenges in deploying LLMs for high-stakes decisions, including data security and accountability.
method Interactive human involvement through multiple iterations, decentralized technologies, and automated auditing.
result Enhanced security and accountability in LLM deployment for financial decisions.

The paper explores how to handle uncertain evidence in probabilistic models.

problem Handling uncertain evidence in probabilistic models and stochastic simulators.
method The paper considers distributional evidence, Jeffrey's rule, and virtual evidence as methods for interpreting uncertain evidence.
result The paper provides guidelines on how to account for uncertain evidence and highlights the importance of careful consideration.

A new method sorts projects using Quicksort and Bradley-Terry model for uncertain long-term benefits.

problem Selecting projects with uncertain long-term benefits.
method Combining Quicksort and Bradley-Terry model for ranking projects based on uncertain long-term benefits.
result Proposed methods outperform existing aggregation methods and can be combined with sampling techniques.

In this paper, within the framework of uncertainty theory, the valuation of equity warrants is investigated. Different from the methods of probability theory, the equity warrants pricing problem is solved by using the method of uncertain calculus. Based on the assumption that the firm price follows an uncertain differe…

2017-11-22abs ↗pdf ↗

The Surprise index assesses autonomous systems' competency in uncertain environments.

problem Evaluating competency of autonomous systems in dynamic, uncertain environments.
method Surprise index, a measure that quantifies system performance based on available data.
result The Surprise index can be computed for dynamic systems with Gaussian marginal distributions.