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

Trend · papers per month

120241361481 · Jun 202019922001200920172026
48 results for decision points

The paper corrects bias in fluid approximation for better decision-making in stochastic optimization.

problem Bias introduced by using mean values in fluid approximation leads to suboptimal decisions.
method Identifying a decision-corrected point estimate that yields optimal decisions.
result A corrected point estimate exists under certain conditions and can be computed algorithmically.

A new model predicts spatio-temporal data using adaptive decision trees and point processes.

problem Predicting spatio-temporal data with real-life applications.
method Hawkes process, adaptive decision tree, joint optimization algorithm.
result Significant improvement in predictions compared to standard methods.

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 ↗

Improved reasoning model by sampling from power distribution without additional training.

problem Efficiently sampling from a sharpened distribution to improve reasoning models.
method Entropy-Cut Metropolis-Hastings algorithm that identifies key decision points for resampling.
result The method consistently improves reasoning models across various datasets.

We use flip points to explain and audit deep learning models, revealing decision boundaries and improving model performance.

problem Lack of interpretability in deep learning models hinders their use in important applications.
method Flip points are used to analyze decision boundaries of deep learning models with continuous output scores.
result Flip points reveal the least changes in input that would alter a model's classification, enabling better understanding and improvement of model behavior.

Method constructs prediction intervals for time-varying individual treatment effects.

problem Accurately quantify uncertainty of individual treatment effects across multiple decision points.
method Conformal inference techniques for time-varying ITEs with weaker assumptions.
result Guaranteed lower bound for coverage dependent on data non-exchangeability.

A framework identifies worst-case decision points in safety-critical scenarios, improving risk assessment by 10 hours.

problem Identifying worst-case outcomes in safety-critical decision-making under uncertainty.
method Explicitly estimating distributions of expected return to identify dead-ends, tuning based on risk tolerance.
result Significantly improves risk assessment, providing indications 10 hours earlier and increasing detection by 20%.

This paper tackles noisy multi-objective optimization with adaptive resampling using bootstrapping.

problem Challenges in optimizing noisy multi-objective problems, especially trade-offs between exploration and exploitation.
method Adaptive resampling with bootstrapping to estimate probability of dominance and improve precision.
result Demonstrates the efficiency of the resampling approach in NSGA-II algorithm under multiple noise variations.

Algorithm reduces decision-making errors in multi-agent bandit problems.

problem Minimizing decision errors in multi-agent multi-armed bandit problems.
method RBO-Coop-UCB algorithm with Bayesian change point detection.
result Expected group regret is upper bounded by O(KNMlogT+KMTlogT)\mathcal{O}(KNM\log T + K\sqrt{MT\log T}).

Optimizes portfolio construction using Bayesian methods and variational techniques.

problem Balancing reward and risk in portfolio construction.
method Bayesian decision-theoretic formulation, saddle-point problem, variational Bayes relaxation, efficient algorithm, provable convergence.
result Proves statistical consistency of proposed decision with optimal Bayesian decision.

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.

Generalized change-point detection using various binary models.

problem Discovering changes in time series distribution.
method Direct density ratio estimation with Gradient Boosting over Decision Trees and Neural Networks.
result Proposed methods outperform classical RuLSIF algorithm.

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.

Characterizes preferences for decision-making under uncertainty using a leader-follower game model.

problem Decision-making under uncertainty and ambiguity aversion.
method Characterizes niveloidal preferences through a leader-follower game model, satisfying specific axioms.
result The leader's strategy space can serve as an ambiguity aversion index.

Extends uncertainty detection in neural networks to finer distinctions.

problem Detecting finer distinctions between certain, uncertain, and out-of-distribution points.
method Two-step approach: first builds class distribution using Kernel Activation Vectors, second determines test point confidence.
result Corrects overconfident NN decisions and learns to say 'I don't know' when uncertain.

Evaluates explanations of LTR models using decision paths and compares their accuracy.

problem Challenges in evaluating local explanations of LTR models due to lack of ground truth feature importance scores.
method Focuses on tree-based LTR models, extracts ground truth feature importance scores using decision paths, and compares them with explanation techniques.
result Explanation accuracy varies depending on the model and data point.

While Multiple Instance (MI) data are point patterns -- sets or multi-sets of unordered points -- appropriate statistical point pattern models have not been used in MI learning. This article proposes a framework for model-based MI learning using point process theory. Likelihood functions for point pattern data derived …

2017-03-07abs ↗pdf ↗

New method controls false discoveries in real-time data streams.

problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.

LUQ-Learning adapts Q-learning for healthcare decisions considering patient preferences.

problem Optimizing treatment decisions for multivariate outcomes based on individual preferences.
method Latent Utility Q-Learning (LUQ-Learning) framework that adapts Q-learning for composite outcomes.
result LUQ-Learning achieves highly competitive performance compared to alternative methods in simulations.

Modeling consumption and investment decisions with reference point and drawdown constraints.

problem Modeling consumption and investment decisions with reference point and drawdown constraints.
method Solving a stochastic control problem to derive value function, optimal consumption plan, and investment strategy in semi-explicit forms.
result Five important thresholds of wealth, all as functions of hh, and significant economic implications.

We define the information threshold in Bayesian decision-making.

problem Understanding the optimal amount of information for reliable classification.
method Defining the information threshold as the point of maximum curvature in the prior vs. posterior curve.
result At the information threshold, additional evidence does not significantly improve posterior probability.

Reinforcement learning (RL) methods learn optimal decisions in the presence of a stationary environment. However, the stationary assumption on the environment is very restrictive. In many real world problems like traffic signal control, robotic applications, one often encounters situations with non-stationary environme…

2019-05-10abs ↗pdf ↗

Ensembles of classification and regression trees remain popular machine learning methods because they define flexible non-parametric models that predict well and are computationally efficient both during training and testing. During induction of decision trees one aims to find predicates that are maximally informative …

2012-06-18abs ↗pdf ↗

Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.

problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.

A new method for generating counterfactual explanations in high-dimensional datasets.

problem Creating realistic counterfactual explanations in complex, high-dimensional data.
method A discretized approach using binary search and boundary approximation.
result Our method reduces the distance between counterfactuals by 5% to 50% in terms of the L2 norm.

Paper introduces WWAggr for ensemble CPD, improving accuracy and decision threshold selection.

problem Challenges in detecting abrupt distribution shifts in high-dimensional data streams.
method Introduces WWAggr, a novel task-specific ensemble aggregation method based on Wasserstein distance.
result Demonstrates WWAggr outperforms standard aggregation techniques and decision threshold selection.

Investment decisions can benefit from incorporating an accumulated knowledge of the past to drive future decision making. We introduce Continual Learning Augmentation (CLA) which is based on an explicit memory structure and a feed forward neural network (FFNN) base model and used to drive long term financial investment…

2018-12-06abs ↗pdf ↗

Recent decades have seen an interest in prediction problems for which Bayesian methodology has been used ubiquitously. Sampling from or approximating the posterior predictive distribution in a Bayesian model allows one to make inferential statements about potentially observable random quantities given observed data. Th…

2015-07-22abs ↗pdf ↗

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.

Hidden cost: Smoothing shrinks decision boundaries, affecting class-wise accuracy.

problem The fragility of machine learning models and the need for robustness verification.
method Randomized smoothing approach to achieve statistical robustness.
result Smoothed classifiers' decision boundaries shrink, leading to class-wise accuracy disparity.

DTE uses tree leaf means to embed data, balancing accuracy and speed.

problem High variance in decision tree splits and computational inefficiency of ensembles.
method DTE constructs an interpretable feature representation using leaf means of a trained tree.
result DTE strikes a balance between accuracy and computational efficiency, outperforming ensembles.

Proposes a method to learn from historical data for personalized decision-making.

problem Sample hunger in sequential decision-making algorithms for personalized medicine.
method Identifiable latent bandit framework using nonlinear independent component analysis.
result Optimal decision-making with shorter exploration time than classical bandits.