Copertina

LIBRA: Language Model Informed Bandit Recourse Algorithm for Personalized Treatment Planning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cao, Junyu, Gao, Ruijiang, Keyvanshokooh, Esmaeil, Ma, Jianhao
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Artificial Intelligence Machine Learning Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

HR-Bandit: Human-AI Collaborated Linear Recourse Bandit
di: Cao, Junyu, et al.
Pubblicazione: (2024)

Beyond Demand Estimation: Consumer Surplus Evaluation via Cumulative Propensity Weights
di: Bian, Zeyu, et al.
Pubblicazione: (2026)

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
di: Boudart, Pierre, et al.
Pubblicazione: (2025)

A Diffusion Analysis of Policy Gradient for Stochastic Bandits
di: Lattimore, Tor
Pubblicazione: (2026)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
di: Ji, Kaixuan, et al.
Pubblicazione: (2026)

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
di: Ji, Kaixuan, et al.
Pubblicazione: (2026)

Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits
di: Zhao, Qingyue, et al.
Pubblicazione: (2025)

Smooth Non-Stationary Bandits
di: Jia, Su, et al.
Pubblicazione: (2023)

Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
di: Zhao, Qingyue, et al.
Pubblicazione: (2026)

Personalized Algorithmic Recourse with Preference Elicitation
di: De Toni, Giovanni, et al.
Pubblicazione: (2022)

Foundations of Top-$k$ Decoding For Language Models
di: Noarov, Georgy, et al.
Pubblicazione: (2025)

RACER: Risk-Aware Calibrated Efficient Routing for Large Language Models
di: Hao, Sai, et al.
Pubblicazione: (2026)

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
di: Chen, Fan, et al.
Pubblicazione: (2025)

Identifying All ε-Best Arms in (Misspecified) Linear Bandits
di: Li, Zhekai, et al.
Pubblicazione: (2025)

Unified Algorithms for RL with Decision-Estimation Coefficients: PAC, Reward-Free, Preference-Based Learning, and Beyond
di: Chen, Fan, et al.
Pubblicazione: (2022)

Deconfounded Warm-Start Thompson Sampling with Applications to Precision Medicine
di: Jaiswal, Prateek, et al.
Pubblicazione: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
di: Meng, Huiling, et al.
Pubblicazione: (2026)

Total Variation Rates for Riemannian Flow Matching
di: Guan, Yunrui, et al.
Pubblicazione: (2026)

How Particle-System Random Batch Methods Enhance Graph Transformer: Memory Efficiency and Parallel Computing Strategy
di: Liu, Hanwen, et al.
Pubblicazione: (2025)

Revisiting Incremental Stochastic Majorization-Minimization Algorithms with Applications to Mixture of Experts
di: Tran, TrungKhang, et al.
Pubblicazione: (2026)

Provable Robust Overfitting Mitigation in Wasserstein Distributionally Robust Optimization
di: Liu, Shuang, et al.
Pubblicazione: (2025)

Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Ability
di: Yu, Lijia, et al.
Pubblicazione: (2025)

From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recourse
di: Budde, Lena Marie, et al.
Pubblicazione: (2026)

On the Statistical Capacity of Deep Generative Models
di: Tam, Edric, et al.
Pubblicazione: (2025)

On the Provable Performance Guarantee of Efficient Reasoning Models
di: Zeng, Hao, et al.
Pubblicazione: (2025)

Counterfactual Generative Modeling with Variational Causal Inference
di: Wu, Yulun, et al.
Pubblicazione: (2024)

Training Implicit Generative Models via an Invariant Statistical Loss
di: de Frutos, José Manuel, et al.
Pubblicazione: (2024)

Cross-regularization: Adaptive Model Complexity through Validation Gradients
di: Brito, Carlos Stein
Pubblicazione: (2025)

The Fragility of Optimized Bandit Algorithms
di: Fan, Lin, et al.
Pubblicazione: (2021)

Identifiability of Potentially Degenerate Gaussian Mixture Models With Piecewise Affine Mixing
di: Xu, Danru, et al.
Pubblicazione: (2026)

Finite-Particle Convergence Rates for Conservative and Non-Conservative Drifting Models
di: Balasubramanian, Krishnakumar
Pubblicazione: (2026)

Navigating the Exploration-Exploitation Tradeoff in Inference-Time Scaling of Diffusion Models
di: Su, Xun, et al.
Pubblicazione: (2025)

Learning Interpretable Concepts: Unifying Causal Representation Learning and Foundation Models
di: Rajendran, Goutham, et al.
Pubblicazione: (2024)

Adapting to Unknown Low-Dimensional Structures in Score-Based Diffusion Models
di: Li, Gen, et al.
Pubblicazione: (2024)

On the Statistical Properties of Generative Adversarial Models for Low Intrinsic Data Dimension
di: Chakraborty, Saptarshi, et al.
Pubblicazione: (2024)

Diffusion Models and the Manifold Hypothesis: Log-Domain Smoothing is Geometry Adaptive
di: Farghly, Tyler, et al.
Pubblicazione: (2025)

Generalization Properties of Score-matching Diffusion Models for Intrinsically Low-dimensional Data
di: Chakraborty, Saptarshi, et al.
Pubblicazione: (2026)

O(d/T) Convergence Theory for Diffusion Probabilistic Models under Minimal Assumptions
di: Li, Gen, et al.
Pubblicazione: (2024)

U-Nets as Belief Propagation: Efficient Classification, Denoising, and Diffusion in Generative Hierarchical Models
di: Mei, Song
Pubblicazione: (2024)

Inference with the Upper Confidence Bound Algorithm
di: Khamaru, Koulik, et al.
Pubblicazione: (2024)