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

3657311,0961,461 · Jun 202019922001200920172026
48 results for model decision

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.

Paper integrates LLMs into portfolio optimization to improve decision quality.

problem Suboptimal portfolio decisions due to mismatch between prediction and decision quality.
method Integrates LLMs with decision-focused learning, using attention mechanism to process asset relationships and macro variables.
result Model consistently outperforms state-of-the-art deep learning models in portfolio optimization.

CREDO assesses decision optimality under uncertainty without assuming a model.

problem Uncertainty in decision-making without reliable quantification of optimality.
method CREDO uses the inverse feasible region and conformal prediction balls to estimate decision optimality probability.
result CREDO provides accurate, efficient, and reliable evaluations of decision optimality.

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.

VisRuler simplifies decision extraction from bagged and boosted trees.

problem Complexity and lack of interpretability in ensemble models.
method Visual analytics tool for selecting robust models, important features, and essential decisions.
result Users successfully extracted and explained decisions from ensemble models.

This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weights when growing or pruning a decision tree, allowing non-greedy decision tree algorithms to automatically learn and adapt to the ideal arch…

2018-11-26abs ↗pdf ↗

The study analyzes when Bayesian averaging over decision trees is reliable.

problem When do Bayesian model averaging weights over decision trees provide reliable information?
method Closed-form solution for Bayesian decision trees with Catalan-exponential priors.
result Established a complete non-asymptotic theory of rational commitment thresholds.

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.

Meta-learning interpretable decision trees with synthetic data.

problem Lack of efficient, scalable methods for generating synthetic data for decision tree meta-learning.
method Synthetic generation of near-optimal decision trees using the MetaTree transformer architecture.
result Meta-learning of decision trees achieves performance comparable to real-world data or optimal decision trees, with significant computational cost reduction.

In many predictive decision-making scenarios, such as credit scoring and academic testing, a decision-maker must construct a model that accounts for agents' propensity to "game" the decision rule by changing their features so as to receive better decisions. Whereas the strategic classification literature has previously…

2020-02-24abs ↗pdf ↗

Paper develops a framework for learning interpretable representations of sequential decision behavior.

problem Obtaining a transparent description of existing behavior.
method Inverse decision modeling framework, formalizing both forward and inverse problems.
result Learning interpretable representations of behavior, including suboptimal actions, biased beliefs, and imperfect knowledge.

SBAMDT uses adaptive soft splits to model complex decision boundaries.

problem Limited ability of standard decision trees to capture complex decision boundaries.
method Probabilistic additive decision tree model with adaptive soft multivariate splits.
result Demonstrated improved predictive performance on synthetic and real datasets.

Multiverse analysis helps prevent fairness hacking and evaluate model design decisions.

problem Downstream effects of ADM systems depend on implicit design and evaluation decisions.
method Turn implicit decisions into explicit ones, create a grid of decision combinations, compute fairness and performance metrics.
result Decisions regarding evaluation can lead to vastly different fairness metrics for the same model.

Decision stumps accurately screen variables in nonparametric models.

problem Challenges in theoretical properties of tree-based variable importance measures.
method Derive performance guarantees for variable selection using a single-level CART decision tree (decision stump).
result Decision stumps can perform consistent model selection despite being inaccurate for estimation.

GoBOED optimizes experiments for specific decision-making objectives, improving downstream outcomes.

problem Reducing parameter uncertainty does not always improve decision-making in critical settings.
method Combines variational posterior surrogate and differentiable convex decision layer for gradient-based design optimization.
result GoBOED identifies designs that better align with specific decision objectives and reveals wider optimal design windows.

DECE visualizes machine learning decisions with counterfactual explanations.

problem Making machine learning models transparent and explainable.
method Interactive visualization system supporting counterfactual explanations at instance- and subgroup-levels.
result DECE enables users to explore and understand machine learning model decisions.

Proposes a method to speed up model selection for classification.

problem Time-consuming model selection process and lack of dataset-specific insights.
method Relaxes decision boundaries of neural decision trees to find equivalent or better models.
result Reduces the scope of exploration needed for model selection.

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 ↗

Deep learning models have been the subject of study from various perspectives, for example, their training process, interpretation, generalization error, robustness to adversarial attacks, etc. A trained model is defined by its decision boundaries, and therefore, many of the studies about deep learning models speculate…

2019-08-07abs ↗pdf ↗

Study finds users mostly use recent market and decision information to guess market direction.

problem Limited ability to model and predict human decision-making in stock markets.
method Used networks inference with stochastic block models (SBM) to find most predictive model of unobserved decisions.
result Users mostly use recent information to guess market direction, and their decision-making strategies are analogous to behaviors in other contexts.

New research shows machine-assisted decisions can still be unfair even when the algorithm is fair.

problem Ensuring fairness in decisions made with machine-assisted human input.
method Formal model and lab experiment to analyze how machine predictions affect human decisions.
result Excluding information about protected groups from machine predictions can increase disparities.

Prediction models can harm patients even when accurate, leading to self-fulfilling prophecies.

problem Prediction models can lead to harmful decisions that worsen patient outcomes.
method Formal characterization of harmful prediction models and analysis of their impact.
result Well-calibrated models are ineffective for decision-making as they do not change the data distribution.

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.

DVA framework attributes value of predictive models to features, configurations, and interactions.

problem Lack of explanation for how predictive models influence operational decisions.
method Shapley-based cooperative game theory applied to predict-then-optimize systems.
result DVA can guide targeted interventions to align model beliefs with operational performance.

CPR models complex decision processes by breaking them into context-specific policies, improving interpretability and accuracy.

problem Interpreting dynamic human decision-making processes in medical contexts.
method Develops Contextualized Policy Recovery (CPR) framework for multi-task learning, modeling each context-specific policy as a linear map.
result Achieves state-of-the-art performance in predicting medical decisions, closing the gap between interpretable and black-box methods.

Integrating causal machine learning with inherently interpretable models for decision support.

problem Providing causal insights and decision support through machine learning models.
method Proposing an approach that integrates causal machine learning with inherently interpretable models.
result The proposed approach achieves competitive performance in prediction and what-if analysis while offering transparency on the system structure, causal relationships among variables, and functional forms connecting them.

New method learns representations for decision forests using input perturbation.

problem Decision forests struggle with raw structured data and lack effective representations.
method Approximate decision forest gradients through input perturbation.
result Effective representation learning for decision forests without structural changes.

Study optimal investment under imitation of decision-changing rates.

problem Optimal investment under imitation of decision-changing rates.
method Proposed integral disparity to quantify imitation, derived general solution using variational method, analyzed asymptotic properties, validated with real data.
result Investor's optimal decisions under imitation of decision-changing rates.

Enhanced decision-making through Dreamer's anticipatory trajectories and Online Decision Transformer.

problem Efficiently integrating world models with decision transformers.
method Combining Dreamer's trajectory forecasting with Online Decision Transformer's adaptive learning.
result Notable improvements in sample efficiency and reward maximization.

Platform combines RL and language models to study narrative influence on AI decisions.

problem Understanding how narrative elements shape AI decision-making.
method Dual-system architecture with reinforcement learning and language model integration.
result Initial experiments show narrative frameworks can influence AI decision-making.

Models obtained by decision tree induction techniques excel in being interpretable.However, they can be prone to overfitting, which results in a low predictive performance. Ensemble techniques are able to achieve a higher accuracy. However, this comes at a cost of losing interpretability of the resulting model. This ma…

2016-11-17abs ↗pdf ↗

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 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 model for human-machine decision-making with private info and opacity.

problem Optimizing decisions in a human-machine system with private info and opacity.
method Formulated as a two-player learning problem, proved lower and upper bounds on optimality.
result Simple coordination strategy is nearly minimax optimal, efficient learning possible under certain assumptions.

The paper provides a method to minimize regret in estimate-then-optimize decision-making.

problem Errors in estimation lead to sub-optimal decisions in data-driven decision-making.
method A novel bound on regret for smooth and unconstrained optimization problems, followed by experimental design to minimize this regret.
result A general procedure for experimental design to minimize regret resulting from estimate-then-optimize.