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. 1110.2755
  4. Cited By
Efficient Tracking of Large Classes of Experts

Efficient Tracking of Large Classes of Experts

12 October 2011
András Gyorgy
Tamás Linder
Gábor Lugosi
ArXivPDFHTML

Papers citing "Efficient Tracking of Large Classes of Experts"

15 / 15 papers shown
Title
MetaCURL: Non-stationary Concave Utility Reinforcement Learning
MetaCURL: Non-stationary Concave Utility Reinforcement Learning
B. Moreno
Margaux Brégère
Pierre Gaillard
Nadia Oudjane
OffRL
39
0
0
30 May 2024
Non-stationary Projection-free Online Learning with Dynamic and Adaptive
  Regret Guarantees
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees
Yibo Wang
Wenhao Yang
Wei Jiang
Shiyin Lu
Bing Wang
Haihong Tang
Yuanyu Wan
Lijun Zhang
29
6
0
19 May 2023
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Lijun Zhang
Wei Jiang
Jinfeng Yi
Tianbao Yang
26
6
0
02 May 2022
Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for
  Mixable/Exp-Concave Losses
Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses
Kaan Gokcesu
Hakan Gokcesu
18
1
0
28 Sep 2021
Universal time-series forecasting with mixture predictors
Universal time-series forecasting with mixture predictors
D. Ryabko
AI4TS
33
0
0
01 Oct 2020
Learning to Bid Optimally and Efficiently in Adversarial First-price
  Auctions
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
Yanjun Han
Zhengyuan Zhou
Aaron Flores
E. Ordentlich
Tsachy Weissman
16
40
0
09 Jul 2020
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive
  Regret of Convex Functions
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions
Lijun Zhang
G. Wang
Wei-Wei Tu
Zhi-Hua Zhou
ODL
18
18
0
26 Jun 2019
Adaptive Regret of Convex and Smooth Functions
Adaptive Regret of Convex and Smooth Functions
Lijun Zhang
Tie-Yan Liu
Zhi-Hua Zhou
ODL
27
45
0
26 Apr 2019
Asymptotic nonparametric statistical analysis of stationary time series
Asymptotic nonparametric statistical analysis of stationary time series
D. Ryabko
24
17
0
30 Mar 2019
Decentralized Online Learning: Take Benefits from Others' Data without
  Sharing Your Own to Track Global Trend
Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend
Wendi Wu
Zongren Li
Yawei Zhao
Chenkai Yu
P. Zhao
Ji Liu
FedML
18
16
0
29 Jan 2019
Improved Strongly Adaptive Online Learning using Coin Betting
Improved Strongly Adaptive Online Learning using Coin Betting
Kwang-Sung Jun
Francesco Orabona
Rebecca Willett
S. Wright
28
80
0
14 Oct 2016
Efficient Algorithms for Adversarial Contextual Learning
Efficient Algorithms for Adversarial Contextual Learning
Vasilis Syrgkanis
A. Krishnamurthy
Robert Schapire
18
77
0
08 Feb 2016
Compress and Control
Compress and Control
J. Veness
Marc G. Bellemare
Marcus Hutter
Alvin Chua
Guillaume Desjardins
OffRL
17
29
0
19 Nov 2014
Universal Codes from Switching Strategies
Universal Codes from Switching Strategies
Wouter M. Koolen
S. D. Rooij
56
21
0
26 Nov 2013
Combining Expert Advice Efficiently
Combining Expert Advice Efficiently
Wouter M. Koolen
S. D. Rooij
91
33
0
14 Feb 2008
1