Fetching the paper…
Reading the bibliography…
A new portfolio selection strategy that adapts to a continuous side-information sequence is presented, with a universal wealth guarantee against a class of state-constant rebalanced portfolios with respect to a state function that maps each side-information symbol to a finite set of states.
Compression of individual sequences via variable-rate coding
Jacob Ziv and Abraham Lempel · 1978
Earlier work this paper cites.
Universal portfolios
Thomas M Cover · 1991
Earlier work this paper cites.
Rates of convergence for empirical processes of stationary mixing sequences
Bin Yu · 1994
Earlier work this paper cites.
Universal portfolios with side information
Thomas M Cover and Erik Ordentlich · 1996
Earlier work this paper cites.
Fisher information and stochastic complexity
Jorma J Rissanen · 1996
Earlier work this paper cites.
Universal prediction
Neri Merhav and Meir Feder · 1998
Earlier work this paper cites.
Universal portfolios with and without transaction costs
Avrim Blum and Adam Kalai · 1999
Earlier work this paper cites.
Asymptotic minimax regret for data compression, gambling, and prediction
Qun Xie and Andrew R Barron · 2000
Earlier work this paper cites.
Concentration inequalities and empirical processes theory applied to the analysis of learning algorithms
Olivier Bousquet · 2002
Earlier work this paper cites.
Efficient algorithms for universal portfolios
Adam Tauman Kalai and Santosh Vempala · 2002
Earlier work this paper cites.
Rates of uniform convergence of empirical means with mixing processes
Rajeeva L Karandikar and Mathukumalli Vidyasagar · 2002
Earlier work this paper cites.
Efficient universal portfolios for past-dependent target classes
Jason E Cross and Andrew R Barron · 2003
Cited alongside, same era.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Cited alongside, same era.
Elements of information theory
Thomas M Cover and Joy A Thomas · 2006
Cited alongside, same era.
Nonparametric kernel-based sequential investment strategies
László Györfi, Gábor Lugosi, and Frederic Udina · 2006
Cited alongside, same era.
Universal portfolios via context trees
Suleyman S Kozat, Andrew C Singer, and Andrew J Bean · 2008
Cited alongside, same era.
Finite memory universal portfolios
Arni Tavory and Meir Feder · 2008
Cited alongside, same era.
On the problem of on-line learning with log-loss
Yaniv Fogel and Meir Feder · 2017
Later among the works it cites.
Efficient online portfolio with logarithmic regret
Haipeng Luo, Chen-Yu Wei, and Kai Zheng · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science , volume 47
Roman Vershynin · 2018
Later among the works it cites.
Rademacher complexity for Markov chains: Applications to kernel smoothing and Metropolis–Hastings
Patrice Bertail and François Portier · 2019
Later among the works it cites.
Statistical learning under nonstationary mixing processes
Steve Hanneke and Liu Yang · 2019
Later among the works it cites.
Tight bounds on minimax regret under logarithmic loss via self-concordance
Blair Bilodeau, Dylan Foster, and Daniel Roy · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ami Tavory and Meir Feder · 2010
Cited alongside, same era.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
Sequential probability assignment with binary alphabets and large classes of experts
Alexander Rakhlin and Karthik Sridharan · 2015
Cited alongside, same era.
Sequential complexities and uniform martingale laws of large numbers
Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari · 2015
Cited alongside, same era.
Later among the works it cites.
Long-and short-term forecasting for portfolio selection with transaction costs
Guy Uziel and Ran El-Yaniv · 2020
Later among the works it cites.
Open problem: Fast and optimal online portfolio selection
Tim van Erven, Dirk van der Hoeven, Wojciech Kotłowski, and Wouter M Koolen · 2020
Later among the works it cites.
Sequential prediction under log-loss with side information
Alankrita Bhatt and Young-Han Kim · 2021
Later among the works it cites.
Minimax rates for conditional density estimation via empirical entropy
Blair Bilodeau, Dylan J Foster, and Daniel M Roy · 2021
Later among the works it cites.