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

161323484645 · Jun 202019922001200920172026
48 results for Adaptive Decision Making

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.

PDTS improves robustness in sequential decision-making.

problem Robust active task sampling for efficient and reliable decision-making.
method Characterizes robust active task sampling as a Markov decision process, proposes PDTS method.
result Significantly improves zero-shot and few-shot adaptation robustness.

FinHEAR combines LLMs with human expertise for better financial decision-making.

problem Challenges in financial decision-making for language models.
method Multi-agent framework with specialized LLMs for historical analysis, event interpretation, and expert retrieval.
result FinHEAR outperforms baselines in financial tasks with higher accuracy and risk-adjusted returns.

LinearAPT optimizes decision-making under resource constraints for a linear threshold problem.

problem Optimizing sequential decisions with a linear threshold under resource limitations.
method LinearAPT, an adaptive algorithm for fixed-budget TLB problem.
result LinearAPT achieves theoretical upper bounds and robust performance on various datasets.

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 approach tackles decision-making under predictions that shape outcomes.

problem Challenges in learning optimal decision rules when predictions influence outcomes.
method Introduces performative omniprediction, a predictor that encodes optimal decision rules for multiple objectives.
result Efficient performative omnipredictors exist under a natural restriction of outcome performativity.

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.

ATLAS uses LLMs to adaptively trade by optimizing prompts and coordinating agents.

problem Adapting LLMs for real-time financial decision-making in noisy markets.
method ATLAS integrates structured market data, uses Adaptive-OPRO for prompt optimization, and employs multi-agent coordination.
result Adaptive-OPRO consistently outperforms fixed prompts in financial trading.

New complexity measure for interactive learning reduces regret to near-optimal levels.

problem Challenges in sample-efficient, adaptive learning algorithms for interactive decision making.
method Introduces the Decision-Estimation Coefficient and the Estimation-to-Decisions (E2D) principle.
result Unified algorithm design principle E2D achieves optimal sample-efficient learning.

Adaptive spectral RL method enhances RL performance and interpretability.

problem Balancing interpretability and performance in reinforcement learning.
method Spectral based linear RL approach with adaptive regularization.
result Near-optimal bounds for parameter estimation and generalization error.

This work advances collaborative decision making by combining human and AI strengths in uncertainty quantification.

problem Current AI lacks robust decision-making capabilities under uncertainty, especially in high-stakes contexts.
method Introduces Human AI Collaborative Uncertainty Quantification (HACUQ) framework, formalizing AI-human collaboration and developing calibration algorithms.
result Optimal collaborative prediction sets follow a two-threshold structure, and online adaptation algorithms can adapt to evolving human behavior.

New online method for statistical inference with matrix context in decision-making.

problem Statistical inference in decision-making with matrix context.
method Proposes a fully online procedure to conduct statistical inference with adaptive data collection, handling low-rank structure.
result Establishes asymptotic normality of debiased estimators and proves validity of confidence intervals.

The paper tackles uncertainty in multi-objective decision-making.

problem Learning Pareto-efficient decisions with statistical confidence in uncertain outcomes.
method Adapting Pareto-efficient decisions to uncertainty, using conformal prediction.
result Statistical guarantees for efficient decisions in uncertain contexts.

DAD learns to design experiments quickly, outperforming traditional methods.

problem Real-time decision-making in sequential Bayesian experimental design.
method Amortized design network trained with contrastive information bounds.
result DAD outperforms alternative strategies on various problems.

Develops adaptive algorithms for sustainable fertilizer use in agriculture.

problem Sustaining high yields while reducing environmental impacts of fertilizer use.
method Nonlinear model-based bandit algorithms linking biological processes to decision-making.
result Faster learning and higher profits with interpretable recommendations.

In many machine learning applications, one needs to interactively select a sequence of items (e.g., recommending movies based on a user's feedback) or make sequential decisions in a certain order (e.g., guiding an agent through a series of states). Not only do sequences already pose a dauntingly large search space, but…

2019-02-15abs ↗pdf ↗

SPARKLE handles high-dimensional covariates for online decision-making.

problem Complex reward-covariate relationships in high-dimensional settings.
method SPARKLE uses a sparse additive reward model with doubly penalized estimator and adaptive screening.
result SPARKLE achieves sublinear regret bound logarithmic in covariate dimensionality.

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.

Ant colonies and boosting algorithms both reduce bias and variance through adaptive mechanisms.

problem Understanding the mathematical principles behind ensemble learning and ant colony behavior.
method Developed a formal mapping between AdaBoost's adaptive reweighting and ant recruitment dynamics.
result Proved that the fundamental theorem of weak learnability has a direct analog in colony decision-making.

New algorithm improves online decision making by adaptively inferring arm rewards.

problem Adaptive selection of arms in MAB leads to non-iid data, complicating accurate inference.
method Proposes a doubly adaptive TS algorithm that leverages causal inference for adaptive reweighting.
result Demonstrates superior empirical performance in identifying the best arm compared to UCB and TS.

The paper explores how different loss functions impact reinforcement learning algorithms.

problem Improving reinforcement learning algorithms by optimizing loss functions.
method Comprehensive survey on loss functions in reinforcement learning, proving the benefits of specific loss functions.
result Binary cross-entropy loss leads to first-order bounds and is more efficient than squared loss.

ARO overfits by making constraints dependent on uncertainty, leading to brittleness.

problem ARO's adaptive policies become brittle when realizations fall outside the uncertainty set.
method Assigning constraint-specific uncertainty set sizes with probabilistic guarantees.
result Regularization through specific uncertainty set sizes ensures stability and flexibility.

Bounded rationality investigates utility-optimizing decision-makers with limited information-processing power. In particular, information theoretic bounded rationality models formalize resource constraints abstractly in terms of relative Shannon information, namely the Kullback-Leibler Divergence between the agents' pr…

2018-09-04abs ↗pdf ↗

New method for online statistical inference in contextual bandits using SGD.

problem Online decision-making in contextual bandits with statistical inference.
method Weighted stochastic gradient descent for adaptive data collection.
result Asymptotic normality of the parameter estimator with improved efficiency.

We introduce a unified probabilistic framework for solving sequential decision making problems ranging from Bayesian optimisation to contextual bandits and reinforcement learning. This is accomplished by a probabilistic model-based approach that explains observed data while capturing predictive uncertainty during the d…

2019-03-28abs ↗pdf ↗

Hybrid Bayesian-conformal framework improves uncertainty quantification in healthcare predictions.

problem Jointly satisfying distribution-free coverage guarantees and risk-adaptive precision in clinical decision-making.
method Integrates Bayesian hierarchical random forests with group-aware conformal calibration, using posterior uncertainties to weight conformity scores.
result Achieves target coverage (94.3% vs 95% target) with adaptive precision, 21% narrower intervals for low-uncertainty cases.

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.

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.

The paper develops deep learning models for personalized treatment rules in survival analysis.

problem Deriving optimal treatment rules for bivariate survival outcomes in randomized trials.
method Adaptive prediction-powered learning using deep neural networks and stochastic policies.
result Maximizes joint survival probability beyond fixed time points (t1,t2)(t_1, t_2).

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.

Develops a new framework for analyzing sequential decision-making problems using information theory.

problem Lack of information-theoretic generalization bounds for sequential decision-making problems.
method Introduces a sequential supersample framework that separates learner filtration from proof-side enlargement, controlling the generalization gap by sequential CMI.
result Establishes a sequential CMI that controls the generalization gap in sequential decision-making problems.