Cover Image

Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghaffari, Fatemeh, Sitaraman, Siddarth, Liu, Xutong, Wang, Xuchuang, Hajiesmaili, Mohammad
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
by: Ghaffari, Fatemeh, et al.
Published: (2024)

Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models
by: Xu, Mengfan, et al.
Published: (2025)

Stochastic Bandits Robust to Adversarial Attacks
by: Wang, Xuchuang, et al.
Published: (2024)

Offline Clustering of Preference Learning with Active-data Augmentation
by: Liu, Jingyuan, et al.
Published: (2025)

Combinatorial Logistic Bandits
by: Liu, Xutong, et al.
Published: (2024)

Unlearning Offline Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2026)

Offline Clustering of Linear Bandits: The Power of Clusters under Limited Data
by: Liu, Jingyuan, et al.
Published: (2025)

Fusing Reward and Dueling Feedback in Stochastic Bandits
by: Wang, Xuchuang, et al.
Published: (2025)

Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
by: Liu, Xutong, et al.
Published: (2024)

Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms
by: Zeynali, Ali, et al.
Published: (2025)

Cascading Bandits Robust to Adversarial Corruptions
by: Xie, Jize, et al.
Published: (2025)

Heterogeneous Multi-Agent Bandits with Parsimonious Hints
by: Mirfakhar, Amirmahdi, et al.
Published: (2025)

Learning Best Paths in Quantum Networks
by: Wang, Xuchuang, et al.
Published: (2025)

Contextual Combinatorial Bandits with Probabilistically Triggered Arms
by: Liu, Xutong, et al.
Published: (2023)

Towards Environmentally Equitable AI
by: Hajiesmaili, Mohammad, et al.
Published: (2024)

Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution
by: Poon, Manhin, et al.
Published: (2025)

Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users
by: Yang, Hantao, et al.
Published: (2024)

Distributed Algorithms for Multi-Agent Multi-Armed Bandits with Collision
by: Zhou, Daoyuan, et al.
Published: (2025)

Robust Learning-Augmented Dictionaries
by: Zeynali, Ali, et al.
Published: (2024)

BONES: Near-Optimal Neural-Enhanced Video Streaming
by: Wang, Lingdong, et al.
Published: (2023)

Cascade-KDE: Robust Time-Series Restoration under Out-of-Distribution Impulse Corruptions
by: Liu, Yuefeng, et al.
Published: (2026)

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
by: Liu, Haolin, et al.
Published: (2024)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
by: Tani, Naoto, et al.
Published: (2026)

Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions
by: Oh, Youngmin
Published: (2026)

Competitive Algorithms for Multi-Agent Ski-Rental Problems
by: Wang, Xuchuang, et al.
Published: (2025)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
by: Lechowicz, Adam, et al.
Published: (2023)

VIDSTAMP: A Temporally-Aware Watermark for Ownership and Integrity in Video Diffusion Models
by: Teymoorianfard, Mohammadreza, et al.
Published: (2025)

Scaling Federated Linear Contextual Bandits via Sketching
by: Yang, Hantao, et al.
Published: (2026)

Robust Decentralized Multi-armed Bandits: From Corruption-Resilience to Byzantine-Resilience
by: Hu, Zicheng, et al.
Published: (2025)

Offline Learning for Combinatorial Multi-armed Bandits
by: Liu, Xutong, et al.
Published: (2025)

Robust Policy Expansion for Offline-to-Online RL under Diverse Data Corruption
by: He, Longxiang, et al.
Published: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

A Model Selection Approach for Corruption Robust Reinforcement Learning
by: Wei, Chen-Yu, et al.
Published: (2021)

Efficient and Optimal Policy Gradient Algorithm for Corrupted Multi-armed Bandits
by: Liu, Jiayuan, et al.
Published: (2025)

Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection
by: Zeng, Qirun, et al.
Published: (2025)

Online Survival Analysis: A Bandit Approach under Cox PH Model
by: Xu, Yang, et al.
Published: (2026)

A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond
by: Hu, Zicheng, et al.
Published: (2025)

Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes
by: Ye, Chenlu, et al.
Published: (2022)

Robust Q-Learning under Corrupted Rewards
by: Maity, Sreejeet, et al.
Published: (2024)

Online Bandits with (Biased) Offline Data: Adaptive Learning under Distribution Mismatch
by: Cheung, Wang Chi, et al.
Published: (2024)