[{"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"language":[{"iso":"eng"}],"type":"preprint","article_processing_charge":"No","day":"07","department":[{"_id":"ChLa"}],"citation":{"chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>.","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. ."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","external_id":{"arxiv":["2102.05996"]},"date_published":"2021-06-07T00:00:00Z","oa_version":"Preprint","date_created":"2022-02-28T14:13:59Z","publication":"arXiv","date_updated":"2023-09-07T13:42:08Z","status":"public","publication_status":"submitted","related_material":{"record":[{"id":"10799","relation":"dissertation_contains","status":"public"}]},"article_number":"2102.05996","author":[{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","last_name":"Konstantinov"},{"orcid":"0000-0002-4561-241X","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"title":"Fairness through regularization for learning to rank","oa":1,"_id":"10803","year":"2021","abstract":[{"lang":"eng","text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality."}],"doi":"10.48550/arXiv.2102.05996"},{"file":[{"date_created":"2022-03-02T15:33:18Z","file_id":"10807","file_size":1257973,"relation":"main_file","creator":"cchlebak","file_name":"2021_JACSAu_Calcabrini.pdf","date_updated":"2022-03-02T15:33:18Z","success":1,"checksum":"1c66a35369e911312a359111420318a9","content_type":"application/pdf","access_level":"open_access"}],"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":1,"article_processing_charge":"Yes (via OA deal)","day":"22","citation":{"mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>.","chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>.","ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","ieee":"M. Calcabrini <i>et al.</i>, “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” <i>JACS Au</i>, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021.","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>"},"ddc":["540"],"month":"11","file_date_updated":"2022-03-02T15:33:18Z","oa_version":"Published Version","publication_identifier":{"issn":["2691-3704"],"eissn":["2691-3704"]},"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication_status":"published","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.","status":"public","ec_funded":1,"author":[{"full_name":"Calcabrini, Mariano","last_name":"Calcabrini","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","first_name":"Mariano"},{"last_name":"Van den Eynden","full_name":"Van den Eynden, Dietger","first_name":"Dietger"},{"full_name":"Sanchez Ribot, Sergi","last_name":"Sanchez Ribot","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","first_name":"Sergi"},{"first_name":"Rohan","full_name":"Pokratath, Rohan","last_name":"Pokratath"},{"last_name":"Llorca","full_name":"Llorca, Jordi","first_name":"Jordi"},{"first_name":"Jonathan","last_name":"De Roo","full_name":"De Roo, Jonathan"},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"}],"title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","_id":"10806","issue":"11","abstract":[{"text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.","lang":"eng"}],"doi":"10.1021/jacsau.1c00349","intvolume":"         1","publisher":"American Chemical Society","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"MaIb"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2021-11-22T00:00:00Z","date_created":"2022-03-02T15:24:16Z","publication":"JACS Au","date_updated":"2023-05-05T08:45:36Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12885"}],"link":[{"relation":"earlier_version","url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr"}]},"article_type":"original","page":"1898-1903","oa":1,"year":"2021","keyword":["general medicine"]},{"oa_version":"None","day":"12","citation":{"ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>.","mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>."},"month":"02","pmid":1,"volume":371,"article_processing_charge":"No","issue":"6530","abstract":[{"lang":"eng","text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material."}],"doi":"10.1126/science.abg0886","author":[{"full_name":"Liu, Yu","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu","orcid":"0000-0001-7313-6740"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria"}],"title":"Tidying up the mess","_id":"10809","status":"public","publication_status":"published","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"date_published":"2021-02-12T00:00:00Z","external_id":{"isi":["000617551600027"],"pmid":["33574201"]},"scopus_import":"1","date_created":"2022-03-03T09:51:48Z","department":[{"_id":"MaIb"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       371","publisher":"American Association for the Advancement of Science","year":"2021","keyword":["multidisciplinary"],"article_type":"letter_note","page":"678-679","publication":"Science","date_updated":"2023-08-17T07:00:35Z"},{"publication":"Nature Computational Science","date_updated":"2023-08-10T22:30:10Z","related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/spot-the-difference/"}],"record":[{"relation":"software","status":"public","id":"10110"}]},"article_type":"original","page":"830-842","oa":1,"year":"2021","keyword":["general medicine"],"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/647800"}],"intvolume":"         1","publisher":"Springer Nature","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","department":[{"_id":"PeJo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-12-16T00:00:00Z","scopus_import":"1","acknowledged_ssus":[{"_id":"SSU"}],"date_created":"2022-03-04T08:32:36Z","publication_identifier":{"issn":["2662-8457"]},"project":[{"grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312"}],"publication_status":"published","acknowledgement":"We thank A. Aertsen, N. Kopell, W. Maass, A. Roth, F. Stella and T. Vogels for critically reading earlier versions of the manuscript. We are grateful to F. Marr and C. Altmutter for excellent technical assistance, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria for efficient support. Finally, we thank T. Carnevale, L. Erdös, M. Hines, D. Nykamp and D. Schröder for useful discussions, and R. Friedrich and S. Wiechert for sharing unpublished data. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692, P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J. and P 31815 to S.J.G.).","status":"public","ec_funded":1,"author":[{"orcid":"0000-0003-2209-5242","last_name":"Guzmán","full_name":"Guzmán, José","first_name":"José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","full_name":"Schlögl, Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100"},{"last_name":"Espinoza Martinez","full_name":"Espinoza Martinez, Claudia ","first_name":"Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082"},{"full_name":"Zhang, Xiaomin","last_name":"Zhang","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","first_name":"Xiaomin"},{"orcid":"0000-0002-9885-6936","full_name":"Suter, Benjamin","last_name":"Suter","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M"}],"title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","_id":"10816","issue":"12","abstract":[{"text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.","lang":"eng"}],"doi":"10.1038/s43588-021-00157-1","file":[{"file_name":"Guzmanetal2021.pdf","file_size":1699466,"creator":"patrickd","relation":"main_file","embargo":"2022-06-17","access_level":"open_access","content_type":"application/pdf","checksum":"9fec5b667909ef52be96d502e4f8c2ae","date_updated":"2022-06-18T22:30:03Z","file_id":"11430","date_created":"2022-06-02T12:51:07Z"},{"file_id":"11431","date_created":"2022-06-02T12:53:47Z","title":"Supplementary Material","file_name":"Guzmanetal2021Suppl.pdf","file_size":3005651,"relation":"supplementary_material","creator":"patrickd","embargo":"2022-06-17","access_level":"open_access","content_type":"application/pdf","checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","date_updated":"2022-06-18T22:30:03Z"}],"has_accepted_license":"1","volume":1,"article_processing_charge":"No","day":"16","citation":{"apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., &#38; Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. <i>Nature Computational Science</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s43588-021-00157-1\">https://doi.org/10.1038/s43588-021-00157-1</a>","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network,” <i>Nature Computational Science</i>, vol. 1, no. 12. Springer Nature, pp. 830–842, 2021.","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. <i>Nature Computational Science</i>. 2021;1(12):830-842. doi:<a href=\"https://doi.org/10.1038/s43588-021-00157-1\">10.1038/s43588-021-00157-1</a>","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 1(12), 830–842.","mla":"Guzmán, José, et al. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” <i>Nature Computational Science</i>, vol. 1, no. 12, Springer Nature, 2021, pp. 830–42, doi:<a href=\"https://doi.org/10.1038/s43588-021-00157-1\">10.1038/s43588-021-00157-1</a>.","chicago":"Guzmán, José, Alois Schlögl, Claudia  Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” <i>Nature Computational Science</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s43588-021-00157-1\">https://doi.org/10.1038/s43588-021-00157-1</a>."},"ddc":["610"],"file_date_updated":"2022-06-18T22:30:03Z","month":"12","oa_version":"Submitted Version"},{"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"publisher":"Elsevier","intvolume":"        31","main_file_link":[{"url":"https://doi.org/10.1101/2020.03.24.005835","open_access":"1"}],"date_created":"2022-03-08T07:51:04Z","scopus_import":"1","date_published":"2021-05-24T00:00:00Z","external_id":{"isi":["000654652200002"],"pmid":["33711252"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MiSi"}],"page":"2051-2064.e8","article_type":"original","date_updated":"2023-08-17T07:01:14Z","publication":"Current Biology","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"year":"2021","oa":1,"volume":31,"article_processing_charge":"No","oa_version":"Preprint","month":"05","pmid":1,"citation":{"apa":"Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani, A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>","ieee":"S. Stahnke <i>et al.</i>, “Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion,” <i>Current Biology</i>, vol. 31, no. 10. Elsevier, p. 2051–2064.e8, 2021.","ama":"Stahnke S, Döring H, Kusch C, et al. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. 2021;31(10):2051-2064.e8. doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>","short":"S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani, I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A. Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31 (2021) 2051–2064.e8.","ista":"Stahnke S, Döring H, Kusch C, de Gorter DJJ, Dütting S, Guledani A, Pleines I, Schnoor M, Sixt MK, Geffers R, Rohde M, Müsken M, Kage F, Steffen A, Faix J, Nieswandt B, Rottner K, Stradal TEB. 2021. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology. 31(10), 2051–2064.e8.","chicago":"Stahnke, Stephanie, Hermann Döring, Charly Kusch, David J.J. de Gorter, Sebastian Dütting, Aleks Guledani, Irina Pleines, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>.","mla":"Stahnke, Stephanie, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>, vol. 31, no. 10, Elsevier, 2021, p. 2051–2064.e8, doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>."},"day":"24","publication_status":"published","status":"public","acknowledgement":"We are grateful to Silvia Prettin, Ina Schleicher, and Petra Hagendorff for expert technical assistance; David Dettbarn for animal keeping and breeding; and Lothar Gröbe and Maria Höxter for cell sorting. We also thank Werner Tegge for peptides and Giorgio Scita for antibodies. This work was supported, in part, by the Deutsche Forschungsgemeinschaft (DFG), Priority Programm SPP1150 (to T.E.B.S., K.R., and M. Sixt), and by DFG grant GRK2223/1 (to K.R.). T.E.B.S. acknowledges support by the Helmholtz Society through HGF impulse fund W2/W3-066 and M. Schnoor by the Mexican Council for Science and Technology (CONACyT, 284292 ), Fund SEP-Cinvestav ( 108 ), and the Royal Society, UK (Newton Advanced Fellowship, NAF/R1/180017 ).","publication_identifier":{"issn":["0960-9822"]},"doi":"10.1016/j.cub.2021.02.043","abstract":[{"text":"Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation and the protrusion of branched actin filament networks. Moreover, Hem1 loss of function in immune cells causes autoimmune diseases in humans. Here, we show that genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis as well as phagocytic cup formation in addition to defects in lamellipodial protrusion and migration. Moreover, Hem1-null macrophages displayed strong defects in cell adhesion despite unaltered podosome formation and concomitant extracellular matrix degradation. Specifically, dynamics of both adhesion and de-adhesion as well as concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly compromised. Accordingly, disruption of WRC function in non-hematopoietic cells coincided with both defects in adhesion turnover and altered FAK and paxillin phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes, but not lamellipodia formation, were partially rescued by small molecule activation of FAK. A full rescue of the phenotype, including lamellipodia formation, required not only the presence of WRCs but also their binding to and activation by Rac. Collectively, our results uncover that WRC impacts on integrin-dependent processes in a FAK-dependent manner, controlling formation and dismantling of adhesions, relevant for properly grabbing onto extracellular surfaces and particles during cell edge expansion, like in migration or phagocytosis.","lang":"eng"}],"issue":"10","_id":"10834","title":"Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion","author":[{"first_name":"Stephanie","full_name":"Stahnke, Stephanie","last_name":"Stahnke"},{"first_name":"Hermann","last_name":"Döring","full_name":"Döring, Hermann"},{"full_name":"Kusch, Charly","last_name":"Kusch","first_name":"Charly"},{"first_name":"David J.J.","full_name":"de Gorter, David J.J.","last_name":"de Gorter"},{"first_name":"Sebastian","last_name":"Dütting","full_name":"Dütting, Sebastian"},{"first_name":"Aleks","full_name":"Guledani, Aleks","last_name":"Guledani"},{"first_name":"Irina","full_name":"Pleines, Irina","last_name":"Pleines"},{"first_name":"Michael","last_name":"Schnoor","full_name":"Schnoor, Michael"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","full_name":"Sixt, Michael K","last_name":"Sixt"},{"first_name":"Robert","full_name":"Geffers, Robert","last_name":"Geffers"},{"full_name":"Rohde, Manfred","last_name":"Rohde","first_name":"Manfred"},{"last_name":"Müsken","full_name":"Müsken, Mathias","first_name":"Mathias"},{"full_name":"Kage, Frieda","last_name":"Kage","first_name":"Frieda"},{"last_name":"Steffen","full_name":"Steffen, Anika","first_name":"Anika"},{"full_name":"Faix, Jan","last_name":"Faix","first_name":"Jan"},{"first_name":"Bernhard","full_name":"Nieswandt, Bernhard","last_name":"Nieswandt"},{"first_name":"Klemens","last_name":"Rottner","full_name":"Rottner, Klemens"},{"first_name":"Theresia E.B.","last_name":"Stradal","full_name":"Stradal, Theresia E.B."}]},{"keyword":["Immunology","Immunology and Allergy"],"year":"2021","oa":1,"article_type":"letter_note","page":"1553-1556","date_updated":"2023-09-05T15:58:53Z","publication":"Allergy","scopus_import":"1","date_created":"2022-03-08T11:19:05Z","external_id":{"pmid":["32990982"],"isi":["000577708800001"]},"date_published":"2021-05-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"Bio"}],"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"intvolume":"        76","publisher":"Wiley","doi":"10.1111/all.14604","issue":"5","_id":"10836","author":[{"first_name":"Christina L.","full_name":"Pranger, Christina L.","last_name":"Pranger"},{"id":"36432834-F248-11E8-B48F-1D18A9856A87","first_name":"Judit","full_name":"Fazekas-Singer, Judit","last_name":"Fazekas-Singer","orcid":"0000-0002-8777-3502"},{"first_name":"Verena K.","full_name":"Köhler, Verena K.","last_name":"Köhler"},{"full_name":"Pali‐Schöll, Isabella","last_name":"Pali‐Schöll","first_name":"Isabella"},{"first_name":"Alessandro","last_name":"Fiocchi","full_name":"Fiocchi, Alessandro"},{"first_name":"Sophia N.","full_name":"Karagiannis, Sophia N.","last_name":"Karagiannis"},{"first_name":"Olatz","full_name":"Zenarruzabeitia, Olatz","last_name":"Zenarruzabeitia"},{"last_name":"Borrego","full_name":"Borrego, Francisco","first_name":"Francisco"},{"full_name":"Jensen‐Jarolim, Erika","last_name":"Jensen‐Jarolim","first_name":"Erika"}],"title":"PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance","acknowledgement":"This  work  was  supported  by  the  Austrian  Science  Fund  (FWF)  grants  MCCA  W1248-B30  and  SFB  F4606-B28  to  EJJ.  CP  received  a  short-term research fellowship of the European Federation of Immunological Societies  (EFIS-IL)  for  a  research  visit  at  Biocruces  Bizkaia  Health  Research  Institute,  Barakaldo,  Spain.  VKK  received  an  EFIS-IL  short-term  research  fellowship  for  a  research  visit  at  King’s  College  London.  The research was funded by the National Institute for Health Research (NIHR) Biomedical Research Centre (BRC) based at Guy's and St Thomas' NHS Foundation Trust and King's College London (IS-BRC-1215-20006) (SNK).  The  authors  acknowledge  support  by  the  Medical  Research  Council (MR/L023091/1) (SNK); Breast Cancer Now (147; KCL-BCN-Q3)(SNK); Cancer Research UK (C30122/A11527; C30122/A15774) (SNK); Cancer  Research  UK  King's  Health  Partners  Centre  at  King's  College  London   (C604/A25135)   (SNK);   CRUK/NIHR   in   England/DoH   for   Scotland,  Wales  and  Northern  Ireland  Experimental  Cancer  Medicine  Centre  (C10355/A15587)  (SNK).  The  views  expressed  are  those  of  the  author(s)  and  not  necessarily  those  of  the  NHS,  the  NIHR  or  the  Department  of  Health.  Additionally,  this  work  was  funded  by  Instituto  de  Salud  Carlos  III  through  the  project  \"PI16/01223\"  (Co-funded  by  European Regional Development Fund; “A way to make Europe”) to FB and  by  the  Department  of  Health,  Basque  Government  through  the  project “2019111031” to OZ. OZ is recipient of a Sara Borrell 2017 post-doctoral contract “CD17/00128” funded by Instituto de Salud Carlos III (Co-funded by European Social Fund; “Investing in your future”).","status":"public","publication_status":"published","publication_identifier":{"eissn":["1398-9995"],"issn":["0105-4538"]},"oa_version":"Published Version","month":"05","pmid":1,"ddc":["570"],"file_date_updated":"2022-03-08T11:23:16Z","day":"01","citation":{"ama":"Pranger CL, Singer J, Köhler VK, et al. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. 2021;76(5):1553-1556. doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>","ista":"Pranger CL, Singer J, Köhler VK, Pali‐Schöll I, Fiocchi A, Karagiannis SN, Zenarruzabeitia O, Borrego F, Jensen‐Jarolim E. 2021. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 76(5), 1553–1556.","short":"C.L. Pranger, J. Singer, V.K. Köhler, I. Pali‐Schöll, A. Fiocchi, S.N. Karagiannis, O. Zenarruzabeitia, F. Borrego, E. Jensen‐Jarolim, Allergy 76 (2021) 1553–1556.","apa":"Pranger, C. L., Singer, J., Köhler, V. K., Pali‐Schöll, I., Fiocchi, A., Karagiannis, S. N., … Jensen‐Jarolim, E. (2021). PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. Wiley. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>","ieee":"C. L. Pranger <i>et al.</i>, “PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance,” <i>Allergy</i>, vol. 76, no. 5. Wiley, pp. 1553–1556, 2021.","mla":"Pranger, Christina L., et al. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>, vol. 76, no. 5, Wiley, 2021, pp. 1553–56, doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>.","chicago":"Pranger, Christina L., Judit Singer, Verena K. Köhler, Isabella Pali‐Schöll, Alessandro Fiocchi, Sophia N. Karagiannis, Olatz Zenarruzabeitia, Francisco Borrego, and Erika Jensen‐Jarolim. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>."},"volume":76,"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":[{"file_id":"10837","date_created":"2022-03-08T11:23:16Z","file_name":"2021_Allergy_Pranger.pdf","file_size":626081,"relation":"main_file","creator":"dernst","success":1,"date_updated":"2022-03-08T11:23:16Z","access_level":"open_access","content_type":"application/pdf","checksum":"9526f9554112fc027c9f7fa540c488cd"}]},{"file":[{"file_size":1726548,"relation":"main_file","creator":"dernst","file_name":"2021_MolecularEcology_Westram.pdf","checksum":"d5611f243ceb63a0e091d6662ebd9cda","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-03-08T11:31:30Z","success":1,"date_created":"2022-03-08T11:31:30Z","file_id":"10839"}],"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":30,"article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2022-03-08T11:31:30Z","ddc":["570"],"pmid":1,"month":"08","day":"01","citation":{"ieee":"A. M. Westram, R. Faria, K. Johannesson, and R. Butlin, “Using replicate hybrid zones to understand the genomic basis of adaptive divergence,” <i>Molecular Ecology</i>, vol. 30, no. 15. Wiley, pp. 3797–3814, 2021.","apa":"Westram, A. M., Faria, R., Johannesson, K., &#38; Butlin, R. (2021). Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>","ama":"Westram AM, Faria R, Johannesson K, Butlin R. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. 2021;30(15):3797-3814. doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>","ista":"Westram AM, Faria R, Johannesson K, Butlin R. 2021. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. 30(15), 3797–3814.","short":"A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021) 3797–3814.","chicago":"Westram, Anja M, Rui Faria, Kerstin Johannesson, and Roger Butlin. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>.","mla":"Westram, Anja M., et al. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>, vol. 30, no. 15, Wiley, 2021, pp. 3797–814, doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>."},"oa_version":"Published Version","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"publication_status":"published","acknowledgement":"We thank everyone who helped with fieldwork, snail processing and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot, Mark Ravinet, Irena Senčić and Zuzanna Zagrodzka. We are also grateful to Edinburgh Genomics for library preparation and sequencing, to Stuart Baird and Mark Ravinet for helpful discussions, and to three anonymous reviewers for their constructive comments. This work was supported by the Natural Environment Research Council (NE/K014021/1), the European Research Council (AdG-693030-BARRIERS), Swedish Research Councils Formas and Vetenskapsrådet through a Linnaeus grant to the Centre for Marine Evolutionary Biology (217-2008-1719), the European Regional Development Fund (POCI-01-0145-FEDER-030628), and the Fundação para a iência e a Tecnologia,\r\nPortugal (PTDC/BIA-EVL/\r\n30628/2017). A.M.W. and R.F. were\r\nfunded by the European Union’s Horizon 2020 research and innovation\r\nprogramme under Marie Skłodowska-Curie\r\ngrant agreements\r\nno. 754411/797747 and no. 706376, respectively.","status":"public","_id":"10838","author":[{"orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M"},{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"first_name":"Kerstin","full_name":"Johannesson, Kerstin","last_name":"Johannesson"},{"last_name":"Butlin","full_name":"Butlin, Roger","first_name":"Roger"}],"title":"Using replicate hybrid zones to understand the genomic basis of adaptive divergence","doi":"10.1111/mec.15861","issue":"15","abstract":[{"text":"Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones.","lang":"eng"}],"intvolume":"        30","publisher":"Wiley","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"BeVi"}],"scopus_import":"1","date_created":"2022-03-08T11:28:32Z","date_published":"2021-08-01T00:00:00Z","external_id":{"pmid":["33638231"],"isi":["000669439700001"]},"date_updated":"2023-09-05T16:02:19Z","publication":"Molecular Ecology","article_type":"original","page":"3797-3814","oa":1,"keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"year":"2021"},{"oa_version":"Published Version","conference":{"name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization","start_date":"2021-08-19","location":"Virtual, Online","end_date":"2021-08-27"},"month":"09","citation":{"ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: <i>30th International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., &#38; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In <i>30th International Joint Conference on Artificial Intelligence</i> (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in <i>30th International Joint Conference on Artificial Intelligence</i>, Virtual, Online, 2021, pp. 4182–4189.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” <i>30th International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>.","chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In <i>30th International Joint Conference on Artificial Intelligence</i>, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>."},"day":"01","article_processing_charge":"No","doi":"10.24963/ijcai.2021/575","abstract":[{"lang":"eng","text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game."}],"_id":"10847","title":"Solving partially observable stochastic shortest-path games","author":[{"first_name":"Petr","last_name":"Tomášek","full_name":"Tomášek, Petr"},{"last_name":"Horák","full_name":"Horák, Karel","first_name":"Karel"},{"first_name":"Aditya","last_name":"Aradhye","full_name":"Aradhye, Aditya"},{"full_name":"Bošanský, Branislav","last_name":"Bošanský","first_name":"Branislav"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"ec_funded":1,"status":"public","publication_status":"published","acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. ","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication_identifier":{"issn":["1045-0823"],"isbn":["9780999241196"]},"date_created":"2022-03-13T23:01:47Z","scopus_import":"1","date_published":"2021-09-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","publisher":"International Joint Conferences on Artificial Intelligence","main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"year":"2021","oa":1,"page":"4182-4189","date_updated":"2025-07-14T09:10:13Z","publication":"30th International Joint Conference on Artificial Intelligence"},{"arxiv":1,"article_processing_charge":"No","volume":33,"citation":{"ama":"Seiringer R. The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. 2021;33(01). doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>","ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021).","apa":"Seiringer, R. (2021). The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>","ieee":"R. Seiringer, “The polaron at strong coupling,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01. World Scientific Publishing, 2021.","mla":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>.","chicago":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>."},"day":"01","month":"02","oa_version":"Preprint","publication_identifier":{"eissn":["1793-6659"],"issn":["0129-055X"]},"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","acknowledgement":"This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227).","status":"public","ec_funded":1,"title":"The polaron at strong coupling","author":[{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"_id":"10852","abstract":[{"lang":"eng","text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass."}],"issue":"01","doi":"10.1142/s0129055x20600120","publisher":"World Scientific Publishing","main_file_link":[{"url":"https://arxiv.org/abs/1912.12509","open_access":"1"}],"intvolume":"        33","isi":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","department":[{"_id":"RoSe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2021-02-01T00:00:00Z","external_id":{"isi":["000613313200013"],"arxiv":["1912.12509"]},"date_created":"2022-03-18T08:11:34Z","scopus_import":"1","publication":"Reviews in Mathematical Physics","date_updated":"2023-09-05T16:08:02Z","article_number":"2060012","article_type":"original","oa":1,"year":"2021","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"]},{"article_processing_charge":"No","arxiv":1,"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2021-07-08","location":"Virtual, Online","start_date":"2021-07-06"},"oa_version":"Preprint","month":"07","day":"01","citation":{"mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 208–20, doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>.","chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 208–20. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>.","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual, Online, 2021, pp. 208–220.","apa":"Fedorov, A., Koval, N., &#38; Alistarh, D.-A. (2021). A scalable concurrent algorithm for dynamic connectivity. In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 208–220). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>","ama":"Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:208-220. doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>","ista":"Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220.","short":"A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220."},"publication_status":"published","status":"public","publication_identifier":{"isbn":["9781450380706"]},"doi":"10.1145/3409964.3461810","abstract":[{"text":"Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate.","lang":"eng"}],"_id":"10853","author":[{"full_name":"Fedorov, Alexander","last_name":"Fedorov","first_name":"Alexander"},{"full_name":"Koval, Nikita","last_name":"Koval","first_name":"Nikita"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"title":"A scalable concurrent algorithm for dynamic connectivity","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2105.08098","open_access":"1"}],"publisher":"Association for Computing Machinery","scopus_import":"1","date_created":"2022-03-18T08:21:47Z","date_published":"2021-07-01T00:00:00Z","external_id":{"arxiv":["2105.08098"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"page":"208-220","date_updated":"2022-03-18T08:45:46Z","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","year":"2021","oa":1},{"arxiv":1,"article_processing_charge":"No","day":"01","citation":{"ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2021:71-72. doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Virtual, Online, 2021, pp. 71–72.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i> (pp. 71–72). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, 71–72. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2021, pp. 71–72, doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>."},"month":"05","conference":{"end_date":"2021-06-18","start_date":"2021-06-14","location":"Virtual, Online","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems"},"oa_version":"Preprint","publication_identifier":{"isbn":["9781450380720"]},"project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"},{"call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605"}],"status":"public","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the paper. 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), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","publication_status":"published","ec_funded":1,"author":[{"first_name":"Klaus-Tycho","last_name":"Foerster","full_name":"Foerster, Klaus-Tycho"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","full_name":"Korhonen, Janne","last_name":"Korhonen"},{"last_name":"Paz","full_name":"Paz, Ami","first_name":"Ami"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","full_name":"Rybicki, Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"title":"Input-dynamic distributed algorithms for communication networks","_id":"10854","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.","lang":"eng"}],"doi":"10.1145/3410220.3453923","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"publisher":"Association for Computing Machinery","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-05-01T00:00:00Z","external_id":{"arxiv":["2005.07637"]},"scopus_import":"1","date_created":"2022-03-18T08:48:41Z","publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","date_updated":"2023-09-26T10:40:55Z","related_material":{"record":[{"id":"10855","relation":"extended_version","status":"public"}]},"page":"71-72","oa":1,"year":"2021"},{"year":"2021","keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"oa":1,"related_material":{"record":[{"id":"10854","status":"public","relation":"shorter_version"}]},"page":"1-33","article_type":"original","publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","date_updated":"2023-09-26T10:40:55Z","date_published":"2021-03-01T00:00:00Z","external_id":{"arxiv":["2005.07637"]},"date_created":"2022-03-18T09:10:27Z","scopus_import":"1","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publisher":"Association for Computing Machinery","intvolume":"         5","main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques."}],"issue":"1","doi":"10.1145/3447384","title":"Input-dynamic distributed algorithms for communication networks","author":[{"first_name":"Klaus-Tycho","last_name":"Foerster","full_name":"Foerster, Klaus-Tycho"},{"last_name":"Korhonen","full_name":"Korhonen, Janne","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","full_name":"Rybicki, Joel","last_name":"Rybicki"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"_id":"10855","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["2476-1249"]},"project":[{"grant_number":"840605","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"},{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"oa_version":"Preprint","citation":{"mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>"},"day":"01","month":"03","article_processing_charge":"No","volume":5,"arxiv":1},{"file":[{"content_type":"application/pdf","checksum":"7e615ac8489f5eae580b6517debfdc53","access_level":"open_access","date_updated":"2022-03-18T09:31:59Z","success":1,"file_size":789801,"creator":"dernst","relation":"main_file","file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","date_created":"2022-03-18T09:31:59Z","file_id":"10857"}],"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,"article_processing_charge":"No","volume":9,"has_accepted_license":"1","month":"01","file_date_updated":"2022-03-18T09:31:59Z","ddc":["510"],"day":"29","citation":{"mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021."},"oa_version":"Published Version","publication_identifier":{"issn":["2299-3274"]},"publication_status":"published","status":"public","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","_id":"10856","author":[{"last_name":"Ivanov","full_name":"Ivanov, Grigory","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"},{"full_name":"Tsiutsiurupa, Igor","last_name":"Tsiutsiurupa","first_name":"Igor"}],"title":"On the volume of sections of the cube","doi":"10.1515/agms-2020-0103","issue":"1","abstract":[{"lang":"eng","text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2."}],"intvolume":"         9","publisher":"De Gruyter","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"UlWa"}],"scopus_import":"1","date_created":"2022-03-18T09:25:14Z","external_id":{"arxiv":["2004.02674"],"isi":["000734286800001"]},"date_published":"2021-01-29T00:00:00Z","date_updated":"2023-08-17T07:07:58Z","publication":"Analysis and Geometry in Metric Spaces","article_type":"original","page":"1-18","oa":1,"keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"year":"2021"},{"keyword":["General Materials Science","General Chemical Engineering"],"year":"2021","oa":1,"article_type":"original","article_number":"1827","date_updated":"2023-08-17T07:08:30Z","publication":"Nanomaterials","scopus_import":"1","date_created":"2022-03-18T09:45:02Z","external_id":{"isi":["000676570000001"]},"date_published":"2021-07-14T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"MaIb"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","isi":1,"intvolume":"        11","publisher":"MDPI","doi":"10.3390/nano11071827","issue":"7","abstract":[{"text":"The cost-effective conversion of low-grade heat into electricity using thermoelectric devices requires developing alternative materials and material processing technologies able to reduce the currently high device manufacturing costs. In this direction, thermoelectric materials that do not rely on rare or toxic elements such as tellurium or lead need to be produced using high-throughput technologies not involving high temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative to Bi2Te3 for ambient temperature thermoelectric applications, but its performance is still low for practical applications, and additional efforts toward finding proper dopants are required. Here, we report a scalable method to produce Bi2Se3 nanosheets at low synthesis temperatures. We studied the influence of different dopants on the thermoelectric properties of this material. Among the elements tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a reduction in the thermal conductivity in the direction of the hot-press axis, resulting in an overall 60% improvement in the thermoelectric figure of merit of Bi2Se3.","lang":"eng"}],"_id":"10858","author":[{"last_name":"Li","full_name":"Li, Mengyao","first_name":"Mengyao"},{"first_name":"Yu","full_name":"Zhang, Yu","last_name":"Zhang"},{"last_name":"Zhang","full_name":"Zhang, Ting","first_name":"Ting"},{"first_name":"Yong","full_name":"Zuo, Yong","last_name":"Zuo"},{"first_name":"Ke","full_name":"Xiao, Ke","last_name":"Xiao"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"last_name":"Llorca","full_name":"Llorca, Jordi","first_name":"Jordi"},{"orcid":"0000-0001-7313-6740","full_name":"Liu, Yu","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"title":"Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping","ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3.","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"publication_identifier":{"issn":["2079-4991"]},"oa_version":"Published Version","month":"07","file_date_updated":"2022-03-18T09:53:15Z","ddc":["540"],"day":"14","citation":{"apa":"Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021). Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. MDPI. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>","ieee":"M. Li <i>et al.</i>, “Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping,” <i>Nanomaterials</i>, vol. 11, no. 7. MDPI, 2021.","short":"M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu, A. Cabot, Nanomaterials 11 (2021).","ama":"Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. 2021;11(7). doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>","ista":"Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A. 2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. Nanomaterials. 11(7), 1827.","chicago":"Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>.","mla":"Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>, vol. 11, no. 7, 1827, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>."},"article_processing_charge":"No","volume":11,"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":[{"file_id":"10859","date_created":"2022-03-18T09:53:15Z","success":1,"date_updated":"2022-03-18T09:53:15Z","access_level":"open_access","content_type":"application/pdf","checksum":"f28a8b5cf80f5605828359bb398463b0","file_name":"2021_Nanomaterials_Li.pdf","creator":"dernst","relation":"main_file","file_size":4867547}]},{"oa":1,"year":"2021","keyword":["General Mathematics","Tight frame","Grassmannian","zonotope"],"publication":"Canadian Mathematical Bulletin","date_updated":"2023-09-05T12:43:09Z","page":"942-963","article_type":"original","department":[{"_id":"UlWa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1804.10055"],"isi":["000730165300021"]},"date_published":"2021-12-18T00:00:00Z","date_created":"2022-03-18T09:55:59Z","scopus_import":"1","publisher":"Canadian Mathematical Society","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10055"}],"intvolume":"        64","isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","title":"Tight frames and related geometric problems","author":[{"first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","full_name":"Ivanov, Grigory"}],"_id":"10860","abstract":[{"lang":"eng","text":"A tight frame is the orthogonal projection of some orthonormal basis of Rn onto Rk. We show that a set of vectors is a tight frame if and only if the set of all cross products of these vectors is a tight frame. We reformulate a range of problems on the volume of projections (or sections) of regular polytopes in terms of tight frames and write a first-order necessary condition for local extrema of these problems. As applications, we prove new results for the problem of maximization of the volume of zonotopes."}],"issue":"4","doi":"10.4153/s000843952000096x","publication_identifier":{"issn":["0008-4395"],"eissn":["1496-4287"]},"publication_status":"published","acknowledgement":"The author was supported by the Swiss National Science Foundation grant 200021_179133. The author acknowledges the financial support from the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no. 075-15-2019-1926.","status":"public","citation":{"apa":"Ivanov, G. (2021). Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>","ieee":"G. Ivanov, “Tight frames and related geometric problems,” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.","short":"G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.","ama":"Ivanov G. Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. 2021;64(4):942-963. doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>","ista":"Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 64(4), 942–963.","mla":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>.","chicago":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society, 2021. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>."},"day":"18","month":"12","oa_version":"Preprint","arxiv":1,"volume":64,"article_processing_charge":"No"},{"date_updated":"2022-03-22T07:53:18Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"P34015","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","name":"Efficient coding with biophysical realism"}],"status":"public","publication_status":"submitted","acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","page":"37","ec_funded":1,"oa":1,"title":"Quantifying the coexistence of neuronal oscillations and avalanches","author":[{"orcid":"0000-0003-2623-5249","full_name":"Lombardi, Fabrizio","last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425","first_name":"Fabrizio"},{"id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","first_name":"Selver","full_name":"Pepic, Selver","last_name":"Pepic"},{"first_name":"Oren","last_name":"Shriki","full_name":"Shriki, Oren"},{"orcid":"0000-0002-6699-1455","last_name":"Tkačik","full_name":"Tkačik, Gašper","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele"}],"_id":"10912","abstract":[{"text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"year":"2021","doi":"10.48550/ARXIV.2108.06686","publisher":"arXiv","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.06686"}],"arxiv":1,"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"citation":{"mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.)."},"day":"17","department":[{"_id":"GaTk"}],"ddc":["570"],"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-08-17T00:00:00Z","external_id":{"arxiv":["2108.06686"]},"date_created":"2022-03-21T11:41:28Z","oa_version":"Preprint"},{"publication_identifier":{"eissn":["2374-3468"],"isbn":["9781713835974"],"issn":["2159-5399"]},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"publication_status":"published","acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh 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).","status":"public","ec_funded":1,"author":[{"first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav","last_name":"Kungurtsev"},{"first_name":"Malcolm","full_name":"Egan, Malcolm","last_name":"Egan"},{"last_name":"Chatterjee","full_name":"Chatterjee, Bapi","first_name":"Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","_id":"11436","issue":"9B","abstract":[{"text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy.","lang":"eng"}],"arxiv":1,"article_processing_charge":"No","volume":35,"day":"18","citation":{"mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16.","chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216.","ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216."},"month":"05","conference":{"end_date":"2021-02-09","location":"Virtual, Online","start_date":"2021-02-02","name":"AAAI: Conference on Artificial Intelligence"},"oa_version":"Preprint","publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","date_updated":"2022-06-07T06:53:36Z","page":"8209-8216","oa":1,"year":"2021","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1905.11845","open_access":"1"}],"intvolume":"        35","publisher":"AAAI Press","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1905.11845"]},"date_published":"2021-05-18T00:00:00Z","scopus_import":"1","date_created":"2022-06-05T22:01:52Z"},{"month":"12","day":"01","citation":{"mla":"Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited Communication.” <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34.","chicago":"Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, 4:2823–34. Neural Information Processing Systems Foundation, 2021.","ieee":"F. Alimisis, P. Davies, B. Vandereycken, and D.-A. Alistarh, “Distributed principal component analysis with limited communication,” in <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 4, pp. 2823–2834.","apa":"Alimisis, F., Davies, P., Vandereycken, B., &#38; Alistarh, D.-A. (2021). Distributed principal component analysis with limited communication. In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i> (Vol. 4, pp. 2823–2834). Virtual, Online: Neural Information Processing Systems Foundation.","ama":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.","ista":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal component analysis with limited communication. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 4, 2823–2834.","short":"F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 2823–2834."},"conference":{"start_date":"2021-12-06","location":"Virtual, Online","end_date":"2021-12-14","name":"NeurIPS: Neural Information Processing Systems"},"oa_version":"Published Version","arxiv":1,"article_processing_charge":"No","volume":4,"_id":"11452","author":[{"full_name":"Alimisis, Foivos","last_name":"Alimisis","first_name":"Foivos"},{"orcid":"0000-0002-5646-9524","first_name":"Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425","last_name":"Davies","full_name":"Davies, Peter"},{"first_name":"Bart","last_name":"Vandereycken","full_name":"Vandereycken, Bart"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"title":"Distributed principal component analysis with limited communication","abstract":[{"text":"We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a new quantized variant of Riemannian gradient descent to solve this problem, and prove that the algorithm converges with high probability under a set of necessary spherical-convexity properties. We give bounds on the number of bits transmitted by the algorithm under common initialization schemes, and investigate the dependency on the problem dimension in each case.","lang":"eng"}],"project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"ec_funded":1,"acknowledgement":"We would like to thank the anonymous reviewers for helpful comments and suggestions. We also thank Aurelien Lucchi and Antonio Orvieto for fruitful discussions at an early stage of this work. FA is partially supported by the SNSF under research project No. 192363 and conducted part of this work while at IST Austria under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411.","publication_status":"published","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"scopus_import":"1","date_created":"2022-06-19T22:01:58Z","external_id":{"arxiv":["2110.14391"]},"date_published":"2021-12-01T00:00:00Z","intvolume":"         4","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf"}],"publisher":"Neural Information Processing Systems Foundation","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"oa":1,"year":"2021","date_updated":"2022-06-20T08:31:52Z","publication":"Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems","page":"2823-2834"},{"publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"project":[{"_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."}],"status":"public","publication_status":"published","acknowledgement":"We would like to thank Professor Dr. Henning Sprekeler for his valuable suggestions and Dr. Andrew Saxe, Milan Klöwer and Anna Wallis for their constructive feedback on the manuscript. Lukas Braun was supported by the Network of European Neuroscience Schools through their NENS Exchange Grant program, by the European Union through their European Community Action Scheme for the Mobility of University Students, the Woodward Scholarship awarded by Wadham College, Oxford and the Medical Research Council [MR/N013468/1]. Tim P. Vogels was supported by a Wellcome Trust Senior Research Fellowship [214316/Z/18/Z].","author":[{"first_name":"Lukas","last_name":"Braun","full_name":"Braun, Lukas"},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P","full_name":"Vogels, Tim P","last_name":"Vogels","orcid":"0000-0003-3295-6181"}],"title":"Online learning of neural computations from sparse temporal feedback","_id":"11453","abstract":[{"text":"Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological properties. Synaptic connectivity determines which inputs from presynaptic neurons are integrated, while cellular properties determine how inputs are filtered over time. Unlike their biological counterparts, most computational approaches to learning in simulated neural networks are limited to changes in synaptic connectivity. However, if intrinsic parameters change, neural computations are altered drastically. Here, we include the parameters that determine the intrinsic properties,\r\ne.g., time constants and reset potential, into the learning paradigm. Using sparse feedback signals that indicate target spike times, and gradient-based parameter updates, we show that the intrinsic parameters can be learned along with the synaptic weights to produce specific input-output functions. Specifically, we use a teacher-student paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire neuron must recover the parameters of a teacher neuron. We show that complex temporal functions can be learned online and without backpropagation through time, relying on event-based updates only. Our results are a step towards online learning of neural computations from ungraded and unsigned sparse feedback signals with a biologically inspired learning mechanism.","lang":"eng"}],"volume":20,"article_processing_charge":"No","day":"01","citation":{"ista":"Braun L, Vogels TP. 2021. Online learning of neural computations from sparse temporal feedback. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 20, 16437–16450.","ama":"Braun L, Vogels TP. Online learning of neural computations from sparse temporal feedback. In: <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>. Vol 20. Neural Information Processing Systems Foundation; 2021:16437-16450.","short":"L. Braun, T.P. Vogels, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 16437–16450.","apa":"Braun, L., &#38; Vogels, T. P. (2021). Online learning of neural computations from sparse temporal feedback. In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i> (Vol. 20, pp. 16437–16450). Virtual, Online: Neural Information Processing Systems Foundation.","ieee":"L. Braun and T. P. Vogels, “Online learning of neural computations from sparse temporal feedback,” in <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 20, pp. 16437–16450.","chicago":"Braun, Lukas, and Tim P Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, 20:16437–50. Neural Information Processing Systems Foundation, 2021.","mla":"Braun, Lukas, and Tim P. Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, vol. 20, Neural Information Processing Systems Foundation, 2021, pp. 16437–50."},"month":"12","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-14","start_date":"2021-12-06","location":"Virtual, Online"},"oa_version":"Published Version","publication":"Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems","date_updated":"2022-06-20T07:12:58Z","page":"16437-16450","oa":1,"year":"2021","intvolume":"        20","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/88e1ce84f9feef5a08d0df0334c53468-Paper.pdf","open_access":"1"}],"publisher":"Neural Information Processing Systems Foundation","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"TiVo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-12-01T00:00:00Z","scopus_import":"1","date_created":"2022-06-19T22:01:59Z"},{"oa_version":"Published Version","conference":{"end_date":"2021-12-14","start_date":"2021-12-06","location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems"},"citation":{"mla":"Peste, Elena-Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 34, Curran Associates, 2021, pp. 8557–70.","chicago":"Peste, Elena-Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 34:8557–70. Curran Associates, 2021.","ama":"Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 34. Curran Associates; 2021:8557-8570.","ista":"Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 8557–8570.","short":"E.-A. Peste, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 8557–8570.","ieee":"E.-A. Peste, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating Compressed/DeCompressed training of deep neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 34, pp. 8557–8570.","apa":"Peste, E.-A., Iofinova, E. B., Vladu, A., &#38; Alistarh, D.-A. (2021). AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 34, pp. 8557–8570). Virtual, Online: Curran Associates."},"day":"6","month":"12","article_processing_charge":"No","volume":34,"arxiv":1,"abstract":[{"text":"The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.","lang":"eng"}],"title":"AC/DC: Alternating Compressed/DeCompressed training of deep neural networks","author":[{"last_name":"Peste","full_name":"Peste, Elena-Alexandra","first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","first_name":"Eugenia B","full_name":"Iofinova, Eugenia B","last_name":"Iofinova","orcid":"0000-0002-7778-3221"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"_id":"11458","publication_status":"published","status":"public","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). We would also like to thank Christoph Lampert for his feedback on an earlier version of this work, as well as for providing hardware for the Transformer-XL experiments.","ec_funded":1,"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"date_published":"2021-12-06T00:00:00Z","external_id":{"arxiv":["2106.12379"]},"date_created":"2022-06-20T12:11:53Z","acknowledged_ssus":[{"_id":"ScienComp"}],"scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Curran Associates","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf","open_access":"1"}],"intvolume":"        34","year":"2021","oa":1,"related_material":{"record":[{"id":"13074","status":"public","relation":"dissertation_contains"}]},"page":"8557-8570","publication":"35th Conference on Neural Information Processing Systems","date_updated":"2023-06-01T12:54:45Z"}]