Imagen de Portada

Optimal Policy Learning under Budget and Coverage Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Cerulli, Giovanni
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Policy Learning with Observational Data in Multi-Action Scenarios: Estimation, Risk Preference, and Potential Failures
por: Cerulli, Giovanni
Publicado: (2024)

Cascaded Transfer: Learning Many Tasks under Budget Constraints
por: Campagne, Eloi, et al.
Publicado: (2026)

Adaptive LLM Routing under Budget Constraints
por: Panda, Pranoy, et al.
Publicado: (2025)

Online Decision Deferral under Budget Constraints
por: Reid, Mirabel, et al.
Publicado: (2024)

Optimal Policy Learning for Multi-Action Treatment with Risk Preference using Stata
por: Cerulli, Giovanni
Publicado: (2025)

Generalized Coverage for More Robust Low-Budget Active Learning
por: Bae, Wonho, et al.
Publicado: (2024)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
por: Wang, Yige, et al.
Publicado: (2025)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
por: Castiglioni, Matteo, et al.
Publicado: (2023)

Estimation of Optimal Dynamic Treatment Assignment Rules under Policy Constraints
por: Sakaguchi, Shosei
Publicado: (2021)

Personalized Reinforcement Learning with a Budget of Policies
por: Ivanov, Dmitry, et al.
Publicado: (2024)

ConBatch-BAL: Batch Bayesian Active Learning under Budget Constraints
por: Morato, Pablo G., et al.
Publicado: (2025)

Learning with a Budget: Identifying the Best Arm with Resource Constraints
por: Li, Zitian, et al.
Publicado: (2026)

Quantile-Optimal Policy Learning under Unmeasured Confounding
por: Chen, Zhongren, et al.
Publicado: (2025)

Adaptive Policy Selection and Fine-Tuning under Interaction Budgets for Offline-to-Online Reinforcement Learning
por: Bozkurt, Alper Kamil, et al.
Publicado: (2026)

Selection of the Best Policy under Fairness Constraints for Subpopulations
por: Zhu, Tingyu, et al.
Publicado: (2026)

Delivery Optimized Discovery in Behavioral User Segmentation under Budget Constraint
por: Chopra, Harshita, et al.
Publicado: (2024)

Towards Optimal Environmental Policies: Policy Learning under Arbitrary Bipartite Network Interference
por: Kim, Raphael C., et al.
Publicado: (2024)

Adaptive Coverage Policies in Conformal Prediction
por: Gauthier, Etienne, et al.
Publicado: (2025)

Optimal Perturbation Budget Allocation for Data Poisoning in Offline Reinforcement Learning
por: Qiu, Junnan, et al.
Publicado: (2025)

End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling
por: Sun, Zexu, et al.
Publicado: (2024)

Optimal Policy Adaptation under Covariate Shift
por: Liu, Xueqing, et al.
Publicado: (2025)

Multi-Objective Coverage via Constraint Active Search
por: Siam, Zakaria Shams, et al.
Publicado: (2026)

Offline Constrained Reinforcement Learning under Partial Data Coverage
por: Ko, Seokmin, et al.
Publicado: (2025)

Safe Offline Reinforcement Learning with Real-Time Budget Constraints
por: Lin, Qian, et al.
Publicado: (2023)

Optimal Transport under Group Fairness Constraints
por: Bleistein, Linus, et al.
Publicado: (2026)

Lever: Inference-Time Policy Reuse under Support Constraints
por: Vitenko, Ihor, et al.
Publicado: (2026)

Optimal Budgeted Adaptation of Large Language Models
por: Wang, Jing, et al.
Publicado: (2026)

Optimal Budgeted Rejection Sampling for Generative Models
por: Verine, Alexandre, et al.
Publicado: (2023)

Federated Language Models Under Bandwidth Budgets: Distillation Rates and Conformal Coverage
por: Dubey, Prasanjit, et al.
Publicado: (2026)

A Single Deep Preference-Conditioned Policy for Learning Pareto Coverage Sets
por: Kubo, Akihiro, et al.
Publicado: (2026)

Model Compression with Exact Budget Constraints via Riemannian Manifolds
por: Helcig, Michael, et al.
Publicado: (2026)

Budget-Aware Sequential Brick Assembly with Efficient Constraint Satisfaction
por: Ahn, Seokjun, et al.
Publicado: (2022)

A New Benchmark for Online Learning with Budget-Balancing Constraints
por: Braverman, Mark, et al.
Publicado: (2025)

Learning an Optimal Assortment Policy under Observational Data
por: Han, Yuxuan, et al.
Publicado: (2025)

Learning Optimal Deterministic Policies with Stochastic Policy Gradients
por: Montenegro, Alessandro, et al.
Publicado: (2024)

Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints
por: Qiao, Dan, et al.
Publicado: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
por: Zurek, Matthew, et al.
Publicado: (2025)

Matching Rates and Optimal Allocation for Federated Probe-Logit Distillation under Heterogeneous Bandwidth Budgets
por: Dubey, Prasanjit, et al.
Publicado: (2026)

Federated Offline Reinforcement Learning: Collaborative Single-Policy Coverage Suffices
por: Woo, Jiin, et al.
Publicado: (2024)

Joint Continual Learning of Local Language Models and Cloud Offloading Decisions with Budget Constraints
por: Chen, Evan, et al.
Publicado: (2026)