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

6291,2571,8862,514 · Jun 202019922001200920172026
48 results for Learning to Defer

This paper evaluates deferring systems using causal inference.

problem Evaluating the impact of deferring systems on model accuracy is challenging.
method The paper uses a causal inference framework to evaluate deferring systems, distinguishing between scenarios with and without access to human predictions.
result The approach allows identifying causal effects of deferring strategies on predictive accuracy.

Framework for deferring decisions to experts in sequential medical settings.

problem Myopic and non-adaptive decision-making by ML models in sequential medical contexts.
method Sequential Learning-to-Defer (SLTD) framework using model-based reinforcement learning.
result Adaptive deferral policy improves trade-off between long-term outcomes and deferral frequency.

New L2D framework allows deferring specific parts of a sequence prediction to experts.

problem Current L2D methods defer entire predictions, which is not ideal for long sequences.
method Proposes token-level and one-time rejectors to defer specific outputs of a model prediction to experts.
result Granular deferrals achieve better cost-accuracy tradeoffs than whole deferrals.

Study on learning to defer with multiple experts using new surrogate losses.

problem Learning to defer with multiple experts in a machine learning context.
method Introducing a new family of surrogate losses for the multiple-expert setting, proving HH-consistency bounds, and designing learning algorithms.
result Explicit guarantees for new learning to defer algorithms based on minimization of these surrogate losses.

A new method for learning to defer decisions with expert advice improves over standard methods.

problem Learning to defer decisions with expert advice in systems where expert information can be modified after selection.
method An augmented surrogate that operates on the composite expert-advice action space, providing consistency guarantees and excess-risk bounds.
result The method improves over standard Learning-to-Defer and adapts its advice acquisition behavior to the cost regime.

Unified framework for deferring queries to top-k experts, improving accuracy-cost trade-offs.

problem Limitation of existing L2D frameworks to single-expert deferral.
method Top-kk Learning-to-Defer framework, including adaptive Top-k(x)k(x) variant.
result Superior accuracy-cost trade-offs with multi-expert deferral.

Study of loss functions for learning to defer, proving consistency.

problem Learning to defer in machine learning.
method Introduced a family of surrogate losses parameterized by ΨΨ and proved their consistency.
result Proved realizable HH-consistency and Bayes-consistency of specific surrogate losses.

Optimized deferral improves accuracy in imbalanced settings.

problem Imbalance in expert predictions leads to suboptimal performance in two-stage learning to defer.
method Developed novel cost-sensitive learning algorithms and margin-based loss functions tailored for expert imbalance.
result MILD algorithm shows clear improvements over baselines in image classification and LLM routing tasks.

Study on learning to defer to multiple experts with consistent surrogates and confidence calibration.

problem Addressing the open problems of consistent surrogates, confidence calibration, and ensembling of experts.
method Derive two consistent surrogates (softmax and OvA) and propose a conformal inference technique for choosing experts.
result The OvA-based loss does not cause mis-calibration propagation, while the softmax-based loss does.

Online L2D algorithm for multiclass classification with varying experts.

problem Handling streaming data, changing expert availability, and shifting expert distribution.
method First online L2D algorithm with O((n+ne)T2/3)O((n+n_e)T^{2/3}) and O((n+ne)T)O((n+n_e)\sqrt{T}) regret guarantees.
result Effective extension of standard L2D to settings with varying expert availability and reliability.

Paper proposes consistent estimators for learning to defer decisions to experts.

problem Learning algorithms often ignore expert decision-making in practical scenarios.
method Reduction to cost sensitive learning, novel surrogate loss for consistent estimation.
result Effective approach demonstrated on various tasks, showing consistency.

New framework improves adversarial robustness in one-stage L2D.

problem Adversarial robustness in one-stage Learning-to-Defer (L2D).
method Formalizes attacks, proposes cost-sensitive adversarial surrogate losses, establishes theoretical guarantees.
result Improves robustness against untargeted and targeted attacks while preserving clean performance.

L2D-CD learns to defer expert recommendations in causal discovery.

problem Combining expert knowledge with data-driven results in causal discovery when expert recommendations may contradict data.
method Adapting learning-to-defer algorithms for pairwise causal discovery, L2D-CD learns a deferral function to select between expert recommendations and data-driven methods.
result L2D-CD outperforms both causal discovery methods and the expert used in isolation, identifying domains where the expert's performance is strong or weak.

The paper optimizes insurance purchases for financial goals.

problem Maximizing probability of achieving financial goals with insurance.
method Analyzes deferred term insurance in deterministic and stochastic frameworks, considering income, consumption, and risky investment.
result Provides optimal insurance and investment strategies for achieving financial goals.

Framework allows systems to defer difficult decisions to unknown experts.

problem Ensuring safety and robustness in autonomous systems with unknown human experts.
method Meta-learning approach that adapts to new experts at test-time using optimization and model-based attention mechanisms.
result Framework can quickly adapt deferral policies to new experts without re-training.

SARD improves adversarial robustness in two-stage L2D systems.

problem Adversarial attacks can manipulate query allocation in two-stage L2D systems.
method Introduces SARD, a convex learning algorithm with provable guarantees.
result SARD significantly improves robustness under adversarial attacks while maintaining strong clean performance.

A new method for multi-expert learning-to-defer avoids optimization issues.

problem Optimization issues in multi-expert learning-to-defer systems.
method A decoupled surrogate with a softmax classifier head and independent sigmoid heads per expert.
result First multi-expert L2D guarantee with a constant not growing with the expert pool.

Multi-expert L2D underfits more severely, requiring new methods.

problem Underfitting in multi-expert L2D settings.
method PiCCE (Pick the Confident and Correct Expert), a surrogate-based method.
result PiCCE effectively reduces multi-expert L2D to a single-expert-like problem, resolving underfitting.

Study on estimating conditional risk in machine learning.

problem Estimating expected loss of prediction models given input features.
method Analyzed in classification and regression settings, showing equivalence to standard regression. Developed theoretical insights and empirical validation.
result Conditional risk calibration is distinct from existing uncertainty quantification problems.

Multistage Defer Trees improve model accuracy while maintaining interpretability.

problem Balancing model accuracy and interpretability, especially in noisy domains.
method A sequence of sparse decision trees that defer predictions to the next tree or a black box.
result Matches the performance of complex tree-based ensembles while using only one or a few sparse trees.

The paper tackles AI advice giving by considering adherence levels and defer options.

problem Inadequate consideration of human adherence to AI recommendations.
method Sequential decision-making model that considers adherence levels and incorporates a defer option.
result Specialized learning algorithms provide better convergence and empirical performance.

A novel framework for regression with multiple experts, addressing challenges in infinite and continuous label spaces.

problem Challenges in regression with multiple experts due to the infinite and continuous nature of the label space.
method Introduces a novel framework for regression with deferral, analyzing both single-stage and two-stage scenarios with new surrogate loss functions.
result Proves HH-consistency bounds for both single-stage and two-stage methods, providing stronger guarantees than Bayes consistency.

The paper optimizes DIA purchase policies using lifecycle models and asset allocation.

problem Determining the optimal allocation to Deferred Income Annuities (DIAs).
method Employed a lifecycle model with utility of consumption and bequest, formalized optimization process, analyzed results, and extended model to include asset allocation.
result Optimal DIA allocation varies based on refundability, asset allocation, and perceived longevity.

A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a non-binary "scoring" classifier that is calibrated over all protected groups, and then to post-process this score to obtain a binary decision. We study the feasibility of achieving vari…

2018-10-03abs ↗pdf ↗

This paper tackles deferral learning with multiple experts, providing strong theoretical guarantees.

problem Optimizing input assignment to experts balancing accuracy and computational cost.
method Introducing new surrogate loss functions and efficient algorithms with strong theoretical learning guarantees.
result Realizable HH-consistency, HH-consistency bounds, and Bayes-consistency for deferral learning.

The paper proposes a method to assess when automated predictions are reliable.

problem Ensuring reliability and safety of automated decision-making in machine learning.
method Clustering to measure distances between outputs and class centroids, defining a safety threshold based on these distances.
result The proposed metric can efficiently determine when automated predictions are acceptable and when they should be deferred.

Improves accuracy and fairness in prediction systems with multiple domain experts.

problem Designing unbiased and accurate deferral systems with multiple experts.
method Proposes a framework for learning a classifier and deferral system that chooses to defer to multiple human experts.
result Significantly improves accuracy and fairness of final predictions compared to baselines.

New framework optimizes deep learning training by deferring large batch sizes to late stages.

problem Optimizing batch size scheduling for deep learning training efficiency.
method Introduced the functional scaling law (FSL) framework to analyze and optimize batch size scheduling.
result Large batch sizes can be deferred to late training stages without sacrificing performance.

We describe Information Forests, an approach to classification that generalizes Random Forests by replacing the splitting criterion of non-leaf nodes from a discriminative one -- based on the entropy of the label distribution -- to a generative one -- based on maximizing the information divergence between the class-con…

2012-02-07abs ↗pdf ↗

HD algorithm simulates dynamics on random matrix ensembles without generating full matrices.

problem Simulating dynamics on dense random matrix ensembles with high space and time complexity.
method Householder reflectors for adaptive and recursive construction, deferring decisions.
result Significant reductions in runtime and memory footprint for practical TnT \ll n.

We use variational Gaussian approximations to analyze parametric models with unknown data-generating distributions.

problem Analyzing inference and learning in parametric models with unknown or intractable data-generating distributions.
method Replica method with variational Gaussian approximation in grand canonical formalism.
result Stationarity conditions adaptively determine parameters of the trial Hamiltonian for each dataset.

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

Deep learning algorithms can fare poorly when the training dataset suffers from heavy class-imbalance but the testing criterion requires good generalization on less frequent classes. We design two novel methods to improve performance in such scenarios. First, we propose a theoretically-principled label-distribution-awa…

2019-06-18abs ↗pdf ↗

LLMs can collude in market divisions, maximizing profits.

problem Strategic collusion of LLM agents in multi-commodity markets.
method Examined LLMs in Cournot competition frameworks, analyzing pricing and resource allocation strategies.
result LLMs can monopolize specific commodities without direct human input or explicit collusion commands.

This is a technical paper, which is a continuation of math.DG/0211159. Here we construct Ricci flow with surgeries and verify most of the assertions, made in section 13 of that e-print; the exceptions are (1) the statement that manifolds that can collapse with local lower bound on sectional curvature are graph manifold…

2003-03-10abs ↗pdf ↗