Cover Image

Combinatorial Causal Bandits without Graph Skeleton

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Shi, Xiong, Nuoya, Chen, Wei
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
by: Xiong, Guojun, et al.
Published: (2024)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)

Bandit Allocational Instability
by: Chen, Yilun, et al.
Published: (2026)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems
by: Hu, Chenchuhui
Published: (2024)

Combinatorial Optimization Augmented Machine Learning
by: Schiffer, Maximilian, et al.
Published: (2026)

Latent Guided Sampling for Combinatorial Optimization
by: Surendran, Sobihan, et al.
Published: (2025)

Contextual Bandits with Budgeted Information Reveal
by: Gan, Kyra, et al.
Published: (2023)

Decentralized Contextual Bandits with Network Adaptivity
by: Deng, Chuyun, et al.
Published: (2025)

The Safety-Privacy Tradeoff in Linear Bandits
by: Zibaie, Arghavan, et al.
Published: (2025)

Pointer Networks with Q-Learning for Combinatorial Optimization
by: Barro, Alessandro
Published: (2023)

Imitation Learning for Combinatorial Optimisation under Uncertainty
by: Gawas, Prakash, et al.
Published: (2026)

Unbiased Single-Queried Gradient for Combinatorial Objective
by: Sornwanee, Thanawat
Published: (2026)

Structured Reinforcement Learning for Combinatorial Decision-Making
by: Hoppe, Heiko, et al.
Published: (2025)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Tight Rates for Bandit Control Beyond Quadratics
by: Sun, Y. Jennifer, et al.
Published: (2024)

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization
by: Li, Muheng, et al.
Published: (2025)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
by: Li, Xuheng, et al.
Published: (2024)

Multi-User Contextual Cascading Bandits for Personalized Recommendation
by: Park, Jiho, et al.
Published: (2025)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
by: Liu, Keqin, et al.
Published: (2021)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update
by: Pugacheva, Daria, et al.
Published: (2024)

Going from a Representative Agent to Counterfactuals in Combinatorial Choice
by: Ruan, Yanqiu, et al.
Published: (2025)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
by: Li, Xuheng, et al.
Published: (2025)

Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards
by: Guo, Xin, et al.
Published: (2026)

A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
by: Lee, Wei-Cheng, et al.
Published: (2025)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
by: Lodi, Andrea, et al.
Published: (2019)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization
by: Sorokin, D., et al.
Published: (2023)

Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
by: Bu, Fanchen, et al.
Published: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
by: Lee, Wei-Cheng, et al.
Published: (2025)

Neural Network-Based Bandit: A Medium Access Control for the IIoT Alarm Scenario
by: Raghuwanshi, Prasoon, et al.
Published: (2024)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
by: Zhan, Jingxin, et al.
Published: (2025)

Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction
by: Feng, Jie, et al.
Published: (2024)

Heuristics for Combinatorial Optimization via Value-based Reinforcement Learning: A Unified Framework and Analysis
by: Davidovich, Orit, et al.
Published: (2025)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)