[{"scopus_import":"1","date_updated":"2025-06-24T12:07:06Z","type":"journal_article","publication":"Studia Mathematica","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \\textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces."}],"day":"01","oa":1,"title":"Modelled distributions of Triebel–Lizorkin type","volume":252,"year":"2020","doi":"10.4064/sm180411-11-2","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1709.05202","open_access":"1"}],"publication_identifier":{"eissn":["1730-6337"],"issn":["0039-3223"]},"issue":"3","intvolume":" 252","_id":"9196","quality_controlled":"1","date_published":"2020-03-01T00:00:00Z","status":"public","month":"03","page":"251-297","department":[{"_id":"JuFi"},{"_id":"GradSch"}],"date_created":"2021-02-25T08:55:03Z","publisher":"Instytut Matematyczny","citation":{"ama":"Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 2020;252(3):251-297. doi:10.4064/sm180411-11-2","apa":"Hensel, S., & Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. Instytut Matematyczny. https://doi.org/10.4064/sm180411-11-2","ieee":"S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” Studia Mathematica, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297, 2020.","chicago":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica. Instytut Matematyczny, 2020. https://doi.org/10.4064/sm180411-11-2.","short":"S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297.","mla":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:10.4064/sm180411-11-2.","ista":"Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 252(3), 251–297."},"keyword":["General Mathematics"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"author":[{"full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072","last_name":"Hensel","first_name":"Sebastian"},{"last_name":"Rosati","first_name":"Tommaso","full_name":"Rosati, Tommaso"}],"arxiv":1,"external_id":{"arxiv":["1709.05202"],"isi":["000558100500002"]}},{"date_updated":"2025-07-03T11:44:58Z","type":"journal_article","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","scopus_import":"1","article_type":"original","article_processing_charge":"No","volume":34,"title":"All-pay bidding games on graphs","year":"2020","OA_type":"green","conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"New York, NY, United States","end_date":"2020-02-12","start_date":"2020-02-07"},"day":"03","oa":1,"abstract":[{"text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve.","lang":"eng"}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1911.08360"}],"publication_status":"published","doi":"10.1609/aaai.v34i02.5546","date_published":"2020-04-03T00:00:00Z","project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369"}],"quality_controlled":"1","issue":"02","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["9781577358350"]},"intvolume":" 34","_id":"9197","publisher":"Association for the Advancement of Artificial Intelligence","citation":{"ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546."},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2021-02-25T09:05:18Z","page":"1798-1805","status":"public","month":"04","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"}],"external_id":{"arxiv":["1911.08360"]},"arxiv":1,"OA_place":"repository","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"file":[{"content_type":"application/pdf","creator":"mgarcias","date_updated":"2021-02-26T16:38:14Z","file_id":"9203","checksum":"8f97f229316c3b3a6f0cf99297aa0941","file_size":1125794,"file_name":"main.pdf","relation":"main_file","access_level":"open_access","date_created":"2021-02-26T16:38:14Z"}],"acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","external_id":{"isi":["000680435100021"]},"author":[{"last_name":"Garcia Soto","first_name":"Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2936-5719","full_name":"Garcia Soto, Miriam"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"isi":1,"_id":"9202","publication_identifier":{"eisbn":["9781728183244"],"eissn":["2576-3172"]},"date_published":"2020-12-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"page":"244-256","month":"12","status":"public","citation":{"mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256.","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256.","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031","apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031"},"publisher":"IEEE","date_created":"2021-02-26T16:38:24Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function."}],"language":[{"iso":"eng"}],"year":"2020","title":"Hybridization for stability verification of nonlinear switched systems","oa":1,"conference":{"name":"RTTS: Real-Time Systems Symposium","location":"Houston, TX, USA ","end_date":"2020-12-04","start_date":"2020-12-01"},"day":"01","publication_status":"published","doi":"10.1109/RTSS49844.2020.00031","file_date_updated":"2021-02-26T16:38:14Z","scopus_import":"1","ddc":["000"],"publication":"2020 IEEE Real-Time Systems Symposium","type":"conference","date_updated":"2025-04-15T06:25:57Z","article_processing_charge":"No"},{"type":"conference","publication":"34th Conference on Neural Information Processing Systems","date_updated":"2025-05-14T11:27:13Z","article_processing_charge":"No","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n"}],"oa":1,"conference":{"start_date":"2020-12-06","name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12","location":"Vancouver, Canada"},"day":"07","year":"2020","alternative_title":["Advances in Neural Information Processing Systems"],"volume":33,"title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/2002.07867","open_access":"1"}],"_id":"9221","intvolume":" 33","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"quality_controlled":"1","date_published":"2020-07-07T00:00:00Z","month":"07","status":"public","page":"11961–11972","department":[{"_id":"MaMo"}],"date_created":"2021-03-03T12:06:02Z","citation":{"chicago":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Neural Information Processing Systems Foundation, 2020.","short":"Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2020, pp. 11961–11972.","mla":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 11961–11972.","ista":"Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 33, 11961–11972.","apa":"Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Neural Information Processing Systems Foundation.","ama":"Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Neural Information Processing Systems Foundation; 2020:11961–11972.","ieee":"Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972."},"publisher":"Neural Information Processing Systems Foundation","acknowledgement":"The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","external_id":{"arxiv":["2002.07867"]},"arxiv":1,"author":[{"last_name":"Nguyen","first_name":"Quynh","full_name":"Nguyen, Quynh"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"}]},{"oa_version":"Published Version","related_material":{"record":[{"id":"7541","status":"public","relation":"used_in_publication"}]},"doi":"10.15479/AT:ISTA:9222","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","last_name":"Katsaros","first_name":"Georgios"}],"file_date_updated":"2021-03-10T07:31:50Z","has_accepted_license":"1","corr_author":"1","file":[{"creator":"gkatsaro","content_type":"application/x-zip-compressed","date_updated":"2021-03-05T17:50:45Z","file_id":"9223","file_name":"DOI_SiteControlledHWs.zip","checksum":"41b66e195ed3dbd73077feee77b05652","file_size":13317557,"date_created":"2021-03-05T17:50:45Z","access_level":"open_access","relation":"main_file"},{"content_type":"text/plain","creator":"dernst","date_updated":"2021-03-10T07:31:50Z","file_id":"9233","checksum":"a1dc5f710ba4b3bb7f248195ba754ab2","file_size":3515,"success":1,"file_name":"Readme.txt","relation":"main_file","access_level":"open_access","date_created":"2021-03-10T07:31:50Z"}],"title":"Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling","year":"2020","day":"16","oa":1,"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"status":"public","month":"03","article_processing_charge":"No","citation":{"ieee":"G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.","apa":"Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9222","ama":"Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222","mla":"Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222.","short":"G. Katsaros, (2020).","ista":"Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9222.","chicago":"Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222."},"publisher":"Institute of Science and Technology Austria","date_created":"2021-03-05T18:00:47Z","department":[{"_id":"GeKa"}],"ddc":["530"],"_id":"9222","date_published":"2020-03-16T00:00:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","contributor":[{"contributor_type":"research_group","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios"}],"date_updated":"2025-06-12T07:16:21Z","type":"research_data"},{"has_accepted_license":"1","acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","file":[{"creator":"dernst","content_type":"application/pdf","file_id":"9272","date_updated":"2021-03-22T08:56:37Z","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","checksum":"4a1043fa0548a725d464017fe2483ce0","success":1,"file_size":3668725,"date_created":"2021-03-22T08:56:37Z","access_level":"open_access","relation":"main_file"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"last_name":"Andres","first_name":"Eric","full_name":"Andres, Eric"}],"intvolume":" 4","issue":"1","publication_identifier":{"issn":["2353-3390"]},"_id":"9249","date_published":"2020-11-17T00:00:00Z","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"page":"143-158","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"11","publisher":"De Gruyter","citation":{"ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106.","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158.","mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158."},"department":[{"_id":"HeEd"}],"date_created":"2021-03-16T08:55:19Z","corr_author":"1","abstract":[{"text":"Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.","lang":"eng"}],"language":[{"iso":"eng"}],"title":"Digital objects in rhombic dodecahedron grid","volume":4,"year":"2020","day":"17","oa":1,"publication_status":"published","doi":"10.1515/mathm-2020-0106","ec_funded":1,"file_date_updated":"2021-03-22T08:56:37Z","ddc":["510"],"date_updated":"2025-04-14T07:48:35Z","type":"journal_article","publication":"Mathematical Morphology - Theory and Applications","article_type":"original","article_processing_charge":"No"},{"date_published":"2020-09-20T00:00:00Z","project":[{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"}],"quality_controlled":"1","intvolume":" 12590","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030687656"]},"_id":"9299","citation":{"short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371.","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28.","ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371.","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28","apa":"Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28"},"publisher":"Springer Nature","department":[{"_id":"HeEd"}],"date_created":"2021-03-28T22:01:44Z","page":"359-371","status":"public","month":"09","acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","author":[{"last_name":"Pach","first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"},{"first_name":"Gábor","last_name":"Tardos","full_name":"Tardos, Gábor"},{"first_name":"Géza","last_name":"Tóth","full_name":"Tóth, Géza"}],"arxiv":1,"external_id":{"arxiv":["2006.14908"]},"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-15T07:16:52Z","type":"conference","publication":"28th International Symposium on Graph Drawing and Network Visualization","scopus_import":"1","series_title":"LNCS","article_processing_charge":"No","volume":12590,"title":"Crossings between non-homotopic edges","year":"2020","day":"20","conference":{"location":"Virtual, Online","name":"GD: Graph Drawing and Network Visualization","end_date":"2020-09-18","start_date":"2020-09-16"},"oa":1,"abstract":[{"lang":"eng","text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ ."}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"publication_status":"published","doi":"10.1007/978-3-030-68766-3_28"},{"language":[{"iso":"eng"}],"title":"Eliminating higher-multiplicity intersections, III. Codimension 2","volume":75,"year":"2020","day":"01","oa":1,"publication_status":"published","doi":"10.1070/RM9943","main_file_link":[{"url":"https://arxiv.org/abs/1511.03501","open_access":"1"}],"scopus_import":"1","date_updated":"2025-07-02T10:54:51Z","publication":"Russian Mathematical Surveys","type":"journal_article","article_type":"original","article_processing_charge":"No","acknowledgement":"This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169)","related_material":{"record":[{"status":"public","id":"10220","relation":"later_version"},{"relation":"earlier_version","id":"8183","status":"public"}]},"oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Sergey","last_name":"Avvakumov","orcid":"0000-0002-7840-5062","full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","last_name":"Mabillard"},{"first_name":"A. B.","last_name":"Skopenkov","full_name":"Skopenkov, A. B."}],"external_id":{"arxiv":["1511.03501"],"isi":["000625983100001"]},"arxiv":1,"isi":1,"publication_identifier":{"issn":["0036-0279"]},"intvolume":" 75","issue":"6","_id":"9308","date_published":"2020-12-01T00:00:00Z","quality_controlled":"1","page":"1156-1158","status":"public","month":"12","publisher":"IOP Publishing","citation":{"ista":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.","short":"S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158.","chicago":"Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.","apa":"Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943","ama":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943","ieee":"S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020."},"department":[{"_id":"UlWa"}],"date_created":"2021-04-04T22:01:22Z"},{"date_created":"2021-04-14T12:05:20Z","department":[{"_id":"LeSa"}],"citation":{"chicago":"Gupta, Chitrak, Umesh Khaniya, Chun Chan, Francois Dehez, Mrinal Shekhar, M. R. Gunner, Leonid A Sazanov, Christophe Chipot, and Abhishek Singharoy. “Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I.” American Chemical Society, 2020. https://doi.org/10.1021/jacs.9b13450.s002.","short":"C. Gupta, U. Khaniya, C. Chan, F. Dehez, M. Shekhar, M.R. Gunner, L.A. Sazanov, C. Chipot, A. Singharoy, (2020).","mla":"Gupta, Chitrak, et al. Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I. American Chemical Society, 2020, doi:10.1021/jacs.9b13450.s002.","ista":"Gupta C, Khaniya U, Chan C, Dehez F, Shekhar M, Gunner MR, Sazanov LA, Chipot C, Singharoy A. 2020. Charge transfer and chemo-mechanical coupling in respiratory complex I, American Chemical Society, 10.1021/jacs.9b13450.s002.","ama":"Gupta C, Khaniya U, Chan C, et al. Charge transfer and chemo-mechanical coupling in respiratory complex I. 2020. doi:10.1021/jacs.9b13450.s002","apa":"Gupta, C., Khaniya, U., Chan, C., Dehez, F., Shekhar, M., Gunner, M. R., … Singharoy, A. (2020). Charge transfer and chemo-mechanical coupling in respiratory complex I. American Chemical Society. https://doi.org/10.1021/jacs.9b13450.s002","ieee":"C. Gupta et al., “Charge transfer and chemo-mechanical coupling in respiratory complex I.” American Chemical Society, 2020."},"publisher":"American Chemical Society","article_processing_charge":"No","month":"05","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"type":"research_data_reference","date_updated":"2025-07-10T11:55:01Z","date_published":"2020-05-20T00:00:00Z","_id":"9326","author":[{"first_name":"Chitrak","last_name":"Gupta","full_name":"Gupta, Chitrak"},{"full_name":"Khaniya, Umesh","last_name":"Khaniya","first_name":"Umesh"},{"last_name":"Chan","first_name":"Chun","full_name":"Chan, Chun"},{"full_name":"Dehez, Francois","last_name":"Dehez","first_name":"Francois"},{"last_name":"Shekhar","first_name":"Mrinal","full_name":"Shekhar, Mrinal"},{"full_name":"Gunner, M. R.","first_name":"M. R.","last_name":"Gunner"},{"first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A"},{"last_name":"Chipot","first_name":"Christophe","full_name":"Chipot, Christophe"},{"full_name":"Singharoy, Abhishek","first_name":"Abhishek","last_name":"Singharoy"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1021/jacs.9b13450.s002","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8040"}]},"oa_version":"Published Version","day":"20","year":"2020","title":"Charge transfer and chemo-mechanical coupling in respiratory complex I","abstract":[{"text":"The mitochondrial respiratory chain, formed by five protein complexes, utilizes energy from catabolic processes to synthesize ATP. Complex I, the first and the largest protein complex of the chain, harvests electrons from NADH to reduce quinone, while pumping protons across the mitochondrial membrane. Detailed knowledge of the working principle of such coupled charge-transfer processes remains, however, fragmentary due to bottlenecks in understanding redox-driven conformational transitions and their interplay with the hydrated proton pathways. Complex I from Thermus thermophilus encases 16 subunits with nine iron–sulfur clusters, reduced by electrons from NADH. Here, employing the latest crystal structure of T. thermophilus complex I, we have used microsecond-scale molecular dynamics simulations to study the chemo-mechanical coupling between redox changes of the iron–sulfur clusters and conformational transitions across complex I. First, we identify the redox switches within complex I, which allosterically couple the dynamics of the quinone binding pocket to the site of NADH reduction. Second, our free-energy calculations reveal that the affinity of the quinone, specifically menaquinone, for the binding-site is higher than that of its reduced, menaquinol forma design essential for menaquinol release. Remarkably, the barriers to diffusive menaquinone dynamics are lesser than that of the more ubiquitous ubiquinone, and the naphthoquinone headgroup of the former furnishes stronger binding interactions with the pocket, favoring menaquinone for charge transport in T. thermophilus. Our computations are consistent with experimentally validated mutations and hierarchize the key residues into three functional classes, identifying new mutation targets. Third, long-range hydrogen-bond networks connecting the quinone-binding site to the transmembrane subunits are found to be responsible for proton pumping. Put together, the simulations reveal the molecular design principles linking redox reactions to quinone turnover to proton translocation in complex I.","lang":"eng"}]},{"article_processing_charge":"No","scopus_import":"1","ddc":["000"],"type":"conference","publication":"37th International Conference on Machine Learning, ICML 2020","date_updated":"2023-02-23T13:57:24Z","file_date_updated":"2021-05-25T09:51:36Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. "}],"oa":1,"day":"12","conference":{"start_date":"2020-07-12","end_date":"2020-07-18","location":"Online","name":"ICML: International Conference on Machine Learning"},"year":"2020","volume":119,"title":"Inducing and exploiting activation sparsity for fast neural network inference","month":"07","status":"public","page":"5533-5543","department":[{"_id":"DaAl"}],"date_created":"2021-05-23T22:01:45Z","citation":{"chicago":"Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020.","mla":"Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.","short":"M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.","ista":"Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.","ieee":"M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, ICML 2020, Online, 2020, vol. 119, pp. 5533–5543.","ama":"Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.","apa":"Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online."},"_id":"9415","publication_identifier":{"issn":["2640-3498"]},"intvolume":" 119","quality_controlled":"1","date_published":"2020-07-12T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","author":[{"full_name":"Kurtz, Mark","first_name":"Mark","last_name":"Kurtz"},{"full_name":"Kopinsky, Justin","last_name":"Kopinsky","first_name":"Justin"},{"full_name":"Gelashvili, Rati","first_name":"Rati","last_name":"Gelashvili"},{"full_name":"Matveev, Alexander","last_name":"Matveev","first_name":"Alexander"},{"full_name":"Carr, John","first_name":"John","last_name":"Carr"},{"full_name":"Goin, Michael","first_name":"Michael","last_name":"Goin"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"last_name":"Moore","first_name":"Sage","full_name":"Moore, Sage"},{"first_name":"Bill","last_name":"Nell","full_name":"Nell, Bill"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"}],"file":[{"content_type":"application/pdf","creator":"kschuh","date_updated":"2021-05-25T09:51:36Z","file_id":"9421","file_name":"2020_PMLR_Kurtz.pdf","file_size":741899,"success":1,"checksum":"2aaaa7d7226e49161311d91627cf783b","access_level":"open_access","relation":"main_file","date_created":"2021-05-25T09:51:36Z"}],"has_accepted_license":"1"},{"quality_controlled":"1","date_published":"2020-01-16T00:00:00Z","issue":"2","publication_identifier":{"eissn":["1097-4164"],"issn":["1097-2765"]},"intvolume":" 77","_id":"9526","department":[{"_id":"DaZi"}],"date_created":"2021-06-08T06:37:09Z","citation":{"ista":"Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. 2020. DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. 77(2), 310–323.e7.","mla":"Choi, Jaemyung, et al. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements and Aberrant Intragenic Transcripts.” Molecular Cell, vol. 77, no. 2, Elsevier, 2020, p. 310–323.e7, doi:10.1016/j.molcel.2019.10.011.","short":"J. Choi, D.B. Lyons, M.Y. Kim, J.D. Moore, D. Zilberman, Molecular Cell 77 (2020) 310–323.e7.","chicago":"Choi, Jaemyung, David B. Lyons, M. Yvonne Kim, Jonathan D. Moore, and Daniel Zilberman. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements and Aberrant Intragenic Transcripts.” Molecular Cell. Elsevier, 2020. https://doi.org/10.1016/j.molcel.2019.10.011.","ama":"Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. 2020;77(2):310-323.e7. doi:10.1016/j.molcel.2019.10.011","ieee":"J. Choi, D. B. Lyons, M. Y. Kim, J. D. Moore, and D. Zilberman, “DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts,” Molecular Cell, vol. 77, no. 2. Elsevier, p. 310–323.e7, 2020.","apa":"Choi, J., Lyons, D. B., Kim, M. Y., Moore, J. D., & Zilberman, D. (2020). DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. Elsevier. https://doi.org/10.1016/j.molcel.2019.10.011"},"publisher":"Elsevier","status":"public","month":"01","page":"310-323.e7","OA_place":"publisher","author":[{"full_name":"Choi, Jaemyung","first_name":"Jaemyung","last_name":"Choi"},{"full_name":"Lyons, David B.","first_name":"David B.","last_name":"Lyons"},{"last_name":"Kim","first_name":"M. Yvonne","full_name":"Kim, M. Yvonne"},{"first_name":"Jonathan D.","last_name":"Moore","full_name":"Moore, Jonathan D."},{"last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"}],"pmid":1,"external_id":{"pmid":["31732458"]},"oa_version":"Published Version","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","date_updated":"2024-10-16T12:14:37Z","type":"journal_article","publication":"Molecular Cell","scopus_import":"1","article_processing_charge":"No","article_type":"original","OA_type":"hybrid","day":"16","oa":1,"extern":"1","title":"DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts","volume":77,"year":"2020","language":[{"iso":"eng"}],"abstract":[{"text":"DNA methylation and histone H1 mediate transcriptional silencing of genes and transposable elements, but how they interact is unclear. In plants and animals with mosaic genomic methylation, functionally mysterious methylation is also common within constitutively active housekeeping genes. Here, we show that H1 is enriched in methylated sequences, including genes, of Arabidopsis thaliana, yet this enrichment is independent of DNA methylation. Loss of H1 disperses heterochromatin, globally alters nucleosome organization, and activates H1-bound genes, but only weakly de-represses transposable elements. However, H1 loss strongly activates transposable elements hypomethylated through mutation of DNA methyltransferase MET1. Hypomethylation of genes also activates antisense transcription, which is modestly enhanced by H1 loss. Our results demonstrate that H1 and DNA methylation jointly maintain transcriptional homeostasis by silencing transposable elements and aberrant intragenic transcripts. Such functionality plausibly explains why DNA methylation, a well-known mutagen, has been maintained within coding sequences of crucial plant and animal genes.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1016/j.molcel.2019.10.011","open_access":"1"}],"doi":"10.1016/j.molcel.2019.10.011","publication_status":"published"},{"issue":"3","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"intvolume":" 52","_id":"9573","date_published":"2020-06-01T00:00:00Z","quality_controlled":"1","page":"515-529","status":"public","month":"06","citation":{"ama":"He X, Kwan MA. Universality of random permutations. Bulletin of the London Mathematical Society. 2020;52(3):515-529. doi:10.1112/blms.12345","ieee":"X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.","apa":"He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345","ista":"He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the London Mathematical Society. 52(3), 515–529.","mla":"He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29, doi:10.1112/blms.12345.","short":"X. He, M.A. Kwan, Bulletin of the London Mathematical Society 52 (2020) 515–529.","chicago":"He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/blms.12345."},"publisher":"Wiley","date_created":"2021-06-21T06:23:42Z","oa_version":"Preprint","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"full_name":"He, Xiaoyu","first_name":"Xiaoyu","last_name":"He"},{"last_name":"Kwan","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567"}],"arxiv":1,"external_id":{"arxiv":["1911.12878"]},"scopus_import":"1","date_updated":"2023-02-23T14:01:23Z","publication":"Bulletin of the London Mathematical Society","type":"journal_article","article_type":"original","article_processing_charge":"No","abstract":[{"lang":"eng","text":"It is a classical fact that for any ε>0, a random permutation of length n=(1+ε)k2/4 typically contains a monotone subsequence of length k. As a far-reaching generalization, Alon conjectured that a random permutation of this same length n is typically k-universal, meaning that it simultaneously contains every pattern of length k. He also made the simple observation that for n=O(k2logk), a random length-n permutation is typically k-universal. We make the first significant progress towards Alon's conjecture by showing that n=2000k2loglogk suffices."}],"language":[{"iso":"eng"}],"volume":52,"title":"Universality of random permutations","year":"2020","day":"01","extern":"1","oa":1,"publication_status":"published","doi":"10.1112/blms.12345","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1911.12878"}]},{"article_processing_charge":"No","article_type":"original","type":"journal_article","publication":"International Mathematics Research Notices","date_updated":"2023-02-23T14:01:30Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv-export-lb.library.cornell.edu/abs/1810.07462"}],"doi":"10.1093/imrn/rnaa004","publication_status":"published","oa":1,"extern":"1","day":"01","year":"2020","volume":2020,"title":"Halfway to Rota’s basis conjecture","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In 1989, Rota made the following conjecture. Given n bases B1,…,Bn in an n-dimensional vector space V⁠, one can always find n disjoint bases of V⁠, each containing exactly one element from each Bi (we call such bases transversal bases). Rota’s basis conjecture remains wide open despite its apparent simplicity and the efforts of many researchers (e.g., the conjecture was recently the subject of the collaborative “Polymath” project). In this paper we prove that one can always find (1/2−o(1))n disjoint transversal bases, improving on the previous best bound of Ω(n/logn)⁠. Our results also apply to the more general setting of matroids."}],"date_created":"2021-06-21T08:12:30Z","publisher":"Oxford University Press","citation":{"ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020;2020(21):8007-8026. doi:10.1093/imrn/rnaa004","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, and B. Sudakov, “Halfway to Rota’s basis conjecture,” International Mathematics Research Notices, vol. 2020, no. 21. Oxford University Press, pp. 8007–8026, 2020.","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., & Sudakov, B. (2020). Halfway to Rota’s basis conjecture. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaa004","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, and Benny Sudakov. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices. Oxford University Press, 2020. https://doi.org/10.1093/imrn/rnaa004.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, International Mathematics Research Notices 2020 (2020) 8007–8026.","mla":"Bucić, Matija, et al. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press, 2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.","ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. 2020. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020(21), 8007–8026."},"month":"11","status":"public","page":"8007-8026","quality_controlled":"1","date_published":"2020-11-01T00:00:00Z","_id":"9576","intvolume":" 2020","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"issue":"21","external_id":{"arxiv":["1810.07462"]},"arxiv":1,"author":[{"last_name":"Bucić","first_name":"Matija","full_name":"Bucić, Matija"},{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","last_name":"Kwan","first_name":"Matthew Alan"},{"first_name":"Alexey","last_name":"Pokrovskiy","full_name":"Pokrovskiy, Alexey"},{"full_name":"Sudakov, Benny","first_name":"Benny","last_name":"Sudakov"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Preprint"},{"user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","oa_version":"Published Version","arxiv":1,"external_id":{"arxiv":["1711.02937"]},"author":[{"orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","first_name":"Matthew Alan"},{"full_name":"Sudakov, Benny","first_name":"Benny","last_name":"Sudakov"}],"OA_place":"publisher","_id":"9577","intvolume":" 2020","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"issue":"6","date_published":"2020-03-01T00:00:00Z","quality_controlled":"1","page":"1621–1638","month":"03","status":"public","publisher":"Oxford University Press","citation":{"short":"M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020) 1621–1638.","mla":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.","ista":"Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020(6), 1621–1638.","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices. Oxford University Press, 2020. https://doi.org/10.1093/imrn/rny064.","ieee":"M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically many sizes,” International Mathematics Research Notices, vol. 2020, no. 6. Oxford University Press, pp. 1621–1638, 2020.","ama":"Kwan MA, Sudakov B. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020;2020(6):1621–1638. doi:10.1093/imrn/rny064","apa":"Kwan, M. A., & Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rny064"},"date_created":"2021-06-21T08:30:12Z","abstract":[{"lang":"eng","text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clogn⁠. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. Motivated by an old problem of Erd̋s and McKay, recently Narayanan, Sahasrabudhe, and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of Θ(n2) different sizes. In this paper we prove this conjecture."}],"language":[{"iso":"eng"}],"year":"2020","title":"Ramsey graphs induce subgraphs of quadratically many sizes","volume":2020,"extern":"1","oa":1,"OA_type":"hybrid","day":"01","publication_status":"published","doi":"10.1093/imrn/rny064","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/imrn/rny064"}],"scopus_import":"1","type":"journal_article","publication":"International Mathematics Research Notices","date_updated":"2024-10-16T12:20:07Z","article_type":"original","article_processing_charge":"No"},{"arxiv":1,"external_id":{"arxiv":["1809.01468"]},"author":[{"full_name":"Bucić, Matija","first_name":"Matija","last_name":"Bucić"},{"last_name":"Kwan","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567"},{"full_name":"Pokrovskiy, Alexey","last_name":"Pokrovskiy","first_name":"Alexey"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"},{"full_name":"Tran, Tuan","first_name":"Tuan","last_name":"Tran"},{"last_name":"Wagner","first_name":"Adam Zsolt","full_name":"Wagner, Adam Zsolt"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Preprint","date_created":"2021-06-21T13:24:35Z","publisher":"Springer","citation":{"ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel Journal of Mathematics 238 (2020) 663–685.","mla":"Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:10.1007/s11856-020-2035-7.","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics. Springer, 2020. https://doi.org/10.1007/s11856-020-2035-7.","ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 2020;238(2):663-685. doi:10.1007/s11856-020-2035-7","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” Israel Journal of Mathematics, vol. 238, no. 2. Springer, pp. 663–685, 2020.","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., & Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-020-2035-7"},"month":"07","status":"public","page":"663-685","quality_controlled":"1","date_published":"2020-07-01T00:00:00Z","_id":"9578","intvolume":" 238","issue":"2","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01468"}],"doi":"10.1007/s11856-020-2035-7","publication_status":"published","extern":"1","oa":1,"day":"01","year":"2020","title":"Nearly-linear monotone paths in edge-ordered graphs","volume":238,"language":[{"iso":"eng"}],"abstract":[{"text":"How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971, and has since attracted the attention of many researchers, inspiring a variety of related problems. The prevailing conjecture is that one can always find a monotone path of linear length, but until now the best known lower bound was n2/3-o(1). In this paper we almost close this gap, proving that any edge-ordering of the complete graph contains a monotone path of length n1-o(1).","lang":"eng"}],"article_processing_charge":"No","article_type":"original","publication":"Israel Journal of Mathematics","type":"journal_article","date_updated":"2023-02-23T14:01:35Z","scopus_import":"1"},{"article_processing_charge":"No","article_type":"original","publication":"Proceedings of the London Mathematical Society","type":"journal_article","date_updated":"2023-02-23T14:01:43Z","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1611.02246","open_access":"1"}],"doi":"10.1112/plms.12373","publication_status":"published","oa":1,"extern":"1","day":"01","year":"2020","volume":121,"title":"Almost all Steiner triple systems have perfect matchings","language":[{"iso":"eng"}],"abstract":[{"text":"We show that for any 𝑛 divisible by 3, almost all order- 𝑛 Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a uniformly random Steiner triple system to the outcome of the triangle removal process, which we hope will be useful for other problems. Our methods can also be adapted to other types of designs; for example, we sketch a proof of the theorem that almost all Latin squares have transversals.","lang":"eng"}],"date_created":"2021-06-22T06:35:16Z","citation":{"ieee":"M. A. Kwan, “Almost all Steiner triple systems have perfect matchings,” Proceedings of the London Mathematical Society, vol. 121, no. 6. Wiley, pp. 1468–1495, 2020.","ama":"Kwan MA. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 2020;121(6):1468-1495. doi:10.1112/plms.12373","apa":"Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12373","short":"M.A. Kwan, Proceedings of the London Mathematical Society 121 (2020) 1468–1495.","mla":"Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley, 2020, pp. 1468–95, doi:10.1112/plms.12373.","ista":"Kwan MA. 2020. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 121(6), 1468–1495.","chicago":"Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/plms.12373."},"publisher":"Wiley","month":"12","status":"public","page":"1468-1495","quality_controlled":"1","date_published":"2020-12-01T00:00:00Z","_id":"9581","issue":"6","publication_identifier":{"eissn":["1460-244X"],"issn":["0024-6115"]},"intvolume":" 121","external_id":{"arxiv":["1611.02246"]},"arxiv":1,"author":[{"last_name":"Kwan","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Preprint"},{"oa_version":"Preprint","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan"},{"last_name":"Letzter","first_name":"Shoham","full_name":"Letzter, Shoham"},{"first_name":"Benny","last_name":"Sudakov","full_name":"Sudakov, Benny"},{"full_name":"Tran, Tuan","first_name":"Tuan","last_name":"Tran"}],"external_id":{"arxiv":["1810.12144"]},"arxiv":1,"status":"public","month":"04","page":"283-305","date_created":"2021-06-22T06:42:26Z","publisher":"Springer","citation":{"apa":"Kwan, M. A., Letzter, S., Sudakov, B., & Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. Springer. https://doi.org/10.1007/s00493-019-4086-0","ama":"Kwan MA, Letzter S, Sudakov B, Tran T. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 2020;40(2):283-305. doi:10.1007/s00493-019-4086-0","ieee":"M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite subgraphs in triangle-free graphs,” Combinatorica, vol. 40, no. 2. Springer, pp. 283–305, 2020.","ista":"Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 40(2), 283–305.","mla":"Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.","short":"M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305.","chicago":"Kwan, Matthew Alan, Shoham Letzter, Benny Sudakov, and Tuan Tran. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica. Springer, 2020. https://doi.org/10.1007/s00493-019-4086-0."},"publication_identifier":{"issn":["0209-9683"],"eissn":["1439-6912"]},"intvolume":" 40","issue":"2","_id":"9582","quality_controlled":"1","date_published":"2020-04-01T00:00:00Z","doi":"10.1007/s00493-019-4086-0","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1810.12144","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The problem of finding dense induced bipartite subgraphs in H-free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any H-free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degree at least cH log d/log log d, thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we also answer a question of Erdœs, Janson, Łuczak and Spencer."}],"day":"01","oa":1,"extern":"1","title":"Dense induced bipartite subgraphs in triangle-free graphs","volume":40,"year":"2020","article_processing_charge":"No","article_type":"original","scopus_import":"1","date_updated":"2023-02-23T14:01:45Z","publication":"Combinatorica","type":"journal_article"},{"date_created":"2021-06-22T09:12:23Z","publisher":"Cambridge University Press","citation":{"mla":"Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University Press, 2020, doi:10.1017/fms.2020.29.","short":"A. Ferber, M.A. Kwan, Forum of Mathematics 8 (2020).","ista":"Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39.","chicago":"Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics. Cambridge University Press, 2020. https://doi.org/10.1017/fms.2020.29.","ama":"Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 2020;8. doi:10.1017/fms.2020.29","ieee":"A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,” Forum of Mathematics, vol. 8. Cambridge University Press, 2020.","apa":"Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29"},"status":"public","month":"11","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"quality_controlled":"1","date_published":"2020-11-03T00:00:00Z","publication_identifier":{"eissn":["2050-5094"]},"intvolume":" 8","_id":"9583","OA_place":"publisher","author":[{"first_name":"Asaf","last_name":"Ferber","full_name":"Ferber, Asaf"},{"full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan"}],"pmid":1,"DOAJ_listed":"1","external_id":{"pmid":["1907.06744"]},"oa_version":"Published Version","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","has_accepted_license":"1","file":[{"date_updated":"2021-06-22T09:23:59Z","file_id":"9584","creator":"asandaue","content_type":"application/pdf","date_created":"2021-06-22T09:23:59Z","relation":"main_file","access_level":"open_access","success":1,"file_size":601516,"checksum":"5553c596bb4db0f38226a56bee9c87a1","file_name":"2020_CambridgeUniversityPress_Ferber.pdf"}],"article_processing_charge":"No","article_type":"original","date_updated":"2024-10-16T12:26:40Z","type":"journal_article","publication":"Forum of Mathematics","ddc":["510"],"scopus_import":"1","file_date_updated":"2021-06-22T09:23:59Z","doi":"10.1017/fms.2020.29","publication_status":"published","OA_type":"gold","day":"03","extern":"1","oa":1,"title":"Almost all Steiner triple systems are almost resolvable","volume":8,"year":"2020","article_number":"e39","language":[{"iso":"eng"}],"abstract":[{"text":"We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).","lang":"eng"}]},{"article_processing_charge":"No","type":"conference","date_updated":"2025-05-14T11:27:33Z","scopus_import":"1","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html"}],"publication_status":"published","oa":1,"day":"06","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06"},"year":"2020","alternative_title":["Advances in Neural Information Processing Systems"],"volume":33,"title":"Scalable belief propagation via relaxed scheduling","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been considerable effort invested into developing efficient parallel variants of classic machine learning algorithms. However, despite the wealth of knowledge on parallelization, some classic machine learning algorithms often prove hard to parallelize efficiently while maintaining convergence. In this paper, we focus on efficient parallel algorithms for the key machine learning task of inference on graphical models, in particular on the fundamental belief propagation algorithm. We address the challenge of efficiently parallelizing this classic paradigm by showing how to leverage scalable relaxed schedulers in this context. We present an extensive empirical study, showing that our approach outperforms previous parallel belief propagation implementations both in terms of scalability and in terms of wall-clock convergence time, on a range of practical applications."}],"corr_author":"1","department":[{"_id":"DaAl"}],"date_created":"2021-07-04T22:01:26Z","citation":{"ama":"Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed scheduling. In: Vol 33. Neural Information Processing Systems Foundation; 2020:22361-22372.","ieee":"V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.","apa":"Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling (Vol. 33, pp. 22361–22372). Presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling,” 33:22361–72. Neural Information Processing Systems Foundation, 2020.","ista":"Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. NeurIPS: Conference on Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 33, 22361–22372.","mla":"Aksenov, Vitaly, et al. Scalable Belief Propagation via Relaxed Scheduling. Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 22361–72.","short":"V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Neural Information Processing Systems Foundation, 2020, pp. 22361–22372."},"publisher":"Neural Information Processing Systems Foundation","month":"12","status":"public","page":"22361-22372","project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","date_published":"2020-12-06T00:00:00Z","_id":"9631","intvolume":" 33","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713829546"]},"external_id":{"arxiv":["2002.11505"]},"arxiv":1,"author":[{"last_name":"Aksenov","first_name":"Vitaly","full_name":"Aksenov, Vitaly"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne","first_name":"Janne","last_name":"Korhonen"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","acknowledgement":"We thank Marco Mondelli for discussions related to LDPC decoding, and Giorgi Nadiradze for discussions on analysis of relaxed schedulers. This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML)."},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","arxiv":1,"external_id":{"arxiv":["2004.14340"]},"author":[{"full_name":"Singh, Sidak Pal","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","last_name":"Singh","first_name":"Sidak Pal"},{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","month":"12","status":"public","page":"18098-18109","department":[{"_id":"DaAl"},{"_id":"ToHe"}],"date_created":"2021-07-04T22:01:26Z","citation":{"chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression,” 33:18098–109. Neural Information Processing Systems Foundation, 2020.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. WoodFisher: Efficient Second-Order Approximation for Neural Network Compression. Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 18098–109.","short":"S.P. Singh, D.-A. Alistarh, in:, Neural Information Processing Systems Foundation, 2020, pp. 18098–18109.","ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. NeurIPS: Conference on Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 33, 18098–18109.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Vol 33. Neural Information Processing Systems Foundation; 2020:18098-18109.","apa":"Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression (Vol. 33, pp. 18098–18109). Presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation."},"publisher":"Neural Information Processing Systems Foundation","_id":"9632","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713829546"]},"intvolume":" 33","quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"}],"date_published":"2020-12-06T00:00:00Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html"}],"ec_funded":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher."}],"corr_author":"1","oa":1,"conference":{"location":"Vancouver, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2020-12-12","start_date":"2020-12-06"},"day":"06","year":"2020","alternative_title":["Advances in Neural Information Processing Systems"],"volume":33,"title":"WoodFisher: Efficient second-order approximation for neural network compression","article_processing_charge":"No","scopus_import":"1","type":"conference","date_updated":"2025-05-14T11:27:23Z"}]