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. 1405.6076
  4. Cited By
Online Linear Optimization via Smoothing

Online Linear Optimization via Smoothing

23 May 2014
Jacob D. Abernethy
Chansoo Lee
Abhinav Sinha
Ambuj Tewari
ArXivPDFHTML

Papers citing "Online Linear Optimization via Smoothing"

16 / 16 papers shown
Title
Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
Mengmeng Li
Daniel Kuhn
Bahar Taşkesen
44
0
0
30 Sep 2024
On the Regret of Coded Caching with Adversarial Requests
On the Regret of Coded Caching with Adversarial Requests
Anupam Nayak
Kota Srinivas Reddy
Nikhil Karamchandani
21
0
0
19 Sep 2024
Agnostic Interactive Imitation Learning: New Theory and Practical
  Algorithms
Agnostic Interactive Imitation Learning: New Theory and Practical Algorithms
Yichen Li
Chicheng Zhang
OffRL
37
0
0
28 Dec 2023
On the Regret of Online Edge Service Hosting
On the Regret of Online Edge Service Hosting
Rudrabhotla Sri Prakash
Nikhil Karamchandani
Sharayu Moharir
20
3
0
13 Mar 2023
Optimistic No-regret Algorithms for Discrete Caching
Optimistic No-regret Algorithms for Discrete Caching
N. Mhaisen
Abhishek Sinha
G. Paschos
Georgios Iosifidis
36
11
0
15 Aug 2022
LeadCache: Regret-Optimal Caching in Networks
LeadCache: Regret-Optimal Caching in Networks
Debjit Paria
Abhishek Sinha
26
25
0
17 Sep 2020
Learning with Differentiable Perturbed Optimizers
Learning with Differentiable Perturbed Optimizers
Quentin Berthet
Mathieu Blondel
O. Teboul
Marco Cuturi
Jean-Philippe Vert
Francis R. Bach
29
106
0
20 Feb 2020
Faster Projection-free Online Learning
Faster Projection-free Online Learning
Elad Hazan
Edgar Minasyan
23
58
0
30 Jan 2020
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits
Julian Zimmert
Yevgeny Seldin
AAML
24
175
0
19 Jul 2018
The Price of Differential Privacy For Online Learning
The Price of Differential Privacy For Online Learning
Naman Agarwal
Karan Singh
FedML
14
94
0
27 Jan 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and
  Faster MMWU
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU
Zeyuan Allen-Zhu
Yuanzhi Li
22
44
0
06 Jan 2017
Fighting Bandits with a New Kind of Smoothness
Fighting Bandits with a New Kind of Smoothness
Jacob D. Abernethy
Chansoo Lee
Ambuj Tewari
AAML
15
77
0
14 Dec 2015
Second-order Quantile Methods for Experts and Combinatorial Games
Second-order Quantile Methods for Experts and Combinatorial Games
Wouter M. Koolen
T. Erven
26
101
0
27 Feb 2015
On the Inductive Bias of Dropout
On the Inductive Bias of Dropout
D. Helmbold
Philip M. Long
44
71
0
15 Dec 2014
Prediction by Random-Walk Perturbation
Prediction by Random-Walk Perturbation
Luc Devroye
Gábor Lugosi
Gergely Neu
62
37
0
23 Feb 2013
Improving neural networks by preventing co-adaptation of feature
  detectors
Improving neural networks by preventing co-adaptation of feature detectors
Geoffrey E. Hinton
Nitish Srivastava
A. Krizhevsky
Ilya Sutskever
Ruslan Salakhutdinov
VLM
266
7,639
0
03 Jul 2012
1