IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1910.13668.html
   My bibliography  Save this paper

Random concave functions

Author

Listed:
  • Peter Baxendale
  • Ting-Kam Leonard Wong

Abstract

Spaces of convex and concave functions appear naturally in theory and applications. For example, convex regression and log-concave density estimation are important topics in nonparametric statistics. In stochastic portfolio theory, concave functions on the unit simplex measure the concentration of capital, and their gradient maps define novel investment strategies. The gradient maps may also be regarded as optimal transport maps on the simplex. In this paper we construct and study probability measures supported on spaces of concave functions. These measures may serve as prior distributions in Bayesian statistics and Cover's universal portfolio, and induce distribution-valued random variables via optimal transport. The random concave functions are constructed on the unit simplex by taking a suitably scaled (mollified, or soft) minimum of random hyperplanes. Depending on the regime of the parameters, we show that as the number of hyperplanes tends to infinity there are several possible limiting behaviors. In particular, there is a transition from a deterministic almost sure limit to a non-trivial limiting distribution that can be characterized using convex duality and Poisson point processes.

Suggested Citation

  • Peter Baxendale & Ting-Kam Leonard Wong, 2019. "Random concave functions," Papers 1910.13668, arXiv.org, revised May 2021.
    • Handle: RePEc:arx:papers:1910.13668
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1910.13668
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Madeleine Cule & Richard Samworth & Michael Stewart, 2010. "Maximum likelihood estimation of a multi‐dimensional log‐concave density," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 72(5), pages 545-607, November.
    2. Christa Cuchiero & Walter Schachermayer & Ting‐Kam Leonard Wong, 2019. "Cover's universal portfolio, stochastic portfolio theory, and the numéraire portfolio," Mathematical Finance, Wiley Blackwell, vol. 29(3), pages 773-803, July.
    3. Ting-Kam Wong, 2015. "Optimization of relative arbitrage," Annals of Finance, Springer, vol. 11(3), pages 345-382, November.
    4. Thomas M. Cover, 1991. "Universal Portfolios," Mathematical Finance, Wiley Blackwell, vol. 1(1), pages 1-29, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Erhan Bayraktar & Donghan Kim & Abhishek Tilva, 2023. "Quantifying dimensional change in stochastic portfolio theory," Papers 2303.00858, arXiv.org, revised Apr 2023.
    2. Donghan Kim, 2019. "Open Markets," Papers 1912.13110, arXiv.org.
    3. Nicole Tianjiao Yang & Tomoyuki Ichiba, 2023. "Relative Arbitrage Opportunities in an Extended Mean Field System," Papers 2311.02690, arXiv.org.
    4. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    5. Ali Al-Aradi & Sebastian Jaimungal, 2018. "Outperformance and Tracking: Dynamic Asset Allocation for Active and Passive Portfolio Management," Papers 1803.05819, arXiv.org, revised Jul 2018.
    6. Seung-Hyun Moon & Yong-Hyuk Kim & Byung-Ro Moon, 2019. "Empirical investigation of state-of-the-art mean reversion strategies for equity markets," Papers 1909.04327, arXiv.org.
    7. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    8. Luo, Yong & Zhu, Bo & Tang, Yong, 2014. "Simulated annealing algorithm for optimal capital growth," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 408(C), pages 10-18.
    9. Fabio Stella & Alfonso Ventura, 2011. "Defensive online portfolio selection," International Journal of Financial Markets and Derivatives, Inderscience Enterprises Ltd, vol. 2(1/2), pages 88-105.
    10. Ormos, Mihály & Urbán, András & Zoltán, Tamás, 2009. "Logoptimális portfóliók empirikus vizsgálata [Empirical analysis of log-optimal portfolios]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(1), pages 1-18.
    11. Battey, Heather & Linton, Oliver, 2014. "Nonparametric estimation of multivariate elliptic densities via finite mixture sieves," Journal of Multivariate Analysis, Elsevier, vol. 123(C), pages 43-67.
    12. Jarrod Wilcox, 2020. "Better portfolios with higher moments," Journal of Asset Management, Palgrave Macmillan, vol. 21(7), pages 569-580, December.
    13. Dmitry B. Rokhlin, 2021. "Relative utility bounds for empirically optimal portfolios," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 437-462, June.
    14. Vladimir V'yugin, 2014. "Log-Optimal Portfolio Selection Using the Blackwell Approachability Theorem," Papers 1410.5996, arXiv.org, revised Jun 2015.
    15. Yining Chen, 2015. "Semiparametric Time Series Models with Log-concave Innovations: Maximum Likelihood Estimation and its Consistency," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 42(1), pages 1-31, March.
    16. R'emi J'ez'equel & Dmitrii M. Ostrovskii & Pierre Gaillard, 2022. "Efficient and Near-Optimal Online Portfolio Selection," Papers 2209.13932, arXiv.org.
    17. Miquel Noguer i Alonso & Sonam Srivastava, 2020. "Deep Reinforcement Learning for Asset Allocation in US Equities," Papers 2010.04404, arXiv.org.
    18. Malo Huard & Rémy Garnier & Gilles Stoltz, 2020. "Hierarchical robust aggregation of sales forecasts at aggregated levels in e-commerce, based on exponential smoothing and Holt's linear trend method," Working Papers hal-02794320, HAL.
    19. Christopher Dance & Alexei Gaivoronski, 2012. "Stochastic optimization for real time service capacity allocation under random service demand," Annals of Operations Research, Springer, vol. 193(1), pages 221-253, March.
    20. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1910.13668. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.