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.

169,341 papers · 148 categories

Trend · papers per month

1.2%2.4%3.6%4.8% · Nov 199519922001200920182026
48 results for external decision-makers

A framework for automated models to defer decisions to external decision-makers to improve accuracy and fairness.

problem Improving fairness and accuracy in systems with multiple decision-makers.
method Two-stage framework with learning to defer, considering external decision-makers' biases.
result Learning to defer can make systems more accurate and less biased, even with inconsistent or biased users.

Algorithm reduces long-term policy regret in ML decision-making.

problem Capturing long-term impacts of ML decisions in communities.
method Modeling communities as arms in a multi-armed bandit problem, defining policy regret as a stronger metric than external regret.
result Algorithm achieves provably sub-linear policy regret for long time horizons.

New research shows strategic classification harms individuals and society.

problem Strategic behavior in decision-making leads to unfair outcomes.
method Introducing a social burden metric, the study quantifies the negative externalities of strategic classification.
result Any increase in institutional utility leads to a corresponding increase in social burden.

The paper addresses the difficulty of decision makers trusting AI-assisted predictions and proposes a method to improve confidence values.

problem Decision makers struggle to trust AI-assisted predictions based on confidence values.
method The paper investigates why decision makers have difficulties and proposes a method to construct more useful confidence values.
result Multicalibration with respect to the decision maker's confidence on her own predictions is a sufficient condition for alignment, leading to better decisions.

Study shows it's hard to detect when a decision-maker fakes fairness using a specific sampling technique.

problem Detecting when decision-makers fake fairness using auditing tools.
method Developed a stealthily biased sampling algorithm to construct deceptive benchmark datasets.
result The constructed deceptive datasets are difficult to detect, making it hard to avoid fake fairness.

We investigate how the choice of decision makers can be varied under the presence of risk and uncertainty. Our analysis is based on the approach we have previously applied to individual decision makers, which we now generalize to the case of decision makers that are members of a society. The approach employs the mathem…

2014-09-02abs ↗pdf ↗

A principle for specialized decision-making divides complex problems into manageable parts.

problem Complex decision-making problems beyond individual capabilities.
method An on-line learning rule that learns a partitioning of the problem space for specialized linear policies.
result The approach solves problems that exceed individual decision-makers' capabilities.

This paper uses a diffusion model to forecast electrical loads with uncertainty.

problem Uncertainties in electrical load forecasting due to renewable energy and external events.
method Diffusion-based Seq2Seq structure for epistemic uncertainty and robust additive Cauchy distribution for aleatoric uncertainty.
result Ability to separate and quantify both types of uncertainties in load forecasting.

We consider an adversarial online learning setting where a decision maker can choose an action in every stage of the game. In addition to observing the reward of the chosen action, the decision maker gets side observations on the reward he would have obtained had he chosen some of the other actions. The observation str…

2011-06-13abs ↗pdf ↗

Online learning framework for inverse optimization improves decision-making in noisy data.

problem Real-time decision-making with noisy data and limited historical information.
method Developed an online learning algorithm with implicit update rule for noisy data.
result Algorithm converges at O(1/T)\mathcal{O}(1/\sqrt{T}) rate and is statistically consistent.

The paper presents algorithms to learn decision-maker's objective function from observed data.

problem Learning the objective function of a decision-maker from observed data and decisions.
method Online learning algorithms for inverse optimization with convergence rate O(1/T) \mathcal{O}(1/\sqrt{T}) .
result The algorithms allow decisions as good as the observed decision-maker's after few iterations.

Develops optimal uncertainty quantification for risk-averse decision makers.

problem Quantifying prediction uncertainty for risk-sensitive domains.
method Decision-theoretic foundations connecting uncertainty quantification with risk-averse decision-making.
result Risk-Averse Calibration (RAC) algorithm provides optimal prediction sets for risk-averse decision makers.

New algorithms optimize decision rules in strategic scenarios, minimizing prediction risk and incentivizing better outcomes.

problem Strategic agents manipulate features to improve outcomes, complicating decision-making models.
method Efficient algorithms for learning decision rules that minimize prediction risk, incentivize better outcomes, and estimate true model coefficients.
result Optimal decision rules can be learned through testing and observing agent responses, circumventing hardness results.

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.

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

Paper tackles non-monotonic resource utilization in sequential decision-making.

problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.

Bayesian inference reconstructs external potentials in DFT for many-particle systems.

problem Reconstructing external potentials in classical density-functional theory (DFT) for many-particle systems.
method Combines Bayesian inference with classical DFT to probabilistically reconstruct external potentials.
result Accurately infers external potentials and density profiles with uncertainty quantification.

We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference between her realized loss and the best loss she would have achieved by picking, in hindsight, the best possible action. Our goal is to unde…

2012-04-20abs ↗pdf ↗

Optimized model tackles global industrial externalities in non-OECD countries.

problem Analyzing and mitigating externalities from pollution, agriculture, and energy industries in non-OECD countries.
method Integrated systems modeling approach combining fiscal, monetary policies and incentives for cooperative behavior.
result Proposes an optimized solution to internalize externalities in non-OECD countries.

Proposes a method to use external machine-learning predictions in multinomial logistic regression.

problem Improving statistical inference using summary-level external machine-learning predictions.
method Empirical-likelihood framework incorporating moment constraints from external nonparametric machine-learning predictions.
result Fused estimator achieves strict efficiency gain over primary-only estimator under mild conditions.

Study resource allocation strategies in sequential decisions with unknown rewards.

problem Sequential resource allocation with unknown rewards.
method Design combinatorial multi-armed bandit algorithms for discrete or continuous budgets.
result Prove algorithms achieve logarithmic cumulative regret under semi-bandit feedback.

Bayesian method helps decision-makers find preferred solutions in multi-objective optimization.

problem Identifying preferred solutions from the Pareto set in multi-objective optimization problems.
method Bayesian model to estimate decision-maker's utility function based on pairwise comparisons, guided by a principled elicitation strategy.
result Superior performance in finding high-utility solutions with a small number of queries.

The maximum entropy principle can be used to assign utility values when only partial information is available about the decision maker's preferences. In order to obtain such utility values it is necessary to establish an analogy between probability and utility through the notion of a utility density function. According…

2007-09-05abs ↗pdf ↗

Study robust control for systems with continuous states using adversarial perturbations.

problem Fragile policies in Markov control models under internal or external perturbations.
method Distributionally robust stochastic control with adaptive adversarial perturbations.
result Optimal robust policies for continuous state systems with uniform learning guarantees.

New estimator improves ATT estimation efficiency with external controls.

problem Reduced efficiency when incorporating external controls into ATT estimation.
method Proposes a novel doubly robust estimator for ATT that maintains higher efficiency than standard approaches.
result Demonstrates improved efficiency of the new estimator compared to standard approaches, even under model misspecification.

Method estimates model performance on external samples from limited statistical characteristics.

problem Limited access to multiple datasets due to privacy and commercial restrictions.
method Search for weights that match external statistics and are closest to uniform, using model performance on weighted internal sample as an estimation.
result Estimated external performance is closer to actual performance than internal performance.

The study assesses external validity by evaluating worst-case treatment effects across subpopulations.

problem Underrepresentation of marginalized groups and limited study populations.
method Develops a semiparametrically efficient estimator for worst-case treatment effects (WTE) and uses cross-fitting to guard against brittle findings.
result The proposed framework guards against invalid findings due to unanticipated population shifts.

A method for logistic regression inference using both internal and external data.

problem Inability to estimate intercept and marginal case proportion in case-control logistic regression.
method Empirical likelihood approach integrating internal and external data.
result Intercept parameter becomes identifiable with external information, and all parameters are estimable consistently.

We discuss multi-task online learning when a decision maker has to deal simultaneously with M tasks. The tasks are related, which is modeled by imposing that the M-tuple of actions taken by the decision maker needs to satisfy certain constraints. We give natural examples of such restrictions and then discuss a general …

2009-02-20abs ↗pdf ↗

Study examines remittances in Nepal, linking external demand and domestic monetary conditions.

problem Understanding the dynamics of remittances in Nepal's economy.
method Constructed composite indices via PCA for external demand and domestic monetary conditions. Used ARDL, cointegration, DOLS, ECM, and machine learning for analysis.
result Strong positive long-run effect of external demand on remittances, significant negative impact of tighter domestic monetary conditions.

New measure of policy regret shows compatibility with traditional external regret in adversarial games.

problem Incompatibility between traditional and new policy regret measures in adaptive adversaries.
method Revisited policy regret and compared it with external regret; introduced policy equilibrium.
result Policy regret and external regret are compatible in adversarial games.

New algorithm BE reduces regret in bandit learning with positive externalities.

problem Self-reinforcing user preferences in platforms lead to suboptimal performance in bandit learning.
method Developed Balanced Exploration (BE) algorithm and an adaptive variant.
result BE and adaptive BE achieve optimal asymptotic regret in bandit learning with positive externalities.

Framework for estimating treatment effects using external control data.

problem Improving efficiency in estimating average treatment effects (ATE) in hybrid trials.
method Developed a formal causal inference framework based on exchangeability assumptions and graphical criteria. Proposed estimators and efficient doubly-robust methods.
result Established finite-sample performance and demonstrated application to spinal muscular atrophy trial.

Algorithm learns RBMs with arbitrary external fields, improving on previous constraints.

problem Learning RBMs with arbitrary external fields, improving on previous constraints.
method Greedy algorithm that maximizes covariance between observed nodes sharing latent neighbors.
result Algorithm can learn RBMs with arbitrary external fields, improving on previous constraints.