:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Cerulli, Giovanni
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2605.12235
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning
by: Brahmanage, Janaka Chathuranga, et al.
Published: (2026)