No article text was recorded for this version.
bandit feedback constraints
Version 1 of 11,058 papers1,328 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Combinatorial Bandits for Maximum Value Reward Function under Max Value-Index Feedback
- Blog: Non-Uniform Multiclass Learning with Bandit Feedback
- Blog: Top-Combinatorial Bandits with Full-Bandit Feedback
- Blog: Combinatorial Bandits with Full-Bandit Feedback: Sample Complexity and Regret Minimization
- Blog: Minimax Games with Bandits
- Blog: Advice-Efficient Prediction with Expert Advice
- Blog: Sparsity, variance and curvature in multi-armed bandits
- Blog: A Shared Task on Bandit Learning for Machine Translation
- Blog: Online Influence Maximization: Concept and Algorithm
- Blog: Learning from eXtreme Bandit Feedback
- Blog: The price of bandit information in multiclass online classification
- Blog: For Universal Multiclass Online Learning, Bandit Feedback and Full Supervision are Equivalent
- Blog: Adaptation to Easy Data in Prediction with Limited Advice
- Blog: Fast Rates for Bandit PAC Multiclass Classification
- Blog: Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
- Blog: Open Problem: Model Selection for Contextual Bandits
- Blog: Online Learning with Predictable Sequences
- Blog: Online Boosting for Multilabel Ranking with Top-k Feedback.
- Blog: Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
- Blog: Refined Lower Bounds for Adversarial Bandits
- Blog: Efficient Constrained Regret Minimization
- Blog: Improved Regret Bounds for Online Kernel Selection under Bandit Feedback
- Blog: Efficient bandit algorithms for online multiclass prediction
- Blog: Bandit Structured Prediction for Learning from Partial Feedback in Statistical Machine Translation
- Blog: Online multiclass learning with "bandit" feedback under a Passive-Aggressive approach
- Blog: A Survey of Decentralized Online Learning
- Blog: Steering No-Regret Learners to a Desired Equilibrium
- Blog: Exploiting easy data in online optimization
- Blog: Toward a classification of finite partial-monitoring games
- Blog: Bandit Online Linear Optimization with Hints and Queries
- Blog: From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
- Blog: Semi-Bandit Learning for Monotone Stochastic Optimization
- Blog: Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
- Blog: Online Convex Optimization with Stochastic Constraints: Zero Constraint Violation and Bandit Feedback
- Blog: Tracking the Best Expert in Non-stationary Stochastic Environments
- Blog: Reward Imputation with Sketching for Contextual Batched Bandits
- Blog: Logarithmic Regret for Matrix Games against an Adversary with Noisy Bandit Feedback
- Blog: Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
- Blog: Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round
- Blog: Bandit Algorithms for Prophet Inequality and Pandora's Box
- Blog: Strategy-Aware Contextual Bandits
- Blog: Semi-bandit Optimization in the Dispersed Setting
- Blog: Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
- Blog: Combinatorial Bandits for Maximum Value Reward Function under Value-Index Feedback
- Blog: Experts with Lower-Bounded Loss Feedback: A Unifying Framework
- Blog: Adversarial Combinatorial Bandits with Switching Costs
- Blog: A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
- Blog: The price of bandit information in multiclass online classification
- Blog: Open Problem: Model Selection for Contextual Bandits
- Blog: The Pareto Regret Frontier for Bandits
- Blog: Competing against Adaptive Strategies in Online Learning via Hints
- Blog: Taming the Exponential Action Set: Sublinear Regret and Fast Convergence to Nash Equilibrium in Online Congestion Games
- Blog: Improved Regret Bounds for Projection-free Bandit Convex Optimization
- Blog: Submodular Bandit Problem Under Multiple Constraints
- Blog: Thompson Sampling for Online Learning with Linear Experts
- Blog: Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games
- Blog: Contextual Bandits and Optimistically Universal Learning
- Blog: Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information
- Blog: No-regret learning in harmonic games: Extrapolation in the face of conflicting interests
- Blog: On the Universal Near Optimality of Hedge in Combinatorial Settings
Showing 60 of 1,058 papers.
History & citation
Current · Permanent link
- The Adaptivity Barrier in Bandit Feedback merged into this direction (53% overlap)
- Combinatorial Bandits with Aggregate Feedback merged into this direction (81% overlap)
- Gradient Estimation from Single Point Bandit Feedback merged into this direction (55% overlap)
- Online Multiclass Prediction with Bandit Feedback merged into this direction (100% overlap)
- Strategic Learning in Games with Bandit Feedback merged into this direction (97% overlap)
- Online Optimization with Bandit Feedback merged into this direction (94% overlap)
- Bridging the Efficiency Gap in Submodular Bandit Learning merged into this direction (57% overlap)
- Online Learning with Action Dependent Feedback Delays merged into this direction (50% overlap)
- The Cost of Limited Feedback in Online Learning merged into this direction (69% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_bandit_feedback_constraints_36c0309b,
title = {bandit feedback constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/bandit-feedback-constraints/rdr_36c0309b221f43a8b706efc6b91152f7},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_bandit_feedback_constraints_36c0309b_v1,
title = {bandit feedback constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/bandit-feedback-constraints/rdr_36c0309b221f43a8b706efc6b91152f7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}