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. 1805.07430
  4. Cited By
Efficient Online Portfolio with Logarithmic Regret

Efficient Online Portfolio with Logarithmic Regret

18 May 2018
Haipeng Luo
Chen-Yu Wei
Kai Zheng
ArXivPDFHTML

Papers citing "Efficient Online Portfolio with Logarithmic Regret"

6 / 6 papers shown
Title
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
152
1,927
0
07 Sep 2019
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
Laurent Orseau
Tor Lattimore
Shane Legg
25
22
0
08 Jan 2019
More Adaptive Algorithms for Adversarial Bandits
More Adaptive Algorithms for Adversarial Bandits
Chen-Yu Wei
Haipeng Luo
122
182
0
10 Jan 2018
Sparsity, variance and curvature in multi-armed bandits
Sparsity, variance and curvature in multi-armed bandits
Sébastien Bubeck
Michael B. Cohen
Yuanzhi Li
126
60
0
03 Nov 2017
Corralling a Band of Bandit Algorithms
Corralling a Band of Bandit Algorithms
Alekh Agarwal
Haipeng Luo
Behnam Neyshabur
Robert Schapire
137
157
0
19 Dec 2016
Sampling from a log-concave distribution with Projected Langevin Monte
  Carlo
Sampling from a log-concave distribution with Projected Langevin Monte Carlo
Sébastien Bubeck
Ronen Eldan
Joseph Lehec
69
139
0
09 Jul 2015
1