ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2208.06414
  4. Cited By
Optimistic No-regret Algorithms for Discrete Caching

Optimistic No-regret Algorithms for Discrete Caching

15 August 2022
N. Mhaisen
Abhishek Sinha
G. Paschos
Georgios Iosifidis
ArXivPDFHTML

Papers citing "Optimistic No-regret Algorithms for Discrete Caching"

17 / 17 papers shown
Title
Universal Caching
Universal Caching
Ativ Joshi
Abhishek Sinha
OffRL
56
2
0
10 May 2022
Online Caching with Optimistic Learning
Online Caching with Optimistic Learning
N. Mhaisen
Georgios Iosifidis
D. Leith
72
12
0
22 Feb 2022
Between Stochastic and Adversarial Online Convex Optimization: Improved
  Regret Bounds via Smoothness
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
Sarah Sachs
Hédi Hadiji
T. Erven
Cristóbal Guzmán
103
17
0
15 Feb 2022
Lazy Lagrangians with Predictions for Online Learning
Lazy Lagrangians with Predictions for Online Learning
Daron Anderson
Georgios Iosifidis
D. Leith
80
6
0
08 Jan 2022
$k\texttt{-experts}$ -- Online Policies and Fundamental Limits
k-expertsk\texttt{-experts}k-experts -- Online Policies and Fundamental Limits
S. Mukhopadhyay
Sourav Sahoo
Abhishek Sinha
OffRL
52
8
0
15 Oct 2021
No-Regret Caching via Online Mirror Descent
No-Regret Caching via Online Mirror Descent
T. Si Salem
Giovanni Neglia
Stratis Ioannidis
34
36
0
29 Jan 2021
LeadCache: Regret-Optimal Caching in Networks
LeadCache: Regret-Optimal Caching in Networks
Debjit Paria
Abhishek Sinha
36
25
0
17 Sep 2020
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for
  Smooth Minimax Games
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games
A. Suggala
Praneeth Netrapalli
41
15
0
13 Jun 2020
Online Learning with Imperfect Hints
Online Learning with Imperfect Hints
Aditya Bhaskara
Ashok Cutkosky
Ravi Kumar
Manish Purohit
96
58
0
11 Feb 2020
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
150
1,927
0
07 Sep 2019
Online Non-Convex Learning: Following the Perturbed Leader is Optimal
Online Non-Convex Learning: Following the Perturbed Leader is Optimal
A. Suggala
Praneeth Netrapalli
110
54
0
19 Mar 2019
Reinforcement Learning for Adaptive Caching with Dynamic Storage Pricing
Reinforcement Learning for Adaptive Caching with Dynamic Storage Pricing
A. Sadeghi
Fatemeh Sheikholeslami
A. Marques
G. Giannakis
31
53
0
17 Dec 2018
Competitive caching with machine learned advice
Competitive caching with machine learned advice
Thodoris Lykouris
Sergei Vassilvitskii
53
386
0
15 Feb 2018
Projection onto the capped simplex
Projection onto the capped simplex
Weiran Wang
Canyi Lu
52
44
0
03 Mar 2015
Online Linear Optimization via Smoothing
Online Linear Optimization via Smoothing
Jacob D. Abernethy
Chansoo Lee
Abhinav Sinha
Ambuj Tewari
104
77
0
23 May 2014
Optimization, Learning, and Games with Predictable Sequences
Optimization, Learning, and Games with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
92
379
0
08 Nov 2013
Follow the Leader If You Can, Hedge If You Must
Follow the Leader If You Can, Hedge If You Must
S. D. Rooij
T. Erven
Peter Grünwald
Wouter M. Koolen
169
180
0
03 Jan 2013
1