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

Trend · papers per month

57114171228 · Jun 202019922001200920172026
48 results for operational 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.

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.

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.

NEON uses neural networks to optimize functions in infinite-dimensional spaces.

problem Optimizing composite functions in function spaces.
method NEON (Neural Epistemic Operator Networks) for sequential decision-making.
result NEON achieves state-of-the-art performance with fewer parameters.

Universal algorithm learns unknown distribution for various decision-making problems.

problem Various statistical measures in contextual sequential decision-making.
method Infinite-dimensional functional regression oracle for cumulative distribution functions.
result Utility regret rate bounded by polynomial decay of eigenvalue sequence.

Geometric methods solve sampling, optimisation, inference, and adaptive decision-making.

problem Efficient solutions for sampling, optimisation, inference, and adaptive decision-making.
method Derive algorithms exploiting geometric structures of Hamiltonian systems, Hilbertian subspaces, and information geometry.
result Wide range of geometric theories emerge in these fields, enabling efficient solutions.

Chronological Causal Bandits (CCB) tackles dynamic causal decision-making.

problem Dynamic causal decision-making in a system where rewards depend on past interventions.
method Introduces a new MAB problem (Chronological Causal Bandit) where rewards are influenced by a dynamic causal model.
result Early findings show the CCB can transfer information between sequential MABs.

A softmax operator applied to a set of values acts somewhat like the maximization function and somewhat like an average. In sequential decision making, softmax is often used in settings where it is necessary to maximize utility but also to hedge against problems that arise from putting all of one's weight behind a sing…

2016-12-16abs ↗pdf ↗

This work proposes a way to align statistical modeling with decision making. We provide a method that propagates the uncertainty in predictive modeling to the uncertainty in operational cost, where operational cost is the amount spent by the practitioner in solving the problem. The method allows us to explore the range…

2011-12-03abs ↗pdf ↗

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.

Non-parametric bootstrap improves robust portfolio and trading strategy optimization.

problem Mitigating uncertainty in expected returns and covariances in financial decision-making.
method Non-parametric bootstrap framework for robust optimization without distributional assumptions.
result Improved out-of-sample performance with smoother, more stable results.

Ensuring secure and reliable operations of the power grid is a primary concern of system operators. Phasor measurement units (PMUs) are rapidly being deployed in the grid to provide fast-sampled operational data that should enable quicker decision-making. This work presents a general interpretable framework for analyzi…

2019-11-14abs ↗pdf ↗

New approach to fairness in machine learning models using conformal prediction.

problem Fairness in machine learning models' downstream decision-making.
method Theoretical derivation and empirical evaluation of label-clustered conformal prediction.
result Label-clustered conformal prediction often provides a favorable balance between utility and substantive fairness.

Deep neural networks (DNNs) may outperform human brains in complex tasks, but the lack of transparency in their decision-making processes makes us question whether we could fully trust DNNs with high stakes problems. As DNNs' operations rely on a massive number of both parallel and sequential linear/nonlinear computati…

2019-09-29abs ↗pdf ↗

LemonadeBench evaluates LLMs' economic intuition through a simulated lemonade stand.

problem Evaluating LLMs' economic understanding and decision-making in simple markets.
method Simulated lemonade stand business to test LLMs' long-term planning and profit maximization.
result Models achieve profitability but exhibit local rather than global optimization.

This work improves neural network trustworthiness through uncertainty estimation.

problem Overconfident neural networks lead to poor performance under distribution shifts.
method Develops a general uncertainty framework for neural networks, including classification with rejection.
result Improves model trustworthiness and robustness in decision-making tasks.

Paper proposes a risk-aware decision-making framework for real-world sequential decisions.

problem Real-world sequential decision-making problems often have critical constraints that learning solutions often neglect.
method Actor multi-critic architecture with risk characterization.
result Our approach consistently satisfies system constraints with minimal performance toll.

Generative models help make decisions under changing data distributions.

problem Making decisions based on historical data when the actual data distribution changes.
method Flow- and score-based generative models to represent and transform distributions.
result Generative models can learn nominal uncertainty, create stressed distributions, and produce conditional distributions.

The study quantifies decision-making risks from suboptimal classifiers and proposes methods to reduce these risks.

problem Excess risk in decision-making from suboptimal probabilistic classifiers.
method Analytical expressions and upper/lower bounds for excess risk, calibration curve estimation, grouping loss estimator.
result Identifies regimes where recalibration alone or post-training is more effective.

The paper proposes a new method for creating interpretable models using convex optimization.

problem Creating models that are both accurate and interpretable for decision-making.
method Formulates convex learning problems that combine interpretability with accuracy, using operator theory and parametric nonlinear models.
result Shows how to create efficient surrogate models that are both accurate and interpretable.

New risk measure and quadrangle improve financial decision-making.

problem Heterogeneous risk assessments among analysts.
method Established analytical characterizations of WGRM and incorporated FRQ into WRQ.
result WGRM and WRQ framework improves risk-adjusted performance and downside resilience.

This study aims to predict vessel stay and delay times at ports to optimize logistics.

problem Uncertainties in maritime logistics, including weather, cargo diversity, and port dynamics, lead to increased costs and inefficiencies.
method Developed predictive analytics to address shortcomings in previous works, using feature analysis and SHAP explanations.
result Predictive analytics can assist in efficient planning and scheduling of port operations, reducing costs and improving logistics.

New framework uses OR to ensure AI systems make safe decisions.

problem Ensuring generative AI systems make safe decisions as they gain autonomy.
method Developed a conceptual framework combining flow-based models and adversarial robustness.
result Increased autonomy requires new OR approaches for feasibility, robustness, and stress testing.

Paper introduces probabilistic digital twins for optimal decision making under uncertainty.

problem Optimal sequential decision making under incomplete and uncertain information.
method Formal definition of epistemic uncertainty using measure theory, and solution via deep reinforcement learning.
result Proposes a generic approximate solution for optimal sequential decision making.

Paper identifies a shared toolkit of strategies for risk management across fields.

problem Uncertainty and risk management in various fields.
method Systematic identification and categorization of 110 strategies.
result RDOT: Risk-reducing Design and Operations Toolkit provides versatile responses to uncertainty.

Study optimizes portfolio allocation policies using off-policy data and constraints.

problem Optimizing portfolio allocation policies under constraints using off-policy data.
method Solves a minimax objective with off-policy estimators and online learning to control constraint violations.
result Constructs near-optimal allocation policies for various regimes of operation and constraints.

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.

Framework infers Langevin dynamics from stochastic observations of latent systems.

problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.

Many decision-making problems naturally exhibit pronounced structures inherited from the characteristics of the underlying environment. In a Markov decision process model, for example, two distinct states can have inherently related semantics or encode resembling physical state configurations. This often implies locall…

2019-09-11abs ↗pdf ↗

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.

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

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.