{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:16Z","timestamp":1750220716281,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,15]]},"DOI":"10.1145\/3383455.3422531","type":"proceedings-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T14:51:48Z","timestamp":1633618308000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Dealing with transaction costs in portfolio optimization"],"prefix":"10.1145","author":[{"given":"Edoardo","family":"Vittori","sequence":"first","affiliation":[{"name":"Politecnico di Milano and Intesa Sanpaolo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martino Bernasconi","family":"de Luca","sequence":"additional","affiliation":[{"name":"Politecnico di Milano"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Trov\u00f2","sequence":"additional","affiliation":[{"name":"Politecnico di Milano"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Restelli","sequence":"additional","affiliation":[{"name":"Politecnico di Milano"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"J. Abernethy and S. Kale. 2013. Adaptive market making via online learning. In Neural Information Processing Systems. NeurIPS Stateline Nevada United States 2058--2066.  J. Abernethy and S. Kale. 2013. Adaptive market making via online learning. In Neural Information Processing Systems . NeurIPS Stateline Nevada United States 2058--2066."},{"volume-title":"International Conference on Machine Learning. ICML","author":"Agarwal A.","key":"e_1_3_2_1_2_1","unstructured":"A. Agarwal , E. Hazan , S. Kale , and R.E. Schapire . 2006. Algorithms for portfolio management based on the Newton method . In International Conference on Machine Learning. ICML , Pittsburgh, Pennsylvania, United States, 9--16. A. Agarwal, E. Hazan, S. Kale, and R.E. Schapire. 2006. Algorithms for portfolio management based on the Newton method. In International Conference on Machine Learning. ICML, Pittsburgh, Pennsylvania, United States, 9--16."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194902"},{"key":"e_1_3_2_1_4_1","unstructured":"E.V. Belmega P. Mertikopoulos R. Negrel and L. Sanguinetti. 2018. Online convex optimization and no-regret learning: Algorithms guarantees and applications. arXiv:1804.04529 12 April (2018) 1--34.  E.V. Belmega P. Mertikopoulos R. Negrel and L. Sanguinetti. 2018. Online convex optimization and no-regret learning: Algorithms guarantees and applications. arXiv:1804.04529 12 April (2018) 1--34."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2331201"},{"key":"e_1_3_2_1_6_1","volume-title":"Risk-Averse Trust Region Optimization for Reward-Volatility Reduction. In International Joint Conference on Artificial Intelligence. IJCAI, Held Online, 4583--4589","author":"Bisi Lorenzo","year":"2020","unstructured":"Lorenzo Bisi , Luca Sabbioni , Edoardo Vittori , Matteo Papini , and Marcello Restelli . 2020 . Risk-Averse Trust Region Optimization for Reward-Volatility Reduction. In International Joint Conference on Artificial Intelligence. IJCAI, Held Online, 4583--4589 . Lorenzo Bisi, Luca Sabbioni, Edoardo Vittori, Matteo Papini, and Marcello Restelli. 2020. Risk-Averse Trust Region Optimization for Reward-Volatility Reduction. In International Joint Conference on Artificial Intelligence. IJCAI, Held Online, 4583--4589."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007530728748"},{"key":"e_1_3_2_1_8_1","unstructured":"A. Borodin et al. 2004. Can we learn to beat the best stock. In Neural Information Processing Systems. NeurIPS Vancouver Canada 345--352.  A. Borodin et al. 2004. Can we learn to beat the best stock. In Neural Information Processing Systems . NeurIPS Vancouver Canada 345--352."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_1_10_1","unstructured":"N. Cesa-Bianchi O. Dekel and O. Shamir. 2013. Online learning with switching costs and other adaptive adversaries. In Neural Information Processing Systems. NeurIPS Stateline Nevada United States 1160--1168.  N. Cesa-Bianchi O. Dekel and O. Shamir. 2013. Online learning with switching costs and other adaptive adversaries. In Neural Information Processing Systems . NeurIPS Stateline Nevada United States 1160--1168."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-0143-1"},{"volume-title":"The Kelly Capital Growth Investment Criterion. World Scientific","author":"Cover T.M.","key":"e_1_3_2_1_12_1","unstructured":"T.M. Cover . 1991. The Kelly Capital Growth Investment Criterion. World Scientific , Singapore . 181--209 pages. T.M. Cover. 1991. The Kelly Capital Growth Investment Criterion. World Scientific, Singapore. 181--209 pages."},{"volume-title":"Online Lazy Updates for Portfolio Selection with Transaction Costs. In Conference on Artificial Intelligence. AAAI","author":"Das P.","key":"e_1_3_2_1_14_1","unstructured":"P. Das , N. Johnson , and A. Banerjee . 2013 . Online Lazy Updates for Portfolio Selection with Transaction Costs. In Conference on Artificial Intelligence. AAAI , Bellevue, Washington, United States, 202--208. P. Das, N. Johnson, and A. Banerjee. 2013. Online Lazy Updates for Portfolio Selection with Transaction Costs. In Conference on Artificial Intelligence. AAAI, Bellevue, Washington, United States, 202--208."},{"volume-title":"Online algorithms for the portfolio selection problem","author":"Dochow Robert","key":"e_1_3_2_1_15_1","unstructured":"Robert Dochow . 2016. Online algorithms for the portfolio selection problem . Springer , Berlin, Germany . Robert Dochow. 2016. Online algorithms for the portfolio selection problem. Springer, Berlin, Germany."},{"volume-title":"International Conference on Machine Learning. ICML","author":"Duchi J.","key":"e_1_3_2_1_16_1","unstructured":"J. Duchi , S. Shalev-Shwartz , Y. Singer , and T. Chandra . 2008. Efficient projections onto the I1-ball for learning in high dimensions . In International Conference on Machine Learning. ICML , Helsinki, Finland, 272--279. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. 2008. Efficient projections onto the I1-ball for learning in high dimensions. In International Conference on Machine Learning. ICML, Helsinki, Finland, 272--279."},{"volume-title":"Composite Objective Mirror Descent. In Conference on Learning Theory. COLT","author":"Duchi J.C.","key":"e_1_3_2_1_17_1","unstructured":"J.C. Duchi , S. Shalev-Shwartz , Y. Singer , and A. Tewari . 2010 . Composite Objective Mirror Descent. In Conference on Learning Theory. COLT , Haifa, Israel, 14--26. J.C. Duchi, S. Shalev-Shwartz, Y. Singer, and A. Tewari. 2010. Composite Objective Mirror Descent. In Conference on Learning Theory. COLT, Haifa, Israel, 14--26."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.020"},{"key":"e_1_3_2_1_19_1","volume-title":"Neural Information Processing Systems. NeurIPS","author":"Goel Gautam","year":"2019","unstructured":"Gautam Goel , Yiheng Lin , Haoyuan Sun , and Adam Wierman . 2019 . Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization . In Neural Information Processing Systems. NeurIPS , Vancouver, Canada , 1873--1883. Gautam Goel, Yiheng Lin, Haoyuan Sun, and Adam Wierman. 2019. Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization. In Neural Information Processing Systems. NeurIPS, Vancouver, Canada, 1873--1883."},{"key":"e_1_3_2_1_20_1","unstructured":"R. C. Grinold and R.N. Kahn. 2000. Active portfolio management. McGraw Hill New York New York United States.  R. C. Grinold and R.N. Kahn. 2000. Active portfolio management . McGraw Hill New York New York United States."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"N.H. Hakansson and W.T. Ziemba. 1995. Capital growth theory. Handbooks in operations research and management science 9 (1995) 65--86.  N.H. Hakansson and W.T. Ziemba. 1995. Capital growth theory. Handbooks in operations research and management science 9 (1995) 65--86.","DOI":"10.1016\/S0927-0507(05)80047-7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9965.00058"},{"key":"e_1_3_2_1_24_1","unstructured":"S. Ito D. Hatano H. Sumita A. Yabe T. Fukunaga N. Kakimura and K. Kawarabayashi. 2018. Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. In Neural Information Processing Systems. NeurIPS Montr\u00e9al Canada 1--10.  S. Ito D. Hatano H. Sumita A. Yabe T. Fukunaga N. Kakimura and K. Kawarabayashi. 2018. Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. In Neural Information Processing Systems . NeurIPS Montr\u00e9al Canada 1--10."},{"key":"e_1_3_2_1_25_1","first-page":"423","article-title":"Efficient algorithms for universal portfolios","author":"Kalai A.","year":"2002","unstructured":"A. Kalai and S. Vempala . 2002 . Efficient algorithms for universal portfolios . J MACH LEARN RES 3 , Nov (2002), 423 -- 440 . A. Kalai and S. Vempala. 2002. Efficient algorithms for universal portfolios. J MACH LEARN RES 3, Nov (2002), 423--440.","journal-title":"J MACH LEARN RES 3"},{"key":"e_1_3_2_1_26_1","volume-title":"A New Interpretation of Information Rate. Bell Systems 21 March","author":"Kelly J.L.","year":"1956","unstructured":"J.L. Kelly . 1956. A New Interpretation of Information Rate. Bell Systems 21 March ( 1956 ), 25--34. J.L. Kelly. 1956. A New Interpretation of Information Rate. Bell Systems 21 March (1956), 25--34."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512962"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.01.006"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/14697688.2017.1357831"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-012-5281-z"},{"key":"e_1_3_2_1_31_1","unstructured":"Y. Li G. Qu and N. Li. 2018. Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit. arXiv:1801.07780 7 March (2018) 1--24.  Y. Li G. Qu and N. Li. 2018. Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit. arXiv:1801.07780 7 March (2018) 1--24."},{"key":"e_1_3_2_1_32_1","first-page":"98","article-title":"Online optimization with switching cost","volume":"40","author":"Lin M.","year":"2012","unstructured":"M. Lin , A. Wierman , A. Roytman , A. Meyerson , and L.L.H. Andrew . 2012 . Online optimization with switching cost . PERFER SI 40 , 3 (2012), 98 -- 100 . M. Lin, A. Wierman, A. Roytman, A. Meyerson, and L.L.H. Andrew. 2012. Online optimization with switching cost. PERFER SI 40, 3 (2012), 98--100.","journal-title":"PERFER SI"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"L.C. MacLean E.O. Thorp and W.T. Ziemba. 2011. The Kelly capital growth investment criterion: Theory and practice. Vol. 3. World Scientific Singapore.  L.C. MacLean E.O. Thorp and W.T. Ziemba. 2011. The Kelly capital growth investment criterion: Theory and practice . Vol. 3. World Scientific Singapore.","DOI":"10.1142\/9789814293501_0001"},{"key":"e_1_3_2_1_34_1","volume-title":"Portfolio selection. The journal of finance 7, 1","author":"Markowitz H.","year":"1952","unstructured":"H. Markowitz . 1952. Portfolio selection. The journal of finance 7, 1 ( 1952 ), 77--91. H. Markowitz. 1952. Portfolio selection. The journal of finance 7, 1 (1952), 77--91."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"e_1_3_2_1_36_1","volume-title":"On the momentum term in gradient descent learning algorithms. Neural networks 12, 1","author":"Qian Ning","year":"1999","unstructured":"Ning Qian . 1999. On the momentum term in gradient descent learning algorithms. Neural networks 12, 1 ( 1999 ), 145--151. Ning Qian. 1999. On the momentum term in gradient descent learning algorithms. Neural networks 12, 1 (1999), 145--151."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.2.277"},{"key":"e_1_3_2_1_38_1","volume-title":"International Conference on Machine Learning. ICML","author":"Sutskever Ilya","year":"2013","unstructured":"Ilya Sutskever , James Martens , George Dahl , and Geoffrey Hinton . 2013 . On the importance of initialization and momentum in deep learning . In International Conference on Machine Learning. ICML , Atlanta, Georgia, United States, 1139--1147. Ilya Sutskever, James Martens, George Dahl, and Geoffrey Hinton. 2013. On the importance of initialization and momentum in deep learning. In International Conference on Machine Learning. ICML, Atlanta, Georgia, United States, 1139--1147."},{"volume-title":"European Conference on Artificial Intelligence. ECAI","author":"Trov\u00f2 F.","key":"e_1_3_2_1_39_1","unstructured":"F. Trov\u00f2 , S. Paladino , M. Restelli , and N. Gatti . 2016. Budgeted multi-armed bandit in continuous action space . In European Conference on Artificial Intelligence. ECAI , The Hague, Netherlands, 560--568. F. Trov\u00f2, S. Paladino, M. Restelli, and N. Gatti. 2016. Budgeted multi-armed bandit in continuous action space. In European Conference on Artificial Intelligence. ECAI, The Hague, Netherlands, 560--568."},{"key":"e_1_3_2_1_40_1","first-page":"79","article-title":"Reversion strategy for online portfolio selection with transaction costs","volume":"11","author":"Yang X.","year":"2018","unstructured":"X. Yang , H. Li , Y. Zhang , and J. He . 2018 . Reversion strategy for online portfolio selection with transaction costs . INT J APP DECIS SCI 11 , 1 (2018), 79 -- 99 . X. Yang, H. Li, Y. Zhang, and J. He. 2018. Reversion strategy for online portfolio selection with transaction costs. INT J APP DECIS SCI 11, 1 (2018), 79--99.","journal-title":"INT J APP DECIS SCI"},{"key":"e_1_3_2_1_41_1","volume-title":"International Conference on Machine Learning. ICML, Washington D.C., United States, 928--936","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . 2003 . Online convex programming and generalized infinitesimal gradient ascent . In International Conference on Machine Learning. ICML, Washington D.C., United States, 928--936 . M. Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In International Conference on Machine Learning. ICML, Washington D.C., United States, 928--936."}],"event":{"name":"ICAIF '20: ACM International Conference on AI in Finance","sponsor":["ACM Association for Computing Machinery"],"location":"New York New York","acronym":"ICAIF '20"},"container-title":["Proceedings of the First ACM International Conference on AI in Finance"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3383455.3422531","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3383455.3422531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:22Z","timestamp":1750199602000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3383455.3422531"}},"subtitle":["online gradient descent with momentum"],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":40,"alternative-id":["10.1145\/3383455.3422531","10.1145\/3383455"],"URL":"https:\/\/doi.org\/10.1145\/3383455.3422531","relation":{},"subject":[],"published":{"date-parts":[[2020,10,15]]},"assertion":[{"value":"2021-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}