Image de couverture de livre

On the Regret of Coded Caching with Adversarial Requests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Nayak, Anupam, Reddy, Kota Srinivas, Karamchandani, Nikhil
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Clustering of Data Sequences with Bandit Information
par: Chandran, G Dhinesh, et autres
Publié: (2025)

Fixed-Confidence Best Arm Identification with Decreasing Variance
par: Roychowdhury, Tamojeet, et autres
Publié: (2025)

Game of Coding With an Unknown Adversary
par: Akbarinodehi, Hanzaleh, et autres
Publié: (2025)

Normalized Maximum Likelihood Code-Length on Riemannian Data Spaces
par: Fukuzawa, Kota, et autres
Publié: (2025)

Best Arm Identification with Minimal Regret
par: Yang, Junwen, et autres
Publié: (2024)

Learning from Acceptance: Cumulative Regret in the Game of Coding
par: Nodehi, Hanzaleh Akbari, et autres
Publié: (2026)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
par: Li, Zihan, et autres
Publié: (2022)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
par: Bondaschi, Marco, et autres
Publié: (2025)

Cascaded Group Testing
par: Mirza, Waqar, et autres
Publié: (2024)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
par: Frey, Matthias, et autres
Publié: (2026)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
par: Panda, Subhodip, et autres
Publié: (2026)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
par: Tajdini, Artin, et autres
Publié: (2025)

Complexity as Advantage: A Regret-Based Perspective on Emergent Structure
par: Naparstek, Oshri
Publié: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
par: Bongole, Raghav, et autres
Publié: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
par: Yang, Junwen, et autres
Publié: (2024)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
par: Jia, Zeyu, et autres
Publié: (2025)

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces
par: Tran-The, Hung, et autres
Publié: (2020)

Foundation of Calculating Normalized Maximum Likelihood for Continuous Probability Models
par: Suzuki, Atsushi, et autres
Publié: (2024)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
par: Shah, Mohammad Taha, et autres
Publié: (2025)

Contrastive ECOC: Learning Output Codes for Adversarial Defense
par: Chou, Che-Yu, et autres
Publié: (2025)

Small-Error Cascaded Group Testing
par: McMorrow, Daniel, et autres
Publié: (2026)

Personalized Federated Learning for Cellular VR: Online Learning and Dynamic Caching
par: Tharakan, Krishnendu S., et autres
Publié: (2025)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
par: Nayak, Anupam, et autres
Publié: (2025)

Tight Regret Bounds for Bayesian Optimization in One Dimension
par: Scarlett, Jonathan
Publié: (2018)

On Distributed Multi-User Secret Sharing with Multiple Secrets per User
par: Chigullapally, Rasagna, et autres
Publié: (2023)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
par: Azize, Achraf, et autres
Publié: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
par: Zamir, Guy, et autres
Publié: (2026)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
par: Hou, Yunlong, et autres
Publié: (2026)

Adversarial Jamming for Autoencoder Distribution Matching
par: El-Geresy, Waleed, et autres
Publié: (2025)

eOptShrinkQ: Near-Lossless KV Cache Compression Through Optimal Spectral Denoising and Quantization
par: Su, Pei-Chun
Publié: (2026)

Adversarial Combinatorial Semi-bandits with Graph Feedback
par: Wen, Yuxiao
Publié: (2025)

Minimizing Queue Length Regret for Arbitrarily Varying Channels
par: Krishnakumar, G, et autres
Publié: (2025)

No-Regret Bayesian Recommendation to Homogeneous Users
par: Feng, Yiding, et autres
Publié: (2022)

Modulation and Coding for NOMA and RSMA
par: Jafarkhani, Hamid, et autres
Publié: (2024)

Neural Distributed Source Coding
par: Whang, Jay, et autres
Publié: (2021)

Bottlenecked Transformers: Periodic KV Cache Consolidation for Generalised Reasoning
par: Oomerjee, Adnan, et autres
Publié: (2025)

DoDo-Code: an Efficient Levenshtein Distance Embedding-based Code for 4-ary IDS Channel
par: Guo, Alan J. X., et autres
Publié: (2023)

VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence
par: Bakshi, Mayank, et autres
Publié: (2024)

Compressed Sensor Caching and Collaborative Sparse Data Recovery with Anchor Alignment
par: Yang, Yi-Jen, et autres
Publié: (2024)

Neural Window Decoder for SC-LDPC Codes
par: Yun, Dae-Young, et autres
Publié: (2024)