ResearchTrend.AI
Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness
v1v2 (latest)

Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness

C. Tsai
Ying-Ting Lin
Yen-Huan Li
ArXiv (abs)PDFHTML

Papers citing "Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness"

5 / 5 papers shown
Title
Damped Online Newton Step for Portfolio Selection
Damped Online Newton Step for Portfolio Selection
Zakaria Mhammedi
Alexander Rakhlin
39
15
0
15 Feb 2022
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
175
1,932
0
07 Sep 2019
Efficient Online Portfolio with Logarithmic Regret
Efficient Online Portfolio with Logarithmic Regret
Haipeng Luo
Chen-Yu Wei
Kai Zheng
36
46
0
18 May 2018
Optimization, Learning, and Games with Predictable Sequences
Optimization, Learning, and Games with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
95
380
0
08 Nov 2013
Online Learning with Predictable Sequences
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
207
359
0
18 Aug 2012

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.