1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Contextual Slate GLM Bandits with Limited Adaptivity
Tanmay Goyal, Sukruta Prakash Midigeshi, Gaurav Sinha
We investigate the contextual slate bandit problem with generalized linear rewards under limited adaptivity. At each round, the learner is presented with sets of items, where e…
cs.DS2026
Packing Linear Programs and Fractional Knapsack using Comparison Oracles
Ritabrata Barat, Siddharth Barman, Nirjhar Das +1
We study the problem of recovering the objective of a packing linear program when the algorithm accesses only comparison information about optimal solutions under varying constrain…