Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cao, Junyu, Gao, Ruijiang, Keyvanshokooh, Esmaeil, Ma, Jianhao
Formato:	Preprint
Publicado:	2026
Materias:	Artificial Intelligence Machine Learning Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

Smooth Non-Stationary Bandits
por: Jia, Su, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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