[{"year":"2021","oa":1,"page":"14873-14886","publication":"35th Conference on Neural Information Processing Systems","date_updated":"2022-06-27T07:05:12Z","external_id":{"arxiv":["2010.08222"]},"date_published":"2021-12-06T00:00:00Z","date_created":"2022-06-26T22:01:35Z","scopus_import":"1","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","publisher":"Curran Associates","intvolume":"        34","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/7cfd5df443b4eb0d69886a583b33de4c-Paper.pdf"}],"abstract":[{"text":"Efficiently approximating local curvature information of the loss function is a key tool for optimization and compression of deep neural networks. Yet, most existing methods to approximate second-order information have high computational\r\nor storage costs, which limits their practicality. In this work, we investigate matrix-free, linear-time approaches for estimating Inverse-Hessian Vector Products (IHVPs) for the case when the Hessian can be approximated as a sum of rank-one matrices, as in the classic approximation of the Hessian by the empirical Fisher matrix. We propose two new algorithms: the first is tailored towards network compression and can compute the IHVP for dimension d, if the Hessian is given as a sum of m rank-one matrices, using O(dm2) precomputation, O(dm) cost for computing the IHVP, and query cost O(m) for any single element of the inverse Hessian. The second algorithm targets an optimization setting, where we wish to compute the product between the inverse Hessian, estimated over a sliding window of optimization steps, and a given gradient direction, as required for preconditioned SGD. We give an algorithm with cost O(dm + m2) for computing the IHVP and O(dm + m3) for adding or removing any gradient from the sliding window. These\r\ntwo algorithms yield state-of-the-art results for network pruning and optimization with lower computational overhead relative to existing second-order methods. Implementations are available at [9] and [17].","lang":"eng"}],"title":"M-FAC: Efficient matrix-free approximations of second-order information","author":[{"last_name":"Frantar","full_name":"Frantar, Elias","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"last_name":"Kurtic","full_name":"Kurtic, Eldar","first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"_id":"11463","acknowledgement":"We gratefully acknowledge funding the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as computational support from Amazon Web Services (AWS) EC2.","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"oa_version":"Published Version","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual, Online","end_date":"2021-12-14"},"citation":{"mla":"Frantar, Elias, et al. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 34, Curran Associates, 2021, pp. 14873–86.","chicago":"Frantar, Elias, Eldar Kurtic, and Dan-Adrian Alistarh. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” In <i>35th Conference on Neural Information Processing Systems</i>, 34:14873–86. Curran Associates, 2021.","apa":"Frantar, E., Kurtic, E., &#38; Alistarh, D.-A. (2021). M-FAC: Efficient matrix-free approximations of second-order information. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 34, pp. 14873–14886). Virtual, Online: Curran Associates.","ieee":"E. Frantar, E. Kurtic, and D.-A. Alistarh, “M-FAC: Efficient matrix-free approximations of second-order information,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 34, pp. 14873–14886.","ista":"Frantar E, Kurtic E, Alistarh D-A. 2021. M-FAC: Efficient matrix-free approximations of second-order information. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 14873–14886.","ama":"Frantar E, Kurtic E, Alistarh D-A. M-FAC: Efficient matrix-free approximations of second-order information. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 34. Curran Associates; 2021:14873-14886.","short":"E. Frantar, E. Kurtic, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 14873–14886."},"day":"06","month":"12","article_processing_charge":"No","volume":34,"arxiv":1},{"oa":1,"year":"2021","publication":"35th Conference on Neural Information Processing Systems","date_updated":"2022-06-27T06:54:31Z","page":"7254-7266","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2010.08222"]},"date_published":"2021-12-06T00:00:00Z","date_created":"2022-06-26T22:01:35Z","scopus_import":"1","publisher":"Curran Associates","intvolume":"        34","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/3b92d18aa7a6176dd37d372bc2f1eb71-Paper.pdf"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","title":"Towards tight communication lower bounds for distributed optimisation","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne"}],"_id":"11464","abstract":[{"text":"We consider a standard distributed optimisation setting where N machines, each holding a d-dimensional function\r\nfi, aim to jointly minimise the sum of the functions ∑Ni=1fi(x). This problem arises naturally in large-scale distributed optimisation, where a standard solution is to apply variants of (stochastic) gradient descent. We focus on the communication complexity of this problem: our main result provides the first fully unconditional bounds on total number of bits which need to be sent and received by the N machines to solve this problem under point-to-point communication, within a given error-tolerance. Specifically, we show that Ω(Ndlogd/Nε) total bits need to be communicated between the machines to find an additive ϵ-approximation to the minimum of ∑Ni=1fi(x). The result holds for both deterministic and randomised algorithms, and, importantly, requires no assumptions on the algorithm structure. The lower bound is tight under certain restrictions on parameter values, and is matched within constant factors for quadratic objectives by a new variant of quantised gradient descent, which we describe and analyse. Our results bring over tools from communication complexity to distributed optimisation, which has potential for further applications.","lang":"eng"}],"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"status":"public","acknowledgement":"We thank the NeurIPS reviewers for insightful comments that helped us improve the positioning of our results, as well as for pointing out the subsampling approach for complementing the randomised lower bound. We also thank Foivos Alimisis and Peter Davies for useful discussions. 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).","publication_status":"published","ec_funded":1,"citation":{"ama":"Alistarh D-A, Korhonen J. Towards tight communication lower bounds for distributed optimisation. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 34. Curran Associates; 2021:7254-7266.","short":"D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 7254–7266.","ista":"Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 7254–7266.","apa":"Alistarh, D.-A., &#38; Korhonen, J. (2021). Towards tight communication lower bounds for distributed optimisation. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 34, pp. 7254–7266). Virtual, Online: Curran Associates.","ieee":"D.-A. Alistarh and J. Korhonen, “Towards tight communication lower bounds for distributed optimisation,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 34, pp. 7254–7266.","chicago":"Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” In <i>35th Conference on Neural Information Processing Systems</i>, 34:7254–66. Curran Associates, 2021.","mla":"Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 34, Curran Associates, 2021, pp. 7254–66."},"day":"06","month":"12","oa_version":"Published Version","conference":{"start_date":"2021-12-06","location":"Virtual, Online","end_date":"2021-12-14","name":"NeurIPS: Neural Information Processing Systems"},"arxiv":1,"volume":34,"article_processing_charge":"No"},{"citation":{"apa":"Kuzmicz-Kowalska, K., &#38; Kicheva, A. (2021). Regulation of size and scale in vertebrate spinal cord development. <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. Wiley. <a href=\"https://doi.org/10.1002/wdev.383\">https://doi.org/10.1002/wdev.383</a>","ieee":"K. Kuzmicz-Kowalska and A. Kicheva, “Regulation of size and scale in vertebrate spinal cord development,” <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. Wiley, 2021.","ista":"Kuzmicz-Kowalska K, Kicheva A. 2021. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology., e383.","ama":"Kuzmicz-Kowalska K, Kicheva A. Regulation of size and scale in vertebrate spinal cord development. <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. 2021. doi:<a href=\"https://doi.org/10.1002/wdev.383\">10.1002/wdev.383</a>","short":"K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental Biology (2021).","chicago":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/wdev.383\">https://doi.org/10.1002/wdev.383</a>.","mla":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” <i>Wiley Interdisciplinary Reviews: Developmental Biology</i>, e383, Wiley, 2021, doi:<a href=\"https://doi.org/10.1002/wdev.383\">10.1002/wdev.383</a>."},"day":"15","file_date_updated":"2020-11-24T13:11:39Z","pmid":1,"ddc":["570"],"month":"04","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2020-11-24T13:11:39Z","file_id":"8800","content_type":"application/pdf","checksum":"f0a7745d48afa09ea7025e876a0145a8","access_level":"open_access","date_updated":"2020-11-24T13:11:39Z","success":1,"creator":"dernst","file_size":2527276,"relation":"main_file","file_name":"2020_WIREs_DevBio_KuzmiczKowalska.pdf"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","title":"Regulation of size and scale in vertebrate spinal cord development","author":[{"full_name":"Kuzmicz-Kowalska, Katarzyna","last_name":"Kuzmicz-Kowalska","id":"4CED352A-F248-11E8-B48F-1D18A9856A87","first_name":"Katarzyna"},{"orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna","full_name":"Kicheva, Anna","last_name":"Kicheva"}],"_id":"7883","abstract":[{"lang":"eng","text":"All vertebrates have a spinal cord with dimensions and shape specific to their species. Yet how species‐specific organ size and shape are achieved is a fundamental unresolved question in biology. The formation and sculpting of organs begins during embryonic development. As it develops, the spinal cord extends in anterior–posterior direction in synchrony with the overall growth of the body. The dorsoventral (DV) and apicobasal lengths of the spinal cord neuroepithelium also change, while at the same time a characteristic pattern of neural progenitor subtypes along the DV axis is established and elaborated. At the basis of these changes in tissue size and shape are biophysical determinants, such as the change in cell number, cell size and shape, and anisotropic tissue growth. These processes are controlled by global tissue‐scale regulators, such as morphogen signaling gradients as well as mechanical forces. Current challenges in the field are to uncover how these tissue‐scale regulatory mechanisms are translated to the cellular and molecular level, and how regulation of distinct cellular processes gives rise to an overall defined size. Addressing these questions will help not only to achieve a better understanding of how size is controlled, but also of how tissue size is coordinated with the specification of pattern."}],"doi":"10.1002/wdev.383","publication_identifier":{"eissn":["17597692"],"issn":["17597684"]},"project":[{"grant_number":"680037","_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord"},{"_id":"267AF0E4-B435-11E9-9278-68D0E5697425","name":"The role of morphogens in the regulation of neural tube growth"},{"name":"Morphogen control of growth and pattern in the spinal cord","grant_number":"F07802","_id":"059DF620-7A3F-11EA-A408-12923DDC885E"}],"publication_status":"published","acknowledgement":"Austrian Academy of Sciences, Grant/Award Number: DOC fellowship for Katarzyna Kuzmicz-Kowalska; Austrian Science Fund, Grant/Award Number: F78 (Stem Cell Modulation); H2020 European Research Council, Grant/Award Number: 680037","status":"public","ec_funded":1,"department":[{"_id":"AnKi"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000531419400001"],"pmid":["32391980"]},"date_published":"2021-04-15T00:00:00Z","date_created":"2020-05-24T22:01:00Z","scopus_import":"1","publisher":"Wiley","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","oa":1,"year":"2021","publication":"Wiley Interdisciplinary Reviews: Developmental Biology","date_updated":"2024-03-07T15:03:00Z","related_material":{"record":[{"id":"14323","status":"public","relation":"dissertation_contains"}]},"article_number":"e383","article_type":"original"},{"article_type":"original","article_number":"2060009","publication":"Reviews in Mathematical Physics","date_updated":"2023-09-05T16:07:40Z","year":"2021","oa":1,"isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1910.08190","open_access":"1"}],"intvolume":"        33","publisher":"World Scientific","date_published":"2021-01-01T00:00:00Z","external_id":{"isi":["000613313200010"],"arxiv":["1910.08190"]},"scopus_import":"1","date_created":"2020-05-28T16:47:55Z","department":[{"_id":"RoSe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"eissn":["1793-6659"],"issn":["0129-055X"]},"project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"issue":"1","abstract":[{"lang":"eng","text":"Hartree–Fock theory has been justified as a mean-field approximation for fermionic systems. However, it suffers from some defects in predicting physical properties, making necessary a theory of quantum correlations. Recently, bosonization of many-body correlations has been rigorously justified as an upper bound on the correlation energy at high density with weak interactions. We review the bosonic approximation, deriving an effective Hamiltonian. We then show that for systems with Coulomb interaction this effective theory predicts collective excitations (plasmons) in accordance with the random phase approximation of Bohm and Pines, and with experimental observation."}],"doi":"10.1142/s0129055x20600090","author":[{"id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","first_name":"Niels P","full_name":"Benedikter, Niels P","last_name":"Benedikter","orcid":"0000-0002-1071-6091"}],"title":"Bosonic collective excitations in Fermi gases","_id":"7900","article_processing_charge":"No","volume":33,"arxiv":1,"oa_version":"Preprint","day":"01","citation":{"short":"N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).","ista":"Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 33(1), 2060009.","ama":"Benedikter NP. Bosonic collective excitations in Fermi gases. <i>Reviews in Mathematical Physics</i>. 2021;33(1). doi:<a href=\"https://doi.org/10.1142/s0129055x20600090\">10.1142/s0129055x20600090</a>","ieee":"N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1. World Scientific, 2021.","apa":"Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. <i>Reviews in Mathematical Physics</i>. World Scientific. <a href=\"https://doi.org/10.1142/s0129055x20600090\">https://doi.org/10.1142/s0129055x20600090</a>","chicago":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” <i>Reviews in Mathematical Physics</i>. World Scientific, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600090\">https://doi.org/10.1142/s0129055x20600090</a>.","mla":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1, 2060009, World Scientific, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600090\">10.1142/s0129055x20600090</a>."},"month":"01"},{"article_type":"original","page":"885-979","publication":"Inventiones Mathematicae","date_updated":"2023-08-21T06:30:30Z","year":"2021","oa":1,"isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       225","publisher":"Springer","external_id":{"arxiv":["2005.08933"],"isi":["000646573600001"]},"date_published":"2021-05-03T00:00:00Z","scopus_import":"1","date_created":"2020-05-28T16:48:20Z","department":[{"_id":"RoSe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We thank Christian Hainzl for helpful discussions and a referee for very careful reading of the paper and many helpful suggestions. NB and RS were supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 694227). Part of the research of NB was conducted on the RZD18 Nice–Milan–Vienna–Moscow. NB thanks Elliott H. Lieb and Peter Otte for explanations about the Luttinger model. PTN has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy (EXC-2111-390814868). MP acknowledges financial support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC StG MaMBoQ, grant agreement No. 802901). BS gratefully acknowledges financial support from the NCCR SwissMAP, from the Swiss National Science Foundation through the Grant “Dynamical and energetic properties of Bose-Einstein condensates” and from the European Research Council through the ERC-AdG CLaQS (grant agreement No. 834782). All authors acknowledge support for workshop participation from Mathematisches Forschungsinstitut Oberwolfach (Leibniz Association). NB, PTN, BS, and RS acknowledge support for workshop participation from Fondation des Treilles.","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["0020-9910"],"eissn":["1432-1297"]},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"abstract":[{"text":"We derive rigorously the leading order of the correlation energy of a Fermi gas in a scaling regime of high density and weak interaction. The result verifies the prediction of the random-phase approximation. Our proof refines the method of collective bosonization in three dimensions. We approximately diagonalize an effective Hamiltonian describing approximately bosonic collective excitations around the Hartree–Fock state, while showing that gapless and non-collective excitations have only a negligible effect on the ground state energy.","lang":"eng"}],"doi":"10.1007/s00222-021-01041-5","author":[{"first_name":"Niels P","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","last_name":"Benedikter","full_name":"Benedikter, Niels P","orcid":"0000-0002-1071-6091"},{"last_name":"Nam","full_name":"Nam, Phan Thành","first_name":"Phan Thành"},{"full_name":"Porta, Marcello","last_name":"Porta","first_name":"Marcello"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"title":"Correlation energy of a weakly interacting Fermi gas","_id":"7901","has_accepted_license":"1","volume":225,"article_processing_charge":"Yes (via OA deal)","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"file":[{"file_size":1089319,"relation":"main_file","creator":"dernst","file_name":"2021_InventMath_Benedikter.pdf","date_updated":"2022-05-16T12:23:40Z","success":1,"content_type":"application/pdf","checksum":"f38c79dfd828cdc7f49a34b37b83d376","access_level":"open_access","date_created":"2022-05-16T12:23:40Z","file_id":"11386"}],"oa_version":"Published Version","day":"03","citation":{"ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Correlation energy of a weakly interacting Fermi gas. <i>Inventiones Mathematicae</i>. 2021;225:885-979. doi:<a href=\"https://doi.org/10.1007/s00222-021-01041-5\">10.1007/s00222-021-01041-5</a>","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Correlation energy of a weakly interacting Fermi gas. Inventiones Mathematicae. 225, 885–979.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Inventiones Mathematicae 225 (2021) 885–979.","ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Correlation energy of a weakly interacting Fermi gas,” <i>Inventiones Mathematicae</i>, vol. 225. Springer, pp. 885–979, 2021.","apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., &#38; Seiringer, R. (2021). Correlation energy of a weakly interacting Fermi gas. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-021-01041-5\">https://doi.org/10.1007/s00222-021-01041-5</a>","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Correlation Energy of a Weakly Interacting Fermi Gas.” <i>Inventiones Mathematicae</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s00222-021-01041-5\">https://doi.org/10.1007/s00222-021-01041-5</a>.","mla":"Benedikter, Niels P., et al. “Correlation Energy of a Weakly Interacting Fermi Gas.” <i>Inventiones Mathematicae</i>, vol. 225, Springer, 2021, pp. 885–979, doi:<a href=\"https://doi.org/10.1007/s00222-021-01041-5\">10.1007/s00222-021-01041-5</a>."},"file_date_updated":"2022-05-16T12:23:40Z","month":"05","ddc":["510"]},{"page":"1166-1198","article_type":"original","publication":"Discrete and Computational Geometry","date_updated":"2024-03-07T15:01:58Z","year":"2021","oa":1,"isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Springer Nature","intvolume":"        65","external_id":{"isi":["000536324700001"],"arxiv":["1712.07734"]},"date_published":"2021-06-01T00:00:00Z","date_created":"2020-05-30T10:26:04Z","scopus_import":"1","department":[{"_id":"HeEd"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375. The authors would like to thank the anonymous referees for their insightful comments.","publication_status":"published","status":"public","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"abstract":[{"lang":"eng","text":"We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2), 195–222, 2020). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms."}],"doi":"10.1007/s00454-020-00206-y","title":"Sheaf-theoretic stratification learning from geometric and topological perspectives","author":[{"full_name":"Brown, Adam","last_name":"Brown","id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam"},{"first_name":"Bei","full_name":"Wang, Bei","last_name":"Wang"}],"_id":"7905","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","volume":65,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","content_type":"application/pdf","checksum":"487a84ea5841b75f04f66d7ebd71b67e","success":1,"date_updated":"2020-11-25T09:06:41Z","file_name":"2020_DiscreteCompGeometry_Brown.pdf","relation":"main_file","creator":"dernst","file_size":1013730,"file_id":"8803","date_created":"2020-11-25T09:06:41Z"}],"arxiv":1,"oa_version":"Published Version","citation":{"ama":"Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. 2021;65:1166-1198. doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>","short":"A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.","ista":"Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.","ieee":"A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” <i>Discrete and Computational Geometry</i>, vol. 65. Springer Nature, pp. 1166–1198, 2021.","apa":"Brown, A., &#38; Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>","chicago":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>.","mla":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>."},"day":"01","file_date_updated":"2020-11-25T09:06:41Z","ddc":["510"],"month":"06"},{"isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":"        15","publisher":"Springer Nature","external_id":{"isi":["000537342300001"]},"date_published":"2021-09-01T00:00:00Z","scopus_import":"1","date_created":"2020-06-04T11:28:33Z","department":[{"_id":"VlKo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_type":"original","page":"2109-2126","publication":"Optimization Letters","date_updated":"2024-03-07T15:00:43Z","year":"2021","oa":1,"has_accepted_license":"1","volume":15,"article_processing_charge":"Yes (via OA deal)","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","checksum":"63c5f31cd04626152a19f97a2476281b","access_level":"open_access","date_updated":"2024-03-07T14:58:51Z","success":1,"relation":"main_file","file_size":2148882,"creator":"kschuh","file_name":"2021_OptimizationLetters_Shehu.pdf","date_created":"2024-03-07T14:58:51Z","file_id":"15089"}],"oa_version":"Published Version","day":"01","citation":{"mla":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>.","chicago":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>.","apa":"Shehu, Y., &#38; Gibali, A. (2021). New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>","ieee":"Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” <i>Optimization Letters</i>, vol. 15. Springer Nature, pp. 2109–2126, 2021.","ama":"Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. 2021;15:2109-2126. doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>","ista":"Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126.","short":"Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126."},"file_date_updated":"2024-03-07T14:58:51Z","ddc":["510"],"month":"09","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are grateful to the referees for their insightful comments which have improved the earlier version of the manuscript greatly. The first author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["1862-4472"],"eissn":["1862-4480"]},"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"abstract":[{"lang":"eng","text":"In this paper, we introduce a relaxed CQ method with alternated inertial step for solving split feasibility problems. We give convergence of the sequence generated by our method under some suitable assumptions. Some numerical implementations from sparse signal and image deblurring are reported to show the efficiency of our method."}],"doi":"10.1007/s11590-020-01603-1","author":[{"full_name":"Shehu, Yekini","last_name":"Shehu","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","first_name":"Yekini","orcid":"0000-0001-9224-7139"},{"first_name":"Aviv","full_name":"Gibali, Aviv","last_name":"Gibali"}],"title":"New inertial relaxed method for solving split feasibilities","_id":"7925"},{"oa":1,"year":"2021","publication":"Distributed Computing","date_updated":"2024-03-07T14:43:39Z","related_material":{"record":[{"id":"6933","status":"public","relation":"earlier_version"}]},"page":"463-487","article_type":"original","department":[{"_id":"DaAl"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1903.05956"],"isi":["000556444600001"]},"date_published":"2021-12-01T00:00:00Z","date_created":"2020-06-07T22:00:54Z","scopus_import":"1","publisher":"Springer Nature","intvolume":"        34","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00446-020-00380-5"}],"isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","title":"Fast approximate shortest paths in the congested clique","author":[{"full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel","first_name":"Keren"},{"first_name":"Michal","full_name":"Dory, Michal","last_name":"Dory"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","full_name":"Korhonen, Janne","last_name":"Korhonen"},{"first_name":"Dean","last_name":"Leitersdorf","full_name":"Leitersdorf, Dean"}],"_id":"7939","abstract":[{"text":"We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include:\r\n    A (2+ϵ)-approximation for all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n    A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√) sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in O~(n1/6) rounds. ","lang":"eng"}],"doi":"10.1007/s00446-020-00380-5","publication_identifier":{"issn":["0178-2770"],"eissn":["1432-0452"]},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful discussions. This project has received funding from the European Union’s Horizon 2020 Research And Innovation Program under Grant Agreement No. 755839.","status":"public","publication_status":"published","citation":{"ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. <i>Distributed Computing</i>. 2021;34:463-487. doi:<a href=\"https://doi.org/10.1007/s00446-020-00380-5\">10.1007/s00446-020-00380-5</a>","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. <i>Distributed Computing</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00446-020-00380-5\">https://doi.org/10.1007/s00446-020-00380-5</a>","ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” <i>Distributed Computing</i>, vol. 34. Springer Nature, pp. 463–487, 2021.","mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>, vol. 34, Springer Nature, 2021, pp. 463–87, doi:<a href=\"https://doi.org/10.1007/s00446-020-00380-5\">10.1007/s00446-020-00380-5</a>.","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00446-020-00380-5\">https://doi.org/10.1007/s00446-020-00380-5</a>."},"day":"01","month":"12","oa_version":"Published Version","arxiv":1,"article_processing_charge":"Yes (via OA deal)","volume":34},{"publisher":"Elsevier","intvolume":"       161","article_processing_charge":"No","volume":161,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"ista":"Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by X10 microscopy. In: Methods in Cell Biology. vol. 161, 33–56.","ama":"Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy. In: <i>Methods in Cell Biology</i>. Vol 161. Elsevier; 2021:33-56. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">10.1016/bs.mcb.2020.04.016</a>","short":"S.M. Truckenbrodt, S.O. Rizzoli, in:, Methods in Cell Biology, Elsevier, 2021, pp. 33–56.","ieee":"S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution by X10 microscopy,” in <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021, pp. 33–56.","apa":"Truckenbrodt, S. M., &#38; Rizzoli, S. O. (2021). Simple multi-color super-resolution by X10 microscopy. In <i>Methods in Cell Biology</i> (Vol. 161, pp. 33–56). Elsevier. <a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">https://doi.org/10.1016/bs.mcb.2020.04.016</a>","chicago":"Truckenbrodt, Sven M, and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” In <i>Methods in Cell Biology</i>, 161:33–56. Elsevier, 2021. <a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">https://doi.org/10.1016/bs.mcb.2020.04.016</a>.","mla":"Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021, pp. 33–56, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">10.1016/bs.mcb.2020.04.016</a>."},"day":"01","department":[{"_id":"JoDa"}],"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","external_id":{"pmid":["33478696"]},"date_published":"2021-01-01T00:00:00Z","oa_version":"None","date_created":"2020-06-07T22:00:55Z","scopus_import":"1","publication":"Methods in Cell Biology","publication_identifier":{"issn":["0091-679X"],"isbn":["978012820807-6"]},"date_updated":"2021-03-11T08:49:08Z","publication_status":"published","status":"public","page":"33-56","title":"Simple multi-color super-resolution by X10 microscopy","author":[{"full_name":"Truckenbrodt, Sven M","last_name":"Truckenbrodt","id":"45812BD4-F248-11E8-B48F-1D18A9856A87","first_name":"Sven M"},{"full_name":"Rizzoli, Silvio O.","last_name":"Rizzoli","first_name":"Silvio O."}],"_id":"7941","abstract":[{"text":"Expansion microscopy is a recently developed super-resolution imaging technique, which provides an alternative to optics-based methods such as deterministic approaches (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion microscopy is to embed the biological sample in a swellable gel, and then to expand it isotropically, thereby increasing the distance between the fluorophores. This approach breaks the diffraction barrier by simply separating the emission point-spread-functions of the fluorophores. The resolution attainable in expansion microscopy is thus directly dependent on the separation that can be achieved, i.e. on the expansion factor. The original implementation of the technique achieved an expansion factor of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique can be implemented with minimal technical requirements on any standard fluorescence microscope, and is more easily applied for multi-color imaging than either deterministic or stochastic super-resolution approaches. This renders X10 expansion microscopy a highly promising tool for new biological discoveries, as discussed here, and as demonstrated by several recent applications.","lang":"eng"}],"year":"2021","doi":"10.1016/bs.mcb.2020.04.016"},{"has_accepted_license":"1","volume":22,"article_processing_charge":"Yes (via OA deal)","file":[{"date_updated":"2020-08-03T15:24:39Z","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":2137860,"creator":"dernst","relation":"main_file","file_name":"2020_OptimizationEngineering_Shehu.pdf","date_created":"2020-08-03T15:24:39Z","file_id":"8197"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","day":"25","citation":{"ama":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>. 2021;22:2627-2653. doi:<a href=\"https://doi.org/10.1007/s11081-020-09544-5\">10.1007/s11081-020-09544-5</a>","ista":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.","short":"Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering 22 (2021) 2627–2653.","ieee":"Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method for the sum of two maximal monotone operators,” <i>Optimization and Engineering</i>, vol. 22. Springer Nature, pp. 2627–2653, 2021.","apa":"Shehu, Y., Dong, Q.-L., Liu, L.-L., &#38; Yao, J.-C. (2021). New strong convergence method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11081-020-09544-5\">https://doi.org/10.1007/s11081-020-09544-5</a>","chicago":"Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” <i>Optimization and Engineering</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11081-020-09544-5\">https://doi.org/10.1007/s11081-020-09544-5</a>.","mla":"Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” <i>Optimization and Engineering</i>, vol. 22, Springer Nature, 2021, pp. 2627–53, doi:<a href=\"https://doi.org/10.1007/s11081-020-09544-5\">10.1007/s11081-020-09544-5</a>."},"month":"02","file_date_updated":"2020-08-03T15:24:39Z","ddc":["510"],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The project of Yekini Shehu has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013) (Grant Agreement No. 616160). The authors are grateful to the anonymous referees and the handling Editor for their comments and suggestions which have improved the earlier version of the manuscript greatly.","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["1389-4420"],"eissn":["1573-2924"]},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"abstract":[{"text":"This paper aims to obtain a strong convergence result for a Douglas–Rachford splitting method with inertial extrapolation step for finding a zero of the sum of two set-valued maximal monotone operators without any further assumption of uniform monotonicity on any of the involved maximal monotone operators. Furthermore, our proposed method is easy to implement and the inertial factor in our proposed method is a natural choice. Our method of proof is of independent interest. Finally, some numerical implementations are given to confirm the theoretical analysis.","lang":"eng"}],"doi":"10.1007/s11081-020-09544-5","author":[{"orcid":"0000-0001-9224-7139","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","last_name":"Shehu","full_name":"Shehu, Yekini"},{"last_name":"Dong","full_name":"Dong, Qiao-Li","first_name":"Qiao-Li"},{"last_name":"Liu","full_name":"Liu, Lu-Lu","first_name":"Lu-Lu"},{"first_name":"Jen-Chih","last_name":"Yao","full_name":"Yao, Jen-Chih"}],"title":"New strong convergence method for the sum of two maximal monotone operators","_id":"8196","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":"        22","publisher":"Springer Nature","external_id":{"isi":["000559345400001"]},"date_published":"2021-02-25T00:00:00Z","scopus_import":"1","date_created":"2020-08-03T14:29:57Z","department":[{"_id":"VlKo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_type":"original","page":"2627-2653","publication":"Optimization and Engineering","date_updated":"2024-03-07T14:39:29Z","year":"2021","oa":1},{"year":"2021","oa":1,"article_number":"214204","article_type":"original","date_updated":"2023-08-04T10:56:33Z","publication":"Physical Review B","date_created":"2020-08-04T13:03:40Z","external_id":{"isi":["000664429700005"],"arxiv":["2007.14879"]},"date_published":"2021-06-21T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaSe"}],"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"publisher":"American Physical Society","intvolume":"       103","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.14879"}],"doi":"10.1103/PhysRevB.103.214204","abstract":[{"text":"We investigate how the critical driving amplitude at the Floquet many-body localized (MBL) to ergodic phase transition differs between smooth and nonsmooth drives. To this end, we numerically study a disordered spin-1/2 chain which is periodically driven by a sine or square-wave drive over a wide range of driving frequencies. In both cases the critical driving amplitude increases monotonically with the frequency, and at large frequencies it is identical for the two drives. However, at low and intermediate frequencies the critical amplitude of the square-wave drive depends strongly on the frequency, while that of the sinusoidal drive is almost constant over a wide frequency range. By analyzing the density of drive-induced resonances we conclude that this difference is due to resonances induced by the higher harmonics which are present (absent) in the Fourier spectrum of the square-wave (sine) drive. Furthermore, we suggest a numerically efficient method for estimating the frequency dependence of the critical driving amplitudes for different drives which is based on calculating the density of drive-induced resonances. We conclude that delocalization occurs once the density of drive-induced resonances reaches a critical value determined only by the static system.","lang":"eng"}],"issue":"21","_id":"8198","title":"Impact of drive harmonics on the stability of Floquet many-body localization","author":[{"full_name":"Diringer, Asaf A.","last_name":"Diringer","first_name":"Asaf A."},{"last_name":"Gulden","full_name":"Gulden, Tobias","first_name":"Tobias","id":"1083E038-9F73-11E9-A4B5-532AE6697425","orcid":"0000-0001-6814-7541"}],"ec_funded":1,"status":"public","acknowledgement":"We thank Y. Bar Lev, T. Biadse, and, particularly, E. Bairey and B. Katzir for illuminating discussions and their many insights and help. The authors thank N. Lindner for his support throughout this project. We are further grateful to M. Serbyn, A. Kamenev, A. Turner, and S. de Nicola for reading the manuscript and providing good feedback and suggestions. We acknowledge financial support from the Defense Advanced Research Projects Agency through the DRINQS program, Grant No. D18AC00025. T.G. was in part supported by an Aly Kaufman Fellowship at the Technion. T.G. acknowledges funding from the Institute of Science and Technology (IST) Austria and from the European Union’s Horizon 2020 research and innovation program under Marie SkłodowskaCurie Grant Agreement No. 754411.under the Marie Skłodowska-Curie Grant Agreement No.754411.","publication_status":"published","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"publication_identifier":{"issn":["24699950"],"eissn":["24699969"]},"oa_version":"Preprint","month":"06","citation":{"ista":"Diringer AA, Gulden T. 2021. Impact of drive harmonics on the stability of Floquet many-body localization. Physical Review B. 103(21), 214204.","ama":"Diringer AA, Gulden T. Impact of drive harmonics on the stability of Floquet many-body localization. <i>Physical Review B</i>. 2021;103(21). doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">10.1103/PhysRevB.103.214204</a>","short":"A.A. Diringer, T. Gulden, Physical Review B 103 (2021).","apa":"Diringer, A. A., &#38; Gulden, T. (2021). Impact of drive harmonics on the stability of Floquet many-body localization. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">https://doi.org/10.1103/PhysRevB.103.214204</a>","ieee":"A. A. Diringer and T. Gulden, “Impact of drive harmonics on the stability of Floquet many-body localization,” <i>Physical Review B</i>, vol. 103, no. 21. American Physical Society, 2021.","mla":"Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability of Floquet Many-Body Localization.” <i>Physical Review B</i>, vol. 103, no. 21, 214204, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">10.1103/PhysRevB.103.214204</a>.","chicago":"Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability of Floquet Many-Body Localization.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">https://doi.org/10.1103/PhysRevB.103.214204</a>."},"day":"21","article_processing_charge":"No","volume":103,"arxiv":1},{"date_updated":"2024-03-07T14:54:59Z","publication":"Discrete and Computational Geometry","page":"666-686","article_type":"original","oa":1,"year":"2021","publisher":"Springer Nature","intvolume":"        66","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-020-00233-9"}],"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"date_created":"2020-08-11T07:11:51Z","scopus_import":"1","date_published":"2021-09-01T00:00:00Z","external_id":{"isi":["000558119300001"]},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"ec_funded":1,"publication_status":"published","acknowledgement":"Open access funding provided by the Institute of Science and Technology (IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India.\r\nThis work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","status":"public","_id":"8248","title":"Local conditions for triangulating submanifolds of Euclidean space","author":[{"first_name":"Jean-Daniel","last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel"},{"first_name":"Ramsay","full_name":"Dyer, Ramsay","last_name":"Dyer"},{"last_name":"Ghosh","full_name":"Ghosh, Arijit","first_name":"Arijit"},{"last_name":"Lieutier","full_name":"Lieutier, Andre","first_name":"Andre"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220"}],"doi":"10.1007/s00454-020-00233-9","abstract":[{"lang":"eng","text":"We consider the following setting: suppose that we are given a manifold M in Rd with positive reach. Moreover assume that we have an embedded simplical complex A without boundary, whose vertex set lies on the manifold, is sufficiently dense and such that all simplices in A have sufficient quality. We prove that if, locally, interiors of the projection of the simplices onto the tangent space do not intersect, then A is a triangulation of the manifold, that is, they are homeomorphic."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":66,"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","month":"09","ddc":["510"],"citation":{"mla":"Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 666–86, doi:<a href=\"https://doi.org/10.1007/s00454-020-00233-9\">10.1007/s00454-020-00233-9</a>.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00233-9\">https://doi.org/10.1007/s00454-020-00233-9</a>.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., &#38; Wintraecken, M. (2021). Local conditions for triangulating submanifolds of Euclidean space. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00233-9\">https://doi.org/10.1007/s00454-020-00233-9</a>","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local conditions for triangulating submanifolds of Euclidean space,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 666–686, 2021.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. <i>Discrete and Computational Geometry</i>. 2021;66:666-686. doi:<a href=\"https://doi.org/10.1007/s00454-020-00233-9\">10.1007/s00454-020-00233-9</a>","ista":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 66, 666–686."},"day":"01","oa_version":"Published Version"},{"department":[{"_id":"TiVo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-03-01T00:00:00Z","external_id":{"isi":["000663433900003"],"pmid":["33513328"]},"scopus_import":"1","date_created":"2020-08-12T12:08:24Z","intvolume":"        33","publisher":"MIT Press","isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"oa":1,"year":"2021","publication":"Neural Computation","date_updated":"2023-08-04T10:53:14Z","article_type":"original","page":"899-925","day":"01","citation":{"chicago":"Zenke, Friedemann, and Tim P Vogels. “The Remarkable Robustness of Surrogate Gradient Learning for Instilling Complex Function in Spiking Neural Networks.” <i>Neural Computation</i>. MIT Press, 2021. <a href=\"https://doi.org/10.1162/neco_a_01367\">https://doi.org/10.1162/neco_a_01367</a>.","mla":"Zenke, Friedemann, and Tim P. Vogels. “The Remarkable Robustness of Surrogate Gradient Learning for Instilling Complex Function in Spiking Neural Networks.” <i>Neural Computation</i>, vol. 33, no. 4, MIT Press, 2021, pp. 899–925, doi:<a href=\"https://doi.org/10.1162/neco_a_01367\">10.1162/neco_a_01367</a>.","ama":"Zenke F, Vogels TP. The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. <i>Neural Computation</i>. 2021;33(4):899-925. doi:<a href=\"https://doi.org/10.1162/neco_a_01367\">10.1162/neco_a_01367</a>","short":"F. Zenke, T.P. Vogels, Neural Computation 33 (2021) 899–925.","ista":"Zenke F, Vogels TP. 2021. The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. Neural Computation. 33(4), 899–925.","apa":"Zenke, F., &#38; Vogels, T. P. (2021). The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. <i>Neural Computation</i>. MIT Press. <a href=\"https://doi.org/10.1162/neco_a_01367\">https://doi.org/10.1162/neco_a_01367</a>","ieee":"F. Zenke and T. P. Vogels, “The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks,” <i>Neural Computation</i>, vol. 33, no. 4. MIT Press, pp. 899–925, 2021."},"file_date_updated":"2022-04-08T06:05:39Z","month":"03","pmid":1,"ddc":["000","570"],"oa_version":"Published Version","file":[{"date_created":"2022-04-08T06:05:39Z","file_id":"11131","creator":"dernst","file_size":1611614,"relation":"main_file","file_name":"2021_NeuralComputation_Zenke.pdf","checksum":"eac5a51c24c8989ae7cf9ae32ec3bc95","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-04-08T06:05:39Z","success":1}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","volume":33,"article_processing_charge":"No","author":[{"orcid":"0000-0003-1883-644X","first_name":"Friedemann","last_name":"Zenke","full_name":"Zenke, Friedemann"},{"orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P","full_name":"Vogels, Tim P","last_name":"Vogels"}],"title":"The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks","_id":"8253","issue":"4","abstract":[{"lang":"eng","text":"Brains process information in spiking neural networks. Their intricate connections shape the diverse functions these networks perform. In comparison, the functional capabilities of models of spiking networks are still rudimentary. This shortcoming is mainly due to the lack of insight and practical algorithms to construct the necessary connectivity. Any such algorithm typically attempts to build networks by iteratively reducing the error compared to a desired output. But assigning credit to hidden units in multi-layered spiking networks has remained challenging due to the non-differentiable nonlinearity of spikes. To avoid this issue, one can employ surrogate gradients to discover the required connectivity in spiking network models. However, the choice of a surrogate is not unique, raising the question of how its implementation influences the effectiveness of the method. Here, we use numerical simulations to systematically study how essential design parameters of surrogate gradients impact learning performance on a range of classification problems. We show that surrogate gradient learning is robust to different shapes of underlying surrogate derivatives, but the choice of the derivative’s scale can substantially affect learning performance. When we combine surrogate gradients with a suitable activity regularization technique, robust information processing can be achieved in spiking networks even at the sparse activity limit. Our study provides a systematic account of the remarkable robustness of surrogate gradient learning and serves as a practical guide to model functional spiking neural networks."}],"doi":"10.1162/neco_a_01367","publication_identifier":{"issn":["0899-7667"],"eissn":["1530-888X"]},"project":[{"grant_number":"819603","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","call_identifier":"H2020"},{"_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","grant_number":"214316/Z/18/Z","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks."}],"acknowledgement":"F.Z. was supported by the Wellcome Trust (110124/Z/15/Z) and the Novartis Research Foundation. T.P.V. was supported by a Wellcome Trust Sir Henry Dale Research fellowship (WT100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant SYNAPSEEK.","status":"public","publication_status":"published","ec_funded":1},{"publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"status":"public","publication_status":"published","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier versions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments. Open access funding provided by Institute of Science and Technology (IST Austria). Funding was provided by European Research Council (Grant No. PR1042ERC01).","ec_funded":1,"title":"Dynamic averaging load balancing on cycles","author":[{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5634-0731","first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","first_name":"Amirmojtaba","full_name":"Sabour, Amirmojtaba","last_name":"Sabour"}],"_id":"8286","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. "}],"doi":"10.1007/s00453-021-00905-9","file":[{"file_id":"10577","date_created":"2021-12-27T10:36:40Z","file_name":"2021_Algorithmica_Alistarh.pdf","file_size":525950,"creator":"cchlebak","relation":"main_file","success":1,"date_updated":"2021-12-27T10:36:40Z","access_level":"open_access","checksum":"21169b25b0c8e17b21e12af22bff9870","content_type":"application/pdf"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","citation":{"ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. <i>Algorithmica</i>. 2021. doi:<a href=\"https://doi.org/10.1007/s00453-021-00905-9\">10.1007/s00453-021-00905-9</a>","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica (2021).","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2021. Dynamic averaging load balancing on cycles. Algorithmica.","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” <i>Algorithmica</i>. Springer Nature, 2021.","apa":"Alistarh, D.-A., Nadiradze, G., &#38; Sabour, A. (2021). Dynamic averaging load balancing on cycles. <i>Algorithmica</i>. Virtual, Online; Germany: Springer Nature. <a href=\"https://doi.org/10.1007/s00453-021-00905-9\">https://doi.org/10.1007/s00453-021-00905-9</a>","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” <i>Algorithmica</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s00453-021-00905-9\">10.1007/s00453-021-00905-9</a>.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” <i>Algorithmica</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00453-021-00905-9\">https://doi.org/10.1007/s00453-021-00905-9</a>."},"day":"24","ddc":["000"],"file_date_updated":"2021-12-27T10:36:40Z","month":"12","oa_version":"Published Version","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming ","end_date":"2020-07-11","location":"Virtual, Online; Germany","start_date":"2020-07-08"},"publication":"Algorithmica","date_updated":"2024-03-05T07:35:53Z","related_material":{"record":[{"id":"15077","status":"public","relation":"earlier_version"}],"link":[{"relation":"earlier_version","url":"https://doi.org/10.4230/LIPIcs.ICALP.2020.7"}]},"article_type":"original","oa":1,"year":"2021","publisher":"Springer Nature","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","department":[{"_id":"DaAl"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["2003.09297"],"isi":["000734004600001"]},"date_published":"2021-12-24T00:00:00Z","date_created":"2020-08-24T06:24:04Z","scopus_import":"1"},{"title":"Folding polyominoes with holes into a cube","author":[{"last_name":"Aichholzer","full_name":"Aichholzer, Oswin","first_name":"Oswin"},{"last_name":"Akitaya","full_name":"Akitaya, Hugo A.","first_name":"Hugo A."},{"last_name":"Cheung","full_name":"Cheung, Kenneth C.","first_name":"Kenneth C."},{"full_name":"Demaine, Erik D.","last_name":"Demaine","first_name":"Erik D."},{"first_name":"Martin L.","full_name":"Demaine, Martin L.","last_name":"Demaine"},{"full_name":"Fekete, Sándor P.","last_name":"Fekete","first_name":"Sándor P."},{"first_name":"Linda","full_name":"Kleist, Linda","last_name":"Kleist"},{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"last_name":"Löffler","full_name":"Löffler, Maarten","first_name":"Maarten"},{"orcid":"0000-0002-6660-1322","last_name":"Masárová","full_name":"Masárová, Zuzana","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Klara","full_name":"Mundilova, Klara","last_name":"Mundilova"},{"first_name":"Christiane","full_name":"Schmidt, Christiane","last_name":"Schmidt"}],"_id":"8317","abstract":[{"text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability.","lang":"eng"}],"doi":"10.1016/j.comgeo.2020.101700","publication_identifier":{"issn":["09257721"]},"project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","acknowledgement":"This research was performed in part at the 33rd Bellairs Winter Workshop on Computational Geometry. We thank all other participants for a fruitful atmosphere. H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","status":"public","citation":{"mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>, vol. 93, 101700, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>.","chicago":"Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>.","short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, Computational Geometry: Theory and Applications 93 (2021).","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. 2021;93. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>","ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding polyominoes with holes into a cube. Computational Geometry: Theory and Applications. 93, 101700.","apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>","ieee":"O. Aichholzer <i>et al.</i>, “Folding polyominoes with holes into a cube,” <i>Computational Geometry: Theory and Applications</i>, vol. 93. Elsevier, 2021."},"day":"01","month":"02","oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","volume":93,"oa":1,"year":"2021","publication":"Computational Geometry: Theory and Applications","date_updated":"2023-08-04T10:57:42Z","related_material":{"record":[{"status":"public","relation":"shorter_version","id":"6989"}]},"article_number":"101700","article_type":"original","department":[{"_id":"HeEd"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["1910.09917"],"isi":["000579185100004"]},"date_published":"2021-02-01T00:00:00Z","date_created":"2020-08-30T22:01:09Z","scopus_import":"1","publisher":"Elsevier","intvolume":"        93","main_file_link":[{"url":"https://arxiv.org/abs/1910.09917v3","open_access":"1"}],"isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article"},{"oa":1,"year":"2021","date_updated":"2024-03-07T14:51:11Z","publication":"Discrete and Computational Geometry","page":"938-976","article_type":"original","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"date_created":"2020-09-06T22:01:13Z","scopus_import":"1","external_id":{"arxiv":["1908.00856"],"isi":["000564488500002"]},"date_published":"2021-10-01T00:00:00Z","publisher":"Springer Nature","intvolume":"        66","main_file_link":[{"url":"https://arxiv.org/abs/1908.00856","open_access":"1"}],"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"_id":"8338","title":"On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs","author":[{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"last_name":"Bobenko","full_name":"Bobenko, Alexander I.","first_name":"Alexander I."},{"full_name":"Schief, Wolfgang K.","last_name":"Schief","first_name":"Wolfgang K."},{"first_name":"Jan","full_name":"Techter, Jan","last_name":"Techter"}],"doi":"10.1007/s00454-020-00240-w","abstract":[{"lang":"eng","text":"Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces of Blaschke type generated by asymptotic and characteristic lines that are diagonally related to lines of curvature is proved theoretically and established constructively. Appropriate samplings (grids) of these webs lead to three-dimensional extensions of non-planar IC nets. Three-dimensional octahedral grids composed of planes and spatially extending (checkerboard) IC-nets are shown to arise in connection with systems of confocal quadrics in Minkowski space. In this context, the Laguerre geometric notion of conical octahedral grids of planes is introduced. The latter generalise the octahedral grids derived from systems of confocal quadrics in Minkowski space. An explicit construction of conical octahedral grids is presented. The results are accompanied by various illustrations which are based on the explicit formulae provided by the theory."}],"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"ec_funded":1,"status":"public","acknowledgement":"This research was supported by the DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by the Australian Research Council (DP1401000851). A.V.A. was also supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha).","publication_status":"published","month":"10","citation":{"chicago":"Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>.","mla":"Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 938–76, doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>.","ieee":"A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 938–976, 2021.","apa":"Akopyan, A., Bobenko, A. I., Schief, W. K., &#38; Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>","ista":"Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 66, 938–976.","short":"A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.","ama":"Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. 2021;66:938-976. doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>"},"day":"01","oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","volume":66},{"doi":"10.1016/j.laa.2020.09.007","abstract":[{"lang":"eng","text":"It is well known that special Kubo-Ando operator means admit divergence center interpretations, moreover, they are also mean squared error estimators for certain metrics on positive definite operators. In this paper we give a divergence center interpretation for every symmetric Kubo-Ando mean. This characterization of the symmetric means naturally leads to a definition of weighted and multivariate versions of a large class of symmetric Kubo-Ando means. We study elementary properties of these weighted multivariate means, and note in particular that in the special case of the geometric mean we recover the weighted A#H-mean introduced by Kim, Lawson, and Lim."}],"_id":"8373","title":"A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means","author":[{"first_name":"József","full_name":"Pitrik, József","last_name":"Pitrik"},{"orcid":"0000-0003-1109-5511","first_name":"Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","last_name":"Virosztek","full_name":"Virosztek, Daniel"}],"ec_funded":1,"acknowledgement":"The authors are grateful to Milán Mosonyi for fruitful discussions on the topic, and to the anonymous referee for his/her comments and suggestions.\r\nJ. Pitrik was supported by the Hungarian Academy of Sciences Lendület-Momentum Grant for Quantum Information Theory, No. 96 141, and by Hungarian National Research, Development and Innovation Office (NKFIH) via grants no. K119442, no. K124152, and no. KH129601. D. Virosztek was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01), by the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 846294, and partially supported by the Hungarian National Research, Development and Innovation Office (NKFIH) via grants no. K124152, and no. KH129601.","status":"public","publication_status":"published","project":[{"call_identifier":"H2020","name":"Geometric study of Wasserstein spaces and free probability","_id":"26A455A6-B435-11E9-9278-68D0E5697425","grant_number":"846294"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"publication_identifier":{"issn":["0024-3795"]},"oa_version":"Preprint","month":"01","citation":{"mla":"Pitrik, József, and Daniel Virosztek. “A Divergence Center Interpretation of General Symmetric Kubo-Ando Means, and Related Weighted Multivariate Operator Means.” <i>Linear Algebra and Its Applications</i>, vol. 609, Elsevier, 2021, pp. 203–17, doi:<a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">10.1016/j.laa.2020.09.007</a>.","chicago":"Pitrik, József, and Daniel Virosztek. “A Divergence Center Interpretation of General Symmetric Kubo-Ando Means, and Related Weighted Multivariate Operator Means.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">https://doi.org/10.1016/j.laa.2020.09.007</a>.","ista":"Pitrik J, Virosztek D. 2021. A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. Linear Algebra and its Applications. 609, 203–217.","ama":"Pitrik J, Virosztek D. A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. <i>Linear Algebra and its Applications</i>. 2021;609:203-217. doi:<a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">10.1016/j.laa.2020.09.007</a>","short":"J. Pitrik, D. Virosztek, Linear Algebra and Its Applications 609 (2021) 203–217.","ieee":"J. Pitrik and D. Virosztek, “A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means,” <i>Linear Algebra and its Applications</i>, vol. 609. Elsevier, pp. 203–217, 2021.","apa":"Pitrik, J., &#38; Virosztek, D. (2021). A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">https://doi.org/10.1016/j.laa.2020.09.007</a>"},"day":"15","article_processing_charge":"No","volume":609,"arxiv":1,"keyword":["Kubo-Ando mean","weighted multivariate mean","barycenter"],"year":"2021","oa":1,"page":"203-217","article_type":"original","date_updated":"2023-08-04T10:58:14Z","publication":"Linear Algebra and its Applications","date_created":"2020-09-11T08:35:50Z","date_published":"2021-01-15T00:00:00Z","external_id":{"arxiv":["2002.11678"],"isi":["000581730500011"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","isi":1,"publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.11678"}],"intvolume":"       609"},{"volume":12,"article_processing_charge":"No","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"date_updated":"2021-12-06T07:47:11Z","access_level":"open_access","checksum":"384681be17aff902c149a48f52d13d4f","content_type":"application/pdf","file_name":"2021_NatComm_Paxtot.pdf","relation":"main_file","file_size":6519771,"creator":"cchlebak","file_id":"10419","date_created":"2021-12-06T07:47:11Z"}],"oa_version":"Published Version","file_date_updated":"2021-12-06T07:47:11Z","ddc":["610"],"month":"11","day":"30","citation":{"chicago":"Patxot, Marion, Daniel Trejo Banos, Athanasios Kousathanas, Etienne J Orliac, Sven E Ojavee, Gerhard Moser, Julia Sidorenko, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-27258-9\">https://doi.org/10.1038/s41467-021-27258-9</a>.","mla":"Patxot, Marion, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” <i>Nature Communications</i>, vol. 12, no. 1, 6972, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-27258-9\">10.1038/s41467-021-27258-9</a>.","short":"M. Patxot, D. Trejo Banos, A. Kousathanas, E.J. Orliac, S.E. Ojavee, G. Moser, J. Sidorenko, Z. Kutalik, R. Magi, P.M. Visscher, L. Ronnegard, M.R. Robinson, Nature Communications 12 (2021).","ama":"Patxot M, Trejo Banos D, Kousathanas A, et al. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-27258-9\">10.1038/s41467-021-27258-9</a>","ista":"Patxot M, Trejo Banos D, Kousathanas A, Orliac EJ, Ojavee SE, Moser G, Sidorenko J, Kutalik Z, Magi R, Visscher PM, Ronnegard L, Robinson MR. 2021. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 12(1), 6972.","apa":"Patxot, M., Trejo Banos, D., Kousathanas, A., Orliac, E. J., Ojavee, S. E., Moser, G., … Robinson, M. R. (2021). Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-27258-9\">https://doi.org/10.1038/s41467-021-27258-9</a>","ieee":"M. Patxot <i>et al.</i>, “Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021."},"publication_status":"published","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). L.R. acknowledges funding from the Kjell & Märta Beijer Foundation (Stockholm, Sweden). We also would like to acknowledge Simone Rubinacci, Oliver Delanau, Alexander Terenin, Eleonora Porcu, and Mike Goddard for their useful comments and suggestions.","status":"public","publication_identifier":{"eissn":["2041-1723"]},"doi":"10.1038/s41467-021-27258-9","issue":"1","abstract":[{"text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only ≤10% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data.","lang":"eng"}],"_id":"8429","author":[{"first_name":"Marion","last_name":"Patxot","full_name":"Patxot, Marion"},{"first_name":"Daniel","last_name":"Trejo Banos","full_name":"Trejo Banos, Daniel"},{"first_name":"Athanasios","last_name":"Kousathanas","full_name":"Kousathanas, Athanasios"},{"last_name":"Orliac","full_name":"Orliac, Etienne J","first_name":"Etienne J"},{"first_name":"Sven E","last_name":"Ojavee","full_name":"Ojavee, Sven E"},{"last_name":"Moser","full_name":"Moser, Gerhard","first_name":"Gerhard"},{"full_name":"Sidorenko, Julia","last_name":"Sidorenko","first_name":"Julia"},{"first_name":"Zoltan","full_name":"Kutalik, Zoltan","last_name":"Kutalik"},{"full_name":"Magi, Reedik","last_name":"Magi","first_name":"Reedik"},{"first_name":"Peter M","last_name":"Visscher","full_name":"Visscher, Peter M"},{"first_name":"Lars","last_name":"Ronnegard","full_name":"Ronnegard, Lars"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","last_name":"Robinson","orcid":"0000-0001-8982-8813"}],"title":"Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"intvolume":"        12","publisher":"Springer Nature","scopus_import":"1","date_created":"2020-09-17T10:52:38Z","external_id":{"isi":["000724450600023"]},"date_published":"2021-11-30T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaRo"}],"article_type":"original","article_number":"6972","related_material":{"record":[{"id":"13063","relation":"research_data","status":"public"}]},"date_updated":"2023-09-26T10:36:14Z","publication":"Nature Communications","year":"2021","oa":1},{"publication":"Nature Communications","date_updated":"2023-08-04T11:00:17Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/predicting-the-onset-of-diseases/","description":"News on IST Homepage","relation":"press_release"}]},"article_number":"2337","oa":1,"year":"2021","publisher":"Nature Research","intvolume":"        12","isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","department":[{"_id":"MaRo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-04-20T00:00:00Z","external_id":{"isi":["000642509600006"]},"date_created":"2020-09-17T10:53:00Z","scopus_import":"1","publication_identifier":{"eissn":["20411723"]},"project":[{"name":"Improving estimation and prediction of common complex disease risk","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","grant_number":"PCEGP3_181181"}],"status":"public","publication_status":"published","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria and the University of Lausanne; the work of KF was supported by the grant PUT1665 by the Estonian Research Council. We would like to thank Mike Goddard for comments which greatly improved the work, the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support.","title":"Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis","author":[{"first_name":"Sven E","full_name":"Ojavee, Sven E","last_name":"Ojavee"},{"first_name":"Athanasios","full_name":"Kousathanas, Athanasios","last_name":"Kousathanas"},{"first_name":"Daniel","last_name":"Trejo Banos","full_name":"Trejo Banos, Daniel"},{"first_name":"Etienne J","full_name":"Orliac, Etienne J","last_name":"Orliac"},{"first_name":"Marion","last_name":"Patxot","full_name":"Patxot, Marion"},{"last_name":"Lall","full_name":"Lall, Kristi","first_name":"Kristi"},{"first_name":"Reedik","last_name":"Magi","full_name":"Magi, Reedik"},{"first_name":"Krista","full_name":"Fischer, Krista","last_name":"Fischer"},{"first_name":"Zoltan","full_name":"Kutalik, Zoltan","last_name":"Kutalik"},{"first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813"}],"_id":"8430","abstract":[{"lang":"eng","text":"While recent advancements in computation and modelling have improved the analysis of complex traits, our understanding of the genetic basis of the time at symptom onset remains limited. Here, we develop a Bayesian approach (BayesW) that provides probabilistic inference of the genetic architecture of age-at-onset phenotypes in a sampling scheme that facilitates biobank-scale time-to-event analyses. We show in extensive simulation work the benefits BayesW provides in terms of number of discoveries, model performance and genomic prediction. In the UK Biobank, we find many thousands of common genomic regions underlying the age-at-onset of high blood pressure (HBP), cardiac disease (CAD), and type-2 diabetes (T2D), and for the genetic basis of onset reflecting the underlying genetic liability to disease. Age-at-menopause and age-at-menarche are also highly polygenic, but with higher variance contributed by low frequency variants. Genomic prediction into the Estonian Biobank data shows that BayesW gives higher prediction accuracy than other approaches."}],"issue":"1","doi":"10.1038/s41467-021-22538-w","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"creator":"kschuh","file_size":6474239,"relation":"main_file","file_name":"2021_nature_communications_Ojavee.pdf","checksum":"eca8b9ae713835c5b785211dd08d8a2e","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-05-04T15:07:50Z","success":1,"date_created":"2021-05-04T15:07:50Z","file_id":"9372"}],"has_accepted_license":"1","volume":12,"article_processing_charge":"No","citation":{"mla":"Ojavee, Sven E., et al. “Genomic Architecture and Prediction of Censored Time-to-Event Phenotypes with a Bayesian Genome-Wide Analysis.” <i>Nature Communications</i>, vol. 12, no. 1, 2337, Nature Research, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-22538-w\">10.1038/s41467-021-22538-w</a>.","chicago":"Ojavee, Sven E, Athanasios Kousathanas, Daniel Trejo Banos, Etienne J Orliac, Marion Patxot, Kristi Lall, Reedik Magi, Krista Fischer, Zoltan Kutalik, and Matthew Richard Robinson. “Genomic Architecture and Prediction of Censored Time-to-Event Phenotypes with a Bayesian Genome-Wide Analysis.” <i>Nature Communications</i>. Nature Research, 2021. <a href=\"https://doi.org/10.1038/s41467-021-22538-w\">https://doi.org/10.1038/s41467-021-22538-w</a>.","ama":"Ojavee SE, Kousathanas A, Trejo Banos D, et al. Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-22538-w\">10.1038/s41467-021-22538-w</a>","ista":"Ojavee SE, Kousathanas A, Trejo Banos D, Orliac EJ, Patxot M, Lall K, Magi R, Fischer K, Kutalik Z, Robinson MR. 2021. Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. Nature Communications. 12(1), 2337.","short":"S.E. Ojavee, A. Kousathanas, D. Trejo Banos, E.J. Orliac, M. Patxot, K. Lall, R. Magi, K. Fischer, Z. Kutalik, M.R. Robinson, Nature Communications 12 (2021).","ieee":"S. E. Ojavee <i>et al.</i>, “Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis,” <i>Nature Communications</i>, vol. 12, no. 1. Nature Research, 2021.","apa":"Ojavee, S. E., Kousathanas, A., Trejo Banos, D., Orliac, E. J., Patxot, M., Lall, K., … Robinson, M. R. (2021). Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. <i>Nature Communications</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41467-021-22538-w\">https://doi.org/10.1038/s41467-021-22538-w</a>"},"day":"20","ddc":["570"],"month":"04","file_date_updated":"2021-05-04T15:07:50Z","oa_version":"Published Version"},{"publication_identifier":{"eissn":["1097-4199"]},"project":[{"_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"acknowledgement":"We thank M. Mishina for GluD2fl frozen embryos, T.C. Südhof and J.I. Morgan for Cbln1fl mice, L. Anderson for help in generating the MADM alleles, W. Joo for a previously unpublished construct, M. Yuzaki, K. Shen, J. Ding, and members of the Luo lab, including J.M. Kebschull, H. Li, J. Li, T. Li, C.M. McLaughlin, D. Pederick, J. Ren, D.C. Wang and C. Xu for discussions and critiques of the manuscript, and M. Yuzaki for supporting Y.H.T. during the final phase of this project. Y.H.T. was supported by a JSPS fellowship; S.A.S. was supported by a Stanford Graduate Fellowship and an NSF Predoctoral Fellowship; L.J. is supported by a Stanford Graduate Fellowship and an NSF Predoctoral Fellowship; M.J.W. is supported by a Burroughs Wellcome Fund CASI Award. This work was supported by an NIH grant (R01-NS050538) to L.L.; the European Research Council (ERC) under the European Union's Horizon 2020 research and innovations programme (No. 725780 LinPro) to S.H.; and Simons and James S. McDonnell Foundations and an NSF CAREER award to S.G.; L.L. is an HHMI investigator.","publication_status":"published","status":"public","ec_funded":1,"author":[{"first_name":"Yukari H.","full_name":"Takeo, Yukari H.","last_name":"Takeo"},{"full_name":"Shuster, S. Andrew","last_name":"Shuster","first_name":"S. Andrew"},{"full_name":"Jiang, Linnie","last_name":"Jiang","first_name":"Linnie"},{"first_name":"Miley","full_name":"Hu, Miley","last_name":"Hu"},{"full_name":"Luginbuhl, David J.","last_name":"Luginbuhl","first_name":"David J."},{"full_name":"Rülicke, Thomas","last_name":"Rülicke","first_name":"Thomas"},{"last_name":"Contreras","full_name":"Contreras, Ximena","first_name":"Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","orcid":"0000-0003-2279-1061"},{"first_name":"Mark J.","last_name":"Wagner","full_name":"Wagner, Mark J."},{"first_name":"Surya","last_name":"Ganguli","full_name":"Ganguli, Surya"},{"first_name":"Liqun","full_name":"Luo, Liqun","last_name":"Luo"}],"title":"GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells","_id":"8544","issue":"4","abstract":[{"text":"The synaptotrophic hypothesis posits that synapse formation stabilizes dendritic branches, yet this hypothesis has not been causally tested in vivo in the mammalian brain. Presynaptic ligand cerebellin-1 (Cbln1) and postsynaptic receptor GluD2 mediate synaptogenesis between granule cells and Purkinje cells in the molecular layer of the cerebellar cortex. Here we show that sparse but not global knockout of GluD2 causes under-elaboration of Purkinje cell dendrites in the deep molecular layer and overelaboration in the superficial molecular layer. Developmental, overexpression, structure-function, and genetic epistasis analyses indicate that dendrite morphogenesis defects result from competitive synaptogenesis in a Cbln1/GluD2-dependent manner. A generative model of dendritic growth based on competitive synaptogenesis largely recapitulates GluD2 sparse and global knockout phenotypes. Our results support the synaptotrophic hypothesis at initial stages of dendrite development, suggest a second mode in which cumulative synapse formation inhibits further dendrite growth, and highlight the importance of competition in dendrite morphogenesis.","lang":"eng"}],"doi":"10.1016/j.neuron.2020.11.028","volume":109,"article_processing_charge":"No","day":"17","citation":{"ista":"Takeo YH, Shuster SA, Jiang L, Hu M, Luginbuhl DJ, Rülicke T, Contreras X, Hippenmeyer S, Wagner MJ, Ganguli S, Luo L. 2021. GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. 109(4), P629–644.E8.","short":"Y.H. Takeo, S.A. Shuster, L. Jiang, M. Hu, D.J. Luginbuhl, T. Rülicke, X. Contreras, S. Hippenmeyer, M.J. Wagner, S. Ganguli, L. Luo, Neuron 109 (2021) P629–644.E8.","ama":"Takeo YH, Shuster SA, Jiang L, et al. GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. <i>Neuron</i>. 2021;109(4):P629-644.E8. doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.11.028\">10.1016/j.neuron.2020.11.028</a>","apa":"Takeo, Y. H., Shuster, S. A., Jiang, L., Hu, M., Luginbuhl, D. J., Rülicke, T., … Luo, L. (2021). GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2020.11.028\">https://doi.org/10.1016/j.neuron.2020.11.028</a>","ieee":"Y. H. Takeo <i>et al.</i>, “GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells,” <i>Neuron</i>, vol. 109, no. 4. Elsevier, p. P629–644.E8, 2021.","mla":"Takeo, Yukari H., et al. “GluD2- and Cbln1-Mediated Competitive Synaptogenesis Shapes the Dendritic Arbors of Cerebellar Purkinje Cells.” <i>Neuron</i>, vol. 109, no. 4, Elsevier, 2021, p. P629–644.E8, doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.11.028\">10.1016/j.neuron.2020.11.028</a>.","chicago":"Takeo, Yukari H., S. Andrew Shuster, Linnie Jiang, Miley Hu, David J. Luginbuhl, Thomas Rülicke, Ximena Contreras, et al. “GluD2- and Cbln1-Mediated Competitive Synaptogenesis Shapes the Dendritic Arbors of Cerebellar Purkinje Cells.” <i>Neuron</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.neuron.2020.11.028\">https://doi.org/10.1016/j.neuron.2020.11.028</a>."},"month":"02","oa_version":"Preprint","publication":"Neuron","date_updated":"2024-03-06T12:12:48Z","article_type":"original","page":"P629-644.E8","oa":1,"year":"2021","intvolume":"       109","main_file_link":[{"url":"https://doi.org/10.1101/2020.06.14.151258","open_access":"1"}],"publisher":"Elsevier","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","department":[{"_id":"SiHi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-02-17T00:00:00Z","scopus_import":"1","date_created":"2020-09-21T11:59:47Z"}]