Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cao, Junyu, Gao, Ruijiang, Keyvanshokooh, Esmaeil, Ma, Jianhao
Format:	Preprint
Published:	2026
Subjects:	Artificial Intelligence Machine Learning Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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