[{"author":[{"id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","orcid":"0000-0003-0619-7783","first_name":"Matous","last_name":"Glanc","full_name":"Glanc, Matous"},{"last_name":"Van Gelderen","first_name":"K","full_name":"Van Gelderen, K"},{"full_name":"Hörmayer, Lukas","last_name":"Hörmayer","first_name":"Lukas","orcid":"0000-0001-8295-2926","id":"2EEE7A2A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tan, Shutang","first_name":"Shutang","last_name":"Tan","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285"},{"last_name":"Naramoto","first_name":"S","full_name":"Naramoto, S"},{"last_name":"Zhang","first_name":"Xixi","orcid":"0000-0001-7048-4627","id":"61A66458-47E9-11EA-85BA-8AEAAF14E49A","full_name":"Zhang, Xixi"},{"orcid":"0000-0003-2267-106X","id":"C684CD7A-257E-11EA-9B6F-D8588B4F947F","last_name":"Domjan","first_name":"David","full_name":"Domjan, David"},{"full_name":"Vcelarova, L","first_name":"L","last_name":"Vcelarova"},{"first_name":"Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert"},{"id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2739-8843","first_name":"Alexander J","last_name":"Johnson","full_name":"Johnson, Alexander J"},{"last_name":"de Koning","first_name":"E","full_name":"de Koning, E"},{"last_name":"van Dop","first_name":"M","full_name":"van Dop, M"},{"last_name":"Rademacher","first_name":"E","full_name":"Rademacher, E"},{"full_name":"Janson, S","first_name":"S","last_name":"Janson"},{"first_name":"X","last_name":"Wei","full_name":"Wei, X"},{"full_name":"Molnar, Gergely","first_name":"Gergely","last_name":"Molnar","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matyas","last_name":"Fendrych","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","full_name":"Fendrych, Matyas"},{"last_name":"De Rybel","first_name":"B","full_name":"De Rybel, B"},{"full_name":"Offringa, R","first_name":"R","last_name":"Offringa"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří"}],"date_updated":"2023-09-05T13:03:34Z","date_created":"2021-03-26T12:09:33Z","volume":31,"year":"2021","acknowledgement":"We acknowledge Ben Scheres, Christian Luschnig, and Claus Schwechheimer for sharing published material. We thank Monika Hrtyan and Dorota Jaworska at IST Austria and Gerda Lamers and Ward de Winter at IBL Netherlands for technical assistance; Corinna Hartinger, Jakub Hajný, Lesia Rodriguez, Mingyue Li, and Lindy Abas for experimental support; and the Bioimaging Facility at IST Austria and the Bioimaging Core at VIB for imaging support. We are grateful to Christian Luschnig, Lindy Abas, and Roman Pleskot for valuable discussions. We also acknowledge the EMBO for supporting M.G. with a long-term fellowship ( ALTF 1005-2019 ) during the finalization and revision of this manuscript in the laboratory of B.D.R., and we thank R. Pierik for allowing K.V.G. to work on this manuscript during a postdoc in his laboratory at Utrecht University. This work was supported by grants from the European Research Council under the European Union’s Seventh Framework Programme (ERC grant agreements 742985 to J.F., 714055 to B.D.R., and 803048 to M.F.), the Austrian Science Fund (FWF; I 3630-B25 to J.F.), Chemical Sciences (partly) financed by the Dutch Research Council (NWO-CW TOP 700.58.301 to R.O.), the Dutch Research Council (NWO-VICI 865.17.002 to R. Pierik), Grants-in-Aid from the Ministry of Education, Culture, Sports, Science and Technology, Japan (KAKENHI grant 17K17595 to S.N.), the Ministry of Education, Youth and Sports of the Czech Republic (MŠMT project NPUI-LO1417 ), and a China Scholarship Council (to X.W.).","pmid":1,"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Elsevier","file_date_updated":"2021-04-01T10:53:42Z","ec_funded":1,"doi":"10.1016/j.cub.2021.02.028","acknowledged_ssus":[{"_id":"Bio"}],"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000653077800004"],"pmid":["33705718"]},"quality_controlled":"1","isi":1,"project":[{"grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","_id":"26538374-B435-11E9-9278-68D0E5697425"}],"month":"03","publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"file":[{"access_level":"open_access","file_name":"2021_CurrentBiology_Glanc.pdf","creator":"dernst","file_size":4324371,"content_type":"application/pdf","file_id":"9303","relation":"main_file","success":1,"checksum":"b1723040ecfd8c81194185472eb62546","date_created":"2021-04-01T10:53:42Z","date_updated":"2021-04-01T10:53:42Z"}],"oa_version":"Published Version","_id":"9290","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["580"],"title":"AGC kinases and MAB4/MEL proteins maintain PIN polarity by limiting lateral diffusion in plant cells","status":"public","intvolume":" 31","abstract":[{"lang":"eng","text":"Polar subcellular localization of the PIN exporters of the phytohormone auxin is a key determinant of directional, intercellular auxin transport and thus a central topic of both plant cell and developmental biology. Arabidopsis mutants lacking PID, a kinase that phosphorylates PINs, or the MAB4/MEL proteins of unknown molecular function display PIN polarity defects and phenocopy pin mutants, but mechanistic insights into how these factors convey PIN polarity are missing. Here, by combining protein biochemistry with quantitative live-cell imaging, we demonstrate that PINs, MAB4/MELs, and AGC kinases interact in the same complex at the plasma membrane. MAB4/MELs are recruited to the plasma membrane by the PINs and in concert with the AGC kinases maintain PIN polarity through limiting lateral diffusion-based escape of PINs from the polar domain. The PIN-MAB4/MEL-PID protein complex has self-reinforcing properties thanks to positive feedback between AGC kinase-mediated PIN phosphorylation and MAB4/MEL recruitment. We thus uncover the molecular mechanism by which AGC kinases and MAB4/MEL proteins regulate PIN localization and plant development."}],"issue":"9","type":"journal_article","date_published":"2021-03-10T00:00:00Z","publication":"Current Biology","citation":{"mla":"Glanc, Matous, et al. “AGC Kinases and MAB4/MEL Proteins Maintain PIN Polarity by Limiting Lateral Diffusion in Plant Cells.” Current Biology, vol. 31, no. 9, Elsevier, 2021, pp. 1918–30, doi:10.1016/j.cub.2021.02.028.","short":"M. Glanc, K. Van Gelderen, L. Hörmayer, S. Tan, S. Naramoto, X. Zhang, D. Domjan, L. Vcelarova, R. Hauschild, A.J. Johnson, E. de Koning, M. van Dop, E. Rademacher, S. Janson, X. Wei, G. Molnar, M. Fendrych, B. De Rybel, R. Offringa, J. Friml, Current Biology 31 (2021) 1918–1930.","chicago":"Glanc, Matous, K Van Gelderen, Lukas Hörmayer, Shutang Tan, S Naramoto, Xixi Zhang, David Domjan, et al. “AGC Kinases and MAB4/MEL Proteins Maintain PIN Polarity by Limiting Lateral Diffusion in Plant Cells.” Current Biology. Elsevier, 2021. https://doi.org/10.1016/j.cub.2021.02.028.","ama":"Glanc M, Van Gelderen K, Hörmayer L, et al. AGC kinases and MAB4/MEL proteins maintain PIN polarity by limiting lateral diffusion in plant cells. Current Biology. 2021;31(9):1918-1930. doi:10.1016/j.cub.2021.02.028","ista":"Glanc M, Van Gelderen K, Hörmayer L, Tan S, Naramoto S, Zhang X, Domjan D, Vcelarova L, Hauschild R, Johnson AJ, de Koning E, van Dop M, Rademacher E, Janson S, Wei X, Molnar G, Fendrych M, De Rybel B, Offringa R, Friml J. 2021. AGC kinases and MAB4/MEL proteins maintain PIN polarity by limiting lateral diffusion in plant cells. Current Biology. 31(9), 1918–1930.","ieee":"M. Glanc et al., “AGC kinases and MAB4/MEL proteins maintain PIN polarity by limiting lateral diffusion in plant cells,” Current Biology, vol. 31, no. 9. Elsevier, pp. 1918–1930, 2021.","apa":"Glanc, M., Van Gelderen, K., Hörmayer, L., Tan, S., Naramoto, S., Zhang, X., … Friml, J. (2021). AGC kinases and MAB4/MEL proteins maintain PIN polarity by limiting lateral diffusion in plant cells. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2021.02.028"},"article_type":"original","page":"1918-1930","day":"10","article_processing_charge":"No","has_accepted_license":"1"},{"file_date_updated":"2021-02-04T11:37:50Z","date_created":"2020-12-01T13:39:46Z","date_updated":"2023-09-05T13:03:15Z","volume":31,"author":[{"last_name":"Marquès-Bueno","first_name":"MM","full_name":"Marquès-Bueno, MM"},{"last_name":"Armengot","first_name":"L","full_name":"Armengot, L"},{"full_name":"Noack, LC","first_name":"LC","last_name":"Noack"},{"full_name":"Bareille, J","last_name":"Bareille","first_name":"J"},{"full_name":"Rodriguez Solovey, Lesia","first_name":"Lesia","last_name":"Rodriguez Solovey","id":"3922B506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7244-7237"},{"full_name":"Platre, MP","first_name":"MP","last_name":"Platre"},{"first_name":"V","last_name":"Bayle","full_name":"Bayle, V"},{"full_name":"Liu, M","first_name":"M","last_name":"Liu"},{"full_name":"Opdenacker, D","first_name":"D","last_name":"Opdenacker"},{"first_name":"S","last_name":"Vanneste","full_name":"Vanneste, S"},{"last_name":"Möller","first_name":"BK","full_name":"Möller, BK"},{"full_name":"Nimchuk, ZL","first_name":"ZL","last_name":"Nimchuk"},{"first_name":"T","last_name":"Beeckman","full_name":"Beeckman, T"},{"first_name":"AI","last_name":"Caño-Delgado","full_name":"Caño-Delgado, AI"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"},{"last_name":"Jaillais","first_name":"Y","full_name":"Jaillais, Y"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"JiFr"}],"year":"2021","acknowledgement":"We thank the SiCE group for discussions and comments; S. Yalovsky, B. Scheres, and the NASC/ABRC collection for providing transgenic Arabidopsis lines and plasmids; L. Kalmbach and M. Barberon for the gift of pLOK180_pFR7m34GW; A. Lacroix, J. Berger, and P. Bolland for plant care; and M. Fendrych for help with microfluidics in the J.F. lab. We acknowledge\r\nthe contribution of the SFR Biosciences (UMS3444/CNRS, US8/Inser m, ENS de Lyon, UCBL) facilities: C. Lionet, E. Chatre, and J. Brocard at LBIPLATIM-MICROSCOPY for assistance with imaging, and V. GuegenChaignon and A. Page at the Protein Science Facility (PSF) for assistance with protein purification and mass spectrometry. Y.J. was funded by ERC\r\ngrant 3363360-APPL under FP/2007–2013. Y.J. and Z.L.N. were funded by an ANR- and NSF-supported ERA-CAPS project (SICOPID: ANR-17-CAPS0003-01/NSF PGRP IOS-1841917). A.I.C.-D. is funded by an ERC consolidator grant (ERC-2015-CoG–683163) and BIO2016-78955 grant from the Spanish Ministry of Economy and Competitiveness. Exchanges between the Y.J. and T.B. laboratories were funded by Tournesol grant 35656NB. B.K.M. was\r\nfunded by the Omics@vib Marie Curie COFUND and Research Foundation Flanders for a postdoctoral fellowship.","pmid":1,"month":"01","publication_identifier":{"eissn":["1879-0445"],"issn":["0960-9822"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.cub.2020.10.011","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000614361000039"],"pmid":["33157019"]},"abstract":[{"text":"Plants are able to orient their growth according to gravity, which ultimately controls both shoot and root architecture.1 Gravitropism is a dynamic process whereby gravistimulation induces the asymmetric distribution of the plant hormone auxin, leading to asymmetric growth, organ bending, and subsequent reset of auxin distribution back to the original pre-gravistimulation situation.1, 2, 3 Differential auxin accumulation during the gravitropic response depends on the activity of polarly localized PIN-FORMED (PIN) auxin-efflux carriers.1, 2, 3, 4 In particular, the timing of this dynamic response is regulated by PIN2,5,6 but the underlying molecular mechanisms are poorly understood. Here, we show that MEMBRANE ASSOCIATED KINASE REGULATOR2 (MAKR2) controls the pace of the root gravitropic response. We found that MAKR2 is required for the PIN2 asymmetry during gravitropism by acting as a negative regulator of the cell-surface signaling mediated by the receptor-like kinase TRANSMEMBRANE KINASE1 (TMK1).2,7, 8, 9, 10 Furthermore, we show that the MAKR2 inhibitory effect on TMK1 signaling is antagonized by auxin itself, which triggers rapid MAKR2 membrane dissociation in a TMK1-dependent manner. Our findings suggest that the timing of the root gravitropic response is orchestrated by the reversible inhibition of the TMK1 signaling pathway at the cell surface.","lang":"eng"}],"issue":"1","type":"journal_article","file":[{"content_type":"application/pdf","file_size":3458646,"creator":"dernst","file_name":"2021_CurrentBiology_MarquesBueno.pdf","access_level":"open_access","date_created":"2021-02-04T11:37:50Z","date_updated":"2021-02-04T11:37:50Z","checksum":"30b3393d841fb2b1e2b22fb42b5c8fff","success":1,"relation":"main_file","file_id":"9090"}],"oa_version":"Published Version","ddc":["570"],"status":"public","title":"Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism","intvolume":" 31","_id":"8824","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"11","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","date_published":"2021-01-11T00:00:00Z","article_type":"original","publication":"Current Biology","citation":{"mla":"Marquès-Bueno, MM, et al. “Auxin-Regulated Reversible Inhibition of TMK1 Signaling by MAKR2 Modulates the Dynamics of Root Gravitropism.” Current Biology, vol. 31, no. 1, Elsevier, 2021, doi:10.1016/j.cub.2020.10.011.","short":"M. Marquès-Bueno, L. Armengot, L. Noack, J. Bareille, L. Rodriguez Solovey, M. Platre, V. Bayle, M. Liu, D. Opdenacker, S. Vanneste, B. Möller, Z. Nimchuk, T. Beeckman, A. Caño-Delgado, J. Friml, Y. Jaillais, Current Biology 31 (2021).","chicago":"Marquès-Bueno, MM, L Armengot, LC Noack, J Bareille, Lesia Rodriguez Solovey, MP Platre, V Bayle, et al. “Auxin-Regulated Reversible Inhibition of TMK1 Signaling by MAKR2 Modulates the Dynamics of Root Gravitropism.” Current Biology. Elsevier, 2021. https://doi.org/10.1016/j.cub.2020.10.011.","ama":"Marquès-Bueno M, Armengot L, Noack L, et al. Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism. Current Biology. 2021;31(1). doi:10.1016/j.cub.2020.10.011","ista":"Marquès-Bueno M, Armengot L, Noack L, Bareille J, Rodriguez Solovey L, Platre M, Bayle V, Liu M, Opdenacker D, Vanneste S, Möller B, Nimchuk Z, Beeckman T, Caño-Delgado A, Friml J, Jaillais Y. 2021. Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism. Current Biology. 31(1).","ieee":"M. Marquès-Bueno et al., “Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism,” Current Biology, vol. 31, no. 1. Elsevier, 2021.","apa":"Marquès-Bueno, M., Armengot, L., Noack, L., Bareille, J., Rodriguez Solovey, L., Platre, M., … Jaillais, Y. (2021). Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2020.10.011"}},{"article_type":"original","publication":"Proceedings of the National Academy of Sciences","citation":{"ieee":"C. Prehal et al., “In situ small-angle X-ray scattering reveals solution phase discharge of Li–O2 batteries with weakly solvating electrolytes,” Proceedings of the National Academy of Sciences, vol. 118, no. 14. National Academy of Sciences, 2021.","apa":"Prehal, C., Samojlov, A., Nachtnebel, M., Lovicar, L., Kriechbaum, M., Amenitsch, H., & Freunberger, S. A. (2021). In situ small-angle X-ray scattering reveals solution phase discharge of Li–O2 batteries with weakly solvating electrolytes. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2021893118","ista":"Prehal C, Samojlov A, Nachtnebel M, Lovicar L, Kriechbaum M, Amenitsch H, Freunberger SA. 2021. In situ small-angle X-ray scattering reveals solution phase discharge of Li–O2 batteries with weakly solvating electrolytes. Proceedings of the National Academy of Sciences. 118(14), e2021893118.","ama":"Prehal C, Samojlov A, Nachtnebel M, et al. In situ small-angle X-ray scattering reveals solution phase discharge of Li–O2 batteries with weakly solvating electrolytes. Proceedings of the National Academy of Sciences. 2021;118(14). doi:10.1073/pnas.2021893118","chicago":"Prehal, Christian, Aleksej Samojlov, Manfred Nachtnebel, Ludek Lovicar, Manfred Kriechbaum, Heinz Amenitsch, and Stefan Alexander Freunberger. “In Situ Small-Angle X-Ray Scattering Reveals Solution Phase Discharge of Li–O2 Batteries with Weakly Solvating Electrolytes.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2021. https://doi.org/10.1073/pnas.2021893118.","short":"C. Prehal, A. Samojlov, M. Nachtnebel, L. Lovicar, M. Kriechbaum, H. Amenitsch, S.A. Freunberger, Proceedings of the National Academy of Sciences 118 (2021).","mla":"Prehal, Christian, et al. “In Situ Small-Angle X-Ray Scattering Reveals Solution Phase Discharge of Li–O2 Batteries with Weakly Solvating Electrolytes.” Proceedings of the National Academy of Sciences, vol. 118, no. 14, e2021893118, National Academy of Sciences, 2021, doi:10.1073/pnas.2021893118."},"date_published":"2021-04-06T00:00:00Z","keyword":["small-angle X-ray scattering","oxygen reduction","disproportionation","Li-air battery"],"day":"06","article_processing_charge":"No","status":"public","title":"In situ small-angle X-ray scattering reveals solution phase discharge of Li–O2 batteries with weakly solvating electrolytes","intvolume":" 118","_id":"9301","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"Electrodepositing insulating lithium peroxide (Li2O2) is the key process during discharge of aprotic Li–O2 batteries and determines rate, capacity, and reversibility. Current understanding states that the partition between surface adsorbed and dissolved lithium superoxide governs whether Li2O2 grows as a conformal surface film or larger particles, leading to low or high capacities, respectively. However, better understanding governing factors for Li2O2 packing density and capacity requires structural sensitive in situ metrologies. Here, we establish in situ small- and wide-angle X-ray scattering (SAXS/WAXS) as a suitable method to record the Li2O2 phase evolution with atomic to submicrometer resolution during cycling a custom-built in situ Li–O2 cell. Combined with sophisticated data analysis, SAXS allows retrieving rich quantitative structural information from complex multiphase systems. Surprisingly, we find that features are absent that would point at a Li2O2 surface film formed via two consecutive electron transfers, even in poorly solvating electrolytes thought to be prototypical for surface growth. All scattering data can be modeled by stacks of thin Li2O2 platelets potentially forming large toroidal particles. Li2O2 solution growth is further justified by rotating ring-disk electrode measurements and electron microscopy. Higher discharge overpotentials lead to smaller Li2O2 particles, but there is no transition to an electronically passivating, conformal Li2O2 coating. Hence, mass transport of reactive species rather than electronic transport through a Li2O2 film limits the discharge capacity. Provided that species mobilities and carbon surface areas are high, this allows for high discharge capacities even in weakly solvating electrolytes. The currently accepted Li–O2 reaction mechanism ought to be reconsidered."}],"issue":"14","isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000637398300050"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.26434/chemrxiv.11447775"}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"doi":"10.1073/pnas.2021893118","month":"04","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"publication_status":"published","publisher":"National Academy of Sciences","department":[{"_id":"StFr"},{"_id":"EM-Fac"}],"acknowledgement":"S.A.F. and C.P. are indebted to the European Research Council under the European Union's Horizon 2020 research and innovation program (Grant Agreement No. 636069), the Austrian Federal Ministry of Science, Research and Economy, and the Austrian Research Promotion Agency (Grant No. 845364). We acknowledge A. Zankel and H. Schroettner for support with SEM measurements. C.P. thanks N. Kostoglou, C. Koczwara, M. Hartmann, and M. Burian for discussions on gas sorption analysis, C++ programming, Monte Carlo modeling, and in situ SAXS experiments, respectively. We thank S. Stadlbauer for help with Karl Fischer titration, R. Riccò for gas sorption measurements, and acknowledge Graz University of Technology for support through the Lead Project LP-03. Likewise, the use of SOMAPP Lab, a core facility supported by the Austrian Federal Ministry of Education, Science and Research, the Graz University of Technology, the University of Graz, and Anton Paar GmbH is acknowledged. S.A.F. is indebted to Institute of Science and Technology Austria (IST Austria) for support. This research was supported by the Scientific Service Units of IST Austria through resources provided by the Electron Microscopy Facility.","year":"2021","date_created":"2021-03-31T07:00:01Z","date_updated":"2023-09-05T13:27:18Z","volume":118,"author":[{"last_name":"Prehal","first_name":"Christian","full_name":"Prehal, Christian"},{"full_name":"Samojlov, Aleksej","last_name":"Samojlov","first_name":"Aleksej"},{"full_name":"Nachtnebel, Manfred","last_name":"Nachtnebel","first_name":"Manfred"},{"first_name":"Ludek","last_name":"Lovicar","id":"36DB3A20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6206-4200","full_name":"Lovicar, Ludek"},{"full_name":"Kriechbaum, Manfred","last_name":"Kriechbaum","first_name":"Manfred"},{"first_name":"Heinz","last_name":"Amenitsch","full_name":"Amenitsch, Heinz"},{"full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","last_name":"Freunberger"}],"article_number":"e2021893118"},{"date_published":"2021-04-05T00:00:00Z","article_type":"original","publication":"Journal of Cell Biology","citation":{"chicago":"Leithner, Alexander F, LM Altenburger, R Hauschild, Frank P Assen, K Rottner, Stradal TEB, A Diz-Muñoz, JV Stein, and Michael K Sixt. “Dendritic Cell Actin Dynamics Control Contact Duration and Priming Efficiency at the Immunological Synapse.” Journal of Cell Biology. Rockefeller University Press, 2021. https://doi.org/10.1083/jcb.202006081.","short":"A.F. Leithner, L. Altenburger, R. Hauschild, F.P. Assen, K. Rottner, S. TEB, A. Diz-Muñoz, J. Stein, M.K. Sixt, Journal of Cell Biology 220 (2021).","mla":"Leithner, Alexander F., et al. “Dendritic Cell Actin Dynamics Control Contact Duration and Priming Efficiency at the Immunological Synapse.” Journal of Cell Biology, vol. 220, no. 4, e202006081, Rockefeller University Press, 2021, doi:10.1083/jcb.202006081.","ieee":"A. F. Leithner et al., “Dendritic cell actin dynamics control contact duration and priming efficiency at the immunological synapse,” Journal of Cell Biology, vol. 220, no. 4. Rockefeller University Press, 2021.","apa":"Leithner, A. F., Altenburger, L., Hauschild, R., Assen, F. P., Rottner, K., TEB, S., … Sixt, M. K. (2021). Dendritic cell actin dynamics control contact duration and priming efficiency at the immunological synapse. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.202006081","ista":"Leithner AF, Altenburger L, Hauschild R, Assen FP, Rottner K, TEB S, Diz-Muñoz A, Stein J, Sixt MK. 2021. Dendritic cell actin dynamics control contact duration and priming efficiency at the immunological synapse. Journal of Cell Biology. 220(4), e202006081.","ama":"Leithner AF, Altenburger L, Hauschild R, et al. Dendritic cell actin dynamics control contact duration and priming efficiency at the immunological synapse. Journal of Cell Biology. 2021;220(4). doi:10.1083/jcb.202006081"},"day":"05","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","file":[{"checksum":"843ebc153847c8626e13c9c5ce71d533","success":1,"date_created":"2022-05-12T14:16:21Z","date_updated":"2022-05-12T14:16:21Z","relation":"main_file","file_id":"11367","content_type":"application/pdf","file_size":5102328,"creator":"dernst","access_level":"open_access","file_name":"2021_JournCellBiology_Leithner.pdf"}],"title":"Dendritic cell actin dynamics control contact duration and priming efficiency at the immunological synapse","status":"public","ddc":["570"],"intvolume":" 220","_id":"9094","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Dendritic cells (DCs) are crucial for the priming of naive T cells and the initiation of adaptive immunity. Priming is initiated at a heterologous cell–cell contact, the immunological synapse (IS). While it is established that F-actin dynamics regulates signaling at the T cell side of the contact, little is known about the cytoskeletal contribution on the DC side. Here, we show that the DC actin cytoskeleton is decisive for the formation of a multifocal synaptic structure, which correlates with T cell priming efficiency. DC actin at the IS appears in transient foci that are dynamized by the WAVE regulatory complex (WRC). The absence of the WRC in DCs leads to stabilized contacts with T cells, caused by an increase in ICAM1-integrin–mediated cell–cell adhesion. This results in lower numbers of activated and proliferating T cells, demonstrating an important role for DC actin in the regulation of immune synapse functionality.","lang":"eng"}],"issue":"4","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1083/jcb.202006081","isi":1,"quality_controlled":"1","external_id":{"isi":["000626365700001"],"pmid":["33533935"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"month":"04","publication_identifier":{"eissn":["1540-8140"],"issn":["0021-9525"]},"date_created":"2021-02-05T10:08:04Z","date_updated":"2023-09-05T13:57:53Z","volume":220,"author":[{"orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","last_name":"Leithner","first_name":"Alexander F","full_name":"Leithner, Alexander F"},{"full_name":"Altenburger, LM","first_name":"LM","last_name":"Altenburger"},{"first_name":"R","last_name":"Hauschild","full_name":"Hauschild, R"},{"orcid":"0000-0003-3470-6119","id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","last_name":"Assen","first_name":"Frank P","full_name":"Assen, Frank P"},{"first_name":"K","last_name":"Rottner","full_name":"Rottner, K"},{"first_name":"Stradal","last_name":"TEB","full_name":"TEB, Stradal"},{"full_name":"Diz-Muñoz, A","last_name":"Diz-Muñoz","first_name":"A"},{"full_name":"Stein, JV","first_name":"JV","last_name":"Stein"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K"}],"publication_status":"published","publisher":"Rockefeller University Press","department":[{"_id":"MiSi"}],"year":"2021","pmid":1,"file_date_updated":"2022-05-12T14:16:21Z","article_number":"e202006081"},{"keyword":["General Neuroscience"],"scopus_import":"1","day":"03","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","page":"813-822","publication":"The Journal of Neuroscience","citation":{"ieee":"I. L. Hanganu-Opatz et al., “The logic of developing neocortical circuits in health and disease,” The Journal of Neuroscience, vol. 41, no. 5. Society for Neuroscience, pp. 813–822, 2021.","apa":"Hanganu-Opatz, I. L., Butt, S. J. B., Hippenmeyer, S., De Marco García, N. V., Cardin, J. A., Voytek, B., & Muotri, A. R. (2021). The logic of developing neocortical circuits in health and disease. The Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/jneurosci.1655-20.2020","ista":"Hanganu-Opatz IL, Butt SJB, Hippenmeyer S, De Marco García NV, Cardin JA, Voytek B, Muotri AR. 2021. The logic of developing neocortical circuits in health and disease. The Journal of Neuroscience. 41(5), 813–822.","ama":"Hanganu-Opatz IL, Butt SJB, Hippenmeyer S, et al. The logic of developing neocortical circuits in health and disease. The Journal of Neuroscience. 2021;41(5):813-822. doi:10.1523/jneurosci.1655-20.2020","chicago":"Hanganu-Opatz, Ileana L., Simon J. B. Butt, Simon Hippenmeyer, Natalia V. De Marco García, Jessica A. Cardin, Bradley Voytek, and Alysson R. Muotri. “The Logic of Developing Neocortical Circuits in Health and Disease.” The Journal of Neuroscience. Society for Neuroscience, 2021. https://doi.org/10.1523/jneurosci.1655-20.2020.","short":"I.L. Hanganu-Opatz, S.J.B. Butt, S. Hippenmeyer, N.V. De Marco García, J.A. Cardin, B. Voytek, A.R. Muotri, The Journal of Neuroscience 41 (2021) 813–822.","mla":"Hanganu-Opatz, Ileana L., et al. “The Logic of Developing Neocortical Circuits in Health and Disease.” The Journal of Neuroscience, vol. 41, no. 5, Society for Neuroscience, 2021, pp. 813–22, doi:10.1523/jneurosci.1655-20.2020."},"date_published":"2021-02-03T00:00:00Z","type":"journal_article","abstract":[{"text":"The sensory and cognitive abilities of the mammalian neocortex are underpinned by intricate columnar and laminar circuits formed from an array of diverse neuronal populations. One approach to determining how interactions between these circuit components give rise to complex behavior is to investigate the rules by which cortical circuits are formed and acquire functionality during development. This review summarizes recent research on the development of the neocortex, from genetic determination in neural stem cells through to the dynamic role that specific neuronal populations play in the earliest circuits of neocortex, and how they contribute to emergent function and cognition. While many of these endeavors take advantage of model systems, consideration will also be given to advances in our understanding of activity in nascent human circuits. Such cross-species perspective is imperative when investigating the mechanisms underlying the dysfunction of early neocortical circuits in neurodevelopmental disorders, so that one can identify targets amenable to therapeutic intervention.","lang":"eng"}],"issue":"5","status":"public","ddc":["570"],"title":"The logic of developing neocortical circuits in health and disease","intvolume":" 41","_id":"9073","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_created":"2022-05-27T06:59:55Z","date_updated":"2022-05-27T06:59:55Z","success":1,"checksum":"578fd7ed1a0aef74bce61bea2d987b33","file_id":"11414","relation":"main_file","creator":"dernst","file_size":1031150,"content_type":"application/pdf","file_name":"2021_JourNeuroscience_Hanganu.pdf","access_level":"open_access"}],"oa_version":"Published Version","month":"02","publication_identifier":{"eissn":["1529-2401"],"issn":["0270-6474"]},"isi":1,"quality_controlled":"1","project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F07805","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"}],"external_id":{"isi":["000616763400002"],"pmid":["33431633"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1523/jneurosci.1655-20.2020","file_date_updated":"2022-05-27T06:59:55Z","ec_funded":1,"publication_status":"published","publisher":"Society for Neuroscience","department":[{"_id":"SiHi"}],"year":"2021","acknowledgement":"Work in the I.L.H.-O. laboratory was supported by European Research Council Grant ERC-2015-CoG 681577 and German Research Foundation Ha 4466/10-1, Ha4466/11-1, Ha4466/12-1, SPP 1665, and SFB 936B5. Work in the S.J.B.B. laboratory was supported by Biotechnology and Biological Sciences Research Council BB/P003796/1, Medical Research Council MR/K004387/1 and MR/T033320/1, Wellcome Trust 215199/Z/19/Z and 102386/Z/13/Z, and John Fell Fund. Work in the S.H. laboratory was supported by European Research Council Grants ERC-2016-CoG 725780 LinPro and FWF SFB F78. This work was supported by National Institutes of Health Grant NIMH 1R01MH110553 to N.V.D.M.G. Work in the J.A.C. laboratory was supported by the Ludwig Family Foundation, Simons Foundation SFARI Research Award, and National Institutes of Health/National Institute of Mental Health R01 MH102365 and R01MH113852. The B.V. laboratory was supported by Whitehall Foundation 2017-12-73, National Science Foundation 1736028, National Institutes of Health, National Institute of General Medical Sciences R01GM134363-01, and Halıcıoğlu Data Science Institute Fellowship. This work was supported by the University of California San Diego School of Medicine.","pmid":1,"date_updated":"2023-09-05T14:03:17Z","date_created":"2021-02-03T12:23:51Z","volume":41,"author":[{"last_name":"Hanganu-Opatz","first_name":"Ileana L.","full_name":"Hanganu-Opatz, Ileana L."},{"full_name":"Butt, Simon J. B.","first_name":"Simon J. B.","last_name":"Butt"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon"},{"last_name":"De Marco García","first_name":"Natalia V.","full_name":"De Marco García, Natalia V."},{"full_name":"Cardin, Jessica A.","last_name":"Cardin","first_name":"Jessica A."},{"last_name":"Voytek","first_name":"Bradley","full_name":"Voytek, Bradley"},{"first_name":"Alysson R.","last_name":"Muotri","full_name":"Muotri, Alysson R."}]},{"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"17","scopus_import":"1","keyword":["Applied Mathematics","Computational Theory and Mathematics","Computational Mathematics","Analysis"],"date_published":"2021-08-17T00:00:00Z","citation":{"apa":"Mondelli, M., Thrampoulidis, C., & Venkataramanan, R. (2021). Optimal combination of linear and spectral estimators for generalized linear models. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-021-09531-x","ieee":"M. Mondelli, C. Thrampoulidis, and R. Venkataramanan, “Optimal combination of linear and spectral estimators for generalized linear models,” Foundations of Computational Mathematics. Springer, 2021.","ista":"Mondelli M, Thrampoulidis C, Venkataramanan R. 2021. Optimal combination of linear and spectral estimators for generalized linear models. Foundations of Computational Mathematics.","ama":"Mondelli M, Thrampoulidis C, Venkataramanan R. Optimal combination of linear and spectral estimators for generalized linear models. Foundations of Computational Mathematics. 2021. doi:10.1007/s10208-021-09531-x","chicago":"Mondelli, Marco, Christos Thrampoulidis, and Ramji Venkataramanan. “Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models.” Foundations of Computational Mathematics. Springer, 2021. https://doi.org/10.1007/s10208-021-09531-x.","short":"M. Mondelli, C. Thrampoulidis, R. Venkataramanan, Foundations of Computational Mathematics (2021).","mla":"Mondelli, Marco, et al. “Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models.” Foundations of Computational Mathematics, Springer, 2021, doi:10.1007/s10208-021-09531-x."},"publication":"Foundations of Computational Mathematics","article_type":"original","abstract":[{"text":"We study the problem of recovering an unknown signal 𝑥𝑥 given measurements obtained from a generalized linear model with a Gaussian sensing matrix. Two popular solutions are based on a linear estimator 𝑥𝑥^L and a spectral estimator 𝑥𝑥^s. The former is a data-dependent linear combination of the columns of the measurement matrix, and its analysis is quite simple. The latter is the principal eigenvector of a data-dependent matrix, and a recent line of work has studied its performance. In this paper, we show how to optimally combine 𝑥𝑥^L and 𝑥𝑥^s. At the heart of our analysis is the exact characterization of the empirical joint distribution of (𝑥𝑥,𝑥𝑥^L,𝑥𝑥^s) in the high-dimensional limit. This allows us to compute the Bayes-optimal combination of 𝑥𝑥^L and 𝑥𝑥^s, given the limiting distribution of the signal 𝑥𝑥. When the distribution of the signal is Gaussian, then the Bayes-optimal combination has the form 𝜃𝑥𝑥^L+𝑥𝑥^s and we derive the optimal combination coefficient. In order to establish the limiting distribution of (𝑥𝑥,𝑥𝑥^L,𝑥𝑥^s), we design and analyze an approximate message passing algorithm whose iterates give 𝑥𝑥^L and approach 𝑥𝑥^s. Numerical simulations demonstrate the improvement of the proposed combination with respect to the two methods considered separately.","lang":"eng"}],"type":"journal_article","file":[{"file_size":2305731,"content_type":"application/pdf","creator":"alisjak","file_name":"2021_Springer_Mondelli.pdf","access_level":"open_access","date_created":"2021-12-13T15:47:54Z","date_updated":"2021-12-13T15:47:54Z","checksum":"9ea12dd8045a0678000a3a59295221cb","success":1,"relation":"main_file","file_id":"10542"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10211","status":"public","ddc":["510"],"title":"Optimal combination of linear and spectral estimators for generalized linear models","publication_identifier":{"issn":["1615-3375"],"eissn":["1615-3383"]},"month":"08","doi":"10.1007/s10208-021-09531-x","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000685721000001"],"arxiv":["2008.03326"]},"oa":1,"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"isi":1,"quality_controlled":"1","file_date_updated":"2021-12-13T15:47:54Z","author":[{"full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"first_name":"Christos","last_name":"Thrampoulidis","full_name":"Thrampoulidis, Christos"},{"last_name":"Venkataramanan","first_name":"Ramji","full_name":"Venkataramanan, Ramji"}],"date_created":"2021-11-03T10:59:08Z","date_updated":"2023-09-05T14:13:57Z","acknowledgement":"M. Mondelli would like to thank Andrea Montanari for helpful discussions. All the authors would like to thank the anonymous reviewers for their helpful comments.","year":"2021","department":[{"_id":"MaMo"}],"publisher":"Springer","publication_status":"published"},{"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000597770300001"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00454-020-00250-8","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"07","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"publication_status":"published","acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement Number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. Open access funding provided by the Institute of Science and Technology (IST Austria).","year":"2021","volume":66,"date_updated":"2023-09-05T15:02:40Z","date_created":"2020-12-12T11:07:02Z","author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"last_name":"Kachanovich","first_name":"Siargey","full_name":"Kachanovich, Siargey"},{"first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"ec_funded":1,"file_date_updated":"2021-08-06T09:52:29Z","page":"386-434","article_type":"original","citation":{"chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00250-8.","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete & Computational Geometry 66 (2021) 386–434.","mla":"Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry, vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:10.1007/s00454-020-00250-8.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Triangulating submanifolds: An elementary and quantified version of Whitney’s method,” Discrete & Computational Geometry, vol. 66, no. 1. Springer Nature, pp. 386–434, 2021.","apa":"Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00250-8","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 66(1), 386–434.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8"},"publication":"Discrete & Computational Geometry","date_published":"2021-07-01T00:00:00Z","keyword":["Theoretical Computer Science","Computational Theory and Mathematics","Geometry and Topology","Discrete Mathematics and Combinatorics"],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","intvolume":" 66","ddc":["516"],"title":"Triangulating submanifolds: An elementary and quantified version of Whitney’s method","status":"public","_id":"8940","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"checksum":"c848986091e56699dc12de85adb1e39c","success":1,"date_created":"2021-08-06T09:52:29Z","date_updated":"2021-08-06T09:52:29Z","relation":"main_file","file_id":"9795","file_size":983307,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2021_DescreteCompGeopmetry_Boissonnat.pdf"}],"type":"journal_article","issue":"1","abstract":[{"text":"We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric.","lang":"eng"}]},{"doi":"10.1007/s11005-021-01358-5","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000617531900001"]},"quality_controlled":"1","isi":1,"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"month":"02","publication_identifier":{"issn":["0377-9017"],"eissn":["1573-0530"]},"author":[{"last_name":"Lauritsen","first_name":"Asbjørn Bækgaard","orcid":"0000-0003-4476-2288","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","full_name":"Lauritsen, Asbjørn Bækgaard"}],"date_created":"2021-02-15T09:27:14Z","date_updated":"2023-09-05T15:17:16Z","volume":111,"year":"2021","acknowledgement":"Most of this work was done as part of the author’s master’s thesis. The author would like to thank Jan Philip Solovej for his supervision of this process.\r\nOpen Access funding provided by Institute of Science and Technology (IST Austria)","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"GradSch"}],"file_date_updated":"2021-02-15T09:31:07Z","article_number":"20","date_published":"2021-02-12T00:00:00Z","publication":"Letters in Mathematical Physics","citation":{"short":"A.B. Lauritsen, Letters in Mathematical Physics 111 (2021).","mla":"Lauritsen, Asbjørn Bækgaard. “The BCS Energy Gap at Low Density.” Letters in Mathematical Physics, vol. 111, 20, Springer Nature, 2021, doi:10.1007/s11005-021-01358-5.","chicago":"Lauritsen, Asbjørn Bækgaard. “The BCS Energy Gap at Low Density.” Letters in Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-021-01358-5.","ama":"Lauritsen AB. The BCS energy gap at low density. Letters in Mathematical Physics. 2021;111. doi:10.1007/s11005-021-01358-5","ieee":"A. B. Lauritsen, “The BCS energy gap at low density,” Letters in Mathematical Physics, vol. 111. Springer Nature, 2021.","apa":"Lauritsen, A. B. (2021). The BCS energy gap at low density. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-021-01358-5","ista":"Lauritsen AB. 2021. The BCS energy gap at low density. Letters in Mathematical Physics. 111, 20."},"article_type":"original","day":"12","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"oa_version":"Published Version","file":[{"file_name":"2021_LettersMathPhysics_Lauritsen.pdf","access_level":"open_access","file_size":329332,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"9122","date_created":"2021-02-15T09:31:07Z","date_updated":"2021-02-15T09:31:07Z","checksum":"eaf1b3ff5026f120f0929a5c417dc842","success":1}],"_id":"9121","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"The BCS energy gap at low density","ddc":["510"],"intvolume":" 111","abstract":[{"text":"We show that the energy gap for the BCS gap equation is\r\nΞ=μ(8e−2+o(1))exp(π2μ−−√a)\r\nin the low density limit μ→0. Together with the similar result for the critical temperature by Hainzl and Seiringer (Lett Math Phys 84: 99–107, 2008), this shows that, in the low density limit, the ratio of the energy gap and critical temperature is a universal constant independent of the interaction potential V. The results hold for a class of potentials with negative scattering length a and no bound states.","lang":"eng"}],"type":"journal_article"},{"_id":"9234","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 21","title":"New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity","ddc":["510"],"status":"public","file":[{"relation":"main_file","file_id":"9884","date_created":"2021-08-11T12:44:16Z","date_updated":"2021-08-11T12:44:16Z","checksum":"22b4253a2e5da843622a2df713784b4c","success":1,"file_name":"2021_NetworksSpatialEconomics_Shehu.pdf","access_level":"open_access","file_size":834964,"content_type":"application/pdf","creator":"kschuh"}],"oa_version":"Published Version","type":"journal_article","issue":"2","abstract":[{"text":"In this paper, we present two new inertial projection-type methods for solving multivalued variational inequality problems in finite-dimensional spaces. We establish the convergence of the sequence generated by these methods when the multivalued mapping associated with the problem is only required to be locally bounded without any monotonicity assumption. Furthermore, the inertial techniques that we employ in this paper are quite different from the ones used in most papers. Moreover, based on the weaker assumptions on the inertial factor in our methods, we derive several special cases of our methods. Finally, we present some experimental results to illustrate the profits that we gain by introducing the inertial extrapolation steps.","lang":"eng"}],"citation":{"ama":"Izuchukwu C, Shehu Y. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. 2021;21(2):291-323. doi:10.1007/s11067-021-09517-w","apa":"Izuchukwu, C., & Shehu, Y. (2021). New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. Springer Nature. https://doi.org/10.1007/s11067-021-09517-w","ieee":"C. Izuchukwu and Y. Shehu, “New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity,” Networks and Spatial Economics, vol. 21, no. 2. Springer Nature, pp. 291–323, 2021.","ista":"Izuchukwu C, Shehu Y. 2021. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. 21(2), 291–323.","short":"C. Izuchukwu, Y. Shehu, Networks and Spatial Economics 21 (2021) 291–323.","mla":"Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.” Networks and Spatial Economics, vol. 21, no. 2, Springer Nature, 2021, pp. 291–323, doi:10.1007/s11067-021-09517-w.","chicago":"Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.” Networks and Spatial Economics. Springer Nature, 2021. https://doi.org/10.1007/s11067-021-09517-w."},"publication":"Networks and Spatial Economics","page":"291-323","article_type":"original","date_published":"2021-06-01T00:00:00Z","scopus_import":"1","keyword":["Computer Networks and Communications","Software","Artificial Intelligence"],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","year":"2021","acknowledgement":"The authors sincerely thank the Editor-in-Chief and anonymous referees for their careful reading, constructive comments and fruitful suggestions that help improve the manuscript. The research of the first author is supported by the National Research Foundation (NRF) South Africa (S& F-DSI/NRF Free Standing Postdoctoral Fellowship; Grant Number: 120784). The first author also acknowledges the financial support from DSI/NRF, South Africa Center of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) Postdoctoral Fellowship. The second author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7 - 2007-2013) (Grant agreement No. 616160). Open Access funding provided by Institute of Science and Technology (IST Austria).","publisher":"Springer Nature","department":[{"_id":"VlKo"}],"publication_status":"published","author":[{"full_name":"Izuchukwu, Chinedu","first_name":"Chinedu","last_name":"Izuchukwu"},{"full_name":"Shehu, Yekini","first_name":"Yekini","last_name":"Shehu","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139"}],"volume":21,"date_updated":"2023-09-05T15:32:32Z","date_created":"2021-03-10T12:18:47Z","ec_funded":1,"file_date_updated":"2021-08-11T12:44:16Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000625002100001"]},"project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"isi":1,"quality_controlled":"1","doi":"10.1007/s11067-021-09517-w","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1566-113X"],"eissn":["1572-9427"]},"month":"06"},{"type":"journal_article","abstract":[{"text":"We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space X equipped with a continuous function f:X→R. We first give a categorification of the mapper graph and the Reeb graph by interpreting them in terms of cosheaves and stratified covers of the real line R. We then introduce a variant of the classic mapper graph of Singh et al. (in: Eurographics symposium on point-based graphics, 2007), referred to as the enhanced mapper graph, and demonstrate that such a construction approximates the Reeb graph of (X,f) when it is applied to points randomly sampled from a probability density function concentrated on (X,f). Our techniques are based on the interleaving distance of constructible cosheaves and topological estimation via kernel density estimates. Following Munch and Wang (In: 32nd international symposium on computational geometry, volume 51 of Leibniz international proceedings in informatics (LIPIcs), Dagstuhl, Germany, pp 53:1–53:16, 2016), we first show that the mapper graph of (X,f), a constructible R-space (with a fixed open cover), approximates the Reeb graph of the same space. We then construct an isomorphism between the mapper of (X,f) to the mapper of a super-level set of a probability density function concentrated on (X,f). Finally, building on the approach of Bobrowski et al. (Bernoulli 23(1):288–328, 2017b), we show that, with high probability, we can recover the mapper of the super-level set given a sufficiently large sample. Our work is the first to consider the mapper construction using the theory of cosheaves in a probabilistic setting. It is part of an ongoing effort to combine sheaf theory, probability, and statistics, to support topological data analysis with random data.","lang":"eng"}],"issue":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9111","ddc":["510"],"status":"public","title":"Probabilistic convergence and stability of random mapper graphs","intvolume":" 5","file":[{"file_id":"9112","relation":"main_file","date_updated":"2021-02-11T14:43:59Z","date_created":"2021-02-11T14:43:59Z","success":1,"checksum":"3f02e9d47c428484733da0f588a3c069","file_name":"2020_JourApplCompTopology_Brown.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":2090265}],"oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication":"Journal of Applied and Computational Topology","citation":{"short":"A. Brown, O. Bobrowski, E. Munch, B. Wang, Journal of Applied and Computational Topology 5 (2021) 99–140.","mla":"Brown, Adam, et al. “Probabilistic Convergence and Stability of Random Mapper Graphs.” Journal of Applied and Computational Topology, vol. 5, no. 1, Springer Nature, 2021, pp. 99–140, doi:10.1007/s41468-020-00063-x.","chicago":"Brown, Adam, Omer Bobrowski, Elizabeth Munch, and Bei Wang. “Probabilistic Convergence and Stability of Random Mapper Graphs.” Journal of Applied and Computational Topology. Springer Nature, 2021. https://doi.org/10.1007/s41468-020-00063-x.","ama":"Brown A, Bobrowski O, Munch E, Wang B. Probabilistic convergence and stability of random mapper graphs. Journal of Applied and Computational Topology. 2021;5(1):99-140. doi:10.1007/s41468-020-00063-x","ieee":"A. Brown, O. Bobrowski, E. Munch, and B. Wang, “Probabilistic convergence and stability of random mapper graphs,” Journal of Applied and Computational Topology, vol. 5, no. 1. Springer Nature, pp. 99–140, 2021.","apa":"Brown, A., Bobrowski, O., Munch, E., & Wang, B. (2021). Probabilistic convergence and stability of random mapper graphs. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-020-00063-x","ista":"Brown A, Bobrowski O, Munch E, Wang B. 2021. Probabilistic convergence and stability of random mapper graphs. Journal of Applied and Computational Topology. 5(1), 99–140."},"article_type":"original","page":"99-140","date_published":"2021-03-01T00:00:00Z","file_date_updated":"2021-02-11T14:43:59Z","ec_funded":1,"year":"2021","acknowledgement":"AB was supported in part by the European Union’s Horizon 2020 research and innovation\r\nprogramme under the Marie Sklodowska-Curie GrantAgreement No. 754411 and NSF IIS-1513616. OB was supported in part by the Israel Science Foundation, Grant 1965/19. BW was supported in part by NSF IIS-1513616 and DBI-1661375. EM was supported in part by NSF CMMI-1800466, DMS-1800446, and CCF-1907591.We would like to thank the Institute for Mathematics and its Applications for hosting a workshop titled Bridging Statistics and Sheaves in May 2018, where this work was conceived.\r\nOpen Access funding provided by Institute of Science and Technology (IST Austria).","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"author":[{"full_name":"Brown, Adam","first_name":"Adam","last_name":"Brown","id":"70B7FDF6-608D-11E9-9333-8535E6697425"},{"full_name":"Bobrowski, Omer","last_name":"Bobrowski","first_name":"Omer"},{"last_name":"Munch","first_name":"Elizabeth","full_name":"Munch, Elizabeth"},{"full_name":"Wang, Bei","first_name":"Bei","last_name":"Wang"}],"date_created":"2021-02-11T14:41:02Z","date_updated":"2023-09-05T15:37:56Z","volume":5,"month":"03","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1909.03488"]},"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"doi":"10.1007/s41468-020-00063-x","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"month":"05","external_id":{"isi":["000636966300001"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1111/evo.14210","language":[{"iso":"eng"}],"file_date_updated":"2021-08-11T13:39:19Z","year":"2021","acknowledgement":"We thank the reviewers for their helpful comments, and also our colleagues, for illuminating discussions over the long gestation of this paper.","publisher":"Wiley","department":[{"_id":"NiBa"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"research_data","id":"13062"}]},"author":[{"full_name":"Szep, Eniko","first_name":"Eniko","last_name":"Szep","id":"485BB5A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sachdeva, Himani","last_name":"Sachdeva","first_name":"Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"volume":75,"date_updated":"2023-09-05T15:44:06Z","date_created":"2021-03-20T08:22:10Z","scopus_import":"1","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics","General Agricultural and Biological Sciences"],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","citation":{"short":"E. Szep, H. Sachdeva, N.H. Barton, Evolution 75 (2021) 1030–1045.","mla":"Szep, Eniko, et al. “Polygenic Local Adaptation in Metapopulations: A Stochastic Eco‐evolutionary Model.” Evolution, vol. 75, no. 5, Wiley, 2021, pp. 1030–45, doi:10.1111/evo.14210.","chicago":"Szep, Eniko, Himani Sachdeva, and Nicholas H Barton. “Polygenic Local Adaptation in Metapopulations: A Stochastic Eco‐evolutionary Model.” Evolution. Wiley, 2021. https://doi.org/10.1111/evo.14210.","ama":"Szep E, Sachdeva H, Barton NH. Polygenic local adaptation in metapopulations: A stochastic eco‐evolutionary model. Evolution. 2021;75(5):1030-1045. doi:10.1111/evo.14210","ieee":"E. Szep, H. Sachdeva, and N. H. Barton, “Polygenic local adaptation in metapopulations: A stochastic eco‐evolutionary model,” Evolution, vol. 75, no. 5. Wiley, pp. 1030–1045, 2021.","apa":"Szep, E., Sachdeva, H., & Barton, N. H. (2021). Polygenic local adaptation in metapopulations: A stochastic eco‐evolutionary model. Evolution. Wiley. https://doi.org/10.1111/evo.14210","ista":"Szep E, Sachdeva H, Barton NH. 2021. Polygenic local adaptation in metapopulations: A stochastic eco‐evolutionary model. Evolution. 75(5), 1030–1045."},"publication":"Evolution","page":"1030-1045","article_type":"original","date_published":"2021-05-01T00:00:00Z","type":"journal_article","issue":"5","abstract":[{"text":"This paper analyses the conditions for local adaptation in a metapopulation with infinitely many islands under a model of hard selection, where population size depends on local fitness. Each island belongs to one of two distinct ecological niches or habitats. Fitness is influenced by an additive trait which is under habitat‐dependent directional selection. Our analysis is based on the diffusion approximation and accounts for both genetic drift and demographic stochasticity. By neglecting linkage disequilibria, it yields the joint distribution of allele frequencies and population size on each island. We find that under hard selection, the conditions for local adaptation in a rare habitat are more restrictive for more polygenic traits: even moderate migration load per locus at very many loci is sufficient for population sizes to decline. This further reduces the efficacy of selection at individual loci due to increased drift and because smaller populations are more prone to swamping due to migration, causing a positive feedback between increasing maladaptation and declining population sizes. Our analysis also highlights the importance of demographic stochasticity, which exacerbates the decline in numbers of maladapted populations, leading to population collapse in the rare habitat at significantly lower migration than predicted by deterministic arguments.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9252","intvolume":" 75","status":"public","title":"Polygenic local adaptation in metapopulations: A stochastic eco‐evolutionary model","ddc":["570"],"oa_version":"Published Version","file":[{"creator":"kschuh","content_type":"application/pdf","file_size":734102,"file_name":"2021_Evolution_Szep.pdf","access_level":"open_access","date_updated":"2021-08-11T13:39:19Z","date_created":"2021-08-11T13:39:19Z","success":1,"checksum":"b90fb5767d623602046fed03725e16ca","file_id":"9886","relation":"main_file"}]},{"article_processing_charge":"No","day":"19","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics","General Agricultural and Biological Sciences"],"date_published":"2021-04-19T00:00:00Z","citation":{"mla":"Butlin, Roger K., et al. “Homage to Felsenstein 1981, or Why Are There so Few/Many Species?” Evolution, vol. 75, no. 5, Wiley, 2021, pp. 978–88, doi:10.1111/evo.14235.","short":"R.K. Butlin, M.R. Servedio, C.M. Smadja, C. Bank, N.H. Barton, S.M. Flaxman, T. Giraud, R. Hopkins, E.L. Larson, M.E. Maan, J. Meier, R. Merrill, M.A.F. Noor, D. Ortiz‐Barrientos, A. Qvarnström, Evolution 75 (2021) 978–988.","chicago":"Butlin, Roger K., Maria R. Servedio, Carole M. Smadja, Claudia Bank, Nicholas H Barton, Samuel M. Flaxman, Tatiana Giraud, et al. “Homage to Felsenstein 1981, or Why Are There so Few/Many Species?” Evolution. Wiley, 2021. https://doi.org/10.1111/evo.14235.","ama":"Butlin RK, Servedio MR, Smadja CM, et al. Homage to Felsenstein 1981, or why are there so few/many species? Evolution. 2021;75(5):978-988. doi:10.1111/evo.14235","ista":"Butlin RK, Servedio MR, Smadja CM, Bank C, Barton NH, Flaxman SM, Giraud T, Hopkins R, Larson EL, Maan ME, Meier J, Merrill R, Noor MAF, Ortiz‐Barrientos D, Qvarnström A. 2021. Homage to Felsenstein 1981, or why are there so few/many species? Evolution. 75(5), 978–988.","ieee":"R. K. Butlin et al., “Homage to Felsenstein 1981, or why are there so few/many species?,” Evolution, vol. 75, no. 5. Wiley, pp. 978–988, 2021.","apa":"Butlin, R. K., Servedio, M. R., Smadja, C. M., Bank, C., Barton, N. H., Flaxman, S. M., … Qvarnström, A. (2021). Homage to Felsenstein 1981, or why are there so few/many species? Evolution. Wiley. https://doi.org/10.1111/evo.14235"},"publication":"Evolution","page":"978-988","article_type":"original","issue":"5","abstract":[{"lang":"eng","text":"If there are no constraints on the process of speciation, then the number of species might be expected to match the number of available niches and this number might be indefinitely large. One possible constraint is the opportunity for allopatric divergence. In 1981, Felsenstein used a simple and elegant model to ask if there might also be genetic constraints. He showed that progress towards speciation could be described by the build‐up of linkage disequilibrium among divergently selected loci and between these loci and those contributing to other forms of reproductive isolation. Therefore, speciation is opposed by recombination, because it tends to break down linkage disequilibria. Felsenstein then introduced a crucial distinction between “two‐allele” models, which are subject to this effect, and “one‐allele” models, which are free from the recombination constraint. These fundamentally important insights have been the foundation for both empirical and theoretical studies of speciation ever since."}],"type":"journal_article","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9374","intvolume":" 75","status":"public","title":"Homage to Felsenstein 1981, or why are there so few/many species?","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"month":"04","doi":"10.1111/evo.14235","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000647224000001"]},"main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/10.1111/evo.14235","open_access":"1"}],"quality_controlled":"1","isi":1,"author":[{"last_name":"Butlin","first_name":"Roger K.","full_name":"Butlin, Roger K."},{"first_name":"Maria R.","last_name":"Servedio","full_name":"Servedio, Maria R."},{"last_name":"Smadja","first_name":"Carole M.","full_name":"Smadja, Carole M."},{"full_name":"Bank, Claudia","first_name":"Claudia","last_name":"Bank"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"},{"full_name":"Flaxman, Samuel M.","first_name":"Samuel M.","last_name":"Flaxman"},{"last_name":"Giraud","first_name":"Tatiana","full_name":"Giraud, Tatiana"},{"full_name":"Hopkins, Robin","last_name":"Hopkins","first_name":"Robin"},{"first_name":"Erica L.","last_name":"Larson","full_name":"Larson, Erica L."},{"full_name":"Maan, Martine E.","last_name":"Maan","first_name":"Martine E."},{"last_name":"Meier","first_name":"Joana","full_name":"Meier, Joana"},{"last_name":"Merrill","first_name":"Richard","full_name":"Merrill, Richard"},{"last_name":"Noor","first_name":"Mohamed A. F.","full_name":"Noor, Mohamed A. F."},{"first_name":"Daniel","last_name":"Ortiz‐Barrientos","full_name":"Ortiz‐Barrientos, Daniel"},{"full_name":"Qvarnström, Anna","first_name":"Anna","last_name":"Qvarnström"}],"volume":75,"date_created":"2021-05-06T04:34:47Z","date_updated":"2023-09-05T15:44:33Z","year":"2021","acknowledgement":"RKB was funded by the Natural Environment Research Council (NE/P012272/1 & NE/P001610/1), the European Research Council (693030 BARRIERS), and the Swedish Research Council (VR) (2018‐03695). MRS was funded by the National Science Foundation (Grant No. DEB1939290).","publisher":"Wiley","department":[{"_id":"NiBa"}],"publication_status":"published"},{"abstract":[{"text":"This paper analyzes the conditions for local adaptation in a metapopulation with infinitely many islands under a model of hard selection, where population size depends on local fitness. Each island belongs to one of two distinct ecological niches or habitats. Fitness is influenced by an additive trait which is under habitat-dependent directional selection. Our analysis is based on the diffusion approximation and accounts for both genetic drift and demographic stochasticity. By neglecting linkage disequilibria, it yields the joint distribution of allele frequencies and population size on each island. We find that under hard selection, the conditions for local adaptation in a rare habitat are more restrictive for more polygenic traits: even moderate migration load per locus at very many loci is sufficient for population sizes to decline. This further reduces the efficacy of selection at individual loci due to increased drift and because smaller populations are more prone to swamping due to migration, causing a positive feedback between increasing maladaptation and declining population sizes. Our analysis also highlights the importance of demographic stochasticity, which exacerbates the decline in numbers of maladapted populations, leading to population collapse in the rare habitat at significantly lower migration than predicted by deterministic arguments.","lang":"eng"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","type":"research_data_reference","author":[{"last_name":"Szep","first_name":"Eniko","id":"485BB5A4-F248-11E8-B48F-1D18A9856A87","full_name":"Szep, Eniko"},{"full_name":"Sachdeva, Himani","first_name":"Himani","last_name":"Sachdeva","id":"42377A0A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"related_material":{"record":[{"id":"9252","relation":"used_in_publication","status":"public"}]},"date_created":"2023-05-23T16:17:02Z","date_updated":"2023-09-05T15:44:05Z","oa_version":"Published Version","year":"2021","_id":"13062","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"status":"public","title":"Supplementary code for: Polygenic local adaptation in metapopulations: A stochastic eco-evolutionary model","department":[{"_id":"NiBa"}],"publisher":"Dryad","month":"03","day":"02","article_processing_charge":"No","date_published":"2021-03-02T00:00:00Z","doi":"10.5061/DRYAD.8GTHT76P1","oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"short":"E. Szep, H. Sachdeva, N.H. Barton, (2021).","mla":"Szep, Eniko, et al. Supplementary Code for: Polygenic Local Adaptation in Metapopulations: A Stochastic Eco-Evolutionary Model. Dryad, 2021, doi:10.5061/DRYAD.8GTHT76P1.","chicago":"Szep, Eniko, Himani Sachdeva, and Nicholas H Barton. “Supplementary Code for: Polygenic Local Adaptation in Metapopulations: A Stochastic Eco-Evolutionary Model.” Dryad, 2021. https://doi.org/10.5061/DRYAD.8GTHT76P1.","ama":"Szep E, Sachdeva H, Barton NH. Supplementary code for: Polygenic local adaptation in metapopulations: A stochastic eco-evolutionary model. 2021. doi:10.5061/DRYAD.8GTHT76P1","ieee":"E. Szep, H. Sachdeva, and N. H. Barton, “Supplementary code for: Polygenic local adaptation in metapopulations: A stochastic eco-evolutionary model.” Dryad, 2021.","apa":"Szep, E., Sachdeva, H., & Barton, N. H. (2021). Supplementary code for: Polygenic local adaptation in metapopulations: A stochastic eco-evolutionary model. Dryad. https://doi.org/10.5061/DRYAD.8GTHT76P1","ista":"Szep E, Sachdeva H, Barton NH. 2021. Supplementary code for: Polygenic local adaptation in metapopulations: A stochastic eco-evolutionary model, Dryad, 10.5061/DRYAD.8GTHT76P1."},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.8gtht76p1","open_access":"1"}]},{"article_processing_charge":"No","has_accepted_license":"1","day":"01","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"scopus_import":"1","date_published":"2021-08-01T00:00:00Z","page":"3797-3814","article_type":"original","citation":{"ista":"Westram AM, Faria R, Johannesson K, Butlin R. 2021. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. 30(15), 3797–3814.","ieee":"A. M. Westram, R. Faria, K. Johannesson, and R. Butlin, “Using replicate hybrid zones to understand the genomic basis of adaptive divergence,” Molecular Ecology, vol. 30, no. 15. Wiley, pp. 3797–3814, 2021.","apa":"Westram, A. M., Faria, R., Johannesson, K., & Butlin, R. (2021). Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.15861","ama":"Westram AM, Faria R, Johannesson K, Butlin R. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. 2021;30(15):3797-3814. doi:10.1111/mec.15861","chicago":"Westram, Anja M, Rui Faria, Kerstin Johannesson, and Roger Butlin. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” Molecular Ecology. Wiley, 2021. https://doi.org/10.1111/mec.15861.","mla":"Westram, Anja M., et al. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” Molecular Ecology, vol. 30, no. 15, Wiley, 2021, pp. 3797–814, doi:10.1111/mec.15861.","short":"A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021) 3797–3814."},"publication":"Molecular Ecology","issue":"15","abstract":[{"lang":"eng","text":"Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones."}],"type":"journal_article","file":[{"date_created":"2022-03-08T11:31:30Z","date_updated":"2022-03-08T11:31:30Z","checksum":"d5611f243ceb63a0e091d6662ebd9cda","success":1,"relation":"main_file","file_id":"10839","file_size":1726548,"content_type":"application/pdf","creator":"dernst","file_name":"2021_MolecularEcology_Westram.pdf","access_level":"open_access"}],"oa_version":"Published Version","intvolume":" 30","status":"public","title":"Using replicate hybrid zones to understand the genomic basis of adaptive divergence","ddc":["570"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10838","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.1111/mec.15861","quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["33638231"],"isi":["000669439700001"]},"file_date_updated":"2022-03-08T11:31:30Z","volume":30,"date_created":"2022-03-08T11:28:32Z","date_updated":"2023-09-05T16:02:19Z","author":[{"full_name":"Westram, Anja M","first_name":"Anja M","last_name":"Westram","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"},{"first_name":"Roger","last_name":"Butlin","full_name":"Butlin, Roger"}],"department":[{"_id":"BeVi"}],"publisher":"Wiley","publication_status":"published","pmid":1,"year":"2021","acknowledgement":"We thank everyone who helped with fieldwork, snail processing and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot, Mark Ravinet, Irena Senčić and Zuzanna Zagrodzka. We are also grateful to Edinburgh Genomics for library preparation and sequencing, to Stuart Baird and Mark Ravinet for helpful discussions, and to three anonymous reviewers for their constructive comments. This work was supported by the Natural Environment Research Council (NE/K014021/1), the European Research Council (AdG-693030-BARRIERS), Swedish Research Councils Formas and Vetenskapsrådet through a Linnaeus grant to the Centre for Marine Evolutionary Biology (217-2008-1719), the European Regional Development Fund (POCI-01-0145-FEDER-030628), and the Fundação para a iência e a Tecnologia,\r\nPortugal (PTDC/BIA-EVL/\r\n30628/2017). A.M.W. and R.F. were\r\nfunded by the European Union’s Horizon 2020 research and innovation\r\nprogramme under Marie Skłodowska-Curie\r\ngrant agreements\r\nno. 754411/797747 and no. 706376, respectively."},{"intvolume":" 230","status":"public","title":"Seedling developmental defects upon blocking CINNAMATE-4-HYDROXYLASE are caused by perturbations in auxin transport","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9288","oa_version":"Published Version","type":"journal_article","issue":"6","abstract":[{"lang":"eng","text":"• The phenylpropanoid pathway serves a central role in plant metabolism, providing numerous compounds involved in diverse physiological processes. Most carbon entering the pathway is incorporated into lignin. Although several phenylpropanoid pathway mutants show seedling growth arrest, the role for lignin in seedling growth and development is unexplored.\r\n• We use complementary pharmacological and genetic approaches to block CINNAMATE‐4‐HYDROXYLASE (C4H) functionality in Arabidopsis seedlings and a set of molecular and biochemical techniques to investigate the underlying phenotypes.\r\n• Blocking C4H resulted in reduced lateral rooting and increased adventitious rooting apically in the hypocotyl. These phenotypes coincided with an inhibition in auxin transport. The upstream accumulation in cis‐cinnamic acid was found to likely cause polar auxin transport inhibition. Conversely, a downstream depletion in lignin perturbed phloem‐mediated auxin transport. Restoring lignin deposition effectively reestablished phloem transport and, accordingly, auxin homeostasis.\r\n• Our results show that the accumulation of bioactive intermediates and depletion in lignin jointly cause the aberrant phenotypes upon blocking C4H, and demonstrate that proper deposition of lignin is essential for the establishment of auxin distribution in seedlings. Our data position the phenylpropanoid pathway and lignin in a new physiological framework, consolidating their importance in plant growth and development."}],"page":"2275-2291","article_type":"original","citation":{"ama":"El Houari I, Van Beirs C, Arents H, et al. Seedling developmental defects upon blocking CINNAMATE-4-HYDROXYLASE are caused by perturbations in auxin transport. New Phytologist. 2021;230(6):2275-2291. doi:10.1111/nph.17349","ista":"El Houari I, Van Beirs C, Arents H, Han H, Chanoca A, Opdenacker D, Pollier J, Storme V, Steenackers W, Quareshy M, Napier R, Beeckman T, Friml J, De Rybel B, Boerjan W, Vanholme B. 2021. Seedling developmental defects upon blocking CINNAMATE-4-HYDROXYLASE are caused by perturbations in auxin transport. New Phytologist. 230(6), 2275–2291.","ieee":"I. El Houari et al., “Seedling developmental defects upon blocking CINNAMATE-4-HYDROXYLASE are caused by perturbations in auxin transport,” New Phytologist, vol. 230, no. 6. Wiley, pp. 2275–2291, 2021.","apa":"El Houari, I., Van Beirs, C., Arents, H., Han, H., Chanoca, A., Opdenacker, D., … Vanholme, B. (2021). Seedling developmental defects upon blocking CINNAMATE-4-HYDROXYLASE are caused by perturbations in auxin transport. New Phytologist. Wiley. https://doi.org/10.1111/nph.17349","mla":"El Houari, I., et al. “Seedling Developmental Defects upon Blocking CINNAMATE-4-HYDROXYLASE Are Caused by Perturbations in Auxin Transport.” New Phytologist, vol. 230, no. 6, Wiley, 2021, pp. 2275–91, doi:10.1111/nph.17349.","short":"I. El Houari, C. Van Beirs, H. Arents, H. Han, A. Chanoca, D. Opdenacker, J. Pollier, V. Storme, W. Steenackers, M. Quareshy, R. Napier, T. Beeckman, J. Friml, B. De Rybel, W. Boerjan, B. Vanholme, New Phytologist 230 (2021) 2275–2291.","chicago":"El Houari, I, C Van Beirs, HE Arents, Huibin Han, A Chanoca, D Opdenacker, J Pollier, et al. “Seedling Developmental Defects upon Blocking CINNAMATE-4-HYDROXYLASE Are Caused by Perturbations in Auxin Transport.” New Phytologist. Wiley, 2021. https://doi.org/10.1111/nph.17349."},"publication":"New Phytologist","date_published":"2021-03-17T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"17","department":[{"_id":"JiFr"}],"publisher":"Wiley","publication_status":"published","pmid":1,"year":"2021","volume":230,"date_updated":"2023-09-05T15:46:55Z","date_created":"2021-03-26T12:09:01Z","author":[{"last_name":"El Houari","first_name":"I","full_name":"El Houari, I"},{"first_name":"C","last_name":"Van Beirs","full_name":"Van Beirs, C"},{"last_name":"Arents","first_name":"HE","full_name":"Arents, HE"},{"full_name":"Han, Huibin","first_name":"Huibin","last_name":"Han","id":"31435098-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chanoca, A","last_name":"Chanoca","first_name":"A"},{"first_name":"D","last_name":"Opdenacker","full_name":"Opdenacker, D"},{"full_name":"Pollier, J","last_name":"Pollier","first_name":"J"},{"full_name":"Storme, V","first_name":"V","last_name":"Storme"},{"first_name":"W","last_name":"Steenackers","full_name":"Steenackers, W"},{"first_name":"M","last_name":"Quareshy","full_name":"Quareshy, M"},{"last_name":"Napier","first_name":"R","full_name":"Napier, R"},{"last_name":"Beeckman","first_name":"T","full_name":"Beeckman, T"},{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"},{"last_name":"De Rybel","first_name":"B","full_name":"De Rybel, B"},{"last_name":"Boerjan","first_name":"W","full_name":"Boerjan, W"},{"full_name":"Vanholme, B","last_name":"Vanholme","first_name":"B"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"pmid":["33728703"],"isi":["000639552400001"]},"main_file_link":[{"url":"https://biblio.ugent.be/publication/8703799/file/8703800.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1111/nph.17349","publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646x"]},"month":"03"},{"type":"journal_article","issue":"5","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10836","status":"public","ddc":["570"],"title":"PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance","intvolume":" 76","oa_version":"Published Version","file":[{"checksum":"9526f9554112fc027c9f7fa540c488cd","success":1,"date_created":"2022-03-08T11:23:16Z","date_updated":"2022-03-08T11:23:16Z","relation":"main_file","file_id":"10837","file_size":626081,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2021_Allergy_Pranger.pdf"}],"scopus_import":"1","keyword":["Immunology","Immunology and Allergy"],"day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"Allergy","citation":{"chicago":"Pranger, Christina L., Judit Singer, Verena K. Köhler, Isabella Pali‐Schöll, Alessandro Fiocchi, Sophia N. Karagiannis, Olatz Zenarruzabeitia, Francisco Borrego, and Erika Jensen‐Jarolim. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” Allergy. Wiley, 2021. https://doi.org/10.1111/all.14604.","mla":"Pranger, Christina L., et al. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” Allergy, vol. 76, no. 5, Wiley, 2021, pp. 1553–56, doi:10.1111/all.14604.","short":"C.L. Pranger, J. Singer, V.K. Köhler, I. Pali‐Schöll, A. Fiocchi, S.N. Karagiannis, O. Zenarruzabeitia, F. Borrego, E. Jensen‐Jarolim, Allergy 76 (2021) 1553–1556.","ista":"Pranger CL, Singer J, Köhler VK, Pali‐Schöll I, Fiocchi A, Karagiannis SN, Zenarruzabeitia O, Borrego F, Jensen‐Jarolim E. 2021. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 76(5), 1553–1556.","ieee":"C. L. Pranger et al., “PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance,” Allergy, vol. 76, no. 5. Wiley, pp. 1553–1556, 2021.","apa":"Pranger, C. L., Singer, J., Köhler, V. K., Pali‐Schöll, I., Fiocchi, A., Karagiannis, S. N., … Jensen‐Jarolim, E. (2021). PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. Wiley. https://doi.org/10.1111/all.14604","ama":"Pranger CL, Singer J, Köhler VK, et al. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 2021;76(5):1553-1556. doi:10.1111/all.14604"},"article_type":"letter_note","page":"1553-1556","date_published":"2021-05-01T00:00:00Z","file_date_updated":"2022-03-08T11:23:16Z","year":"2021","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) grants MCCA W1248-B30 and SFB F4606-B28 to EJJ. CP received a short-term research fellowship of the European Federation of Immunological Societies (EFIS-IL) for a research visit at Biocruces Bizkaia Health Research Institute, Barakaldo, Spain. VKK received an EFIS-IL short-term research fellowship for a research visit at King’s College London. The research was funded by the National Institute for Health Research (NIHR) Biomedical Research Centre (BRC) based at Guy's and St Thomas' NHS Foundation Trust and King's College London (IS-BRC-1215-20006) (SNK). The authors acknowledge support by the Medical Research Council (MR/L023091/1) (SNK); Breast Cancer Now (147; KCL-BCN-Q3)(SNK); Cancer Research UK (C30122/A11527; C30122/A15774) (SNK); Cancer Research UK King's Health Partners Centre at King's College London (C604/A25135) (SNK); CRUK/NIHR in England/DoH for Scotland, Wales and Northern Ireland Experimental Cancer Medicine Centre (C10355/A15587) (SNK). The views expressed are those of the author(s) and not necessarily those of the NHS, the NIHR or the Department of Health. Additionally, this work was funded by Instituto de Salud Carlos III through the project \"PI16/01223\" (Co-funded by European Regional Development Fund; “A way to make Europe”) to FB and by the Department of Health, Basque Government through the project “2019111031” to OZ. OZ is recipient of a Sara Borrell 2017 post-doctoral contract “CD17/00128” funded by Instituto de Salud Carlos III (Co-funded by European Social Fund; “Investing in your future”).","pmid":1,"publication_status":"published","department":[{"_id":"Bio"}],"publisher":"Wiley","author":[{"first_name":"Christina L.","last_name":"Pranger","full_name":"Pranger, Christina L."},{"orcid":"0000-0002-8777-3502","id":"36432834-F248-11E8-B48F-1D18A9856A87","last_name":"Fazekas-Singer","first_name":"Judit","full_name":"Fazekas-Singer, Judit"},{"full_name":"Köhler, Verena K.","first_name":"Verena K.","last_name":"Köhler"},{"full_name":"Pali‐Schöll, Isabella","last_name":"Pali‐Schöll","first_name":"Isabella"},{"full_name":"Fiocchi, Alessandro","first_name":"Alessandro","last_name":"Fiocchi"},{"first_name":"Sophia N.","last_name":"Karagiannis","full_name":"Karagiannis, Sophia N."},{"full_name":"Zenarruzabeitia, Olatz","last_name":"Zenarruzabeitia","first_name":"Olatz"},{"full_name":"Borrego, Francisco","last_name":"Borrego","first_name":"Francisco"},{"full_name":"Jensen‐Jarolim, Erika","last_name":"Jensen‐Jarolim","first_name":"Erika"}],"date_updated":"2023-09-05T15:58:53Z","date_created":"2022-03-08T11:19:05Z","volume":76,"month":"05","publication_identifier":{"issn":["0105-4538"],"eissn":["1398-9995"]},"external_id":{"isi":["000577708800001"],"pmid":["32990982"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1111/all.14604","language":[{"iso":"eng"}]},{"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","page":"963-978","article_type":"original","citation":{"ama":"Ke M, Ma Z, Wang D, et al. Salicylic acid regulates PIN2 auxin transporter hyper-clustering and root gravitropic growth via Remorin-dependent lipid nanodomain organization in Arabidopsis thaliana. New Phytologist. 2021;229(2):963-978. doi:10.1111/nph.16915","ieee":"M. Ke et al., “Salicylic acid regulates PIN2 auxin transporter hyper-clustering and root gravitropic growth via Remorin-dependent lipid nanodomain organization in Arabidopsis thaliana,” New Phytologist, vol. 229, no. 2. Wiley, pp. 963–978, 2021.","apa":"Ke, M., Ma, Z., Wang, D., Sun, Y., Wen, C., Huang, D., … Chen, X. (2021). Salicylic acid regulates PIN2 auxin transporter hyper-clustering and root gravitropic growth via Remorin-dependent lipid nanodomain organization in Arabidopsis thaliana. New Phytologist. Wiley. https://doi.org/10.1111/nph.16915","ista":"Ke M, Ma Z, Wang D, Sun Y, Wen C, Huang D, Chen Z, Yang L, Tan S, Li R, Friml J, Miao Y, Chen X. 2021. Salicylic acid regulates PIN2 auxin transporter hyper-clustering and root gravitropic growth via Remorin-dependent lipid nanodomain organization in Arabidopsis thaliana. New Phytologist. 229(2), 963–978.","short":"M. Ke, Z. Ma, D. Wang, Y. Sun, C. Wen, D. Huang, Z. Chen, L. Yang, S. Tan, R. Li, J. Friml, Y. Miao, X. Chen, New Phytologist 229 (2021) 963–978.","mla":"Ke, M., et al. “Salicylic Acid Regulates PIN2 Auxin Transporter Hyper-Clustering and Root Gravitropic Growth via Remorin-Dependent Lipid Nanodomain Organization in Arabidopsis Thaliana.” New Phytologist, vol. 229, no. 2, Wiley, 2021, pp. 963–78, doi:10.1111/nph.16915.","chicago":"Ke, M, Z Ma, D Wang, Y Sun, C Wen, D Huang, Z Chen, et al. “Salicylic Acid Regulates PIN2 Auxin Transporter Hyper-Clustering and Root Gravitropic Growth via Remorin-Dependent Lipid Nanodomain Organization in Arabidopsis Thaliana.” New Phytologist. Wiley, 2021. https://doi.org/10.1111/nph.16915."},"publication":"New Phytologist","date_published":"2021-01-01T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"To adapt to the diverse array of biotic and abiotic cues, plants have evolved sophisticated mechanisms to sense changes in environmental conditions and modulate their growth. Growth-promoting hormones and defence signalling fine tune plant development antagonistically. During host-pathogen interactions, this defence-growth trade-off is mediated by the counteractive effects of the defence hormone salicylic acid (SA) and the growth hormone auxin. Here we revealed an underlying mechanism of SA regulating auxin signalling by constraining the plasma membrane dynamics of PIN2 auxin efflux transporter in Arabidopsis thaliana roots. The lateral diffusion of PIN2 proteins is constrained by SA signalling, during which PIN2 proteins are condensed into hyperclusters depending on REM1.2-mediated nanodomain compartmentalisation. Furthermore, membrane nanodomain compartmentalisation by SA or Remorin (REM) assembly significantly suppressed clathrin-mediated endocytosis. Consequently, SA-induced heterogeneous surface condensation disrupted asymmetric auxin distribution and the resultant gravitropic response. Our results demonstrated a defence-growth trade-off mechanism by which SA signalling crosstalked with auxin transport by concentrating membrane-resident PIN2 into heterogeneous compartments."}],"intvolume":" 229","title":"Salicylic acid regulates PIN2 auxin transporter hyper-clustering and root gravitropic growth via Remorin-dependent lipid nanodomain organization in Arabidopsis thaliana","ddc":["580"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8608","oa_version":"Published Version","file":[{"success":1,"checksum":"d36b6a8c6fafab66264e0d27114dae63","date_created":"2021-02-04T09:53:16Z","date_updated":"2021-02-04T09:53:16Z","file_id":"9085","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":3674502,"access_level":"open_access","file_name":"2021_NewPhytologist_Ke.pdf"}],"publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646x"]},"month":"01","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["32901934"],"isi":["000573568000001"]},"language":[{"iso":"eng"}],"doi":"10.1111/nph.16915","file_date_updated":"2021-02-04T09:53:16Z","department":[{"_id":"JiFr"}],"publisher":"Wiley","publication_status":"published","pmid":1,"year":"2021","acknowledgement":"This work was supported by the National Key Research andDevelopment Programme of China (2017YFA0506100), theNational Natural Science Foundation of China (31870170 and31701168), and the Fok Ying Tung Education Foundation(161027) to XC; NTU startup grant (M4081533) and NIM/01/2016 (NTU, Singapore) to YM. We thank Lei Shi andZhongquan Lin for microscopy assistance.","volume":229,"date_updated":"2023-09-05T16:06:24Z","date_created":"2020-10-05T12:45:36Z","author":[{"full_name":"Ke, M","first_name":"M","last_name":"Ke"},{"last_name":"Ma","first_name":"Z","full_name":"Ma, Z"},{"full_name":"Wang, D","first_name":"D","last_name":"Wang"},{"first_name":"Y","last_name":"Sun","full_name":"Sun, Y"},{"full_name":"Wen, C","first_name":"C","last_name":"Wen"},{"full_name":"Huang, D","first_name":"D","last_name":"Huang"},{"full_name":"Chen, Z","last_name":"Chen","first_name":"Z"},{"first_name":"L","last_name":"Yang","full_name":"Yang, L"},{"full_name":"Tan, Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","first_name":"Shutang","last_name":"Tan"},{"first_name":"R","last_name":"Li","full_name":"Li, R"},{"last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"},{"first_name":"Y","last_name":"Miao","full_name":"Miao, Y"},{"full_name":"Chen, X","last_name":"Chen","first_name":"X"}]},{"_id":"7900","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 33","title":"Bosonic collective excitations in Fermi gases","status":"public","oa_version":"Preprint","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"Hartree–Fock theory has been justified as a mean-field approximation for fermionic systems. However, it suffers from some defects in predicting physical properties, making necessary a theory of quantum correlations. Recently, bosonization of many-body correlations has been rigorously justified as an upper bound on the correlation energy at high density with weak interactions. We review the bosonic approximation, deriving an effective Hamiltonian. We then show that for systems with Coulomb interaction this effective theory predicts collective excitations (plasmons) in accordance with the random phase approximation of Bohm and Pines, and with experimental observation."}],"citation":{"chicago":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews in Mathematical Physics. World Scientific, 2021. https://doi.org/10.1142/s0129055x20600090.","mla":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews in Mathematical Physics, vol. 33, no. 1, 2060009, World Scientific, 2021, doi:10.1142/s0129055x20600090.","short":"N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).","ista":"Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 33(1), 2060009.","ieee":"N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” Reviews in Mathematical Physics, vol. 33, no. 1. World Scientific, 2021.","apa":"Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. World Scientific. https://doi.org/10.1142/s0129055x20600090","ama":"Benedikter NP. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 2021;33(1). doi:10.1142/s0129055x20600090"},"publication":"Reviews in Mathematical Physics","article_type":"original","date_published":"2021-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","year":"2021","department":[{"_id":"RoSe"}],"publisher":"World Scientific","publication_status":"published","author":[{"last_name":"Benedikter","first_name":"Niels P","orcid":"0000-0002-1071-6091","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","full_name":"Benedikter, Niels P"}],"volume":33,"date_created":"2020-05-28T16:47:55Z","date_updated":"2023-09-05T16:07:40Z","article_number":"2060009","ec_funded":1,"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1910.08190","open_access":"1"}],"external_id":{"arxiv":["1910.08190"],"isi":["000613313200010"]},"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"isi":1,"quality_controlled":"1","doi":"10.1142/s0129055x20600090","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"month":"01"},{"doi":"10.1142/s0129055x20600120","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1912.12509"],"isi":["000613313200013"]},"main_file_link":[{"url":"https://arxiv.org/abs/1912.12509","open_access":"1"}],"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"month":"02","author":[{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"volume":33,"date_updated":"2023-09-05T16:08:02Z","date_created":"2022-03-18T08:11:34Z","acknowledgement":"This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227).","year":"2021","department":[{"_id":"RoSe"}],"publisher":"World Scientific Publishing","publication_status":"published","ec_funded":1,"article_number":"2060012","date_published":"2021-02-01T00:00:00Z","citation":{"chicago":"Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical Physics. World Scientific Publishing, 2021. https://doi.org/10.1142/s0129055x20600120.","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021).","mla":"Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical Physics, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:10.1142/s0129055x20600120.","apa":"Seiringer, R. (2021). The polaron at strong coupling. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x20600120","ieee":"R. Seiringer, “The polaron at strong coupling,” Reviews in Mathematical Physics, vol. 33, no. 01. World Scientific Publishing, 2021.","ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","ama":"Seiringer R. The polaron at strong coupling. Reviews in Mathematical Physics. 2021;33(01). doi:10.1142/s0129055x20600120"},"publication":"Reviews in Mathematical Physics","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"oa_version":"Preprint","_id":"10852","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 33","title":"The polaron at strong coupling","status":"public","issue":"01","abstract":[{"lang":"eng","text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass."}],"type":"journal_article"},{"title":"Multi-cover persistence and Delaunay mosaics","status":"public","ddc":["006","514","516"],"_id":"9056","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_updated":"2021-02-03T10:37:28Z","date_created":"2021-02-02T14:09:25Z","checksum":"bcf27986147cab0533b6abadd74e7629","relation":"source_file","file_id":"9063","content_type":"application/zip","file_size":13446994,"creator":"patrickd","file_name":"thesis_source.zip","access_level":"closed"},{"file_id":"9064","relation":"main_file","success":1,"checksum":"9cc8af266579a464385bbe2aff6af606","date_updated":"2021-02-02T14:09:18Z","date_created":"2021-02-02T14:09:18Z","access_level":"open_access","file_name":"thesis_pdfA2b.pdf","creator":"patrickd","file_size":5210329,"content_type":"application/pdf"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets."}],"page":"134","citation":{"ama":"Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056","apa":"Osang, G. F. (2021). Multi-cover persistence and Delaunay mosaics. Institute of Science and Technology Austria, Klosterneuburg. https://doi.org/10.15479/AT:ISTA:9056","ieee":"G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.","ista":"Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.","short":"G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021.","mla":"Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056.","chicago":"Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9056."},"date_published":"2021-02-01T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"01","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2021","date_created":"2021-02-02T14:11:06Z","date_updated":"2023-09-07T13:29:01Z","related_material":{"record":[{"id":"187","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8703"}]},"author":[{"last_name":"Osang","first_name":"Georg F","orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"}],"place":"Klosterneuburg","file_date_updated":"2021-02-03T10:37:28Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"doi":"10.15479/AT:ISTA:9056","publication_identifier":{"issn":["2663-337X"]},"month":"02"},{"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"oa":1,"supervisor":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:9022","month":"01","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"acknowledgement":"I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.","year":"2021","date_created":"2021-01-21T18:16:54Z","date_updated":"2023-09-07T13:29:32Z","author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","first_name":"Giorgio","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio"}],"file_date_updated":"2021-01-25T14:19:10Z","ec_funded":1,"page":"380","citation":{"chicago":"Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022.","short":"G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021.","mla":"Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022.","apa":"Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022","ieee":"G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021.","ista":"Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria.","ama":"Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022"},"date_published":"2021-01-25T00:00:00Z","day":"25","has_accepted_license":"1","article_processing_charge":"No","ddc":["510"],"title":"Fluctuations in the spectrum of random matrices","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9022","oa_version":"Published Version","file":[{"file_name":"thesis.pdf","access_level":"open_access","creator":"gcipollo","file_size":4127796,"content_type":"application/pdf","file_id":"9043","relation":"main_file","date_created":"2021-01-25T14:19:03Z","date_updated":"2021-01-25T14:19:03Z","success":1,"checksum":"5a93658a5f19478372523ee232887e2b"},{"relation":"source_file","file_id":"9044","checksum":"e8270eddfe6a988e92a53c88d1d19b8c","date_created":"2021-01-25T14:19:10Z","date_updated":"2021-01-25T14:19:10Z","access_level":"closed","file_name":"Thesis_files.zip","content_type":"application/zip","file_size":12775206,"creator":"gcipollo"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices."}]},{"month":"05","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","conference":{"name":" ICLR: International Conference on Learning Representations","end_date":"2021-05-07","start_date":"2021-05-03","location":"Virtual"},"date_published":"2021-05-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"9th International Conference on Learning Representations","citation":{"ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in 9th International Conference on Learning Representations, Virtual, 2021.","apa":"Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In 9th International Conference on Learning Representations. Virtual.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: 9th International Conference on Learning Representations. ; 2021.","chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In 9th International Conference on Learning Representations, 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” 9th International Conference on Learning Representations, 2021."},"main_file_link":[{"url":"https://openreview.net/pdf?id=krz7T0xU9Z_","open_access":"1"}],"oa":1,"quality_controlled":"1","abstract":[{"text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.","lang":"eng"}],"file_date_updated":"2021-05-24T11:15:57Z","type":"conference","author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong","last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"related_material":{"record":[{"id":"9418","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-09-07T13:29:50Z","date_created":"2021-05-24T11:16:46Z","file":[{"checksum":"f34ff17017527db5ba6927f817bdd125","date_created":"2021-05-24T11:15:57Z","date_updated":"2021-05-24T11:15:57Z","file_id":"9417","relation":"main_file","creator":"bphuong","file_size":502356,"content_type":"application/pdf","access_level":"open_access","file_name":"iclr2021_conference.pdf"}],"oa_version":"Published Version","year":"2021","_id":"9416","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"The inductive bias of ReLU networks on orthogonally separable data","status":"public","ddc":["000"],"department":[{"_id":"GradSch"},{"_id":"ChLa"}]},{"oa_version":"Published Version","file":[{"creator":"dernst","file_size":391205,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_LettersMathPhysics_Feliciangeli.pdf","success":1,"checksum":"ffbfe1aad623bce7ff529c207e343b53","date_updated":"2021-03-09T11:44:34Z","date_created":"2021-03-09T11:44:34Z","file_id":"9232","relation":"main_file"}],"intvolume":" 111","title":"Persistence of the spectral gap for the Landau–Pekar equations","status":"public","ddc":["510"],"_id":"9225","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere, we provide a class of initial data for which the associated effective Hamiltonian\r\nhas a uniform spectral gap for all times. For such initial data, this allows us to extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations and their derivation\r\nfrom the Fröhlich model obtained in previous works to larger times."}],"type":"journal_article","date_published":"2021-02-11T00:00:00Z","article_type":"original","citation":{"chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-020-01350-5.","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical Physics 111 (2021).","mla":"Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics, vol. 111, 19, Springer Nature, 2021, doi:10.1007/s11005-020-01350-5.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the spectral gap for the Landau–Pekar equations,” Letters in Mathematical Physics, vol. 111. Springer Nature, 2021.","apa":"Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (2021). Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-020-01350-5","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19.","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 2021;111. doi:10.1007/s11005-020-01350-5"},"publication":"Letters in Mathematical Physics","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"11","scopus_import":"1","volume":111,"date_created":"2021-03-07T23:01:25Z","date_updated":"2023-09-07T13:30:11Z","related_material":{"record":[{"id":"9733","relation":"dissertation_contains","status":"public"}]},"author":[{"first_name":"Dario","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","full_name":"Feliciangeli, Dario"},{"first_name":"Simone Anna Elvira","last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425","orcid":"0000-0001-5059-4466","full_name":"Rademacher, Simone Anna Elvira"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"publisher":"Springer Nature","department":[{"_id":"RoSe"}],"publication_status":"published","year":"2021","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged. Open Access funding provided by Institute of Science and Technology (IST Austria)","ec_funded":1,"file_date_updated":"2021-03-09T11:44:34Z","article_number":"19","language":[{"iso":"eng"}],"doi":"10.1007/s11005-020-01350-5","project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000617195700001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"eissn":["15730530"],"issn":["03779017"]},"month":"02"},{"day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"arXiv","citation":{"ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” arXiv. .","apa":"Feliciangeli, D., & Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv.","ista":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.","ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv.","chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, n.d.","short":"D. Feliciangeli, R. Seiringer, ArXiv (n.d.).","mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, 2101.12566."},"date_published":"2021-02-01T00:00:00Z","type":"preprint","abstract":[{"lang":"eng","text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging."}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9787","title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","status":"public","ddc":["510"],"oa_version":"Preprint","month":"02","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"https://arxiv.org/abs/2101.12566","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2101.12566"]},"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"language":[{"iso":"eng"}],"article_number":"2101.12566","ec_funded":1,"acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n","year":"2021","publication_status":"submitted","department":[{"_id":"RoSe"}],"author":[{"full_name":"Feliciangeli, Dario","last_name":"Feliciangeli","first_name":"Dario","orcid":"0000-0003-0754-8530","id":"41A639AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"related_material":{"record":[{"id":"10224","status":"public","relation":"later_version"},{"id":"9733","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-09-07T13:30:10Z","date_created":"2021-08-06T08:25:57Z"},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, RVF-SMC generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9987","status":"public","title":"Stateless model checking under a reads-value-from equivalence","ddc":["000"],"file":[{"access_level":"open_access","file_name":"2021_LNCS_Agarwal.pdf","content_type":"application/pdf","file_size":1516756,"creator":"dernst","relation":"main_file","file_id":"11368","checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","success":1,"date_updated":"2022-05-13T07:00:20Z","date_created":"2022-05-13T07:00:20Z"}],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes","day":"15","citation":{"ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16","ieee":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.","apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16","ista":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.","short":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.","mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.","chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16."},"publication":"33rd International Conference on Computer-Aided Verification ","page":"341-366","date_published":"2021-07-15T00:00:00Z","ec_funded":1,"file_date_updated":"2022-05-13T07:00:20Z","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","year":"2021","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Agarwal, Pratyush","first_name":"Pratyush","last_name":"Agarwal"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Shreya","last_name":"Pathak","full_name":"Pathak, Shreya"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"},{"full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","first_name":"Viktor"}],"volume":"12759 ","date_created":"2021-09-05T22:01:24Z","date_updated":"2023-09-07T13:30:27Z","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-81685-8"],"isbn":["978-3-030-81684-1"],"eissn":["1611-3349"]},"month":"07","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000698732400016"],"arxiv":["2105.06424"]},"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"isi":1,"quality_controlled":"1","doi":"10.1007/978-3-030-81685-8_16","conference":{"name":"CAV: Computer Aided Verification ","end_date":"2021-07-23","location":"Virtual","start_date":"2021-07-20"},"language":[{"iso":"eng"}]},{"oa":1,"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}],"doi":"10.15479/at:ista:10007","supervisor":[{"full_name":"Fischer, Julian L","last_name":"Fischer","first_name":"Julian L","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"month":"09","publication_identifier":{"issn":["2663-337X"]},"year":"2021","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"author":[{"full_name":"Hensel, Sebastian","orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","first_name":"Sebastian"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10012"},{"relation":"part_of_dissertation","status":"public","id":"10013"},{"status":"public","relation":"part_of_dissertation","id":"7489"}]},"date_updated":"2023-09-07T13:30:45Z","date_created":"2021-09-13T11:12:34Z","file_date_updated":"2021-09-15T14:37:30Z","ec_funded":1,"citation":{"mla":"Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007.","short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.","chicago":"Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.","ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","apa":"Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021."},"page":"300","date_published":"2021-09-14T00:00:00Z","day":"14","has_accepted_license":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10007","ddc":["515"],"title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","status":"public","file":[{"access_level":"closed","file_name":"thesis_final_Hensel.zip","content_type":"application/x-zip-compressed","file_size":15022154,"creator":"shensel","relation":"source_file","file_id":"10008","checksum":"c8475faaf0b680b4971f638f1db16347","date_updated":"2021-09-15T14:37:30Z","date_created":"2021-09-13T11:03:24Z"},{"relation":"main_file","file_id":"10014","date_created":"2021-09-13T14:18:56Z","date_updated":"2021-09-14T09:52:47Z","checksum":"1a609937aa5275452822f45f2da17f07","file_name":"thesis_final_Hensel.pdf","access_level":"open_access","file_size":6583638,"content_type":"application/pdf","creator":"shensel"}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis."}]},{"date_published":"2021-10-15T00:00:00Z","article_type":"original","citation":{"ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021)."},"publication":"Proceedings of the ACM on Programming Languages","has_accepted_license":"1","article_processing_charge":"No","day":"15","keyword":["safety","risk","reliability and quality","software"],"scopus_import":"1","file":[{"creator":"cchlebak","content_type":"application/pdf","file_size":2903485,"access_level":"open_access","file_name":"2021_ProcACMPL_Bui.pdf","success":1,"checksum":"9d6dce7b611853c529bb7b1915ac579e","date_updated":"2021-11-04T07:24:48Z","date_created":"2021-11-04T07:24:48Z","file_id":"10215","relation":"main_file"}],"oa_version":"Published Version","intvolume":" 5","status":"public","title":"The reads-from equivalence for the TSO and PSO memory models","ddc":["000"],"_id":"10191","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"OOPSLA","abstract":[{"lang":"eng","text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1145/3485541","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","external_id":{"arxiv":["2011.11763"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"eissn":["2475-1421"]},"month":"10","volume":5,"date_updated":"2023-09-07T13:30:27Z","date_created":"2021-10-27T15:05:34Z","related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"author":[{"last_name":"Bui","first_name":"Truc Lam","full_name":"Bui, Truc Lam"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Tushar","last_name":"Gautam","full_name":"Gautam, Tushar"},{"first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"last_name":"Toman","first_name":"Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor"}],"publisher":"Association for Computing Machinery","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","year":"2021","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","ec_funded":1,"file_date_updated":"2021-11-04T07:24:48Z","article_number":"164"},{"type":"preprint","article_number":"2108.01733","ec_funded":1,"abstract":[{"lang":"eng","text":"We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10013","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","year":"2021","department":[{"_id":"JuFi"}],"status":"public","publication_status":"submitted","title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","related_material":{"record":[{"status":"public","relation":"later_version","id":"13043"},{"relation":"dissertation_contains","status":"public","id":"10007"}]},"author":[{"last_name":"Hensel","first_name":"Sebastian","orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian"},{"last_name":"Laux","first_name":"Tim","full_name":"Laux, Tim"}],"oa_version":"Preprint","date_updated":"2023-09-07T13:30:45Z","date_created":"2021-09-13T12:17:11Z","article_processing_charge":"No","day":"03","month":"08","citation":{"ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733.","apa":"Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733","ieee":"S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” arXiv. .","ama":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. doi:10.48550/arXiv.2108.01733","chicago":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733.","mla":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733.","short":"S. Hensel, T. Laux, ArXiv (n.d.)."},"external_id":{"arxiv":["2108.01733"]},"main_file_link":[{"url":"https://arxiv.org/abs/2108.01733","open_access":"1"}],"oa":1,"publication":"arXiv","project":[{"grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}],"doi":"10.48550/arXiv.2108.01733","date_published":"2021-08-03T00:00:00Z","language":[{"iso":"eng"}]},{"file":[{"file_id":"10641","relation":"main_file","success":1,"checksum":"36eb41ea43d8ca22b0efab12419e4eb2","date_updated":"2022-01-18T11:29:33Z","date_created":"2022-01-18T11:29:33Z","access_level":"open_access","file_name":"2021_PRXQuantum_Peruzzo.pdf","creator":"cchlebak","file_size":4247422,"content_type":"application/pdf"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9928","ddc":["530"],"title":"Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction","status":"public","intvolume":" 2","abstract":[{"text":"There are two elementary superconducting qubit types that derive directly from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear Josephson junction to realize the widely used charge qubits with a compact phase variable and a discrete charge wave function. In the other, the junction is added in parallel, which gives rise to an extended phase variable, continuous wave functions, and a rich energy-level structure due to the loop topology. While the corresponding rf superconducting quantum interference device Hamiltonian was introduced as a quadratic quasi-one-dimensional potential approximation to describe the fluxonium qubit implemented with long Josephson-junction arrays, in this work we implement it directly using a linear superinductor formed by a single uninterrupted aluminum wire. We present a large variety of qubits, all stemming from the same circuit but with drastically different characteristic energy scales. This includes flux and fluxonium qubits but also the recently introduced quasicharge qubit with strongly enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion. The use of a geometric inductor results in high reproducibility of the inductive energy as guaranteed by top-down lithography—a key ingredient for intrinsically protected superconducting qubits.","lang":"eng"}],"issue":"4","type":"journal_article","date_published":"2021-11-24T00:00:00Z","publication":"PRX Quantum","citation":{"ieee":"M. Peruzzo et al., “Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction,” PRX Quantum, vol. 2, no. 4. American Physical Society, p. 040341, 2021.","apa":"Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., & Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. American Physical Society. https://doi.org/10.1103/PRXQuantum.2.040341","ista":"Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM. 2021. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2(4), 040341.","ama":"Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2021;2(4):040341. doi:10.1103/PRXQuantum.2.040341","chicago":"Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko, Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” PRX Quantum. American Physical Society, 2021. https://doi.org/10.1103/PRXQuantum.2.040341.","short":"M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M. Fink, PRX Quantum 2 (2021) 040341.","mla":"Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” PRX Quantum, vol. 2, no. 4, American Physical Society, 2021, p. 040341, doi:10.1103/PRXQuantum.2.040341."},"article_type":"original","page":"040341","day":"24","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","keyword":["quantum physics","mesoscale and nanoscale physics"],"author":[{"orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo","first_name":"Matilda","full_name":"Peruzzo, Matilda"},{"last_name":"Hassani","first_name":"Farid","orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","full_name":"Hassani, Farid"},{"full_name":"Szep, Gregory","last_name":"Szep","first_name":"Gregory"},{"full_name":"Trioni, Andrea","first_name":"Andrea","last_name":"Trioni","id":"42F71B44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Redchenko, Elena","last_name":"Redchenko","first_name":"Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87"},{"id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","last_name":"Zemlicka","first_name":"Martin","full_name":"Zemlicka, Martin"},{"orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","first_name":"Johannes M","full_name":"Fink, Johannes M"}],"related_material":{"record":[{"id":"13057","status":"public","relation":"research_data"},{"status":"public","relation":"dissertation_contains","id":"9920"}]},"date_created":"2021-08-17T08:14:18Z","date_updated":"2023-09-07T13:31:22Z","volume":2,"acknowledgement":"We thank W. Hughes for analytic and numerical modeling during the early stages of this work, J. Koch for discussions and support with the scqubits package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros for equipment support, as well as the MIBA workshop and the Institute of Science and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise, and E. Flurin for discussions. This work was supported by a NOMIS Foundation research grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria. M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria.","year":"2021","publication_status":"published","department":[{"_id":"JoFi"},{"_id":"NanoFab"},{"_id":"M-Shop"}],"publisher":"American Physical Society","file_date_updated":"2022-01-18T11:29:33Z","ec_funded":1,"doi":"10.1103/PRXQuantum.2.040341","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000723015100001"],"arxiv":["2106.05882"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FWF","name":"Integrating superconducting quantum circuits","grant_number":"F07105","_id":"26927A52-B435-11E9-9278-68D0E5697425"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"2622978C-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"}],"month":"11","publication_identifier":{"eissn":["2691-3399"]}},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10030","ddc":["515"],"title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","status":"public","file":[{"file_id":"10032","relation":"source_file","checksum":"8cd60dcb8762e8f21867e21e8001e183","date_created":"2021-09-21T09:17:34Z","date_updated":"2022-03-10T12:14:42Z","access_level":"closed","file_name":"tex_and_pictures.zip","creator":"cchlebak","content_type":"application/x-zip-compressed","file_size":3876668},{"checksum":"9789e9d967c853c1503ec7f307170279","date_updated":"2021-09-27T11:14:31Z","date_created":"2021-09-27T11:14:31Z","file_id":"10047","relation":"main_file","creator":"cchlebak","content_type":"application/pdf","file_size":2532673,"access_level":"open_access","file_name":"thesis_portinale_Final (1).pdf"}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces.","lang":"eng"}],"citation":{"short":"L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.","mla":"Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10030.","chicago":"Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10030.","ama":"Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:10.15479/at:ista:10030","ieee":"L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021.","apa":"Portinale, L. (2021). Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10030","ista":"Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria."},"date_published":"2021-09-22T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"22","acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","year":"2021","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"id":"10022","relation":"part_of_dissertation","status":"public"},{"id":"9792","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"7573"}]},"author":[{"first_name":"Lorenzo","last_name":"Portinale","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo"}],"date_updated":"2023-09-07T13:31:06Z","date_created":"2021-09-21T09:14:15Z","file_date_updated":"2022-03-10T12:14:42Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations","call_identifier":"FWF"},{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"}],"doi":"10.15479/at:ista:10030","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"publication_identifier":{"issn":["2663-337X"]},"month":"09"},{"month":"08","publication_identifier":{"isbn":["978-3-99078-013-8"],"issn":["2663-337X"]},"oa":1,"doi":"10.15479/at:ista:9920","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"supervisor":[{"full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M","last_name":"Fink"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"file_date_updated":"2021-09-06T08:39:47Z","year":"2021","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Peruzzo, Matilda","first_name":"Matilda","last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628"}],"related_material":{"record":[{"id":"9928","relation":"part_of_dissertation","status":"public"},{"id":"8755","status":"public","relation":"part_of_dissertation"}]},"date_created":"2021-08-16T09:44:09Z","date_updated":"2023-09-07T13:31:22Z","keyword":["quantum computing","superinductor","quantum metrology"],"day":"19","article_processing_charge":"No","has_accepted_license":"1","citation":{"short":"M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021.","mla":"Peruzzo, Matilda. Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9920.","chicago":"Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9920.","ama":"Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:10.15479/at:ista:9920","ieee":"M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021.","apa":"Peruzzo, M. (2021). Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9920","ista":"Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria."},"page":"149","date_published":"2021-08-19T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented.","lang":"eng"}],"_id":"9920","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["539"],"status":"public","title":"Geometric superinductors and their applications in circuit quantum electrodynamics","file":[{"access_level":"closed","file_name":"GeometricSuperinductorsForCQED.zip","file_size":151387283,"content_type":"application/x-zip-compressed","creator":"mperuzzo","relation":"source_file","file_id":"9924","checksum":"3cd1986efde5121d7581f6fcf9090da8","date_created":"2021-08-16T09:33:21Z","date_updated":"2021-09-06T08:39:47Z"},{"checksum":"50928c621cdf0775d7a5906b9dc8602c","date_created":"2021-08-18T14:20:06Z","date_updated":"2021-09-06T08:39:47Z","relation":"main_file","file_id":"9939","file_size":17596344,"content_type":"application/pdf","creator":"mperuzzo","access_level":"open_access","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf"},{"creator":"mperuzzo","file_size":17592425,"content_type":"application/pdf","access_level":"closed","description":"Extra copy of the thesis as PDF/A-2b","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf","checksum":"37f486aa1b622fe44af00d627ec13f6c","date_updated":"2021-09-06T08:39:47Z","date_created":"2021-08-18T14:20:09Z","file_id":"9940","relation":"other"}],"oa_version":"Published Version"},{"article_processing_charge":"No","day":"18","date_published":"2021-05-18T00:00:00Z","citation":{"ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.","apa":"Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.","ieee":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.","ista":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","mla":"Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.","chicago":"Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021."},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","page":"9037-9045","issue":"10","abstract":[{"lang":"eng","text":"One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification."}],"type":"conference","oa_version":"Published Version","_id":"10432","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 35","status":"public","title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","month":"05","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02","location":"Virtual","end_date":"2021-02-09"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2001.05918"]},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"quality_controlled":"1","ec_funded":1,"related_material":{"record":[{"id":"10429","status":"public","relation":"dissertation_contains"}]},"author":[{"orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"},{"full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia","last_name":"Markov"},{"id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2742-4028","first_name":"Bapi","last_name":"Chatterjee","full_name":"Chatterjee, Bapi"},{"first_name":"Vyacheslav ","last_name":"Kungurtsev","full_name":"Kungurtsev, Vyacheslav "},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"volume":35,"date_created":"2021-12-09T09:21:35Z","date_updated":"2023-09-07T13:31:39Z","acknowledgement":"We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus).","year":"2021","department":[{"_id":"DaAl"}],"publication_status":"published"},{"oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10041","title":"Limits on the Adaptive Security of Yao’s Garbling","status":"public","intvolume":" 12826","abstract":[{"lang":"eng","text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth δ , the loss in security is at most exponential in δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security."}],"type":"conference","alternative_title":["LCNS"],"date_published":"2021-08-11T00:00:00Z","publication":"41st Annual International Cryptology Conference, Part II ","citation":{"ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II (Vol. 12826, pp. 486–515). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-84245-1_17","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515.","mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In 41st Annual International Cryptology Conference, Part II , 12826:486–515. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-84245-1_17."},"page":"486-515","day":"11","article_processing_charge":"No","author":[{"full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"related_material":{"record":[{"id":"10035","relation":"dissertation_contains","status":"public"}]},"date_created":"2021-09-23T14:06:15Z","date_updated":"2023-09-07T13:32:11Z","volume":12826,"year":"2021","acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","ec_funded":1,"place":"Cham","conference":{"end_date":"2021-08-20","start_date":"2021-08-16","location":"Virtual","name":"CRYPTO: Annual International Cryptology Conference"},"doi":"10.1007/978-3-030-84245-1_17","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/945"}],"oa":1,"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"month":"08","publication_identifier":{"isbn":["978-3-030-84244-4"],"eissn":["1611-3349"],"eisbn":["978-3-030-84245-1"],"issn":["0302-9743"]}},{"author":[{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","last_name":"Pascual Perez","first_name":"Guillermo","full_name":"Pascual Perez, Guillermo"},{"full_name":"Walter, Michael","first_name":"Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482"},{"last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"last_name":"Capretto","first_name":"Margarita","full_name":"Capretto, Margarita"},{"last_name":"Cueto Noval","first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","full_name":"Cueto Noval, Miguel"},{"full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","first_name":"Ilia"},{"last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X"},{"full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"related_material":{"record":[{"id":"10035","relation":"dissertation_contains","status":"public"}]},"date_created":"2021-09-27T13:46:27Z","date_updated":"2023-09-07T13:32:11Z","acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","year":"2021","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrPi"},{"_id":"DaAl"}],"ec_funded":1,"conference":{"name":"SP: Symposium on Security and Privacy","end_date":"2021-05-27","location":"San Francisco, CA, United States","start_date":"2021-05-24"},"doi":"10.1109/sp40001.2021.00035","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1489"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"month":"08","oa_version":"Preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10049","title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","status":"public","abstract":[{"text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open.","lang":"eng"}],"type":"conference","date_published":"2021-08-26T00:00:00Z","publication":"2021 IEEE Symposium on Security and Privacy ","citation":{"ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.","ieee":"K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy (pp. 268–284). San Francisco, CA, United States: IEEE. https://doi.org/10.1109/sp40001.2021.00035","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035","chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035.","mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284."},"page":"268-284","day":"26","article_processing_charge":"No"},{"publication":"19th Theory of Cryptography Conference 2021","citation":{"ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.","apa":"Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021.","mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021."},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}],"oa":1,"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"conference":{"location":"Raleigh, NC, United States","start_date":"2021-11-08","end_date":"2021-11-11","name":"TCC: Theory of Cryptography Conference"},"date_published":"2021-07-08T00:00:00Z","language":[{"iso":"eng"}],"day":"08","month":"07","article_processing_charge":"No","_id":"10044","acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. ","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2021","title":"On treewidth, separators and Yao's garbling","status":"public","publication_status":"published","publisher":"International Association for Cryptologic Research","department":[{"_id":"KrPi"}],"author":[{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"full_name":"Klein, Karen","first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"related_material":{"record":[{"id":"10409","relation":"later_version","status":"public"},{"id":"10035","status":"public","relation":"dissertation_contains"}]},"date_created":"2021-09-24T12:01:34Z","date_updated":"2023-09-07T13:32:11Z","oa_version":"Preprint","article_number":"2021/926","type":"conference","abstract":[{"text":"We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.","lang":"eng"}],"ec_funded":1},{"alternative_title":["ISTA Master's Thesis"],"type":"dissertation","file_date_updated":"2022-03-10T12:10:25Z","abstract":[{"lang":"eng","text":"Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems."}],"publication_status":"published","title":"Towards designer materials using customizable particle shape","status":"public","ddc":["530"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"CaGo"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10422","year":"2021","date_updated":"2023-09-07T13:34:12Z","date_created":"2021-12-07T10:48:06Z","file":[{"relation":"source_file","file_id":"10424","checksum":"114e8f4b2c002c6c352416c12de2c695","date_updated":"2022-03-10T12:10:25Z","date_created":"2021-12-07T11:13:52Z","access_level":"closed","file_name":"Thesis.zip","file_size":394018,"content_type":"application/x-zip-compressed","creator":"cchlebak"},{"relation":"source_file","file_id":"10425","date_updated":"2022-03-10T12:10:25Z","date_created":"2021-12-07T11:14:01Z","checksum":"cd15ae991ced352a9959815f794e657c","file_name":"Preliminary_pages_Piankov.docx","access_level":"closed","file_size":47638,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"cchlebak"},{"access_level":"open_access","file_name":"2021_Piankov_combined.pdf","file_size":484965,"content_type":"application/pdf","creator":"cchlebak","relation":"main_file","file_id":"10426","checksum":"e6899c798b75ba42fab9822bce309050","success":1,"date_created":"2021-12-07T11:20:35Z","date_updated":"2021-12-07T11:20:35Z"}],"oa_version":"Published Version","author":[{"last_name":"Piankov","first_name":"Anton","id":"865E3C26-AA8C-11E9-A409-C4C4E5697425","full_name":"Piankov, Anton"}],"month":"12","day":"07","publication_identifier":{"issn":["2791-4585"]},"article_processing_charge":"No","has_accepted_license":"1","citation":{"short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021.","mla":"Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422.","chicago":"Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422.","ama":"Piankov A. Towards designer materials using customizable particle shape. 2021. doi:10.15479/at:ista:10422","apa":"Piankov, A. (2021). Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422","ieee":"A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021.","ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria."},"oa":1,"supervisor":[{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","last_name":"Goodrich","first_name":"Carl Peter"}],"degree_awarded":"MS","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:10422","date_published":"2021-12-07T00:00:00Z"},{"day":"07","month":"06","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2021-06-07T00:00:00Z","doi":"10.48550/arXiv.2102.05996","publication":"arXiv","main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"citation":{"chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996.","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” arXiv. .","apa":"Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv. doi:10.48550/arXiv.2102.05996"},"oa":1,"external_id":{"arxiv":["2102.05996"]},"abstract":[{"lang":"eng","text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality."}],"article_number":"2102.05996","type":"preprint","date_updated":"2023-09-07T13:42:08Z","date_created":"2022-02-28T14:13:59Z","oa_version":"Preprint","author":[{"last_name":"Konstantinov","first_name":"Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Christoph","last_name":"Lampert"}],"related_material":{"record":[{"id":"10799","relation":"dissertation_contains","status":"public"}]},"title":"Fairness through regularization for learning to rank","publication_status":"submitted","status":"public","department":[{"_id":"ChLa"}],"_id":"10803","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021"},{"author":[{"full_name":"Rzadkowski, Wojciech","first_name":"Wojciech","last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1106-4419"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail"},{"last_name":"Mentink","first_name":"Johan H.","full_name":"Mentink, Johan H."}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]},"date_created":"2022-02-17T11:18:57Z","date_updated":"2023-09-07T13:44:16Z","oa_version":"Preprint","_id":"10762","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","status":"public","publication_status":"submitted","title":"Artificial neural network states for non-additive systems","department":[{"_id":"MiLe"}],"abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"ec_funded":1,"type":"preprint","doi":"10.48550/arXiv.2105.15193","date_published":"2021-05-31T00:00:00Z","language":[{"iso":"eng"}],"publication":"arXiv","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.15193"}],"oa":1,"citation":{"chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” arXiv. .","apa":"Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, 10.48550/arXiv.2105.15193.","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193"},"external_id":{"arxiv":["2105.15193"]},"page":"2105.15193","project":[{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"day":"31","month":"05","article_processing_charge":"No"},{"day":"30","article_processing_charge":"No","has_accepted_license":"1","citation":{"mla":"Phuong, Mary. Underspecification in Deep Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","apa":"Phuong, M. (2021). Underspecification in deep learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418"},"page":"125","date_published":"2021-05-30T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"_id":"9418","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["000"],"title":"Underspecification in deep learning","oa_version":"Published Version","file":[{"file_name":"mph-thesis-v519-pdfimages.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2673905,"creator":"bphuong","relation":"main_file","file_id":"9419","date_updated":"2021-05-24T11:22:29Z","date_created":"2021-05-24T11:22:29Z","checksum":"4f0abe64114cfed264f9d36e8d1197e3","success":1},{"file_size":92995100,"content_type":"application/zip","creator":"bphuong","file_name":"thesis.zip","access_level":"closed","date_created":"2021-05-24T11:56:02Z","date_updated":"2021-05-24T11:56:02Z","checksum":"f5699e876bc770a9b0df8345a77720a2","relation":"source_file","file_id":"9420"}],"month":"05","publication_identifier":{"issn":["2663-337X"]},"oa":1,"doi":"10.15479/AT:ISTA:9418","supervisor":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"file_date_updated":"2021-05-24T11:56:02Z","year":"2021","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"author":[{"first_name":"Phuong","last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"deleted","id":"7435"},{"id":"7481","status":"public","relation":"part_of_dissertation"},{"id":"9416","status":"public","relation":"part_of_dissertation"},{"id":"7479","status":"public","relation":"part_of_dissertation"}]},"date_created":"2021-05-24T13:06:23Z","date_updated":"2023-09-08T11:11:12Z"},{"scopus_import":"1","day":"01","article_processing_charge":"No","page":"10401-10412","publication":"Proceedings of the 38th International Conference on Machine Learning","citation":{"chicago":"Träuble, Frederik, Elliot Creager, Niki Kilbertus, Francesco Locatello, Andrea Dittadi, Anirudh Goyal, Bernhard Schölkopf, and Stefan Bauer. “On Disentangled Representations Learned from Correlated Data.” In Proceedings of the 38th International Conference on Machine Learning, 139:10401–12. ML Research Press, 2021.","mla":"Träuble, Frederik, et al. “On Disentangled Representations Learned from Correlated Data.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 10401–12.","short":"F. Träuble, E. Creager, N. Kilbertus, F. Locatello, A. Dittadi, A. Goyal, B. Schölkopf, S. Bauer, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 10401–10412.","ista":"Träuble F, Creager E, Kilbertus N, Locatello F, Dittadi A, Goyal A, Schölkopf B, Bauer S. 2021. On disentangled representations learned from correlated data. Proceedings of the 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 139, 10401–10412.","apa":"Träuble, F., Creager, E., Kilbertus, N., Locatello, F., Dittadi, A., Goyal, A., … Bauer, S. (2021). On disentangled representations learned from correlated data. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 10401–10412). Virtual: ML Research Press.","ieee":"F. Träuble et al., “On disentangled representations learned from correlated data,” in Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 10401–10412.","ama":"Träuble F, Creager E, Kilbertus N, et al. On disentangled representations learned from correlated data. In: Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:10401-10412."},"date_published":"2021-08-01T00:00:00Z","alternative_title":["PMLR"],"type":"conference","abstract":[{"lang":"eng","text":"The focus of disentanglement approaches has been on identifying independent factors of variation in data. However, the causal variables underlying real-world observations are often not statistically independent. In this work, we bridge the gap to real-world scenarios by analyzing the behavior of the most prominent disentanglement approaches on correlated data in a large-scale empirical study (including 4260 models). We show and quantify that systematically induced correlations in the dataset are being learned and reflected in the latent representations, which has implications for downstream applications of disentanglement such as fairness. We also demonstrate how to resolve these latent correlations, either using weak supervision during\r\ntraining or by post-hoc correcting a pre-trained model with a small number of labels."}],"title":"On disentangled representations learned from correlated data","status":"public","intvolume":" 139","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14177","oa_version":"Published Version","month":"08","quality_controlled":"1","oa":1,"external_id":{"arxiv":["2006.07886"]},"main_file_link":[{"url":"https://arxiv.org/abs/2006.07886","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2021-07-24","start_date":"2021-07-18","location":"Virtual","name":"ICML: International Conference on Machine Learning"},"extern":"1","publication_status":"published","department":[{"_id":"FrLo"}],"publisher":"ML Research Press","year":"2021","date_updated":"2023-09-11T10:18:48Z","date_created":"2023-08-22T14:03:47Z","volume":139,"author":[{"last_name":"Träuble","first_name":"Frederik","full_name":"Träuble, Frederik"},{"first_name":"Elliot","last_name":"Creager","full_name":"Creager, Elliot"},{"full_name":"Kilbertus, Niki","last_name":"Kilbertus","first_name":"Niki"},{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco","full_name":"Locatello, Francesco"},{"full_name":"Dittadi, Andrea","last_name":"Dittadi","first_name":"Andrea"},{"last_name":"Goyal","first_name":"Anirudh","full_name":"Goyal, Anirudh"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"last_name":"Bauer","first_name":"Stefan","full_name":"Bauer, Stefan"}]},{"external_id":{"arxiv":["2106.05142"]},"main_file_link":[{"url":"https://arxiv.org/abs/2106.05142","open_access":"1"}],"oa":1,"quality_controlled":"1","conference":{"name":"International Conference on Machine Learning","start_date":"2021-07-18","location":"Virtual","end_date":"2021-07-24"},"language":[{"iso":"eng"}],"month":"08","year":"2021","publisher":"ML Research Press","department":[{"_id":"FrLo"}],"publication_status":"published","author":[{"last_name":"Yèche","first_name":"Hugo","full_name":"Yèche, Hugo"},{"last_name":"Dresdner","first_name":"Gideon","full_name":"Dresdner, Gideon"},{"last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"full_name":"Hüser, Matthias","last_name":"Hüser","first_name":"Matthias"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"}],"volume":139,"date_updated":"2023-09-11T10:16:55Z","date_created":"2023-08-22T14:03:04Z","extern":"1","citation":{"short":"H. Yèche, G. Dresdner, F. Locatello, M. Hüser, G. Rätsch, in:, Proceedings of 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 11964–11974.","mla":"Yèche, Hugo, et al. “Neighborhood Contrastive Learning Applied to Online Patient Monitoring.” Proceedings of 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 11964–74.","chicago":"Yèche, Hugo, Gideon Dresdner, Francesco Locatello, Matthias Hüser, and Gunnar Rätsch. “Neighborhood Contrastive Learning Applied to Online Patient Monitoring.” In Proceedings of 38th International Conference on Machine Learning, 139:11964–74. ML Research Press, 2021.","ama":"Yèche H, Dresdner G, Locatello F, Hüser M, Rätsch G. Neighborhood contrastive learning applied to online patient monitoring. In: Proceedings of 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:11964-11974.","apa":"Yèche, H., Dresdner, G., Locatello, F., Hüser, M., & Rätsch, G. (2021). Neighborhood contrastive learning applied to online patient monitoring. In Proceedings of 38th International Conference on Machine Learning (Vol. 139, pp. 11964–11974). Virtual: ML Research Press.","ieee":"H. Yèche, G. Dresdner, F. Locatello, M. Hüser, and G. Rätsch, “Neighborhood contrastive learning applied to online patient monitoring,” in Proceedings of 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 11964–11974.","ista":"Yèche H, Dresdner G, Locatello F, Hüser M, Rätsch G. 2021. Neighborhood contrastive learning applied to online patient monitoring. Proceedings of 38th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 139, 11964–11974."},"publication":"Proceedings of 38th International Conference on Machine Learning","page":"11964-11974","date_published":"2021-08-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","_id":"14176","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 139","title":"Neighborhood contrastive learning applied to online patient monitoring","status":"public","oa_version":"Preprint","type":"conference","alternative_title":["PMLR"],"abstract":[{"text":"Intensive care units (ICU) are increasingly looking towards machine learning for methods to provide online monitoring of critically ill patients. In machine learning, online monitoring is often formulated as a supervised learning problem. Recently, contrastive learning approaches have demonstrated promising improvements over competitive supervised benchmarks. These methods rely on well-understood data augmentation techniques developed for image data which do not apply to online monitoring. In this work, we overcome this limitation by\r\nsupplementing time-series data augmentation techniques with a novel contrastive\r\nlearning objective which we call neighborhood contrastive learning (NCL). Our objective explicitly groups together contiguous time segments from each patient while maintaining state-specific information. Our experiments demonstrate a marked improvement over existing work applying contrastive methods to medical time-series.","lang":"eng"}]},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.01057"}],"external_id":{"arxiv":["2107.01057"]},"citation":{"chicago":"Träuble, Frederik, Julius von Kügelgen, Matthäus Kleindessner, Francesco Locatello, Bernhard Schölkopf, and Peter Gehler. “Backward-Compatible Prediction Updates: A Probabilistic Approach.” In 35th Conference on Neural Information Processing Systems, 34:116–28, 2021.","mla":"Träuble, Frederik, et al. “Backward-Compatible Prediction Updates: A Probabilistic Approach.” 35th Conference on Neural Information Processing Systems, vol. 34, 2021, pp. 116–28.","short":"F. Träuble, J. von Kügelgen, M. Kleindessner, F. Locatello, B. Schölkopf, P. Gehler, in:, 35th Conference on Neural Information Processing Systems, 2021, pp. 116–128.","ista":"Träuble F, Kügelgen J von, Kleindessner M, Locatello F, Schölkopf B, Gehler P. 2021. Backward-compatible prediction updates: A probabilistic approach. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 116–128.","apa":"Träuble, F., Kügelgen, J. von, Kleindessner, M., Locatello, F., Schölkopf, B., & Gehler, P. (2021). Backward-compatible prediction updates: A probabilistic approach. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 116–128). Virtual.","ieee":"F. Träuble, J. von Kügelgen, M. Kleindessner, F. Locatello, B. Schölkopf, and P. Gehler, “Backward-compatible prediction updates: A probabilistic approach,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021, vol. 34, pp. 116–128.","ama":"Träuble F, Kügelgen J von, Kleindessner M, Locatello F, Schölkopf B, Gehler P. Backward-compatible prediction updates: A probabilistic approach. In: 35th Conference on Neural Information Processing Systems. Vol 34. ; 2021:116-128."},"oa":1,"publication":"35th Conference on Neural Information Processing Systems","page":"116-128","quality_controlled":"1","date_published":"2021-07-02T00:00:00Z","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","start_date":"2021-12-07","location":"Virtual"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781713845393"]},"article_processing_charge":"No","month":"07","day":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14182","year":"2021","department":[{"_id":"FrLo"}],"intvolume":" 34","title":"Backward-compatible prediction updates: A probabilistic approach","publication_status":"published","status":"public","author":[{"full_name":"Träuble, Frederik","first_name":"Frederik","last_name":"Träuble"},{"first_name":"Julius von","last_name":"Kügelgen","full_name":"Kügelgen, Julius von"},{"first_name":"Matthäus","last_name":"Kleindessner","full_name":"Kleindessner, Matthäus"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"first_name":"Peter","last_name":"Gehler","full_name":"Gehler, Peter"}],"volume":34,"oa_version":"Preprint","date_created":"2023-08-22T14:05:41Z","date_updated":"2023-09-11T11:31:59Z","type":"conference","abstract":[{"text":"When machine learning systems meet real world applications, accuracy is only\r\none of several requirements. In this paper, we assay a complementary\r\nperspective originating from the increasing availability of pre-trained and\r\nregularly improving state-of-the-art models. While new improved models develop\r\nat a fast pace, downstream tasks vary more slowly or stay constant. Assume that\r\nwe have a large unlabelled data set for which we want to maintain accurate\r\npredictions. Whenever a new and presumably better ML models becomes available,\r\nwe encounter two problems: (i) given a limited budget, which data points should\r\nbe re-evaluated using the new model?; and (ii) if the new predictions differ\r\nfrom the current ones, should we update? Problem (i) is about compute cost,\r\nwhich matters for very large data sets and models. Problem (ii) is about\r\nmaintaining consistency of the predictions, which can be highly relevant for\r\ndownstream applications; our demand is to avoid negative flips, i.e., changing\r\ncorrect to incorrect predictions. In this paper, we formalize the Prediction\r\nUpdate Problem and present an efficient probabilistic approach as answer to the\r\nabove questions. In extensive experiments on standard classification benchmark\r\ndata sets, we show that our method outperforms alternative strategies along key\r\nmetrics for backward-compatible prediction updates.","lang":"eng"}],"extern":"1"},{"month":"05","day":"19","publication_identifier":{"eisbn":["9780999241196"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"conference":{"start_date":"2021-08-19","location":"Montreal, Canada","end_date":"2021-08-27","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"doi":"10.24963/ijcai.2021/322","date_published":"2021-05-19T00:00:00Z","quality_controlled":"1","page":"2337-2343","publication":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","external_id":{"arxiv":["2105.09240"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2105.09240"}],"citation":{"ama":"Dresdner G, Shekhar S, Pedregosa F, Locatello F, Rätsch G. Boosting variational inference with locally adaptive step-sizes. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:2337-2343. doi:10.24963/ijcai.2021/322","ista":"Dresdner G, Shekhar S, Pedregosa F, Locatello F, Rätsch G. 2021. Boosting variational inference with locally adaptive step-sizes. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 2337–2343.","ieee":"G. Dresdner, S. Shekhar, F. Pedregosa, F. Locatello, and G. Rätsch, “Boosting variational inference with locally adaptive step-sizes,” in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, Montreal, Canada, 2021, pp. 2337–2343.","apa":"Dresdner, G., Shekhar, S., Pedregosa, F., Locatello, F., & Rätsch, G. (2021). Boosting variational inference with locally adaptive step-sizes. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (pp. 2337–2343). Montreal, Canada: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/322","mla":"Dresdner, Gideon, et al. “Boosting Variational Inference with Locally Adaptive Step-Sizes.” Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 2337–43, doi:10.24963/ijcai.2021/322.","short":"G. Dresdner, S. Shekhar, F. Pedregosa, F. Locatello, G. Rätsch, in:, Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 2337–2343.","chicago":"Dresdner, Gideon, Saurav Shekhar, Fabian Pedregosa, Francesco Locatello, and Gunnar Rätsch. “Boosting Variational Inference with Locally Adaptive Step-Sizes.” In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2337–43. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/322."},"extern":"1","abstract":[{"lang":"eng","text":"Variational Inference makes a trade-off between the capacity of the variational family and the tractability of finding an approximate posterior distribution. Instead, Boosting Variational Inference allows practitioners to obtain increasingly good posterior approximations by spending more compute. The main obstacle to widespread adoption of Boosting Variational Inference is the amount of resources necessary to improve over a strong Variational Inference baseline. In our work, we trace this limitation back to the global curvature of the KL-divergence. We characterize how the global curvature impacts time and memory consumption, address the problem with the notion of local curvature, and provide a novel approximate backtracking algorithm for estimating local curvature. We give new theoretical convergence rates for our algorithms and provide experimental validation on synthetic and real-world datasets."}],"type":"conference","date_created":"2023-08-22T14:05:14Z","date_updated":"2023-09-11T11:14:30Z","oa_version":"Published Version","author":[{"full_name":"Dresdner, Gideon","last_name":"Dresdner","first_name":"Gideon"},{"first_name":"Saurav","last_name":"Shekhar","full_name":"Shekhar, Saurav"},{"full_name":"Pedregosa, Fabian","first_name":"Fabian","last_name":"Pedregosa"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"}],"publication_status":"published","status":"public","title":"Boosting variational inference with locally adaptive step-sizes","publisher":"International Joint Conferences on Artificial Intelligence","department":[{"_id":"FrLo"}],"_id":"14181","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":34,"oa_version":"Preprint","date_updated":"2023-09-11T10:33:19Z","date_created":"2023-08-22T14:04:36Z","author":[{"full_name":"Kügelgen, Julius von","last_name":"Kügelgen","first_name":"Julius von"},{"full_name":"Sharma, Yash","first_name":"Yash","last_name":"Sharma"},{"full_name":"Gresele, Luigi","last_name":"Gresele","first_name":"Luigi"},{"full_name":"Brendel, Wieland","last_name":"Brendel","first_name":"Wieland"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"},{"first_name":"Michel","last_name":"Besserve","full_name":"Besserve, Michel"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"}],"department":[{"_id":"FrLo"}],"intvolume":" 34","publication_status":"published","title":"Self-supervised learning with data augmentations provably isolates content from style","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14179","year":"2021","extern":"1","abstract":[{"text":"Self-supervised representation learning has shown remarkable success in a number of domains. A common practice is to perform data augmentation via hand-crafted transformations intended to leave the semantics of the data invariant. We seek to understand the empirical success of this approach from a theoretical perspective. We formulate the augmentation process as a latent variable model by postulating a partition of the latent representation into a content component, which is assumed invariant to augmentation, and a style component, which is allowed to change. Unlike prior work on disentanglement and independent component analysis, we allow for both nontrivial statistical and causal dependencies in the latent space. We study the identifiability of the latent representation based on pairs of views of the observations and prove sufficient conditions that allow us to identify the invariant content partition up to an invertible mapping in both generative and discriminative settings. We find numerical simulations with dependent latent variables are consistent with our theory. Lastly, we introduce Causal3DIdent, a dataset of high-dimensional, visually complex images with rich causal dependencies, which we use to study the effect of data augmentations performed in practice.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"date_published":"2021-06-08T00:00:00Z","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-07","location":"Virtual","end_date":"2021-12-10"},"page":"16451-16467","quality_controlled":"1","oa":1,"external_id":{"arxiv":["2106.04619"]},"citation":{"ieee":"J. von Kügelgen et al., “Self-supervised learning with data augmentations provably isolates content from style,” in Advances in Neural Information Processing Systems, Virtual, 2021, vol. 34, pp. 16451–16467.","apa":"Kügelgen, J. von, Sharma, Y., Gresele, L., Brendel, W., Schölkopf, B., Besserve, M., & Locatello, F. (2021). Self-supervised learning with data augmentations provably isolates content from style. In Advances in Neural Information Processing Systems (Vol. 34, pp. 16451–16467). Virtual.","ista":"Kügelgen J von, Sharma Y, Gresele L, Brendel W, Schölkopf B, Besserve M, Locatello F. 2021. Self-supervised learning with data augmentations provably isolates content from style. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 16451–16467.","ama":"Kügelgen J von, Sharma Y, Gresele L, et al. Self-supervised learning with data augmentations provably isolates content from style. In: Advances in Neural Information Processing Systems. Vol 34. ; 2021:16451-16467.","chicago":"Kügelgen, Julius von, Yash Sharma, Luigi Gresele, Wieland Brendel, Bernhard Schölkopf, Michel Besserve, and Francesco Locatello. “Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style.” In Advances in Neural Information Processing Systems, 34:16451–67, 2021.","short":"J. von Kügelgen, Y. Sharma, L. Gresele, W. Brendel, B. Schölkopf, M. Besserve, F. Locatello, in:, Advances in Neural Information Processing Systems, 2021, pp. 16451–16467.","mla":"Kügelgen, Julius von, et al. “Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style.” Advances in Neural Information Processing Systems, vol. 34, 2021, pp. 16451–67."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2106.04619"}],"publication":"Advances in Neural Information Processing Systems","publication_identifier":{"isbn":["9781713845393"]},"article_processing_charge":"No","month":"06","day":"08"},{"extern":"1","abstract":[{"lang":"eng","text":"Modern neural network architectures can leverage large amounts of data to generalize well within the training distribution. However, they are less capable of systematic generalization to data drawn from unseen but related distributions, a feat that is hypothesized to require compositional reasoning and reuse of knowledge. In this work, we present Neural Interpreters, an architecture that factorizes inference in a self-attention network as a system of modules, which we call \\emph{functions}. Inputs to the model are routed through a sequence of functions in a way that is end-to-end learned. The proposed architecture can flexibly compose computation along width and depth, and lends itself well to capacity extension after training. To demonstrate the versatility of Neural Interpreters, we evaluate it in two distinct settings: image classification and visual abstract reasoning on Raven Progressive Matrices. In the former, we show that Neural Interpreters perform on par with the vision transformer using fewer parameters, while being transferrable to a new task in a sample efficient manner. In the latter, we find that Neural Interpreters are competitive with respect to the state-of-the-art in terms of systematic generalization. "}],"type":"conference","date_updated":"2023-09-11T11:33:46Z","date_created":"2023-08-22T14:04:55Z","oa_version":"Preprint","volume":34,"author":[{"full_name":"Rahaman, Nasim","first_name":"Nasim","last_name":"Rahaman"},{"last_name":"Gondal","first_name":"Muhammad Waleed","full_name":"Gondal, Muhammad Waleed"},{"last_name":"Joshi","first_name":"Shruti","full_name":"Joshi, Shruti"},{"full_name":"Gehler, Peter","last_name":"Gehler","first_name":"Peter"},{"full_name":"Bengio, Yoshua","first_name":"Yoshua","last_name":"Bengio"},{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"}],"title":"Dynamic inference with neural interpreters","status":"public","publication_status":"published","department":[{"_id":"FrLo"}],"intvolume":" 34","year":"2021","_id":"14180","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"12","month":"10","article_processing_charge":"No","publication_identifier":{"isbn":["9781713845393"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2021-12-10","location":"Virtual","start_date":"2021-12-07","name":"NeurIPS: Neural Information Processing Systems"},"date_published":"2021-10-12T00:00:00Z","quality_controlled":"1","page":"10985-10998","publication":"Advances in Neural Information Processing Systems","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2110.06399","open_access":"1"}],"external_id":{"arxiv":["2110.06399"]},"citation":{"chicago":"Rahaman, Nasim, Muhammad Waleed Gondal, Shruti Joshi, Peter Gehler, Yoshua Bengio, Francesco Locatello, and Bernhard Schölkopf. “Dynamic Inference with Neural Interpreters.” In Advances in Neural Information Processing Systems, 34:10985–98, 2021.","short":"N. Rahaman, M.W. Gondal, S. Joshi, P. Gehler, Y. Bengio, F. Locatello, B. Schölkopf, in:, Advances in Neural Information Processing Systems, 2021, pp. 10985–10998.","mla":"Rahaman, Nasim, et al. “Dynamic Inference with Neural Interpreters.” Advances in Neural Information Processing Systems, vol. 34, 2021, pp. 10985–98.","apa":"Rahaman, N., Gondal, M. W., Joshi, S., Gehler, P., Bengio, Y., Locatello, F., & Schölkopf, B. (2021). Dynamic inference with neural interpreters. In Advances in Neural Information Processing Systems (Vol. 34, pp. 10985–10998). Virtual.","ieee":"N. Rahaman et al., “Dynamic inference with neural interpreters,” in Advances in Neural Information Processing Systems, Virtual, 2021, vol. 34, pp. 10985–10998.","ista":"Rahaman N, Gondal MW, Joshi S, Gehler P, Bengio Y, Locatello F, Schölkopf B. 2021. Dynamic inference with neural interpreters. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 10985–10998.","ama":"Rahaman N, Gondal MW, Joshi S, et al. Dynamic inference with neural interpreters. In: Advances in Neural Information Processing Systems. Vol 34. ; 2021:10985-10998."},"oa":1},{"page":"612-634","article_type":"original","citation":{"chicago":"Scholkopf, Bernhard, Francesco Locatello, Stefan Bauer, Nan Rosemary Ke, Nal Kalchbrenner, Anirudh Goyal, and Yoshua Bengio. “Toward Causal Representation Learning.” Proceedings of the IEEE. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/jproc.2021.3058954.","short":"B. Scholkopf, F. Locatello, S. Bauer, N.R. Ke, N. Kalchbrenner, A. Goyal, Y. Bengio, Proceedings of the IEEE 109 (2021) 612–634.","mla":"Scholkopf, Bernhard, et al. “Toward Causal Representation Learning.” Proceedings of the IEEE, vol. 109, no. 5, Institute of Electrical and Electronics Engineers, 2021, pp. 612–34, doi:10.1109/jproc.2021.3058954.","ieee":"B. Scholkopf et al., “Toward causal representation learning,” Proceedings of the IEEE, vol. 109, no. 5. Institute of Electrical and Electronics Engineers, pp. 612–634, 2021.","apa":"Scholkopf, B., Locatello, F., Bauer, S., Ke, N. R., Kalchbrenner, N., Goyal, A., & Bengio, Y. (2021). Toward causal representation learning. Proceedings of the IEEE. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/jproc.2021.3058954","ista":"Scholkopf B, Locatello F, Bauer S, Ke NR, Kalchbrenner N, Goyal A, Bengio Y. 2021. Toward causal representation learning. Proceedings of the IEEE. 109(5), 612–634.","ama":"Scholkopf B, Locatello F, Bauer S, et al. Toward causal representation learning. Proceedings of the IEEE. 2021;109(5):612-634. doi:10.1109/jproc.2021.3058954"},"publication":"Proceedings of the IEEE","date_published":"2021-05-01T00:00:00Z","keyword":["Electrical and Electronic Engineering"],"scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 109","status":"public","title":"Toward causal representation learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14117","oa_version":"Published Version","type":"journal_article","issue":"5","abstract":[{"text":"The two fields of machine learning and graphical causality arose and are developed separately. However, there is, now, cross-pollination and increasing interest in both fields to benefit from the advances of the other. In this article, we review fundamental concepts of causal inference and relate them to crucial open problems of machine learning, including transfer and generalization, thereby assaying how causality can contribute to modern machine learning research. This also applies in the opposite direction: we note that most work in causality starts from the premise that the causal variables are given. A central problem for AI and causality is, thus, causal representation learning, that is, the discovery of high-level causal variables from low-level observations. Finally, we delineate some implications of causality for machine learning and propose key research areas at the intersection of both communities.","lang":"eng"}],"quality_controlled":"1","external_id":{"arxiv":["2102.11107"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1109/JPROC.2021.3058954"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/jproc.2021.3058954","publication_identifier":{"eissn":["1558-2256"],"issn":["0018-9219"]},"month":"05","department":[{"_id":"FrLo"}],"publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","year":"2021","volume":109,"date_updated":"2023-09-11T11:43:35Z","date_created":"2023-08-21T12:19:30Z","author":[{"first_name":"Bernhard","last_name":"Scholkopf","full_name":"Scholkopf, Bernhard"},{"full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"last_name":"Bauer","first_name":"Stefan","full_name":"Bauer, Stefan"},{"first_name":"Nan Rosemary","last_name":"Ke","full_name":"Ke, Nan Rosemary"},{"full_name":"Kalchbrenner, Nal","first_name":"Nal","last_name":"Kalchbrenner"},{"full_name":"Goyal, Anirudh","last_name":"Goyal","first_name":"Anirudh"},{"full_name":"Bengio, Yoshua","last_name":"Bengio","first_name":"Yoshua"}],"extern":"1"},{"title":"On the transfer of disentangled representations in realistic settings","publication_status":"published","status":"public","department":[{"_id":"FrLo"}],"_id":"14178","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","date_updated":"2023-09-11T10:55:30Z","date_created":"2023-08-22T14:04:16Z","oa_version":"Preprint","author":[{"full_name":"Dittadi, Andrea","first_name":"Andrea","last_name":"Dittadi"},{"full_name":"Träuble, Frederik","first_name":"Frederik","last_name":"Träuble"},{"full_name":"Locatello, Francesco","last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Manuel","last_name":"Wüthrich","full_name":"Wüthrich, Manuel"},{"first_name":"Vaibhav","last_name":"Agrawal","full_name":"Agrawal, Vaibhav"},{"full_name":"Winther, Ole","first_name":"Ole","last_name":"Winther"},{"full_name":"Bauer, Stefan","last_name":"Bauer","first_name":"Stefan"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"}],"type":"conference","extern":"1","abstract":[{"text":"Learning meaningful representations that disentangle the underlying structure of the data generating process is considered to be of key importance in machine learning. While disentangled representations were found to be useful for diverse tasks such as abstract reasoning and fair classification, their scalability and real-world impact remain questionable. We introduce a new high-resolution dataset with 1M simulated images and over 1,800 annotated real-world images of the same setup. In contrast to previous work, this new dataset exhibits correlations, a complex underlying structure, and allows to evaluate transfer to unseen simulated and real-world settings where the encoder i) remains in distribution or ii) is out of distribution. We propose new architectures in order to scale disentangled representation learning to realistic high-resolution settings and conduct a large-scale empirical study of disentangled representations on this dataset. We observe that disentanglement is a good predictor for out-of-distribution (OOD) task performance.","lang":"eng"}],"quality_controlled":"1","publication":"The Ninth International Conference on Learning Representations","main_file_link":[{"url":"https://arxiv.org/abs/2010.14407","open_access":"1"}],"oa":1,"citation":{"mla":"Dittadi, Andrea, et al. “On the Transfer of Disentangled Representations in Realistic Settings.” The Ninth International Conference on Learning Representations, 2021.","short":"A. Dittadi, F. Träuble, F. Locatello, M. Wüthrich, V. Agrawal, O. Winther, S. Bauer, B. Schölkopf, in:, The Ninth International Conference on Learning Representations, 2021.","chicago":"Dittadi, Andrea, Frederik Träuble, Francesco Locatello, Manuel Wüthrich, Vaibhav Agrawal, Ole Winther, Stefan Bauer, and Bernhard Schölkopf. “On the Transfer of Disentangled Representations in Realistic Settings.” In The Ninth International Conference on Learning Representations, 2021.","ama":"Dittadi A, Träuble F, Locatello F, et al. On the transfer of disentangled representations in realistic settings. In: The Ninth International Conference on Learning Representations. ; 2021.","ista":"Dittadi A, Träuble F, Locatello F, Wüthrich M, Agrawal V, Winther O, Bauer S, Schölkopf B. 2021. On the transfer of disentangled representations in realistic settings. The Ninth International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Dittadi, A., Träuble, F., Locatello, F., Wüthrich, M., Agrawal, V., Winther, O., … Schölkopf, B. (2021). On the transfer of disentangled representations in realistic settings. In The Ninth International Conference on Learning Representations. Virtual.","ieee":"A. Dittadi et al., “On the transfer of disentangled representations in realistic settings,” in The Ninth International Conference on Learning Representations, Virtual, 2021."},"external_id":{"arxiv":["2010.14407"]},"language":[{"iso":"eng"}],"conference":{"location":"Virtual","start_date":"2021-05-03","end_date":"2021-05-07","name":"ICLR: International Conference on Learning Representations"},"date_published":"2021-05-04T00:00:00Z","month":"05","day":"04","article_processing_charge":"No"},{"doi":"10.48550/arXiv.2111.13693","date_published":"2021-11-26T00:00:00Z","language":[{"iso":"eng"}],"publication":"arXiv","external_id":{"arxiv":["2111.13693"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.13693"}],"oa":1,"citation":{"ama":"Locatello F. Enforcing and discovering structure in machine learning. arXiv. doi:10.48550/arXiv.2111.13693","ista":"Locatello F. Enforcing and discovering structure in machine learning. arXiv, 2111.13693.","apa":"Locatello, F. (n.d.). Enforcing and discovering structure in machine learning. arXiv. https://doi.org/10.48550/arXiv.2111.13693","ieee":"F. Locatello, “Enforcing and discovering structure in machine learning,” arXiv. .","mla":"Locatello, Francesco. “Enforcing and Discovering Structure in Machine Learning.” ArXiv, 2111.13693, doi:10.48550/arXiv.2111.13693.","short":"F. Locatello, ArXiv (n.d.).","chicago":"Locatello, Francesco. “Enforcing and Discovering Structure in Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2111.13693."},"day":"26","month":"11","article_processing_charge":"No","author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"}],"date_created":"2023-08-22T14:23:35Z","date_updated":"2023-09-12T07:04:44Z","oa_version":"Preprint","_id":"14221","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","status":"public","title":"Enforcing and discovering structure in machine learning","publication_status":"submitted","department":[{"_id":"FrLo"}],"abstract":[{"lang":"eng","text":"The world is structured in countless ways. It may be prudent to enforce corresponding structural properties to a learning algorithm's solution, such as incorporating prior beliefs, natural constraints, or causal structures. Doing so may translate to faster, more accurate, and more flexible models, which may directly relate to real-world impact. In this dissertation, we consider two different research areas that concern structuring a learning algorithm's solution: when the structure is known and when it has to be discovered."}],"extern":"1","article_number":"2111.13693","type":"preprint"},{"doi":"10.48550/ARXIV.2111.12171","date_published":"2021-11-23T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ista":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv, 2111.12171.","apa":"Koval, I. (n.d.). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv. https://doi.org/10.48550/ARXIV.2111.12171","ieee":"I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” arXiv. .","ama":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv. doi:10.48550/ARXIV.2111.12171","chicago":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2111.12171.","mla":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” ArXiv, 2111.12171, doi:10.48550/ARXIV.2111.12171.","short":"I. Koval, ArXiv (n.d.)."},"oa":1,"external_id":{"arxiv":["2111.12171"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.12171"}],"publication":"arXiv","article_processing_charge":"No","month":"11","day":"23","author":[{"first_name":"Illya","last_name":"Koval","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e","full_name":"Koval, Illya"}],"oa_version":"Preprint","date_updated":"2023-09-15T06:44:00Z","date_created":"2023-09-06T08:35:43Z","_id":"14278","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"}],"status":"public","title":"Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse","publication_status":"submitted","abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral rigidity of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish rigidity for almost all of them.","lang":"eng"}],"type":"preprint","article_number":"2111.12171"},{"file_date_updated":"2021-11-09T09:00:50Z","ec_funded":1,"year":"2021","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"author":[{"full_name":"Toman, Viktor","last_name":"Toman","first_name":"Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"10190","relation":"part_of_dissertation","status":"public"},{"id":"10191","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9987"},{"id":"141","status":"public","relation":"part_of_dissertation"}]},"date_created":"2021-10-29T20:09:01Z","date_updated":"2023-09-19T09:59:54Z","month":"10","publication_identifier":{"issn":["2663-337X"]},"oa":1,"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"doi":"10.15479/at:ista:10199","supervisor":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"SSU"}],"language":[{"iso":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.","lang":"eng"}],"_id":"10199","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["000"],"title":"Improved verification techniques for concurrent systems","status":"public","file":[{"file_id":"10225","relation":"main_file","date_created":"2021-11-08T14:12:22Z","date_updated":"2021-11-08T14:12:22Z","checksum":"4f412a1ee60952221b499a4b1268df35","file_name":"toman_th_final.pdf","access_level":"open_access","creator":"vtoman","file_size":2915234,"content_type":"application/pdf"},{"creator":"vtoman","content_type":"application/zip","file_size":8616056,"access_level":"closed","file_name":"toman_thesis.zip","checksum":"9584943f99127be2dd2963f6784c37d4","date_created":"2021-11-08T14:12:46Z","date_updated":"2021-11-09T09:00:50Z","file_id":"10226","relation":"source_file"}],"oa_version":"Published Version","keyword":["concurrency","verification","model checking"],"day":"31","has_accepted_license":"1","article_processing_charge":"No","citation":{"chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","mla":"Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.","apa":"Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199"},"page":"166","date_published":"2021-10-31T00:00:00Z"}]