[{"file_date_updated":"2020-10-19T11:14:20Z","issue":"2","author":[{"full_name":"Shakiba, A.","last_name":"Shakiba","first_name":"A."},{"orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hooshmandasl, M.R.","last_name":"Hooshmandasl","first_name":"M.R."},{"first_name":"M.","last_name":"Alambardar Meybodi","full_name":"Alambardar Meybodi, M."}],"date_published":"2020-10-01T00:00:00Z","abstract":[{"lang":"eng","text":"We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory. We also demonstrate that one can induce a natural belief structure on one set, given a belief structure on another set, if the two sets are related by a partial monotone S-approximation space. "}],"volume":15,"publication":"Iranian Journal of Mathematical Sciences and Informatics","language":[{"iso":"eng"}],"year":"2020","day":"01","publisher":"Iranian Academic Center for Education, Culture and Research","file":[{"date_updated":"2020-10-19T11:14:20Z","content_type":"application/pdf","file_name":"2020_ijmsi_Shakiba_accepted.pdf","file_size":261688,"access_level":"open_access","file_id":"8676","date_created":"2020-10-19T11:14:20Z","creator":"dernst","relation":"main_file","checksum":"f299661a6d51cda6d255a76be696f48d","success":1}],"scopus_import":"1","date_created":"2020-10-18T22:01:36Z","project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"article_type":"original","has_accepted_license":"1","arxiv":1,"oa_version":"Submitted Version","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa":1,"publication_identifier":{"eissn":["2008-9473"],"issn":["1735-4463"]},"date_updated":"2023-10-16T09:25:00Z","ddc":["000"],"article_processing_charge":"No","citation":{"ieee":"A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” <i>Iranian Journal of Mathematical Sciences and Informatics</i>, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020.","ista":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 15(2), 117–128.","short":"A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian Journal of Mathematical Sciences and Informatics 15 (2020) 117–128.","ama":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. A note on belief structures and s-approximation spaces. <i>Iranian Journal of Mathematical Sciences and Informatics</i>. 2020;15(2):117-128. doi:<a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">10.29252/ijmsi.15.2.117</a>","chicago":"Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar Meybodi. “A Note on Belief Structures and S-Approximation Spaces.” <i>Iranian Journal of Mathematical Sciences and Informatics</i>. Iranian Academic Center for Education, Culture and Research, 2020. <a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">https://doi.org/10.29252/ijmsi.15.2.117</a>.","apa":"Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., &#38; Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. <i>Iranian Journal of Mathematical Sciences and Informatics</i>. Iranian Academic Center for Education, Culture and Research. <a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">https://doi.org/10.29252/ijmsi.15.2.117</a>","mla":"Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.” <i>Iranian Journal of Mathematical Sciences and Informatics</i>, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:<a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">10.29252/ijmsi.15.2.117</a>."},"title":"A note on belief structures and s-approximation spaces","type":"journal_article","status":"public","external_id":{"arxiv":["1805.10672"]},"doi":"10.29252/ijmsi.15.2.117","intvolume":"        15","page":"117-128","_id":"8671","quality_controlled":"1","acknowledgement":"We are very grateful to the anonymous reviewer for detailed comments and suggestions that significantly improved the presentation of this paper. The research was partially supported by a DOC fellowship of the Austrian Academy of Sciences.","department":[{"_id":"KrCh"}]},{"article_type":"original","date_created":"2020-10-18T22:01:37Z","publisher":"Elsevier","file":[{"success":1,"creator":"dernst","date_created":"2021-02-04T10:20:02Z","checksum":"88e1a031a61689165d19a19c2f16d795","relation":"main_file","file_id":"9086","file_name":"2020_DevelopmCell_Chaigne.pdf","file_size":6929686,"access_level":"open_access","date_updated":"2021-02-04T10:20:02Z","content_type":"application/pdf"}],"pmid":1,"scopus_import":"1","day":"26","year":"2020","language":[{"iso":"eng"}],"publication":"Developmental Cell","issue":"2","file_date_updated":"2021-02-04T10:20:02Z","volume":55,"abstract":[{"text":"Cell fate transitions are key to development and homeostasis. It is thus essential to understand the cellular mechanisms controlling fate transitions. Cell division has been implicated in fate decisions in many stem cell types, including neuronal and epithelial progenitors. In other stem cells, such as embryonic stem (ES) cells, the role of division remains unclear. Here, we show that exit from naive pluripotency in mouse ES cells generally occurs after a division. We further show that exit timing is strongly correlated between sister cells, which remain connected by cytoplasmic bridges long after division, and that bridge abscission progressively accelerates as cells exit naive pluripotency. Finally, interfering with abscission impairs naive pluripotency exit, and artificially inducing abscission accelerates it. Altogether, our data indicate that a switch in the division machinery leading to faster abscission regulates pluripotency exit. Our study identifies abscission as a key cellular process coupling cell division to fate transitions.","lang":"eng"}],"date_published":"2020-10-26T00:00:00Z","author":[{"last_name":"Chaigne","first_name":"Agathe","full_name":"Chaigne, Agathe"},{"full_name":"Labouesse, Céline","last_name":"Labouesse","first_name":"Céline"},{"last_name":"White","first_name":"Ian J.","full_name":"White, Ian J."},{"full_name":"Agnew, Meghan","last_name":"Agnew","first_name":"Meghan"},{"id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B","last_name":"Hannezo","first_name":"Edouard B","orcid":"0000-0001-6005-1561"},{"first_name":"Kevin J.","last_name":"Chalut","full_name":"Chalut, Kevin J."},{"first_name":"Ewa K.","last_name":"Paluch","full_name":"Paluch, Ewa K."}],"_id":"8672","page":"195-208","intvolume":"        55","doi":"10.1016/j.devcel.2020.09.001","external_id":{"pmid":["32979313"],"isi":["000582501100012"]},"department":[{"_id":"EdHa"}],"acknowledgement":"This work was supported by the Medical Research Council UK (MRC Program award MC_UU_12018/5 ), the European Research Council (starting grant 311637 -MorphoCorDiv and consolidator grant 820188 -NanoMechShape to E.K.P.), and the Leverhulme Trust (Leverhulme Prize in Biological Sciences to E.K.P.). K.J.C. acknowledges support from the Royal Society (Royal Society Research Fellowship). A.C. acknowledges support from EMBO ( ALTF 2015-563 ), the Wellcome Trust ( 201334/Z/16/Z ), and the Fondation Bettencourt-Schueller (Prix Jeune Chercheur, 2015).","quality_controlled":"1","isi":1,"citation":{"ieee":"A. Chaigne <i>et al.</i>, “Abscission couples cell division to embryonic stem cell fate,” <i>Developmental Cell</i>, vol. 55, no. 2. Elsevier, pp. 195–208, 2020.","ista":"Chaigne A, Labouesse C, White IJ, Agnew M, Hannezo EB, Chalut KJ, Paluch EK. 2020. Abscission couples cell division to embryonic stem cell fate. Developmental Cell. 55(2), 195–208.","short":"A. Chaigne, C. Labouesse, I.J. White, M. Agnew, E.B. Hannezo, K.J. Chalut, E.K. Paluch, Developmental Cell 55 (2020) 195–208.","chicago":"Chaigne, Agathe, Céline Labouesse, Ian J. White, Meghan Agnew, Edouard B Hannezo, Kevin J. Chalut, and Ewa K. Paluch. “Abscission Couples Cell Division to Embryonic Stem Cell Fate.” <i>Developmental Cell</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">https://doi.org/10.1016/j.devcel.2020.09.001</a>.","ama":"Chaigne A, Labouesse C, White IJ, et al. Abscission couples cell division to embryonic stem cell fate. <i>Developmental Cell</i>. 2020;55(2):195-208. doi:<a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">10.1016/j.devcel.2020.09.001</a>","apa":"Chaigne, A., Labouesse, C., White, I. J., Agnew, M., Hannezo, E. B., Chalut, K. J., &#38; Paluch, E. K. (2020). Abscission couples cell division to embryonic stem cell fate. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">https://doi.org/10.1016/j.devcel.2020.09.001</a>","mla":"Chaigne, Agathe, et al. “Abscission Couples Cell Division to Embryonic Stem Cell Fate.” <i>Developmental Cell</i>, vol. 55, no. 2, Elsevier, 2020, pp. 195–208, doi:<a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">10.1016/j.devcel.2020.09.001</a>."},"article_processing_charge":"No","type":"journal_article","status":"public","title":"Abscission couples cell division to embryonic stem cell fate","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"10","oa_version":"Published Version","ddc":["570"],"date_updated":"2023-08-22T10:16:58Z","publication_identifier":{"issn":["15345807"],"eissn":["18781551"]},"oa":1,"publication_status":"published","has_accepted_license":"1"},{"isi":1,"article_processing_charge":"No","citation":{"apa":"Henneberger, C., Bard, L., Panatier, A., Reynolds, J. P., Kopach, O., Medvedev, N. I., … Rusakov, D. A. (2020). LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">https://doi.org/10.1016/j.neuron.2020.08.030</a>","mla":"Henneberger, Christian, et al. “LTP Induction Boosts Glutamate Spillover by Driving Withdrawal of Perisynaptic Astroglia.” <i>Neuron</i>, vol. 108, no. 5, Elsevier, 2020, p. P919–936.E11, doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">10.1016/j.neuron.2020.08.030</a>.","chicago":"Henneberger, Christian, Lucie Bard, Aude Panatier, James P. Reynolds, Olga Kopach, Nikolay I. Medvedev, Daniel Minge, et al. “LTP Induction Boosts Glutamate Spillover by Driving Withdrawal of Perisynaptic Astroglia.” <i>Neuron</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">https://doi.org/10.1016/j.neuron.2020.08.030</a>.","short":"C. Henneberger, L. Bard, A. Panatier, J.P. Reynolds, O. Kopach, N.I. Medvedev, D. Minge, M.K. Herde, S. Anders, I. Kraev, J.P. Heller, S. Rama, K. Zheng, T.P. Jensen, I. Sanchez-Romero, C.J. Jackson, H.L. Janovjak, O.P. Ottersen, E.A. Nagelhus, S.H.R. Oliet, M.G. Stewart, U.Va. Nägerl, D.A. Rusakov, Neuron 108 (2020) P919–936.E11.","ama":"Henneberger C, Bard L, Panatier A, et al. LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia. <i>Neuron</i>. 2020;108(5):P919-936.E11. doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.08.030\">10.1016/j.neuron.2020.08.030</a>","ista":"Henneberger C, Bard L, Panatier A, Reynolds JP, Kopach O, Medvedev NI, Minge D, Herde MK, Anders S, Kraev I, Heller JP, Rama S, Zheng K, Jensen TP, Sanchez-Romero I, Jackson CJ, Janovjak HL, Ottersen OP, Nagelhus EA, Oliet SHR, Stewart MG, Nägerl UVa, Rusakov DA. 2020. LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia. Neuron. 108(5), P919–936.E11.","ieee":"C. Henneberger <i>et al.</i>, “LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia,” <i>Neuron</i>, vol. 108, no. 5. Elsevier, p. P919–936.E11, 2020."},"type":"journal_article","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic astroglia","intvolume":"       108","_id":"8674","page":"P919-936.E11","external_id":{"pmid":["32976770"],"isi":["000603428000010"]},"doi":"10.1016/j.neuron.2020.08.030","department":[{"_id":"HaJa"}],"quality_controlled":"1","acknowledgement":"We thank J. Angibaud for organotypic cultures and R. Chereau and J. Tonnesen for help with the STED microscope; also D. Gonzales and the Neurocentre Magendie INSERM U1215 Genotyping Platform, for breeding management and genotyping. This work was supported by the Wellcome Trust Principal Fellowships 101896 and 212251, ERC Advanced Grant 323113, ERC Proof-of-Concept Grant 767372, EC FP7 ITN 606950, and EU CSA 811011 (D.A.R.); NRW-Rückkehrerpogramm, UCL Excellence Fellowship, German Research Foundation (DFG) SPP1757 and SFB1089 (C.H.); Human Frontiers Science Program (C.H., C.J.J., and H.J.); EMBO Long-Term Fellowship (L.B.); Marie Curie FP7 PIRG08-GA-2010-276995 (A.P.), ASTROMODULATION (S.R.); Equipe FRM DEQ 201 303 26519, Conseil Régional d’Aquitaine R12056GG, INSERM (S.H.R.O.); ANR SUPERTri, ANR Castro (ANR-17-CE16-0002), R-13-BSV4-0007-01, Université de Bordeaux, labex BRAIN (S.H.R.O. and U.V.N.); CNRS (A.P., S.H.R.O., and U.V.N.); HFSP, ANR CEXC, and France-BioImaging ANR-10-INSB-04 (U.V.N.); and FP7 MemStick Project No. 201600 (M.G.S.).","has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","month":"12","publication_identifier":{"issn":["08966273"],"eissn":["10974199"]},"date_updated":"2023-08-22T09:59:29Z","ddc":["570"],"oa":1,"publication_status":"published","pmid":1,"file":[{"success":1,"checksum":"054562bb50165ef9a1f46631c1c5e36b","relation":"main_file","date_created":"2020-12-10T14:42:09Z","creator":"dernst","file_id":"8939","file_size":7518960,"access_level":"open_access","file_name":"2020_Neuron_Henneberger.pdf","content_type":"application/pdf","date_updated":"2020-12-10T14:42:09Z"}],"publisher":"Elsevier","scopus_import":"1","article_type":"original","date_created":"2020-10-18T22:01:38Z","issue":"5","file_date_updated":"2020-12-10T14:42:09Z","date_published":"2020-12-09T00:00:00Z","volume":108,"abstract":[{"lang":"eng","text":"Extrasynaptic actions of glutamate are limited by high-affinity transporters expressed by perisynaptic astroglial processes (PAPs): this helps maintain point-to-point transmission in excitatory circuits. Memory formation in the brain is associated with synaptic remodeling, but how this affects PAPs and therefore extrasynaptic glutamate actions is poorly understood. Here, we used advanced imaging methods, in situ and in vivo, to find that a classical synaptic memory mechanism, long-term potentiation (LTP), triggers withdrawal of PAPs from potentiated synapses. Optical glutamate sensors combined with patch-clamp and 3D molecular localization reveal that LTP induction thus prompts spatial retreat of astroglial glutamate transporters, boosting glutamate spillover and NMDA-receptor-mediated inter-synaptic cross-talk. The LTP-triggered PAP withdrawal involves NKCC1 transporters and the actin-controlling protein cofilin but does not depend on major Ca2+-dependent cascades in astrocytes. We have therefore uncovered a mechanism by which a memory trace at one synapse could alter signal handling by multiple neighboring connections."}],"author":[{"full_name":"Henneberger, Christian","first_name":"Christian","last_name":"Henneberger"},{"full_name":"Bard, Lucie","first_name":"Lucie","last_name":"Bard"},{"first_name":"Aude","last_name":"Panatier","full_name":"Panatier, Aude"},{"full_name":"Reynolds, James P.","first_name":"James P.","last_name":"Reynolds"},{"first_name":"Olga","last_name":"Kopach","full_name":"Kopach, Olga"},{"full_name":"Medvedev, Nikolay I.","last_name":"Medvedev","first_name":"Nikolay I."},{"first_name":"Daniel","last_name":"Minge","full_name":"Minge, Daniel"},{"last_name":"Herde","first_name":"Michel K.","full_name":"Herde, Michel K."},{"first_name":"Stefanie","last_name":"Anders","full_name":"Anders, Stefanie"},{"full_name":"Kraev, Igor","last_name":"Kraev","first_name":"Igor"},{"full_name":"Heller, Janosch P.","last_name":"Heller","first_name":"Janosch P."},{"full_name":"Rama, Sylvain","last_name":"Rama","first_name":"Sylvain"},{"first_name":"Kaiyu","last_name":"Zheng","full_name":"Zheng, Kaiyu"},{"last_name":"Jensen","first_name":"Thomas P.","full_name":"Jensen, Thomas P."},{"first_name":"Inmaculada","last_name":"Sanchez-Romero","full_name":"Sanchez-Romero, Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Colin J.","last_name":"Jackson","full_name":"Jackson, Colin J."},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315"},{"full_name":"Ottersen, Ole Petter","last_name":"Ottersen","first_name":"Ole Petter"},{"full_name":"Nagelhus, Erlend Arnulf","first_name":"Erlend Arnulf","last_name":"Nagelhus"},{"full_name":"Oliet, Stephane H.R.","first_name":"Stephane H.R.","last_name":"Oliet"},{"first_name":"Michael G.","last_name":"Stewart","full_name":"Stewart, Michael G."},{"full_name":"Nägerl, U. VAlentin","first_name":"U. VAlentin","last_name":"Nägerl"},{"full_name":"Rusakov, Dmitri A. ","first_name":"Dmitri A. ","last_name":"Rusakov"}],"language":[{"iso":"eng"}],"year":"2020","day":"09","publication":"Neuron"},{"publication":"Science","language":[{"iso":"eng"}],"year":"2020","day":"02","ec_funded":1,"keyword":["Multidisciplinary"],"issue":"6512","author":[{"full_name":"Tsai, Tony Y.-C.","last_name":"Tsai","first_name":"Tony Y.-C."},{"last_name":"Sikora","first_name":"Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","full_name":"Sikora, Mateusz K"},{"first_name":"Peng","last_name":"Xia","orcid":"0000-0002-5419-7756","id":"4AB6C7D0-F248-11E8-B48F-1D18A9856A87","full_name":"Xia, Peng"},{"full_name":"Colak-Champollion, Tugba","last_name":"Colak-Champollion","first_name":"Tugba"},{"last_name":"Knaut","first_name":"Holger","full_name":"Knaut, Holger"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566"},{"first_name":"Sean G.","last_name":"Megason","full_name":"Megason, Sean G."}],"date_published":"2020-10-02T00:00:00Z","volume":370,"abstract":[{"lang":"eng","text":"Animal development entails the organization of specific cell types in space and time, and spatial patterns must form in a robust manner. In the zebrafish spinal cord, neural progenitors form stereotypic patterns despite noisy morphogen signaling and large-scale cellular rearrangements during morphogenesis and growth. By directly measuring adhesion forces and preferences for three types of endogenous neural progenitors, we provide evidence for the differential adhesion model in which differences in intercellular adhesion mediate cell sorting. Cell type–specific combinatorial expression of different classes of cadherins (N-cadherin, cadherin 11, and protocadherin 19) results in homotypic preference ex vivo and patterning robustness in vivo. Furthermore, the differential adhesion code is regulated by the sonic hedgehog morphogen gradient. We propose that robust patterning during tissue morphogenesis results from interplay between adhesion-based self-organization and morphogen-directed patterning."}],"article_type":"original","date_created":"2020-10-19T14:09:38Z","project":[{"call_identifier":"H2020","grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","_id":"260F1432-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/803635v1","open_access":"1"}],"publisher":"American Association for the Advancement of Science","scopus_import":"1","oa_version":"Preprint","month":"10","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"link":[{"url":"https://ist.ac.at/en/news/sticking-together/","relation":"press_release","description":"News on IST Homepage"}]},"oa":1,"publication_status":"published","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"date_updated":"2023-08-22T10:36:35Z","external_id":{"isi":["000579169000053"]},"doi":"10.1126/science.aba6637","intvolume":"       370","page":"113-116","_id":"8680","quality_controlled":"1","acknowledgement":"We thank the members of the Megason and Heisenberg labs for critical discussions of and technical assistance during the work and B. Appel, S. Holley, J. Jontes, and D. Gilmour for transgenic fish. This work is supported by the Damon Runyon Cancer Foundation, a NICHD K99 fellowship (1K99HD092623), a Travelling Fellowship of the Company of Biologists, a Collaborative Research grant from the Burroughs Wellcome Foundation (T.Y.-C.T.), NIH grant  01GM107733 (T.Y.-C.T. and S.G.M.), NIH grant R01NS102322 (T.C.-C. and H.K.), and an ERC advanced grant\r\n(MECSPEC) (C.-P.H.).","department":[{"_id":"CaHe"}],"article_processing_charge":"No","citation":{"ista":"Tsai TY-C, Sikora MK, Xia P, Colak-Champollion T, Knaut H, Heisenberg C-PJ, Megason SG. 2020. An adhesion code ensures robust pattern formation during tissue morphogenesis. Science. 370(6512), 113–116.","ieee":"T. Y.-C. Tsai <i>et al.</i>, “An adhesion code ensures robust pattern formation during tissue morphogenesis,” <i>Science</i>, vol. 370, no. 6512. American Association for the Advancement of Science, pp. 113–116, 2020.","apa":"Tsai, T. Y.-C., Sikora, M. K., Xia, P., Colak-Champollion, T., Knaut, H., Heisenberg, C.-P. J., &#38; Megason, S. G. (2020). An adhesion code ensures robust pattern formation during tissue morphogenesis. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aba6637\">https://doi.org/10.1126/science.aba6637</a>","mla":"Tsai, Tony Y. C., et al. “An Adhesion Code Ensures Robust Pattern Formation during Tissue Morphogenesis.” <i>Science</i>, vol. 370, no. 6512, American Association for the Advancement of Science, 2020, pp. 113–16, doi:<a href=\"https://doi.org/10.1126/science.aba6637\">10.1126/science.aba6637</a>.","ama":"Tsai TY-C, Sikora MK, Xia P, et al. An adhesion code ensures robust pattern formation during tissue morphogenesis. <i>Science</i>. 2020;370(6512):113-116. doi:<a href=\"https://doi.org/10.1126/science.aba6637\">10.1126/science.aba6637</a>","chicago":"Tsai, Tony Y.-C., Mateusz K Sikora, Peng Xia, Tugba Colak-Champollion, Holger Knaut, Carl-Philipp J Heisenberg, and Sean G. Megason. “An Adhesion Code Ensures Robust Pattern Formation during Tissue Morphogenesis.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.aba6637\">https://doi.org/10.1126/science.aba6637</a>.","short":"T.Y.-C. Tsai, M.K. Sikora, P. Xia, T. Colak-Champollion, H. Knaut, C.-P.J. Heisenberg, S.G. Megason, Science 370 (2020) 113–116."},"isi":1,"title":"An adhesion code ensures robust pattern formation during tissue morphogenesis","type":"journal_article","status":"public"},{"publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04099"}],"date_created":"2020-10-21T15:03:05Z","article_type":"original","issue":"6","volume":269,"abstract":[{"lang":"eng","text":"Given l>2ν>2d≥4, we prove the persistence of a Cantor--family of KAM tori of measure O(ε1/2−ν/l) for any non--degenerate nearly integrable Hamiltonian system of class Cl(D×Td), where D⊂Rd is a bounded domain, provided that the size ε of the perturbation is sufficiently small. This extends a result by D. Salamon in \\cite{salamon2004kolmogorov} according to which we do have the persistence of a single KAM torus in the same framework. Moreover, it is well--known that, for the persistence of a single torus, the regularity assumption can not be improved."}],"date_published":"2020-09-05T00:00:00Z","author":[{"id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","full_name":"Koudjinan, Edmond","orcid":"0000-0003-2640-4049","last_name":"Koudjinan","first_name":"Edmond"}],"day":"05","year":"2020","language":[{"iso":"eng"}],"publication":"Journal of Differential Equations","keyword":["Analysis"],"citation":{"ieee":"E. Koudjinan, “A KAM theorem for finitely differentiable Hamiltonian systems,” <i>Journal of Differential Equations</i>, vol. 269, no. 6. Elsevier, pp. 4720–4750, 2020.","ista":"Koudjinan E. 2020. A KAM theorem for finitely differentiable Hamiltonian systems. Journal of Differential Equations. 269(6), 4720–4750.","chicago":"Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.” <i>Journal of Differential Equations</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">https://doi.org/10.1016/j.jde.2020.03.044</a>.","ama":"Koudjinan E. A KAM theorem for finitely differentiable Hamiltonian systems. <i>Journal of Differential Equations</i>. 2020;269(6):4720-4750. doi:<a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">10.1016/j.jde.2020.03.044</a>","short":"E. Koudjinan, Journal of Differential Equations 269 (2020) 4720–4750.","apa":"Koudjinan, E. (2020). A KAM theorem for finitely differentiable Hamiltonian systems. <i>Journal of Differential Equations</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">https://doi.org/10.1016/j.jde.2020.03.044</a>","mla":"Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.” <i>Journal of Differential Equations</i>, vol. 269, no. 6, Elsevier, 2020, pp. 4720–50, doi:<a href=\"https://doi.org/10.1016/j.jde.2020.03.044\">10.1016/j.jde.2020.03.044</a>."},"article_processing_charge":"No","extern":"1","type":"journal_article","status":"public","title":"A KAM theorem for finitely differentiable Hamiltonian systems","_id":"8691","page":"4720-4750","intvolume":"       269","doi":"10.1016/j.jde.2020.03.044","external_id":{"arxiv":["1909.04099"]},"quality_controlled":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","month":"09","date_updated":"2021-01-12T08:20:33Z","publication_identifier":{"issn":["0022-0396"]},"publication_status":"published","oa":1},{"author":[{"full_name":"Golmakani, Ali","first_name":"Ali","last_name":"Golmakani"},{"last_name":"Koudjinan","first_name":"Edmond","orcid":"0000-0003-2640-4049","full_name":"Koudjinan, Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E"},{"full_name":"Luzzatto, Stefano","first_name":"Stefano","last_name":"Luzzatto"},{"full_name":"Pilarczyk, Pawel","first_name":"Pawel","last_name":"Pilarczyk"}],"date_published":"2020-07-31T00:00:00Z","volume":30,"abstract":[{"text":"We develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition 𝒫 of the parameter interval Ω=[1.4,2] into almost 4×106 subintervals, for each of which we compute to high precision the orbits of the critical points up to some time N and other dynamically relevant quantities, several of which can vary greatly, possibly spanning several orders of magnitude. We also subdivide 𝒫 into a family 𝒫+ of intervals, which we call stochastic intervals, and a family 𝒫− of intervals, which we call regular intervals. We numerically prove that each interval ω∈𝒫+ has an escape time, which roughly means that some iterate of the critical point taken over all the parameters in ω has considerable width in the phase space. This suggests, in turn, that most parameters belonging to the intervals in 𝒫+ are stochastic and most parameters belonging to the intervals in 𝒫− are regular, thus the names. We prove that the intervals in 𝒫+ occupy almost 90% of the total measure of Ω. The software and the data are freely available at http://www.pawelpilarczyk.com/quadr/, and a web page is provided for carrying out the calculations. The ideas and procedures can be easily generalized to apply to other parameterized families of dynamical systems.","lang":"eng"}],"issue":"7","publication":"Chaos","language":[{"iso":"eng"}],"year":"2020","day":"31","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.13444"}],"publisher":"AIP","article_type":"original","date_created":"2020-10-21T15:43:05Z","article_number":"073143","arxiv":1,"oa":1,"publication_status":"published","date_updated":"2021-01-12T08:20:34Z","oa_version":"Preprint","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Rigorous numerics for critical orbits in the quadratic family","type":"journal_article","status":"public","extern":"1","article_processing_charge":"No","citation":{"ama":"Golmakani A, Koudjinan E, Luzzatto S, Pilarczyk P. Rigorous numerics for critical orbits in the quadratic family. <i>Chaos</i>. 2020;30(7). doi:<a href=\"https://doi.org/10.1063/5.0012822\">10.1063/5.0012822</a>","chicago":"Golmakani, Ali, Edmond Koudjinan, Stefano Luzzatto, and Pawel Pilarczyk. “Rigorous Numerics for Critical Orbits in the Quadratic Family.” <i>Chaos</i>. AIP, 2020. <a href=\"https://doi.org/10.1063/5.0012822\">https://doi.org/10.1063/5.0012822</a>.","short":"A. Golmakani, E. Koudjinan, S. Luzzatto, P. Pilarczyk, Chaos 30 (2020).","apa":"Golmakani, A., Koudjinan, E., Luzzatto, S., &#38; Pilarczyk, P. (2020). Rigorous numerics for critical orbits in the quadratic family. <i>Chaos</i>. AIP. <a href=\"https://doi.org/10.1063/5.0012822\">https://doi.org/10.1063/5.0012822</a>","mla":"Golmakani, Ali, et al. “Rigorous Numerics for Critical Orbits in the Quadratic Family.” <i>Chaos</i>, vol. 30, no. 7, 073143, AIP, 2020, doi:<a href=\"https://doi.org/10.1063/5.0012822\">10.1063/5.0012822</a>.","ista":"Golmakani A, Koudjinan E, Luzzatto S, Pilarczyk P. 2020. Rigorous numerics for critical orbits in the quadratic family. Chaos. 30(7), 073143.","ieee":"A. Golmakani, E. Koudjinan, S. Luzzatto, and P. Pilarczyk, “Rigorous numerics for critical orbits in the quadratic family,” <i>Chaos</i>, vol. 30, no. 7. AIP, 2020."},"quality_controlled":"1","external_id":{"arxiv":["2004.13444"]},"doi":"10.1063/5.0012822","intvolume":"        30","_id":"8694"},{"title":"Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"working_paper","status":"public","citation":{"ieee":"K. Mayer <i>et al.</i>, <i>Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria</i>. OANA, 2020.","ista":"Mayer K, Rieck K, Reichmann S, Danowski P, Graschopf A, König T, Kraker P, Lehner P, Reckling F, Ross-Hellauer T, Spichtinger D, Tzatzanis M, Schürz S. 2020. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 36p.","mla":"Mayer, Katja, et al. <i>Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria</i>. OANA, 2020, doi:<a href=\"https://doi.org/10.5281/ZENODO.4109242\">10.5281/ZENODO.4109242</a>.","apa":"Mayer, K., Rieck, K., Reichmann, S., Danowski, P., Graschopf, A., König, T., … Schürz, S. (2020). <i>Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria</i>. OANA. <a href=\"https://doi.org/10.5281/ZENODO.4109242\">https://doi.org/10.5281/ZENODO.4109242</a>","short":"K. Mayer, K. Rieck, S. Reichmann, P. Danowski, A. Graschopf, T. König, P. Kraker, P. Lehner, F. Reckling, T. Ross-Hellauer, D. Spichtinger, M. Tzatzanis, S. Schürz, Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 2020.","ama":"Mayer K, Rieck K, Reichmann S, et al. <i>Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria</i>. OANA; 2020. doi:<a href=\"https://doi.org/10.5281/ZENODO.4109242\">10.5281/ZENODO.4109242</a>","chicago":"Mayer, Katja, Katharina Rieck, Stefan Reichmann, Patrick Danowski, Anton Graschopf, Thomas König, Peter Kraker, et al. <i>Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria</i>. OANA, 2020. <a href=\"https://doi.org/10.5281/ZENODO.4109242\">https://doi.org/10.5281/ZENODO.4109242</a>."},"article_processing_charge":"No","file":[{"success":1,"date_updated":"2020-10-23T09:29:45Z","content_type":"application/pdf","file_name":"2020_OANA_Mayer.pdf","file_size":2298363,"access_level":"open_access","file_id":"8696","creator":"dernst","date_created":"2020-10-23T09:29:45Z","relation":"main_file","checksum":"8eba912bb4b20b4f82f8010f2110461a"}],"publisher":"OANA","department":[{"_id":"E-Lib"}],"doi":"10.5281/ZENODO.4109242","date_created":"2020-10-23T09:08:28Z","_id":"8695","page":"36","author":[{"last_name":"Mayer","first_name":"Katja","full_name":"Mayer, Katja"},{"full_name":"Rieck, Katharina","last_name":"Rieck","first_name":"Katharina"},{"first_name":"Stefan","last_name":"Reichmann","full_name":"Reichmann, Stefan"},{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick","first_name":"Patrick","last_name":"Danowski","orcid":"0000-0002-6026-4409"},{"full_name":"Graschopf, Anton","first_name":"Anton","last_name":"Graschopf"},{"last_name":"König","first_name":"Thomas","full_name":"König, Thomas"},{"last_name":"Kraker","first_name":"Peter","full_name":"Kraker, Peter"},{"full_name":"Lehner, Patrick","first_name":"Patrick","last_name":"Lehner"},{"full_name":"Reckling, Falk","last_name":"Reckling","first_name":"Falk"},{"first_name":"Tony","last_name":"Ross-Hellauer","full_name":"Ross-Hellauer, Tony"},{"full_name":"Spichtinger, Daniel","first_name":"Daniel","last_name":"Spichtinger"},{"first_name":"Michalis","last_name":"Tzatzanis","full_name":"Tzatzanis, Michalis"},{"last_name":"Schürz","first_name":"Stefanie","full_name":"Schürz, Stefanie"}],"date_published":"2020-10-21T00:00:00Z","abstract":[{"lang":"eng","text":"A look at international activities on Open Science reveals a broad spectrum from individual institutional policies to national action plans. The present Recommendations for a National Open Science Strategy in Austria are based on these international initiatives and present practical considerations for their coordinated implementation with regard to strategic developments in research, technology and innovation (RTI) in Austria until 2030. They are addressed to all relevant actors in the RTI system, in particular to Research Performing Organisations, Research Funding Organisations, Research Policy, memory institutions such as Libraries and Researchers. The recommendation paper was developed from 2018 to 2020 by the OANA working group \"Open Science Strategy\" and published for the first time in spring 2020 for a public consultation. The now available final version of the recommendation document, which contains feedback and comments from the consultation, is intended to provide an impetus for further discussion and implementation of Open Science in Austria and serves as a contribution and basis for a potential national Open Science Strategy in Austria. The document builds on the diverse expertise of the authors (academia, administration, library and archive, information technology, science policy, funding system, etc.) and reflects their personal experiences and opinions."},{"text":"Der Blick auf internationale Aktivitäten zu Open Science zeigt ein breites Spektrum von einzelnen institutionellen Policies bis hin zu nationalen Aktionsplänen. Die vorliegenden Empfehlungen für eine nationale Open Science Strategie in Österreich orientieren sich an diesen internationalen Initiativen und stellen praktische Überlegungen für ihre koordinierte Implementierung im Hinblick auf strategische Entwicklungen in Forschung, Technologie und Innovation (FTI) bis 2030 in Österreich dar. Dabei richten sie sich an alle relevanten Akteur*innen im FTI System, im Besonderen an Forschungsstätten, Forschungsförderer, Forschungspolitik, Gedächtnisinstitutionen wie Bibliotheken und Wissenschafter*innen. Das Empfehlungspapier wurde von 2018 bis 2020 von der OANA-Arbeitsgruppe \"Open Science Strategie\" entwickelt und im Frühling 2020 das erste Mal für eine öffentliche Konsultation veröffentlicht. Die nun vorliegende finale Version des Empfehlungsdokuments, die Feedback und Kommentare aus der Konsultation enthält, soll ein Anstoß für die weitere Diskussion und Umsetzung von Open Science in Österreich sein und als Beitrag und Grundlage einer potentiellen nationalen Open Science Strategie in Österreich dienen. Das Dokument baut auf der vielfältigen Expertise der Autor*innen auf (Wissenschaft, Administration, Bibliothek und Archiv, Informationstechnologie, Wissenschaftspolitik, Förderwesen etc.) und spiegelt deren persönliche Erfahrungen und Meinung wider.","lang":"ger"}],"file_date_updated":"2020-10-23T09:29:45Z","has_accepted_license":"1","oa":1,"publication_status":"published","date_updated":"2020-10-23T09:34:40Z","ddc":["020"],"month":"10","oa_version":"Published Version","year":"2020","language":[{"iso":"ger"}],"day":"21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_processing_charge":"Yes (via OA deal)","citation":{"ama":"Fischer JL, Kniely M. Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model. <i>Nonlinearity</i>. 2020;33(11):5733-5772. doi:<a href=\"https://doi.org/10.1088/1361-6544/ab9728\">10.1088/1361-6544/ab9728</a>","short":"J.L. Fischer, M. Kniely, Nonlinearity 33 (2020) 5733–5772.","chicago":"Fischer, Julian L, and Michael Kniely. “Variance Reduction for Effective Energies of Random Lattices in the Thomas-Fermi-von Weizsäcker Model.” <i>Nonlinearity</i>. IOP Publishing, 2020. <a href=\"https://doi.org/10.1088/1361-6544/ab9728\">https://doi.org/10.1088/1361-6544/ab9728</a>.","mla":"Fischer, Julian L., and Michael Kniely. “Variance Reduction for Effective Energies of Random Lattices in the Thomas-Fermi-von Weizsäcker Model.” <i>Nonlinearity</i>, vol. 33, no. 11, IOP Publishing, 2020, pp. 5733–72, doi:<a href=\"https://doi.org/10.1088/1361-6544/ab9728\">10.1088/1361-6544/ab9728</a>.","apa":"Fischer, J. L., &#38; Kniely, M. (2020). Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model. <i>Nonlinearity</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1361-6544/ab9728\">https://doi.org/10.1088/1361-6544/ab9728</a>","ista":"Fischer JL, Kniely M. 2020. Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model. Nonlinearity. 33(11), 5733–5772.","ieee":"J. L. Fischer and M. Kniely, “Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model,” <i>Nonlinearity</i>, vol. 33, no. 11. IOP Publishing, pp. 5733–5772, 2020."},"isi":1,"tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"title":"Variance reduction for effective energies of random lattices in the Thomas-Fermi-von Weizsäcker model","status":"public","type":"journal_article","doi":"10.1088/1361-6544/ab9728","external_id":{"isi":["000576492700001"],"arxiv":["1906.12245"]},"page":"5733-5772","_id":"8697","intvolume":"        33","quality_controlled":"1","department":[{"_id":"JuFi"}],"has_accepted_license":"1","arxiv":1,"oa_version":"Published Version","month":"11","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","oa":1,"date_updated":"2023-08-22T10:38:38Z","ddc":["510"],"publication_identifier":{"issn":["09517715"],"eissn":["13616544"]},"publisher":"IOP Publishing","file":[{"success":1,"access_level":"open_access","file_size":1223899,"file_name":"2020_Nonlinearity_Fischer.pdf","content_type":"application/pdf","date_updated":"2020-10-27T12:09:57Z","relation":"main_file","checksum":"ed90bc6eb5f32ee6157fef7f3aabc057","creator":"cziletti","date_created":"2020-10-27T12:09:57Z","file_id":"8710"}],"scopus_import":"1","article_type":"original","date_created":"2020-10-25T23:01:16Z","file_date_updated":"2020-10-27T12:09:57Z","issue":"11","author":[{"orcid":"0000-0002-0479-558X","last_name":"Fischer","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L"},{"id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87","full_name":"Kniely, Michael","first_name":"Michael","last_name":"Kniely","orcid":"0000-0001-5645-4333"}],"abstract":[{"lang":"eng","text":"In the computation of the material properties of random alloys, the method of 'special quasirandom structures' attempts to approximate the properties of the alloy on a finite volume with higher accuracy by replicating certain statistics of the random atomic lattice in the finite volume as accurately as possible. In the present work, we provide a rigorous justification for a variant of this method in the framework of the Thomas–Fermi–von Weizsäcker (TFW) model. Our approach is based on a recent analysis of a related variance reduction method in stochastic homogenization of linear elliptic PDEs and the locality properties of the TFW model. Concerning the latter, we extend an exponential locality result by Nazar and Ortner to include point charges, a result that may be of independent interest."}],"volume":33,"date_published":"2020-11-01T00:00:00Z","publication":"Nonlinearity","day":"01","language":[{"iso":"eng"}],"year":"2020"},{"oa":1,"publication_status":"published","ddc":["570"],"date_updated":"2023-08-22T12:11:23Z","publication_identifier":{"issn":["00278424"],"eissn":["10916490"]},"oa_version":"Published Version","month":"10","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","has_accepted_license":"1","acknowledgement":"We thank Udi Karpas, Roy Harpaz, Tal Tamir, Adam Haber, and Amir Bar for discussions and suggestions; and especially Oren Forkosh and Walter Senn for invaluable discussions of the learning rule. This work was supported by European Research Council Grant 311238 (to E.S.) and Israel Science Foundation Grant 1629/12 (to E.S.); as well as research support from Martin Kushner Schnur and Mr. and Mrs. Lawrence Feis (E.S.); National Institute of Mental Health Grant R01MH109180 (to R.K.); a Pew Scholarship in Biomedical Sciences (to R.K.); Simons Collaboration on the Global Brain Grant 542997 (to R.K. and E.S.); and a CRCNS (Collaborative Research in Computational Neuroscience) grant (to R.K. and E.S.).","quality_controlled":"1","department":[{"_id":"GaTk"}],"doi":"10.1073/pnas.1912804117","external_id":{"pmid":["32948691"],"isi":["000579045200012"]},"_id":"8698","page":"25066-25073","intvolume":"       117","title":"Learning probabilistic neural representations with randomly connected circuits","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"status":"public","type":"journal_article","article_processing_charge":"No","citation":{"apa":"Maoz, O., Tkačik, G., Esteki, M. S., Kiani, R., &#38; Schneidman, E. (2020). Learning probabilistic neural representations with randomly connected circuits. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1912804117\">https://doi.org/10.1073/pnas.1912804117</a>","mla":"Maoz, Ori, et al. “Learning Probabilistic Neural Representations with Randomly Connected Circuits.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40, National Academy of Sciences, 2020, pp. 25066–73, doi:<a href=\"https://doi.org/10.1073/pnas.1912804117\">10.1073/pnas.1912804117</a>.","short":"O. Maoz, G. Tkačik, M.S. Esteki, R. Kiani, E. Schneidman, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 25066–25073.","ama":"Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. Learning probabilistic neural representations with randomly connected circuits. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2020;117(40):25066-25073. doi:<a href=\"https://doi.org/10.1073/pnas.1912804117\">10.1073/pnas.1912804117</a>","chicago":"Maoz, Ori, Gašper Tkačik, Mohamad Saleh Esteki, Roozbeh Kiani, and Elad Schneidman. “Learning Probabilistic Neural Representations with Randomly Connected Circuits.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1912804117\">https://doi.org/10.1073/pnas.1912804117</a>.","ieee":"O. Maoz, G. Tkačik, M. S. Esteki, R. Kiani, and E. Schneidman, “Learning probabilistic neural representations with randomly connected circuits,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40. National Academy of Sciences, pp. 25066–25073, 2020.","ista":"Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. 2020. Learning probabilistic neural representations with randomly connected circuits. Proceedings of the National Academy of Sciences of the United States of America. 117(40), 25066–25073."},"isi":1,"publication":"Proceedings of the National Academy of Sciences of the United States of America","day":"06","year":"2020","language":[{"iso":"eng"}],"author":[{"first_name":"Ori","last_name":"Maoz","full_name":"Maoz, Ori"},{"orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"full_name":"Esteki, Mohamad Saleh","first_name":"Mohamad Saleh","last_name":"Esteki"},{"full_name":"Kiani, Roozbeh","first_name":"Roozbeh","last_name":"Kiani"},{"full_name":"Schneidman, Elad","first_name":"Elad","last_name":"Schneidman"}],"abstract":[{"lang":"eng","text":"The brain represents and reasons probabilistically about complex stimuli and motor actions using a noisy, spike-based neural code. A key building block for such neural computations, as well as the basis for supervised and unsupervised learning, is the ability to estimate the surprise or likelihood of incoming high-dimensional neural activity patterns. Despite progress in statistical modeling of neural responses and deep learning, current approaches either do not scale to large neural populations or cannot be implemented using biologically realistic mechanisms. Inspired by the sparse and random connectivity of real neuronal circuits, we present a model for neural codes that accurately estimates the likelihood of individual spiking patterns and has a straightforward, scalable, efficient, learnable, and realistic neural implementation. This model’s performance on simultaneously recorded spiking activity of >100 neurons in the monkey visual and prefrontal cortices is comparable with or better than that of state-of-the-art models. Importantly, the model can be learned using a small number of samples and using a local learning rule that utilizes noise intrinsic to neural circuits. Slower, structural changes in random connectivity, consistent with rewiring and pruning processes, further improve the efficiency and sparseness of the resulting neural representations. Our results merge insights from neuroanatomy, machine learning, and theoretical neuroscience to suggest random sparse connectivity as a key design principle for neuronal computation."}],"volume":117,"date_published":"2020-10-06T00:00:00Z","file_date_updated":"2020-10-27T14:57:50Z","issue":"40","date_created":"2020-10-25T23:01:16Z","article_type":"original","scopus_import":"1","file":[{"success":1,"content_type":"application/pdf","date_updated":"2020-10-27T14:57:50Z","file_size":1755359,"access_level":"open_access","file_name":"2020_PNAS_Maoz.pdf","file_id":"8713","checksum":"c6a24fdecf3f28faf447078e7a274a88","relation":"main_file","creator":"cziletti","date_created":"2020-10-27T14:57:50Z"}],"publisher":"National Academy of Sciences","pmid":1},{"publication_identifier":{"eissn":["10916490"],"issn":["00278424"]},"ddc":["530"],"date_updated":"2023-08-22T12:11:52Z","publication_status":"published","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","month":"10","arxiv":1,"has_accepted_license":"1","department":[{"_id":"MiLe"}],"quality_controlled":"1","acknowledgement":"We gratefully acknowledge C. Sahle for experimental support at the ID20 beamline of the ESRF. The soft X-ray experiments were carried out at the ADRESS beamline of the Swiss Light Source, Paul Scherrer Institut (PSI). E. Paris and T.S. thank X. Lu and C. Monney for valuable discussions. The work at PSI is supported by the Swiss National Science Foundation (SNSF) through Project 200021_178867, the NCCR (National Centre of Competence in Research) MARVEL (Materials’ Revolution: Computational Design and Discovery of Novel Materials) and the Sinergia network Mott Physics Beyond the Heisenberg Model (MPBH) (SNSF Research Grants CRSII2_160765/1 and CRSII2_141962). K.W. acknowledges support by the Narodowe Centrum Nauki Projects 2016/22/E/ST3/00560 and 2016/23/B/ST3/00839. E.M.P. and M.N. acknowledge funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreements 754411 and 701647, respectively. M.R. was supported by the Swiss National Science Foundation under Project 200021 – 182695. This research used resources of the APS, a U.S. Department of Energy (DOE) Office of Science User Facility operated for the DOE Office of Science by Argonne National Laboratory under Contract DE-AC02-06CH11357.","intvolume":"       117","_id":"8699","page":"24764-24770","external_id":{"isi":["000579059100029"],"arxiv":["2009.12262"],"pmid":["32958669"]},"doi":"10.1073/pnas.2012043117","type":"journal_article","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"title":"Strain engineering of the charge and spin-orbital interactions in Sr2IrO4","isi":1,"citation":{"ista":"Paris E, Tseng Y, Paerschke E, Zhang W, Upton MH, Efimenko A, Rolfs K, McNally DE, Maurel L, Naamneh M, Caputo M, Strocov VN, Wang Z, Casa D, Schneider CW, Pomjakushina E, Wohlfeld K, Radovic M, Schmitt T. 2020. Strain engineering of the charge and spin-orbital interactions in Sr2IrO4. Proceedings of the National Academy of Sciences of the United States of America. 117(40), 24764–24770.","ieee":"E. Paris <i>et al.</i>, “Strain engineering of the charge and spin-orbital interactions in Sr2IrO4,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40. National Academy of Sciences, pp. 24764–24770, 2020.","mla":"Paris, Eugenio, et al. “Strain Engineering of the Charge and Spin-Orbital Interactions in Sr2IrO4.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40, National Academy of Sciences, 2020, pp. 24764–70, doi:<a href=\"https://doi.org/10.1073/pnas.2012043117\">10.1073/pnas.2012043117</a>.","apa":"Paris, E., Tseng, Y., Paerschke, E., Zhang, W., Upton, M. H., Efimenko, A., … Schmitt, T. (2020). Strain engineering of the charge and spin-orbital interactions in Sr2IrO4. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2012043117\">https://doi.org/10.1073/pnas.2012043117</a>","ama":"Paris E, Tseng Y, Paerschke E, et al. Strain engineering of the charge and spin-orbital interactions in Sr2IrO4. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2020;117(40):24764-24770. doi:<a href=\"https://doi.org/10.1073/pnas.2012043117\">10.1073/pnas.2012043117</a>","short":"E. Paris, Y. Tseng, E. Paerschke, W. Zhang, M.H. Upton, A. Efimenko, K. Rolfs, D.E. McNally, L. Maurel, M. Naamneh, M. Caputo, V.N. Strocov, Z. Wang, D. Casa, C.W. Schneider, E. Pomjakushina, K. Wohlfeld, M. Radovic, T. Schmitt, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 24764–24770.","chicago":"Paris, Eugenio, Yi Tseng, Ekaterina Paerschke, Wenliang Zhang, Mary H Upton, Anna Efimenko, Katharina Rolfs, et al. “Strain Engineering of the Charge and Spin-Orbital Interactions in Sr2IrO4.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.2012043117\">https://doi.org/10.1073/pnas.2012043117</a>."},"article_processing_charge":"No","ec_funded":1,"year":"2020","language":[{"iso":"eng"}],"day":"06","publication":"Proceedings of the National Academy of Sciences of the United States of America","date_published":"2020-10-06T00:00:00Z","volume":117,"abstract":[{"text":"In the high spin–orbit-coupled Sr2IrO4, the high sensitivity of the ground state to the details of the local lattice structure shows a large potential for the manipulation of the functional properties by inducing local lattice distortions. We use epitaxial strain to modify the Ir–O bond geometry in Sr2IrO4 and perform momentum-dependent resonant inelastic X-ray scattering (RIXS) at the metal and at the ligand sites to unveil the response of the low-energy elementary excitations. We observe that the pseudospin-wave dispersion for tensile-strained Sr2IrO4 films displays large softening along the [h,0] direction, while along the [h,h] direction it shows hardening. This evolution reveals a renormalization of the magnetic interactions caused by a strain-driven cross-over from anisotropic to isotropic interactions between the magnetic moments. Moreover, we detect dispersive electron–hole pair excitations which shift to lower (higher) energies upon compressive (tensile) strain, manifesting a reduction (increase) in the size of the charge gap. This behavior shows an intimate coupling between charge excitations and lattice distortions in Sr2IrO4, originating from the modified hopping elements between the t2g orbitals. Our work highlights the central role played by the lattice degrees of freedom in determining both the pseudospin and charge excitations of Sr2IrO4 and provides valuable information toward the control of the ground state of complex oxides in the presence of high spin–orbit coupling.","lang":"eng"}],"author":[{"last_name":"Paris","first_name":"Eugenio","full_name":"Paris, Eugenio"},{"full_name":"Tseng, Yi","last_name":"Tseng","first_name":"Yi"},{"full_name":"Paerschke, Ekaterina","id":"8275014E-6063-11E9-9B7F-6338E6697425","orcid":"0000-0003-0853-8182","last_name":"Paerschke","first_name":"Ekaterina"},{"full_name":"Zhang, Wenliang","first_name":"Wenliang","last_name":"Zhang"},{"last_name":"Upton","first_name":"Mary H","full_name":"Upton, Mary H"},{"full_name":"Efimenko, Anna","last_name":"Efimenko","first_name":"Anna"},{"full_name":"Rolfs, Katharina","last_name":"Rolfs","first_name":"Katharina"},{"full_name":"McNally, Daniel E","first_name":"Daniel E","last_name":"McNally"},{"last_name":"Maurel","first_name":"Laura","full_name":"Maurel, Laura"},{"full_name":"Naamneh, Muntaser","first_name":"Muntaser","last_name":"Naamneh"},{"first_name":"Marco","last_name":"Caputo","full_name":"Caputo, Marco"},{"first_name":"Vladimir N","last_name":"Strocov","full_name":"Strocov, Vladimir N"},{"first_name":"Zhiming","last_name":"Wang","full_name":"Wang, Zhiming"},{"full_name":"Casa, Diego","last_name":"Casa","first_name":"Diego"},{"first_name":"Christof W","last_name":"Schneider","full_name":"Schneider, Christof W"},{"full_name":"Pomjakushina, Ekaterina","last_name":"Pomjakushina","first_name":"Ekaterina"},{"full_name":"Wohlfeld, Krzysztof","last_name":"Wohlfeld","first_name":"Krzysztof"},{"first_name":"Milan","last_name":"Radovic","full_name":"Radovic, Milan"},{"last_name":"Schmitt","first_name":"Thorsten","full_name":"Schmitt, Thorsten"}],"issue":"40","file_date_updated":"2020-10-28T11:53:12Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"article_type":"original","date_created":"2020-10-25T23:01:17Z","scopus_import":"1","pmid":1,"publisher":"National Academy of Sciences","file":[{"success":1,"access_level":"open_access","file_size":1176522,"file_name":"2020_PNAS_Paris.pdf","content_type":"application/pdf","date_updated":"2020-10-28T11:53:12Z","relation":"main_file","checksum":"1638fa36b442e2868576c6dd7d6dc505","date_created":"2020-10-28T11:53:12Z","creator":"cziletti","file_id":"8715"}]},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"access_level":"open_access","file_size":733291,"file_name":"2020_LIPIcs_Osang.pdf","content_type":"application/pdf","date_updated":"2020-10-27T14:31:52Z","checksum":"fe0f7c49a99ed870c671b911e10d5496","relation":"main_file","creator":"cziletti","date_created":"2020-10-27T14:31:52Z","file_id":"8712","success":1}],"scopus_import":"1","project":[{"grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-10-25T23:01:18Z","file_date_updated":"2020-10-27T14:31:52Z","abstract":[{"text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. ","lang":"eng"}],"volume":173,"date_published":"2020-08-26T00:00:00Z","author":[{"orcid":"0000-0002-8882-5116","first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mael","last_name":"Rouxel-Labbé","full_name":"Rouxel-Labbé, Mael"},{"full_name":"Teillaud, Monique","first_name":"Monique","last_name":"Teillaud"}],"day":"26","year":"2020","language":[{"iso":"eng"}],"publication":"28th Annual European Symposium on Algorithms","ec_funded":1,"citation":{"ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>.","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","apa":"Osang, G. F., Rouxel-Labbé, M., &#38; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>","mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>.","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in <i>28th Annual European Symposium on Algorithms</i>, Virtual, Online; Pisa, Italy, 2020, vol. 173."},"article_processing_charge":"No","status":"public","type":"conference","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"title":"Generalizing CGAL periodic Delaunay triangulations","_id":"8703","intvolume":"       173","doi":"10.4230/LIPIcs.ESA.2020.75","department":[{"_id":"HeEd"}],"quality_controlled":"1","alternative_title":["LIPIcs"],"has_accepted_license":"1","article_number":"75","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"9056","relation":"dissertation_contains"}]},"month":"08","oa_version":"Published Version","ddc":["000"],"date_updated":"2023-09-07T13:29:00Z","publication_identifier":{"isbn":["9783959771627"],"issn":["18688969"]},"publication_status":"published","oa":1,"conference":{"name":"ESA: Annual European Symposium on Algorithms","end_date":"2020-09-09","start_date":"2020-09-07","location":"Virtual, Online; Pisa, Italy"}},{"title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","status":"public","type":"conference","citation":{"ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, Paris, France, 2020, pp. 5446–5452.","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.","chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, 5446–52. IEEE, 2020. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>.","ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: <i>Proceedings - IEEE International Conference on Robotics and Automation</i>. IEEE; 2020:5446-5452. doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>","apa":"Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In <i>Proceedings - IEEE International Conference on Robotics and Automation</i> (pp. 5446–5452). Paris, France: IEEE. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, IEEE, 2020, pp. 5446–52, doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>."},"article_processing_charge":"No","isi":1,"quality_controlled":"1","acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","department":[{"_id":"ToHe"}],"external_id":{"isi":["000712319503110"]},"doi":"10.1109/ICRA40945.2020.9196608","page":"5446-5452","_id":"8704","has_accepted_license":"1","alternative_title":["ICRA"],"conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2020-08-31","start_date":"2020-05-31","location":"Paris, France"},"publication_status":"published","oa":1,"publication_identifier":{"issn":["10504729"],"isbn":["9781728173955"]},"date_updated":"2023-08-22T10:40:15Z","ddc":["000"],"oa_version":"Submitted Version","month":"05","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","file":[{"success":1,"checksum":"fccf7b986ac78046918a298cc6849a50","relation":"main_file","date_created":"2020-11-06T10:58:49Z","creator":"dernst","file_id":"8733","file_size":1070010,"access_level":"open_access","file_name":"2020_ICRA_Lechner.pdf","content_type":"application/pdf","date_updated":"2020-11-06T10:58:49Z"}],"publisher":"IEEE","date_created":"2020-10-25T23:01:19Z","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"date_published":"2020-05-01T00:00:00Z","abstract":[{"lang":"eng","text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E."}],"file_date_updated":"2020-11-06T10:58:49Z","publication":"Proceedings - IEEE International Conference on Robotics and Automation","year":"2020","language":[{"iso":"eng"}],"day":"01"},{"file_date_updated":"2020-10-27T12:49:04Z","issue":"12","author":[{"last_name":"Mysliwy","first_name":"Krzysztof","full_name":"Mysliwy, Krzysztof","id":"316457FC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"date_published":"2020-12-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider the quantum mechanical many-body problem of a single impurity particle immersed in a weakly interacting Bose gas. The impurity interacts with the bosons via a two-body potential. We study the Hamiltonian of this system in the mean-field limit and rigorously show that, at low energies, the problem is well described by the Fröhlich polaron model."}],"volume":21,"publication":"Annales Henri Poincare","language":[{"iso":"eng"}],"year":"2020","day":"01","ec_funded":1,"file":[{"date_updated":"2020-10-27T12:49:04Z","content_type":"application/pdf","file_name":"2020_Annales_Mysliwy.pdf","file_size":469831,"access_level":"open_access","file_id":"8711","creator":"cziletti","date_created":"2020-10-27T12:49:04Z","relation":"main_file","checksum":"c12c9c1e6f08def245e42f3cb1d83827","success":1}],"publisher":"Springer Nature","scopus_import":"1","article_type":"original","project":[{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"date_created":"2020-10-25T23:01:19Z","has_accepted_license":"1","arxiv":1,"month":"12","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"id":"11473","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","oa":1,"publication_identifier":{"issn":["1424-0637"]},"date_updated":"2023-09-07T13:43:51Z","ddc":["530"],"citation":{"apa":"Mysliwy, K., &#38; Seiringer, R. (2020). Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>","mla":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>, vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>.","short":"K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025.","ama":"Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. <i>Annales Henri Poincare</i>. 2020;21(12):4003-4025. doi:<a href=\"https://doi.org/10.1007/s00023-020-00969-3\">10.1007/s00023-020-00969-3</a>","chicago":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” <i>Annales Henri Poincare</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00023-020-00969-3\">https://doi.org/10.1007/s00023-020-00969-3</a>.","ieee":"K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit,” <i>Annales Henri Poincare</i>, vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.","ista":"Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12), 4003–4025."},"article_processing_charge":"Yes (via OA deal)","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit","status":"public","type":"journal_article","external_id":{"arxiv":["2003.12371"],"isi":["000578111800002"]},"doi":"10.1007/s00023-020-00969-3","intvolume":"        21","_id":"8705","page":"4003-4025","quality_controlled":"1","acknowledgement":"Financial support through the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme Grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.) is gratefully acknowledged. Funding Open access funding provided by Institute of Science and Technology (IST Austria)","department":[{"_id":"RoSe"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","month":"07","date_updated":"2021-01-12T08:20:40Z","ddc":["020"],"publication_identifier":{"eissn":["10222588"]},"oa":1,"publication_status":"published","has_accepted_license":"1","_id":"8706","page":"278-284","intvolume":"        73","doi":"10.31263/voebm.v73i2.3941","department":[{"_id":"E-Lib"}],"quality_controlled":"1","article_processing_charge":"No","citation":{"ieee":"P. Danowski <i>et al.</i>, “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 278–284, 2020.","ista":"Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T, Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(2), 278–284.","mla":"Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 278–84, doi:<a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">10.31263/voebm.v73i2.3941</a>.","apa":"Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding, S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. <a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">https://doi.org/10.31263/voebm.v73i2.3941</a>","short":"P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding, T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 278–284.","chicago":"Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. <a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">https://doi.org/10.31263/voebm.v73i2.3941</a>.","ama":"Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. 2020;73(2):278-284. doi:<a href=\"https://doi.org/10.31263/voebm.v73i2.3941\">10.31263/voebm.v73i2.3941</a>"},"status":"public","type":"journal_article","title":"„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"14","language":[{"iso":"ger"}],"year":"2020","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","issue":"2","file_date_updated":"2020-10-27T16:27:25Z","volume":73,"abstract":[{"text":"As part of the Austrian Transition to Open Access (AT2OA) project, subproject TP1-B is working on designing a monitoring solution for the output of Open Access publications in Austria. This report on a potential Open Access monitoring approach in Austria is one of the results of these efforts and can serve as a basis for discussion on an international level.","lang":"eng"},{"text":"Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler Ebene dienen.","lang":"ger"}],"date_published":"2020-07-14T00:00:00Z","author":[{"last_name":"Danowski","first_name":"Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick"},{"full_name":"Ferus, Andreas","last_name":"Ferus","first_name":"Andreas"},{"full_name":"Hikl, Anna-Laetitia","last_name":"Hikl","first_name":"Anna-Laetitia"},{"last_name":"McNeill","first_name":"Gerda","full_name":"McNeill, Gerda"},{"full_name":"Miniberger, Clemens","last_name":"Miniberger","first_name":"Clemens"},{"first_name":"Steve","last_name":"Reding","full_name":"Reding, Steve"},{"full_name":"Zarka, Tobias","first_name":"Tobias","last_name":"Zarka"},{"full_name":"Zojer, Michael","last_name":"Zojer","first_name":"Michael"}],"date_created":"2020-10-25T23:01:19Z","article_type":"original","publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","file":[{"date_updated":"2020-10-27T16:27:25Z","content_type":"application/pdf","file_name":"2020_VOEB_Danowski.pdf","access_level":"open_access","file_size":960317,"file_id":"8714","creator":"kschuh","date_created":"2020-10-27T16:27:25Z","checksum":"37443c34d91d5bdbeb38c78b14792537","relation":"main_file","success":1}],"scopus_import":"1"},{"type":"journal_article","status":"public","title":"Receptor kinase module targets PIN-dependent auxin transport during canalization","isi":1,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"article_processing_charge":"No","citation":{"ieee":"J. Hajny <i>et al.</i>, “Receptor kinase module targets PIN-dependent auxin transport during canalization,” <i>Science</i>, vol. 370, no. 6516. American Association for the Advancement of Science, pp. 550–557, 2020.","ista":"Hajny J, Prat T, Rydza N, Rodriguez Solovey L, Tan S, Verstraeten I, Domjan D, Mazur E, Smakowska-Luzan E, Smet W, Mor E, Nolf J, Yang B, Grunewald W, Molnar G, Belkhadir Y, De Rybel B, Friml J. 2020. Receptor kinase module targets PIN-dependent auxin transport during canalization. Science. 370(6516), 550–557.","apa":"Hajny, J., Prat, T., Rydza, N., Rodriguez Solovey, L., Tan, S., Verstraeten, I., … Friml, J. (2020). Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>","mla":"Hajny, Jakub, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>, vol. 370, no. 6516, American Association for the Advancement of Science, 2020, pp. 550–57, doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>.","short":"J. Hajny, T. Prat, N. Rydza, L. Rodriguez Solovey, S. Tan, I. Verstraeten, D. Domjan, E. Mazur, E. Smakowska-Luzan, W. Smet, E. Mor, J. Nolf, B. Yang, W. Grunewald, G. Molnar, Y. Belkhadir, B. De Rybel, J. Friml, Science 370 (2020) 550–557.","ama":"Hajny J, Prat T, Rydza N, et al. Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. 2020;370(6516):550-557. doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>","chicago":"Hajny, Jakub, Tomas Prat, N Rydza, Lesia Rodriguez Solovey, Shutang Tan, Inge Verstraeten, David Domjan, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>."},"department":[{"_id":"JiFr"}],"acknowledgement":"We acknowledge M. Glanc and Y. Zhang for providing entryclones; Vienna Biocenter Core Facilities (VBCF) for recombinantprotein production and purification; Vienna Biocenter Massspectrometry Facility, Bioimaging, and Life Science Facilities at IST Austria and Proteomics Core Facility CEITEC for a great assistance.Funding:This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement 742985) and Austrian Science Fund (FWF): I 3630-B25 to J.F.and by grants from the Austrian Academy of Science through the Gregor Mendel Institute (Y.B.) and the Austrian Agency for International Cooperation in Education and Research (D.D.); the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001) (W.S.); the Research Foundation–Flanders (FWO;Odysseus II G0D0515N) and a European Research Council grant (ERC; StG TORPEDO; 714055) to B.D.R., B.Y., and E.M.; and the Hertha Firnberg Programme postdoctoral fellowship (T-947) from the FWF Austrian Science Fund to E.S.-L.; J.H. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at IST Austria.","quality_controlled":"1","page":"550-557","_id":"8721","intvolume":"       370","doi":"10.1126/science.aba3178","external_id":{"isi":["000583031800041"],"pmid":["33122378"]},"date_updated":"2023-09-05T12:02:35Z","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"oa":1,"publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/molecular-compass-for-cell-orientation/"}]},"oa_version":"Published Version","month":"10","scopus_import":"1","publisher":"American Association for the Advancement of Science","pmid":1,"main_file_link":[{"open_access":"1","url":"https://europepmc.org/article/MED/33122378#free-full-text"}],"article_type":"original","project":[{"grant_number":"742985","call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF"},{"grant_number":"25239","name":"Cell surface receptor complexes for PIN polarity and auxin-mediated development","_id":"2699E3D2-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-11-02T10:04:46Z","volume":370,"abstract":[{"text":"Spontaneously arising channels that transport the phytohormone auxin provide positional cues for self-organizing aspects of plant development such as flexible vasculature regeneration or its patterning during leaf venation. The auxin canalization hypothesis proposes a feedback between auxin signaling and transport as the underlying mechanism, but molecular players await discovery. We identified part of the machinery that routes auxin transport. The auxin-regulated receptor CAMEL (Canalization-related Auxin-regulated Malectin-type RLK) together with CANAR (Canalization-related Receptor-like kinase) interact with and phosphorylate PIN auxin transporters. camel and canar mutants are impaired in PIN1 subcellular trafficking and auxin-mediated PIN polarization, which macroscopically manifests as defects in leaf venation and vasculature regeneration after wounding. The CAMEL-CANAR receptor complex is part of the auxin feedback that coordinates polarization of individual cells during auxin canalization.","lang":"eng"}],"date_published":"2020-10-30T00:00:00Z","author":[{"full_name":"Hajny, Jakub","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2140-7195","last_name":"Hajny","first_name":"Jakub"},{"id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","full_name":"Prat, Tomas","last_name":"Prat","first_name":"Tomas"},{"full_name":"Rydza, N","first_name":"N","last_name":"Rydza"},{"full_name":"Rodriguez Solovey, Lesia","id":"3922B506-F248-11E8-B48F-1D18A9856A87","last_name":"Rodriguez Solovey","first_name":"Lesia","orcid":"0000-0002-7244-7237"},{"last_name":"Tan","first_name":"Shutang","orcid":"0000-0002-0471-8285","full_name":"Tan, Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Verstraeten, Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","first_name":"Inge","last_name":"Verstraeten","orcid":"0000-0001-7241-2328"},{"id":"C684CD7A-257E-11EA-9B6F-D8588B4F947F","full_name":"Domjan, David","orcid":"0000-0003-2267-106X","first_name":"David","last_name":"Domjan"},{"last_name":"Mazur","first_name":"E","full_name":"Mazur, E"},{"first_name":"E","last_name":"Smakowska-Luzan","full_name":"Smakowska-Luzan, E"},{"full_name":"Smet, W","first_name":"W","last_name":"Smet"},{"full_name":"Mor, E","first_name":"E","last_name":"Mor"},{"last_name":"Nolf","first_name":"J","full_name":"Nolf, J"},{"full_name":"Yang, B","last_name":"Yang","first_name":"B"},{"full_name":"Grunewald, W","last_name":"Grunewald","first_name":"W"},{"last_name":"Molnar","first_name":"Gergely","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87","full_name":"Molnar, Gergely"},{"full_name":"Belkhadir, Y","last_name":"Belkhadir","first_name":"Y"},{"full_name":"De Rybel, B","first_name":"B","last_name":"De Rybel"},{"first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"issue":"6516","ec_funded":1,"day":"30","year":"2020","language":[{"iso":"eng"}],"publication":"Science"},{"type":"conference","status":"public","title":"Taming unbalanced training workloads in deep learning with partial collective operations","isi":1,"citation":{"ieee":"S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler, “Taming unbalanced training workloads in deep learning with partial collective operations,” in <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, San Diego, CA, United States, 2020, pp. 45–61.","ista":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 2020. Taming unbalanced training workloads in deep learning with partial collective operations. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 45–61.","ama":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. Taming unbalanced training workloads in deep learning with partial collective operations. In: <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2020:45-61. doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>","short":"S. Li, T.B.-N. Tal Ben-Nun, S.D. Girolamo, D.-A. Alistarh, T. Hoefler, in:, Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61.","chicago":"Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 45–61. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>.","mla":"Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2020, pp. 45–61, doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>.","apa":"Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., &#38; Hoefler, T. (2020). Taming unbalanced training workloads in deep learning with partial collective operations. In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 45–61). San Diego, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>"},"article_processing_charge":"No","department":[{"_id":"DaAl"}],"quality_controlled":"1","page":"45-61","_id":"8722","doi":"10.1145/3332466.3374528","external_id":{"isi":["000564476500004"],"arxiv":["1908.04207"]},"arxiv":1,"date_updated":"2023-08-22T12:13:48Z","publication_status":"published","oa":1,"conference":{"end_date":"2020-02-26","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming","start_date":"2020-02-22","location":"San Diego, CA, United States"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"02","oa_version":"Preprint","publisher":"Association for Computing Machinery","main_file_link":[{"url":"https://arxiv.org/abs/1908.04207","open_access":"1"}],"project":[{"call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"date_created":"2020-11-05T15:25:30Z","abstract":[{"text":"Load imbalance pervasively exists in distributed deep learning training systems, either caused by the inherent imbalance in learned tasks or by the system itself. Traditional synchronous Stochastic Gradient Descent (SGD)\r\nachieves good accuracy for a wide variety of tasks, but relies on global synchronization to accumulate the gradients at every training step. In this paper, we propose eager-SGD, which relaxes the global synchronization for\r\ndecentralized accumulation. To implement eager-SGD, we propose to use two partial collectives: solo and majority. With solo allreduce, the faster processes contribute their gradients eagerly without waiting for the slower processes, whereas with majority allreduce, at least half of the participants must contribute gradients before continuing, all without using a central parameter server. We theoretically prove the convergence of the algorithms and describe the partial collectives in detail. Experimental results on load-imbalanced environments (CIFAR-10, ImageNet, and UCF101 datasets) show\r\nthat eager-SGD achieves 1.27x speedup over the state-of-the-art synchronous SGD, without losing accuracy.","lang":"eng"}],"date_published":"2020-02-01T00:00:00Z","author":[{"full_name":"Li, Shigang","last_name":"Li","first_name":"Shigang"},{"last_name":"Tal Ben-Nun","first_name":"Tal Ben-Nun","full_name":"Tal Ben-Nun, Tal Ben-Nun"},{"last_name":"Girolamo","first_name":"Salvatore Di","full_name":"Girolamo, Salvatore Di"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Torsten","last_name":"Hoefler","full_name":"Hoefler, Torsten"}],"ec_funded":1,"day":"01","year":"2020","language":[{"iso":"eng"}],"publication":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"},{"file_date_updated":"2021-02-15T09:00:01Z","abstract":[{"lang":"eng","text":"We study the problem of learning from multiple untrusted data sources, a scenario of increasing practical relevance given the recent emergence of crowdsourcing and collaborative learning paradigms. Specifically, we analyze the situation in which a learning system obtains datasets from multiple sources, some of which might be biased or even adversarially perturbed. It is\r\nknown that in the single-source case, an adversary with the power to corrupt a fixed fraction of the training data can prevent PAC-learnability, that is, even in the limit of infinitely much training data, no learning system can approach the optimal test error. In this work we show that, surprisingly, the same is not true in the multi-source setting, where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources. Our main results are a generalization bound that provides finite-sample guarantees for this learning setting, as well as corresponding lower bounds. Besides establishing PAC-learnability our results also show that in a cooperative learning setting sharing data with other parties has provable benefits, even if some\r\nparticipants are malicious. "}],"volume":119,"date_published":"2020-07-12T00:00:00Z","author":[{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","last_name":"Konstantinov"},{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias","last_name":"Frantar","first_name":"Elias"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"}],"day":"12","year":"2020","language":[{"iso":"eng"}],"publication":"Proceedings of the 37th International Conference on Machine Learning","ec_funded":1,"publisher":"ML Research Press","file":[{"date_updated":"2021-02-15T09:00:01Z","content_type":"application/pdf","file_name":"2020_PMLR_Konstantinov.pdf","access_level":"open_access","file_size":281286,"file_id":"9120","creator":"dernst","date_created":"2021-02-15T09:00:01Z","checksum":"cc755d0054bc4b2be778ea7aa7884d2f","relation":"main_file","success":1}],"scopus_import":"1","project":[{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"date_created":"2020-11-05T15:25:58Z","arxiv":1,"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10799"}],"link":[{"url":"http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf","relation":"supplementary_material"}]},"oa_version":"Published Version","month":"07","date_updated":"2023-09-07T13:42:08Z","ddc":["000"],"publication_identifier":{"issn":["2640-3498"]},"publication_status":"published","oa":1,"conference":{"location":"Online","name":"ICML: International Conference on Machine Learning","start_date":"2020-07-12","end_date":"2020-07-18"},"acknowledged_ssus":[{"_id":"ScienComp"}],"citation":{"ieee":"N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, Online, 2020, vol. 119, pp. 5416–5425.","ista":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample complexity of adversarial multi-source PAC learning. Proceedings of the 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5416–5425.","ama":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity of adversarial multi-source PAC learning. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. Vol 119. ML Research Press; 2020:5416-5425.","short":"N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.","chicago":"Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 119:5416–25. ML Research Press, 2020.","apa":"Konstantinov, N. H., Frantar, E., Alistarh, D.-A., &#38; Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (Vol. 119, pp. 5416–5425). Online: ML Research Press.","mla":"Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, vol. 119, ML Research Press, 2020, pp. 5416–25."},"article_processing_charge":"No","status":"public","type":"conference","title":"On the sample complexity of adversarial multi-source PAC learning","_id":"8724","page":"5416-5425","intvolume":"       119","external_id":{"arxiv":["2002.10384"]},"department":[{"_id":"DaAl"},{"_id":"ChLa"}],"acknowledgement":"Dan Alistarh is supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","quality_controlled":"1"},{"file_date_updated":"2021-03-11T12:33:35Z","abstract":[{"text":"The design and implementation of efficient concurrent data structures have\r\nseen significant attention. However, most of this work has focused on\r\nconcurrent data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads, objects are often accessed at different rates, since access\r\ndistributions may be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to translate efficiently in the concurrent case.\r\n  In this paper, we investigate distribution-adaptive concurrent data\r\nstructures and propose a new design called the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list, with the key distinction that\r\nthe height of each element adapts dynamically to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements decrease in height. We\r\nshow that the splay-list provides order-optimal amortized complexity bounds for\r\na subset of operations while being amenable to efficient concurrent\r\nimplementation. Experimental results show that the splay-list can leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns, and can outperform the only previously-known distribution-adaptive\r\ndesign in certain settings.","lang":"eng"}],"volume":179,"date_published":"2020-08-03T00:00:00Z","author":[{"last_name":"Aksenov","first_name":"Vitaly","full_name":"Aksenov, Vitaly"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Drozdova","first_name":"Alexandra","full_name":"Drozdova, Alexandra"},{"last_name":"Mohtashami","first_name":"Amirkeivan","full_name":"Mohtashami, Amirkeivan"}],"day":"03","year":"2020","language":[{"iso":"eng"}],"publication":"34th International Symposium on Distributed Computing","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"success":1,"file_size":740358,"access_level":"open_access","file_name":"2020_LIPIcs_Aksenov.pdf","content_type":"application/pdf","date_updated":"2021-03-11T12:33:35Z","relation":"main_file","checksum":"a626a9c47df52b6f6d97edd910dae4ba","date_created":"2021-03-11T12:33:35Z","creator":"dernst","file_id":"9237"}],"series_title":"LIPIcs","project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-11-05T15:26:17Z","arxiv":1,"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","oa_version":"Published Version","ddc":["000"],"date_updated":"2023-02-23T13:41:40Z","publication_identifier":{"isbn":["9783959771689"],"issn":["1868-8969"]},"publication_status":"published","oa":1,"conference":{"location":"Freiburg, Germany","name":"DISC: Symposium on Distributed Computing","start_date":"2020-10-12","end_date":"2020-10-16"},"article_processing_charge":"No","citation":{"ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in <i>34th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In <i>34th International Symposium on Distributed Computing</i>, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>","mla":"Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., &#38; Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>"},"type":"conference","status":"public","title":"The splay-list: A distribution-adaptive concurrent skip-list","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"page":"3:1-3:18","_id":"8725","intvolume":"       179","doi":"10.4230/LIPIcs.DISC.2020.3","external_id":{"arxiv":["2008.01009"]},"department":[{"_id":"DaAl"}],"acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML.","quality_controlled":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","month":"08","ddc":["530"],"date_updated":"2021-01-12T08:20:46Z","publication_identifier":{"issn":["2410-3896"]},"oa":1,"publication_status":"published","arxiv":1,"has_accepted_license":"1","article_number":"53","_id":"8726","intvolume":"         5","doi":"10.3390/condmat5030053","external_id":{"arxiv":["2009.11773"]},"department":[{"_id":"MiLe"}],"quality_controlled":"1","article_processing_charge":"No","citation":{"ieee":"D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” <i>Condensed Matter</i>, vol. 5, no. 3. MDPI, 2020.","ista":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3), 53.","short":"D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).","ama":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. 2020;5(3). doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>.","apa":"Gotfryd, D., Paerschke, E., Wohlfeld, K., &#38; Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. MDPI. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>","mla":"Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>, vol. 5, no. 3, 53, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>."},"status":"public","type":"journal_article","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","day":"26","year":"2020","language":[{"iso":"eng"}],"publication":"Condensed Matter","ec_funded":1,"issue":"3","file_date_updated":"2020-11-06T07:24:40Z","volume":5,"abstract":[{"text":"Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling.","lang":"eng"}],"date_published":"2020-08-26T00:00:00Z","author":[{"full_name":"Gotfryd, Dorota","last_name":"Gotfryd","first_name":"Dorota"},{"first_name":"Ekaterina","last_name":"Paerschke","orcid":"0000-0003-0853-8182","id":"8275014E-6063-11E9-9B7F-6338E6697425","full_name":"Paerschke, Ekaterina"},{"full_name":"Wohlfeld, Krzysztof","first_name":"Krzysztof","last_name":"Wohlfeld"},{"last_name":"Oleś","first_name":"Andrzej M.","full_name":"Oleś, Andrzej M."}],"article_type":"original","date_created":"2020-11-06T07:21:00Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"file":[{"success":1,"file_id":"8727","creator":"dernst","date_created":"2020-11-06T07:24:40Z","relation":"main_file","checksum":"a57a698ff99a11b6665bafd1bac7afbc","date_updated":"2020-11-06T07:24:40Z","content_type":"application/pdf","file_name":"2020_CondensedMatter_Gotfryd.pdf","file_size":768336,"access_level":"open_access"}],"publisher":"MDPI","scopus_import":"1"},{"department":[{"_id":"KrCh"}],"quality_controlled":"1","intvolume":"     12302","page":"253-270","_id":"8728","external_id":{"isi":["000723555700014"]},"doi":"10.1007/978-3-030-59152-6_14","status":"public","type":"conference","title":"Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth","isi":1,"article_processing_charge":"No","citation":{"chicago":"Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In <i>Automated Technology for Verification and Analysis</i>, 12302:253–70. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">https://doi.org/10.1007/978-3-030-59152-6_14</a>.","ama":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: <i>Automated Technology for Verification and Analysis</i>. Vol 12302. Springer Nature; 2020:253-270. doi:<a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">10.1007/978-3-030-59152-6_14</a>","short":"A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis, in:, Automated Technology for Verification and Analysis, Springer Nature, 2020, pp. 253–270.","mla":"Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” <i>Automated Technology for Verification and Analysis</i>, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">10.1007/978-3-030-59152-6_14</a>.","apa":"Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., &#38; Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In <i>Automated Technology for Verification and Analysis</i> (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-59152-6_14\">https://doi.org/10.1007/978-3-030-59152-6_14</a>","ista":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.","ieee":"A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in <i>Automated Technology for Verification and Analysis</i>, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270."},"publication_identifier":{"isbn":["9783030591519"],"eissn":["1611-3349"],"eisbn":["9783030591526"],"issn":["0302-9743"]},"date_updated":"2025-06-02T08:53:43Z","ddc":["000"],"conference":{"location":"Hanoi, Vietnam","end_date":"2020-10-23","name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2020-10-19"},"publication_status":"published","oa":1,"related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"10","oa_version":"Submitted Version","alternative_title":["LNCS"],"has_accepted_license":"1","date_created":"2020-11-06T07:30:05Z","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"scopus_import":"1","file":[{"success":1,"file_id":"8729","checksum":"ae83f27e5b189d5abc2e7514f1b7e1b5","relation":"main_file","creator":"dernst","date_created":"2020-11-06T07:41:03Z","content_type":"application/pdf","date_updated":"2020-11-06T07:41:03Z","access_level":"open_access","file_size":726648,"file_name":"2020_LNCS_ATVA_Asadi_accepted.pdf"}],"publisher":"Springer Nature","language":[{"iso":"eng"}],"year":"2020","day":"12","publication":"Automated Technology for Verification and Analysis","date_published":"2020-10-12T00:00:00Z","volume":12302,"abstract":[{"lang":"eng","text":"Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many techniques for computing these objectives in general MCs/MDPs, they have not been thoroughly studied in terms of parameterized algorithms, particularly when treewidth is used as the parameter. This is in sharp contrast to qualitative objectives for MCs, MDPs and graph games, for which treewidth-based algorithms yield significant complexity improvements. In this work, we show that treewidth can also be used to obtain faster algorithms for the quantitative problems. For an MC with n states and m transitions, we show that each of the classical quantitative objectives can be computed in   O((n+m)⋅t2)  time, given a tree decomposition of the MC with width t. Our results also imply a bound of   O(κ⋅(n+m)⋅t2)  for each objective on MDPs, where   κ  is the number of strategy-iteration refinements required for the given input and objective. Finally, we make an experimental evaluation of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms outperform existing well-established methods by one or more orders of magnitude."}],"author":[{"first_name":"Ali","last_name":"Asadi","full_name":"Asadi, Ali"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"},{"first_name":"Kiarash","last_name":"Mohammadi","full_name":"Mohammadi, Kiarash"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"file_date_updated":"2020-11-06T07:41:03Z"}]