[{"page":"xviii+120","doi":"10.15479/AT:ISTA:8032","date_published":"2020-06-26T00:00:00Z","date_created":"2020-06-26T10:00:36Z","has_accepted_license":"1","year":"2020","day":"26","publisher":"Institute of Science and Technology Austria","oa":1,"author":[{"last_name":"Huszár","orcid":"0000-0002-5445-5057","full_name":"Huszár, Kristóf","id":"33C26278-F248-11E8-B48F-1D18A9856A87","first_name":"Kristóf"}],"article_processing_charge":"No","title":"Combinatorial width parameters for 3-dimensional manifolds","citation":{"mla":"Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.","ieee":"K. Huszár, “Combinatorial width parameters for 3-dimensional manifolds,” Institute of Science and Technology Austria, 2020.","short":"K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020.","ama":"Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020. doi:10.15479/AT:ISTA:8032","apa":"Huszár, K. (2020). Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8032","chicago":"Huszár, Kristóf. “Combinatorial Width Parameters for 3-Dimensional Manifolds.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8032.","ista":"Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","id":"6556","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"7093","status":"public"}]},"license":"https://creativecommons.org/licenses/by/4.0/","publication_identifier":{"isbn":["978-3-99078-006-0"],"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"date_created":"2020-06-26T10:03:58Z","file_name":"Kristof_Huszar-Thesis.pdf","date_updated":"2020-07-14T12:48:08Z","file_size":2637562,"creator":"khuszar","file_id":"8034","checksum":"bd8be6e4f1addc863dfcc0fad29ee9c3","content_type":"application/pdf","access_level":"open_access","relation":"main_file"},{"file_size":7163491,"date_updated":"2020-07-14T12:48:08Z","creator":"khuszar","file_name":"Kristof_Huszar-Thesis-source.zip","date_created":"2020-06-26T10:10:06Z","content_type":"application/x-zip-compressed","relation":"source_file","access_level":"closed","file_id":"8035","checksum":"d5f8456202b32f4a77552ef47a2837d1"}],"language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"month":"06","abstract":[{"text":"Algorithms in computational 3-manifold topology typically take a triangulation as an input and return topological information about the underlying 3-manifold. However, extracting the desired information from a triangulation (e.g., evaluating an invariant) is often computationally very expensive. In recent years this complexity barrier has been successfully tackled in some cases by importing ideas from the theory of parameterized algorithms into the realm of 3-manifolds. Various computationally hard problems were shown to be efficiently solvable for input triangulations that are sufficiently “tree-like.”\r\nIn this thesis we focus on the key combinatorial parameter in the above context: we consider the treewidth of a compact, orientable 3-manifold, i.e., the smallest treewidth of the dual graph of any triangulation thereof. By building on the work of Scharlemann–Thompson and Scharlemann–Schultens–Saito on generalized Heegaard splittings, and on the work of Jaco–Rubinstein on layered triangulations, we establish quantitative relations between the treewidth and classical topological invariants of a 3-manifold. In particular, among other results, we show that the treewidth of a closed, orientable, irreducible, non-Haken 3-manifold is always within a constant factor of its Heegaard genus.","lang":"eng"}],"acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:48:08Z","department":[{"_id":"UlWa"}],"supervisor":[{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner"},{"first_name":"Jonathan","last_name":"Spreer","full_name":"Spreer, Jonathan"}],"date_updated":"2023-09-07T13:18:27Z","ddc":["514"],"type":"dissertation","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"8032"},{"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"Computer Aided Verification","day":"14","year":"2020","has_accepted_license":"1","isi":1,"date_created":"2020-08-03T11:45:35Z","date_published":"2020-07-14T00:00:00Z","doi":"10.1007/978-3-030-53288-8_14","page":"275-298","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298. doi:10.1007/978-3-030-53288-8_14","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14."},"title":"Refinement for structured concurrent programs","article_processing_charge":"No","external_id":{"isi":["000695276000014"]},"author":[{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"oa_version":"Published Version","abstract":[{"text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier.","lang":"eng"}],"intvolume":" 12224","month":"07","alternative_title":["LNCS"],"scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_id":"8201","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-08-06T08:14:54Z","file_name":"2020_LNCS_Kragl.pdf","creator":"dernst","date_updated":"2020-08-06T08:14:54Z","file_size":804237}],"publication_status":"published","publication_identifier":{"eisbn":["9783030532888"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030532871"]},"related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]},"volume":12224,"_id":"8195","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","ddc":["000"],"date_updated":"2023-09-07T13:18:00Z","file_date_updated":"2020-08-06T08:14:54Z","department":[{"_id":"ToHe"}]},{"citation":{"ama":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. Inductive sequentialization of asynchronous programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:227-242. doi:10.1145/3385412.3385980","apa":"Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., & Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 227–242). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385980","ieee":"B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 227–242.","short":"B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–242.","mla":"Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–42, doi:10.1145/3385412.3385980.","ista":"Kragl B, Enea C, Henzinger TA, Mutluergil SO, Qadeer S. 2020. Inductive sequentialization of asynchronous programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 227–242.","chicago":"Kragl, Bernhard, Constantin Enea, Thomas A Henzinger, Suha Orhun Mutluergil, and Shaz Qadeer. “Inductive Sequentialization of Asynchronous Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 227–42. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385980."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl"},{"first_name":"Constantin","full_name":"Enea, Constantin","last_name":"Enea"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Mutluergil, Suha Orhun","last_name":"Mutluergil","first_name":"Suha Orhun"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"article_processing_charge":"No","external_id":{"isi":["000614622300016"]},"title":"Inductive sequentialization of asynchronous programs","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"isi":1,"year":"2020","day":"01","publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation","page":"227-242","date_published":"2020-06-01T00:00:00Z","doi":"10.1145/3385412.3385980","date_created":"2020-06-25T11:40:16Z","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"date_updated":"2023-09-07T13:18:00Z","department":[{"_id":"ToHe"}],"_id":"8012","type":"conference","conference":{"start_date":"2020-06-15","end_date":"2020-06-20","location":"London, United Kingdom","name":"PLDI: Programming Language Design and Implementation"},"status":"public","publication_identifier":{"isbn":["9781450376136"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8332"}]},"abstract":[{"lang":"eng","text":"Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a nondeterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, two-phase commit, and Paxos."}],"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1145/3385412.3385980","open_access":"1"}],"month":"06"},{"type":"dissertation","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"8358","department":[{"_id":"MaLo"}],"file_date_updated":"2020-09-11T07:48:10Z","supervisor":[{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724"}],"date_updated":"2023-09-07T13:18:51Z","ddc":["572"],"alternative_title":["ISTA Thesis"],"month":"09","abstract":[{"lang":"eng","text":"During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This so-called Z-ring acts as a scaffold recruiting several division-related proteins to mid-cell and plays a key role in distributing proteins at the division site, a feature driven by the treadmilling motion of FtsZ filaments around the septum. What regulates the architecture, dynamics and stability of the Z-ring is still poorly understood, but FtsZ-associated proteins (Zaps) are known to play an important role. \r\nAdvances in fluorescence microscopy and in vitro reconstitution experiments have helped to shed light into some of the dynamic properties of these complex systems, but methods that allow to collect and analyze large quantitative data sets of the underlying polymer dynamics are still missing.\r\nHere, using an in vitro reconstitution approach, we studied how different Zaps affect FtsZ filament dynamics and organization into large-scale patterns, giving special emphasis to the role of the well-conserved protein ZapA. For this purpose, we use high-resolution fluorescence microscopy combined with novel image analysis workfows to study pattern organization and polymerization dynamics of active filaments. We quantified the influence of Zaps on FtsZ on three diferent spatial scales: the large-scale organization of the membrane-bound filament network, the underlying\r\npolymerization dynamics and the behavior of single molecules.\r\nWe found that ZapA cooperatively increases the spatial order of the filament network, binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a\r\nswitch-like manner, without compromising filament dynamics. Furthermore, we believe that our automated quantitative methods can be used to analyze a large variety of dynamic cytoskeletal systems, using standard time-lapse\r\nmovies of homogeneously labeled proteins obtained from experiments in vitro or even inside the living cell.\r\n"}],"acknowledged_ssus":[{"_id":"Bio"}],"oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"7572","relation":"dissertation_contains"},{"relation":"part_of_dissertation","id":"7197","status":"public"}]},"publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8364","checksum":"882f93fe9c351962120e2669b84bf088","success":1,"date_updated":"2020-09-10T12:11:29Z","file_size":141602462,"creator":"pcaldas","date_created":"2020-09-10T12:11:29Z","file_name":"phd_thesis_pcaldas.pdf"},{"date_created":"2020-09-10T12:18:17Z","file_name":"phd_thesis_latex_pcaldas.zip","creator":"pcaldas","date_updated":"2020-09-11T07:48:10Z","file_size":450437458,"file_id":"8365","checksum":"70cc9e399c4e41e6e6ac445ae55e8558","access_level":"closed","relation":"source_file","content_type":"application/x-zip-compressed"}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-6730-4461","full_name":"Dos Santos Caldas, Paulo R","last_name":"Dos Santos Caldas","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","first_name":"Paulo R"}],"article_processing_charge":"No","title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","citation":{"apa":"Dos Santos Caldas, P. R. (2020). Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8358","ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:10.15479/AT:ISTA:8358","ieee":"P. R. Dos Santos Caldas, “Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers,” Institute of Science and Technology Austria, 2020.","short":"P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020.","mla":"Dos Santos Caldas, Paulo R. Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8358.","ista":"Dos Santos Caldas PR. 2020. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria.","chicago":"Dos Santos Caldas, Paulo R. “Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8358."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Institute of Science and Technology Austria","oa":1,"acknowledgement":"I should also express my gratitude to the bioimaging facility at IST Austria, for their assistance with the TIRF setup over the years, and especially to Christoph Sommer, who gave me a lot of input when I was starting to dive into programming.","page":"135","date_published":"2020-09-10T00:00:00Z","doi":"10.15479/AT:ISTA:8358","date_created":"2020-09-10T09:26:49Z","has_accepted_license":"1","year":"2020","day":"10"},{"article_processing_charge":"No","author":[{"last_name":"Osang","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rouxel-Labbé","full_name":"Rouxel-Labbé, Mael","first_name":"Mael"},{"first_name":"Monique","full_name":"Teillaud, Monique","last_name":"Teillaud"}],"title":"Generalizing CGAL periodic Delaunay triangulations","citation":{"ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in 28th Annual European Symposium on Algorithms, Virtual, Online; Pisa, Italy, 2020, vol. 173.","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","apa":"Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75","mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” 28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.75."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"article_number":"75","date_created":"2020-10-25T23:01:18Z","doi":"10.4230/LIPIcs.ESA.2020.75","date_published":"2020-08-26T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"28th Annual European Symposium on Algorithms","day":"26","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-10-27T14:31:52Z","department":[{"_id":"HeEd"}],"date_updated":"2023-09-07T13:29:00Z","ddc":["000"],"conference":{"name":"ESA: Annual European Symposium on Algorithms","start_date":"2020-09-07","end_date":"2020-09-09","location":"Virtual, Online; Pisa, Italy"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public","_id":"8703","license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"volume":173,"related_material":{"record":[{"id":"9056","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771627"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-10-27T14:31:52Z","file_size":733291,"creator":"cziletti","date_created":"2020-10-27T14:31:52Z","file_name":"2020_LIPIcs_Osang.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8712","checksum":"fe0f7c49a99ed870c671b911e10d5496","success":1}],"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 173","month":"08","abstract":[{"lang":"eng","text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. "}],"oa_version":"Published Version"},{"month":"04","oa":1,"quality_controlled":"1","oa_version":"Published Version","abstract":[{"text":"We address the following question: How redundant is the parameterisation of ReLU networks? Specifically, we consider transformations of the weight space which leave the function implemented by the network intact. Two such transformations are known for feed-forward architectures: permutation of neurons within a layer, and positive scaling of all incoming weights of a neuron coupled with inverse scaling of its outgoing weights. In this work, we show for architectures with non-increasing widths that permutation and scaling are in fact the only function-preserving weight transformations. For any eligible architecture we give an explicit construction of a neural network such that any other network that implements the same function can be obtained from the original one by the application of permutations and rescaling. The proof relies on a geometric understanding of boundaries between linear regions of ReLU networks, and we hope the developed mathematical tools are of independent interest.","lang":"eng"}],"date_created":"2020-02-11T09:07:37Z","related_material":{"record":[{"id":"9418","status":"public","relation":"dissertation_contains"}],"link":[{"relation":"supplementary_material","url":"https://iclr.cc/virtual_2020/poster_Bylx-TNKvH.html"}]},"date_published":"2020-04-26T00:00:00Z","language":[{"iso":"eng"}],"publication":"8th International Conference on Learning Representations","day":"26","file":[{"creator":"bphuong","file_size":405469,"date_updated":"2020-07-14T12:47:59Z","file_name":"main.pdf","date_created":"2020-02-11T09:07:27Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"7482","checksum":"8d372ea5defd8cb8fdc430111ed754a9"}],"year":"2020","publication_status":"published","has_accepted_license":"1","status":"public","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-27","location":"Online","end_date":"2020-04-30"},"type":"conference","_id":"7481","department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-14T12:47:59Z","title":"Functional vs. parametric equivalence of ReLU networks","article_processing_charge":"No","author":[{"first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2023-09-07T13:29:50Z","citation":{"mla":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” 8th International Conference on Learning Representations, 2020.","ieee":"M. Phuong and C. Lampert, “Functional vs. parametric equivalence of ReLU networks,” in 8th International Conference on Learning Representations, Online, 2020.","short":"M. Phuong, C. Lampert, in:, 8th International Conference on Learning Representations, 2020.","ama":"Phuong M, Lampert C. Functional vs. parametric equivalence of ReLU networks. In: 8th International Conference on Learning Representations. ; 2020.","apa":"Phuong, M., & Lampert, C. (2020). Functional vs. parametric equivalence of ReLU networks. In 8th International Conference on Learning Representations. Online.","chicago":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” In 8th International Conference on Learning Representations, 2020.","ista":"Phuong M, Lampert C. 2020. Functional vs. parametric equivalence of ReLU networks. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations."}},{"publication_status":"published","publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"related_material":{"record":[{"id":"9733","status":"public","relation":"dissertation_contains"}]},"volume":52,"issue":"1","abstract":[{"lang":"eng","text":"We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers, and a quadratic lower bound in terms of the distance to the minimizer. The latter follows from nondegeneracy of the Hessian at the minimum."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.08647"}],"scopus_import":"1","intvolume":" 52","month":"02","date_updated":"2023-09-07T13:30:11Z","ddc":["510"],"department":[{"_id":"RoSe"}],"_id":"9781","tmp":{"short":"CC BY-NC-ND (4.0)","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","image":"/images/cc_by_nc_nd.png"},"article_type":"original","type":"journal_article","keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"status":"public","year":"2020","has_accepted_license":"1","isi":1,"publication":"SIAM Journal on Mathematical Analysis","day":"12","page":"605-622","date_created":"2021-08-06T07:34:16Z","doi":"10.1137/19m126284x","date_published":"2020-02-12T00:00:00Z","acknowledgement":"We are grateful for the hospitality at the Mittag-Leffler Institute, where part of this work has been done. The work of the authors was supported by the European Research Council (ERC)under the European Union's Horizon 2020 research and innovation programme grant 694227.","oa":1,"publisher":"Society for Industrial & Applied Mathematics ","quality_controlled":"1","citation":{"mla":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical Analysis, vol. 52, no. 1, Society for Industrial & Applied Mathematics , 2020, pp. 605–22, doi:10.1137/19m126284x.","ieee":"D. Feliciangeli and R. Seiringer, “Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball,” SIAM Journal on Mathematical Analysis, vol. 52, no. 1. Society for Industrial & Applied Mathematics , pp. 605–622, 2020.","short":"D. Feliciangeli, R. Seiringer, SIAM Journal on Mathematical Analysis 52 (2020) 605–622.","ama":"Feliciangeli D, Seiringer R. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 2020;52(1):605-622. doi:10.1137/19m126284x","apa":"Feliciangeli, D., & Seiringer, R. (2020). Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. Society for Industrial & Applied Mathematics . https://doi.org/10.1137/19m126284x","chicago":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical Analysis. Society for Industrial & Applied Mathematics , 2020. https://doi.org/10.1137/19m126284x.","ista":"Feliciangeli D, Seiringer R. 2020. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 52(1), 605–622."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000546967700022"],"arxiv":["1904.08647 "]},"article_processing_charge":"No","author":[{"full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario"},{"last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"title":"Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball","project":[{"grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"scopus_import":"1","month":"05","intvolume":" 236","abstract":[{"text":"In the present work, we consider the evolution of two fluids separated by a sharp interface in the presence of surface tension—like, for example, the evolution of oil bubbles in water. Our main result is a weak–strong uniqueness principle for the corresponding free boundary problem for the incompressible Navier–Stokes equation: as long as a strong solution exists, any varifold solution must coincide with it. In particular, in the absence of physical singularities, the concept of varifold solutions—whose global in time existence has been shown by Abels (Interfaces Free Bound 9(1):31–65, 2007) for general initial data—does not introduce a mechanism for non-uniqueness. The key ingredient of our approach is the construction of a relative entropy functional capable of controlling the interface error. If the viscosities of the two fluids do not coincide, even for classical (strong) solutions the gradient of the velocity field becomes discontinuous at the interface, introducing the need for a careful additional adaption of the relative entropy.","lang":"eng"}],"oa_version":"Published Version","volume":236,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10007"}]},"ec_funded":1,"publication_identifier":{"eissn":["14320673"],"issn":["00039527"]},"publication_status":"published","file":[{"success":1,"checksum":"f107e21b58f5930876f47144be37cf6c","file_id":"8779","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_ArchRatMechAn_Fischer.pdf","date_created":"2020-11-20T09:14:22Z","creator":"dernst","file_size":1897571,"date_updated":"2020-11-20T09:14:22Z"}],"language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"7489","file_date_updated":"2020-11-20T09:14:22Z","department":[{"_id":"JuFi"}],"date_updated":"2023-09-07T13:30:45Z","ddc":["530","532"],"publisher":"Springer Nature","quality_controlled":"1","oa":1,"page":"967-1087","date_published":"2020-05-01T00:00:00Z","doi":"10.1007/s00205-019-01486-2","date_created":"2020-02-16T23:00:50Z","isi":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"Archive for Rational Mechanics and Analysis","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"author":[{"full_name":"Fischer, Julian L","orcid":"0000-0002-0479-558X","last_name":"Fischer","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hensel","orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000511060200001"]},"title":"Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension","citation":{"ista":"Fischer JL, Hensel S. 2020. Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension. Archive for Rational Mechanics and Analysis. 236, 967–1087.","chicago":"Fischer, Julian L, and Sebastian Hensel. “Weak–Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Surface Tension.” Archive for Rational Mechanics and Analysis. Springer Nature, 2020. https://doi.org/10.1007/s00205-019-01486-2.","ieee":"J. L. Fischer and S. Hensel, “Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension,” Archive for Rational Mechanics and Analysis, vol. 236. Springer Nature, pp. 967–1087, 2020.","short":"J.L. Fischer, S. Hensel, Archive for Rational Mechanics and Analysis 236 (2020) 967–1087.","apa":"Fischer, J. L., & Hensel, S. (2020). Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-019-01486-2","ama":"Fischer JL, Hensel S. Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface tension. Archive for Rational Mechanics and Analysis. 2020;236:967-1087. doi:10.1007/s00205-019-01486-2","mla":"Fischer, Julian L., and Sebastian Hensel. “Weak–Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Surface Tension.” Archive for Rational Mechanics and Analysis, vol. 236, Springer Nature, 2020, pp. 967–1087, doi:10.1007/s00205-019-01486-2."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"_id":"10012","article_number":"2003.05478","type":"preprint","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"status":"public","citation":{"apa":"Fischer, J. L., Hensel, S., Laux, T., & Simon, T. (n.d.). The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv.","ama":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv.","ieee":"J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions,” arXiv. .","short":"J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).","mla":"Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, 2003.05478.","ista":"Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions. arXiv, 2003.05478.","chicago":"Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.” ArXiv, n.d."},"date_updated":"2023-09-07T13:30:45Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","last_name":"Fischer","full_name":"Fischer, Julian L","orcid":"0000-0002-0479-558X"},{"first_name":"Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072","full_name":"Hensel, Sebastian","last_name":"Hensel"},{"full_name":"Laux, Tim","last_name":"Laux","first_name":"Tim"},{"first_name":"Thilo","full_name":"Simon, Thilo","last_name":"Simon"}],"external_id":{"arxiv":["2003.05478"]},"article_processing_charge":"No","title":"The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions","department":[{"_id":"JuFi"}],"abstract":[{"text":"We prove that in the absence of topological changes, the notion of BV solutions to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical) non-uniqueness. Our approach is based on the local structure of the energy landscape near a classical evolution by mean curvature. Mean curvature flow being the gradient flow of the surface energy functional, we develop a gradient-flow analogue of the notion of calibrations. Just like the existence of a calibration guarantees that one has reached a global minimum in the energy landscape, the existence of a \"gradient flow calibration\" ensures that the route of steepest descent in the energy landscape is unique and stable.","lang":"eng"}],"oa_version":"Preprint","acknowledgement":"Parts of the paper were written during the visit of the authors to the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the framework of the trimester program “Evolution of Interfaces”. The support and the hospitality of HIM are gratefully acknowledged. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385.","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2003.05478"}],"month":"03","year":"2020","publication_status":"submitted","day":"11","language":[{"iso":"eng"}],"publication":"arXiv","related_material":{"record":[{"id":"10007","status":"public","relation":"dissertation_contains"}]},"date_published":"2020-03-11T00:00:00Z","date_created":"2021-09-13T12:17:11Z","ec_funded":1},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., & Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. American Physical Society. https://doi.org/10.1103/PhysRevApplied.14.044055","ama":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. 2020;14(4). doi:10.1103/PhysRevApplied.14.044055","short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, Physical Review Applied 14 (2020).","ieee":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor,” Physical Review Applied, vol. 14, no. 4. American Physical Society, 2020.","mla":"Peruzzo, Matilda, et al. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Physical Review Applied, vol. 14, no. 4, 044055, American Physical Society, 2020, doi:10.1103/PhysRevApplied.14.044055.","ista":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. 14(4), 044055.","chicago":"Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Physical Review Applied. American Physical Society, 2020. https://doi.org/10.1103/PhysRevApplied.14.044055."},"title":"Surpassing the resistance quantum with a geometric superinductor","external_id":{"arxiv":["2007.01644"],"isi":["000582797300003"]},"article_processing_charge":"No","author":[{"last_name":"Peruzzo","orcid":"0000-0002-3415-4628","full_name":"Peruzzo, Matilda","first_name":"Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Trioni","full_name":"Trioni, Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea"},{"orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid","last_name":"Hassani","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid"},{"last_name":"Zemlicka","full_name":"Zemlicka, Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"article_number":"044055","project":[{"call_identifier":"FWF","_id":"26927A52-B435-11E9-9278-68D0E5697425","grant_number":"F07105","name":"Integrating superconducting quantum circuits"},{"name":"Hybrid Optomechanical Technologies","grant_number":"732894","call_identifier":"H2020","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"name":"Quantum readout techniques and technologies","grant_number":"862644","_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020"},{"name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"}],"publication":"Physical Review Applied","day":"29","year":"2020","has_accepted_license":"1","isi":1,"date_created":"2020-11-15T23:01:17Z","doi":"10.1103/PhysRevApplied.14.044055","date_published":"2020-10-29T00:00:00Z","acknowledgement":"The authors acknowledge the support from I. Prieto and the IST Nanofabrication Facility. This work was supported by IST Austria and a NOMIS foundation research grant and the Austrian Science Fund (FWF) through BeyondC (F71). MP is the recipient of a P¨ottinger scholarship at IST Austria. JMF acknowledges support from the European Union’s Horizon 2020 research and innovation programs under grant agreement No 732894 (FET Proactive HOT), 862644 (FET Open QUARTET), and the European Research Council under grant agreement\r\nnumber 758053 (ERC StG QUNNECT). ","oa":1,"publisher":"American Physical Society","quality_controlled":"1","ddc":["530"],"date_updated":"2023-09-07T13:31:22Z","department":[{"_id":"JoFi"}],"file_date_updated":"2021-03-29T11:43:20Z","_id":"8755","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"9300","checksum":"2a634abe75251ae7628cd54c8a4ce2e8","success":1,"date_updated":"2021-03-29T11:43:20Z","file_size":2607823,"creator":"dernst","date_created":"2021-03-29T11:43:20Z","file_name":"2020_PhysReviewApplied_Peruzzo.pdf"}],"publication_status":"published","publication_identifier":{"eissn":["23317019"]},"ec_funded":1,"volume":14,"issue":"4","related_material":{"record":[{"id":"13070","status":"public","relation":"research_data"},{"relation":"dissertation_contains","status":"public","id":"9920"}]},"oa_version":"Published Version","acknowledged_ssus":[{"_id":"NanoFab"}],"abstract":[{"lang":"eng","text":"The superconducting circuit community has recently discovered the promising potential of superinductors. These circuit elements have a characteristic impedance exceeding the resistance quantum RQ ≈ 6.45 kΩ which leads to a suppression of ground state charge fluctuations. Applications include the realization of hardware protected qubits for fault tolerant quantum computing, improved coupling to small dipole moment objects and defining a new quantum metrology standard for the ampere. In this work we refute the widespread notion that superinductors can only be implemented based on kinetic inductance, i.e. using disordered superconductors or Josephson junction arrays. We present modeling, fabrication and characterization of 104 planar aluminum coil resonators with a characteristic impedance up to 30.9 kΩ at 5.6 GHz and a capacitance down to ≤ 1 fF, with lowloss and a power handling reaching 108 intra-cavity photons. Geometric superinductors are free of uncontrolled tunneling events and offer high reproducibility, linearity and the ability to couple magnetically - properties that significantly broaden the scope of future quantum circuits. "}],"intvolume":" 14","month":"10","scopus_import":"1"},{"_id":"7573","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-09-07T13:31:05Z","department":[{"_id":"JaMa"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"This paper deals with dynamical optimal transport metrics defined by spatial discretisation of the Benamou–Benamou formula for the Kantorovich metric . Such metrics appear naturally in discretisations of -gradient flow formulations for dissipative PDE. However, it has recently been shown that these metrics do not in general converge to , unless strong geometric constraints are imposed on the discrete mesh. In this paper we prove that, in a 1-dimensional periodic setting, discrete transport metrics converge to a limiting transport metric with a non-trivial effective mobility. This mobility depends sensitively on the geometry of the mesh and on the non-local mobility at the discrete level. Our result quantifies to what extent discrete transport can make use of microstructure in the mesh to reduce the cost of transport."}],"month":"07","intvolume":" 139","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1905.05757","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00217824"]},"publication_status":"published","issue":"7","volume":139,"related_material":{"record":[{"id":"10030","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":" F06504","name":"Taming Complexity in Partial Di erential Systems","call_identifier":"FWF","_id":"260482E2-B435-11E9-9278-68D0E5697425"},{"name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations","call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Gladbach, Peter, et al. “Homogenisation of One-Dimensional Discrete Optimal Transport.” Journal de Mathematiques Pures et Appliquees, vol. 139, no. 7, Elsevier, 2020, pp. 204–34, doi:10.1016/j.matpur.2020.02.008.","ieee":"P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of one-dimensional discrete optimal transport,” Journal de Mathematiques Pures et Appliquees, vol. 139, no. 7. Elsevier, pp. 204–234, 2020.","short":"P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Journal de Mathematiques Pures et Appliquees 139 (2020) 204–234.","ama":"Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. 2020;139(7):204-234. doi:10.1016/j.matpur.2020.02.008","apa":"Gladbach, P., Kopfer, E., Maas, J., & Portinale, L. (2020). Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. Elsevier. https://doi.org/10.1016/j.matpur.2020.02.008","chicago":"Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation of One-Dimensional Discrete Optimal Transport.” Journal de Mathematiques Pures et Appliquees. Elsevier, 2020. https://doi.org/10.1016/j.matpur.2020.02.008.","ista":"Gladbach P, Kopfer E, Maas J, Portinale L. 2020. Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. 139(7), 204–234."},"title":"Homogenisation of one-dimensional discrete optimal transport","author":[{"first_name":"Peter","full_name":"Gladbach, Peter","last_name":"Gladbach"},{"first_name":"Eva","last_name":"Kopfer","full_name":"Kopfer, Eva"},{"last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","full_name":"Portinale, Lorenzo"}],"article_processing_charge":"No","external_id":{"isi":["000539439400008"],"arxiv":["1905.05757"]},"acknowledgement":"J.M. gratefully acknowledges support by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 716117). J.M. and L.P. also acknowledge support from the Austrian Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support by the German Research Foundation through the Hausdorff Center for Mathematics and the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 350398276.","quality_controlled":"1","publisher":"Elsevier","oa":1,"day":"01","publication":"Journal de Mathematiques Pures et Appliquees","isi":1,"year":"2020","date_published":"2020-07-01T00:00:00Z","doi":"10.1016/j.matpur.2020.02.008","date_created":"2020-03-08T23:00:47Z","page":"204-234"},{"article_number":"2008.10962","_id":"10022","project":[{"name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"status":"public","type":"preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2023-09-07T13:31:05Z","citation":{"ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” arXiv. .","short":"D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).","apa":"Forkert, D. L., Maas, J., & Portinale, L. (n.d.). Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv.","mla":"Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, 2008.10962.","ista":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, n.d."},"title":"Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","department":[{"_id":"JaMa"}],"author":[{"last_name":"Forkert","full_name":"Forkert, Dominik L","first_name":"Dominik L","id":"35C79D68-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","full_name":"Portinale, Lorenzo"}],"article_processing_charge":"No","external_id":{"arxiv":["2008.10962"]},"oa_version":"Preprint","acknowledgement":"This work is supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245.","abstract":[{"text":"We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in R^d and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck equation via the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalising the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.","lang":"eng"}],"month":"08","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.10962"}],"oa":1,"day":"25","publication":"arXiv","language":[{"iso":"eng"}],"publication_status":"submitted","year":"2020","related_material":{"record":[{"relation":"later_version","id":"11739","status":"public"},{"id":"10030","status":"public","relation":"dissertation_contains"}]},"date_published":"2020-08-25T00:00:00Z","date_created":"2021-09-17T10:57:27Z","ec_funded":1,"page":"33"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample complexity of adversarial multi-source PAC learning. Proceedings of the 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5416–5425.","chicago":"Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In Proceedings of the 37th International Conference on Machine Learning, 119:5416–25. ML Research Press, 2020.","ieee":"N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in Proceedings of the 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5416–5425.","short":"N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.","apa":"Konstantinov, N. H., Frantar, E., Alistarh, D.-A., & Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 5416–5425). Online: ML Research Press.","ama":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity of adversarial multi-source PAC learning. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:5416-5425.","mla":"Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 5416–25."},"title":"On the sample complexity of adversarial multi-source PAC learning","author":[{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","last_name":"Konstantinov","full_name":"Konstantinov, Nikola H"},{"last_name":"Frantar","full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"}],"external_id":{"arxiv":["2002.10384"]},"article_processing_charge":"No","project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"day":"12","publication":"Proceedings of the 37th International Conference on Machine Learning","has_accepted_license":"1","year":"2020","date_published":"2020-07-12T00:00:00Z","date_created":"2020-11-05T15:25:58Z","page":"5416-5425","acknowledgement":"Dan Alistarh is supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","quality_controlled":"1","publisher":"ML Research Press","oa":1,"ddc":["000"],"date_updated":"2023-09-07T13:42:08Z","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"file_date_updated":"2021-02-15T09:00:01Z","_id":"8724","status":"public","type":"conference","conference":{"start_date":"2020-07-12","location":"Online","end_date":"2020-07-18","name":"ICML: International Conference on Machine Learning"},"file":[{"date_created":"2021-02-15T09:00:01Z","file_name":"2020_PMLR_Konstantinov.pdf","creator":"dernst","date_updated":"2021-02-15T09:00:01Z","file_size":281286,"file_id":"9120","checksum":"cc755d0054bc4b2be778ea7aa7884d2f","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2640-3498"]},"publication_status":"published","related_material":{"record":[{"status":"public","id":"10799","relation":"dissertation_contains"}],"link":[{"url":"http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf","relation":"supplementary_material"}]},"volume":119,"ec_funded":1,"oa_version":"Published Version","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"We study the problem of learning from multiple untrusted data sources, a scenario of increasing practical relevance given the recent emergence of crowdsourcing and collaborative learning paradigms. Specifically, we analyze the situation in which a learning system obtains datasets from multiple sources, some of which might be biased or even adversarially perturbed. It is\r\nknown that in the single-source case, an adversary with the power to corrupt a fixed fraction of the training data can prevent PAC-learnability, that is, even in the limit of infinitely much training data, no learning system can approach the optimal test error. In this work we show that, surprisingly, the same is not true in the multi-source setting, where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources. Our main results are a generalization bound that provides finite-sample guarantees for this learning setting, as well as corresponding lower bounds. Besides establishing PAC-learnability our results also show that in a cooperative learning setting sharing data with other parties has provable benefits, even if some\r\nparticipants are malicious. ","lang":"eng"}],"month":"07","intvolume":" 119","scopus_import":"1"},{"article_number":"093026","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"25681","name":"Analytic and machine learning approaches to composite quantum impurities","_id":"05A235A0-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425","grant_number":"M02641","name":"A path-integral approach to composite impurities"}],"citation":{"mla":"Rzadkowski, Wojciech, et al. “Detecting Composite Orders in Layered Models via Machine Learning.” New Journal of Physics, vol. 22, no. 9, 093026, IOP Publishing, 2020, doi:10.1088/1367-2630/abae44.","ieee":"W. Rzadkowski, N. Defenu, S. Chiacchiera, A. Trombettoni, and G. Bighin, “Detecting composite orders in layered models via machine learning,” New Journal of Physics, vol. 22, no. 9. IOP Publishing, 2020.","short":"W. Rzadkowski, N. Defenu, S. Chiacchiera, A. Trombettoni, G. Bighin, New Journal of Physics 22 (2020).","apa":"Rzadkowski, W., Defenu, N., Chiacchiera, S., Trombettoni, A., & Bighin, G. (2020). Detecting composite orders in layered models via machine learning. New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/abae44","ama":"Rzadkowski W, Defenu N, Chiacchiera S, Trombettoni A, Bighin G. Detecting composite orders in layered models via machine learning. New Journal of Physics. 2020;22(9). doi:10.1088/1367-2630/abae44","chicago":"Rzadkowski, Wojciech, N Defenu, S Chiacchiera, A Trombettoni, and Giacomo Bighin. “Detecting Composite Orders in Layered Models via Machine Learning.” New Journal of Physics. IOP Publishing, 2020. https://doi.org/10.1088/1367-2630/abae44.","ista":"Rzadkowski W, Defenu N, Chiacchiera S, Trombettoni A, Bighin G. 2020. Detecting composite orders in layered models via machine learning. New Journal of Physics. 22(9), 093026."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Rzadkowski","full_name":"Rzadkowski, Wojciech","orcid":"0000-0002-1106-4419","id":"48C55298-F248-11E8-B48F-1D18A9856A87","first_name":"Wojciech"},{"last_name":"Defenu","full_name":"Defenu, N","first_name":"N"},{"last_name":"Chiacchiera","full_name":"Chiacchiera, S","first_name":"S"},{"first_name":"A","last_name":"Trombettoni","full_name":"Trombettoni, A"},{"id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","first_name":"Giacomo","last_name":"Bighin","full_name":"Bighin, Giacomo","orcid":"0000-0001-8823-9777"}],"article_processing_charge":"No","external_id":{"isi":["000573298000001"]},"title":"Detecting composite orders in layered models via machine learning","acknowledgement":"We thank Gesualdo Delfino, Michele Fabrizio, Piero Ferrarese, Robert Konik, Christoph Lampert and Mikhail Lemeshko for stimulating discussions at various stages of this work. WR has received funding from the EU Horizon 2020 program under the Marie Skłodowska-Curie Grant Agreement No. 665385 and is a recipient of a DOC Fellowship of the Austrian Academy of Sciences. GB acknowledges support from the Austrian Science Fund (FWF), under project No. M2641-N27. ND acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) via Collaborative Research Center SFB 1225 (ISOQUANT)--project-id 273811115--and under Germany's Excellence Strategy 'EXC-2181/1-390900948' (the Heidelberg STRUCTURES Excellence Cluster).","quality_controlled":"1","publisher":"IOP Publishing","oa":1,"isi":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"New Journal of Physics","doi":"10.1088/1367-2630/abae44","date_published":"2020-09-01T00:00:00Z","date_created":"2020-10-11T22:01:14Z","_id":"8644","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2023-09-07T13:44:16Z","ddc":["530"],"file_date_updated":"2020-10-12T12:18:47Z","department":[{"_id":"MiLe"}],"abstract":[{"lang":"eng","text":"Determining the phase diagram of systems consisting of smaller subsystems 'connected' via a tunable coupling is a challenging task relevant for a variety of physical settings. A general question is whether new phases, not present in the uncoupled limit, may arise. We use machine learning and a suitable quasidistance between different points of the phase diagram to study layered spin models, in which the spin variables constituting each of the uncoupled systems (to which we refer as layers) are coupled to each other via an interlayer coupling. In such systems, in general, composite order parameters involving spins of different layers may emerge as a consequence of the interlayer coupling. We focus on the layered Ising and Ashkin–Teller models as a paradigmatic case study, determining their phase diagram via the application of a machine learning algorithm to the Monte Carlo data. Remarkably our technique is able to correctly characterize all the system phases also in the case of hidden order parameters, i.e. order parameters whose expression in terms of the microscopic configurations would require additional preprocessing of the data fed to the algorithm. We correctly retrieve the three known phases of the Ashkin–Teller model with ferromagnetic couplings, including the phase described by a composite order parameter. For the bilayer and trilayer Ising models the phases we find are only the ferromagnetic and the paramagnetic ones. Within the approach we introduce, owing to the construction of convolutional neural networks, naturally suitable for layered image-like data with arbitrary number of layers, no preprocessing of the Monte Carlo data is needed, also with regard to its spatial structure. The physical meaning of our results is discussed and compared with analytical data, where available. Yet, the method can be used without any a priori knowledge of the phases one seeks to find and can be applied to other models and structures."}],"oa_version":"Published Version","scopus_import":"1","month":"09","intvolume":" 22","publication_identifier":{"issn":["13672630"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8650","checksum":"c9238fff422e7a957c3a0d559f756b3a","creator":"dernst","file_size":2725143,"date_updated":"2020-10-12T12:18:47Z","file_name":"2020_NewJournalPhysics_Rzdkowski.pdf","date_created":"2020-10-12T12:18:47Z"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]},"volume":22,"issue":"9","ec_funded":1},{"publication_status":"published","publication_identifier":{"issn":["1424-0637"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8711","checksum":"c12c9c1e6f08def245e42f3cb1d83827","creator":"cziletti","file_size":469831,"date_updated":"2020-10-27T12:49:04Z","file_name":"2020_Annales_Mysliwy.pdf","date_created":"2020-10-27T12:49:04Z"}],"ec_funded":1,"issue":"12","volume":21,"related_material":{"record":[{"status":"public","id":"11473","relation":"dissertation_contains"}]},"abstract":[{"lang":"eng","text":"We consider the quantum mechanical many-body problem of a single impurity particle immersed in a weakly interacting Bose gas. The impurity interacts with the bosons via a two-body potential. We study the Hamiltonian of this system in the mean-field limit and rigorously show that, at low energies, the problem is well described by the Fröhlich polaron model."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 21","month":"12","date_updated":"2023-09-07T13:43:51Z","ddc":["530"],"file_date_updated":"2020-10-27T12:49:04Z","department":[{"_id":"RoSe"}],"_id":"8705","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","year":"2020","has_accepted_license":"1","isi":1,"publication":"Annales Henri Poincare","day":"01","page":"4003-4025","date_created":"2020-10-25T23:01:19Z","date_published":"2020-12-01T00:00:00Z","doi":"10.1007/s00023-020-00969-3","acknowledgement":"Financial support through the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme Grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.) is gratefully acknowledged. Funding Open access funding provided by Institute of Science and Technology (IST Austria)","oa":1,"quality_controlled":"1","publisher":"Springer Nature","citation":{"mla":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” Annales Henri Poincare, vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:10.1007/s00023-020-00969-3.","ieee":"K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit,” Annales Henri Poincare, vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.","short":"K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025.","apa":"Mysliwy, K., & Seiringer, R. (2020). Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-020-00969-3","ama":"Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 2020;21(12):4003-4025. doi:10.1007/s00023-020-00969-3","chicago":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” Annales Henri Poincare. Springer Nature, 2020. https://doi.org/10.1007/s00023-020-00969-3.","ista":"Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12), 4003–4025."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000578111800002"],"arxiv":["2003.12371"]},"author":[{"first_name":"Krzysztof","id":"316457FC-F248-11E8-B48F-1D18A9856A87","last_name":"Mysliwy","full_name":"Mysliwy, Krzysztof"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"title":"Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit","project":[{"name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"author":[{"last_name":"Stark","full_name":"Stark, Stefan G","first_name":"Stefan G"},{"first_name":"Joanna","full_name":"Ficek, Joanna","last_name":"Ficek"},{"last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"full_name":"Bonilla, Ximena","last_name":"Bonilla","first_name":"Ximena"},{"first_name":"Stéphane","full_name":"Chevrier, Stéphane","last_name":"Chevrier"},{"first_name":"Franziska","last_name":"Singer","full_name":"Singer, Franziska"},{"first_name":"Rudolf","last_name":"Aebersold","full_name":"Aebersold, Rudolf"},{"first_name":"Faisal S","last_name":"Al-Quaddoomi","full_name":"Al-Quaddoomi, Faisal S"},{"full_name":"Albinus, Jonas","last_name":"Albinus","first_name":"Jonas"},{"last_name":"Alborelli","full_name":"Alborelli, Ilaria","first_name":"Ilaria"},{"first_name":"Sonali","last_name":"Andani","full_name":"Andani, Sonali"},{"first_name":"Per-Olof","full_name":"Attinger, Per-Olof","last_name":"Attinger"},{"first_name":"Marina","last_name":"Bacac","full_name":"Bacac, Marina"},{"first_name":"Daniel","full_name":"Baumhoer, Daniel","last_name":"Baumhoer"},{"full_name":"Beck-Schimmer, Beatrice","last_name":"Beck-Schimmer","first_name":"Beatrice"},{"first_name":"Niko","last_name":"Beerenwinkel","full_name":"Beerenwinkel, Niko"},{"first_name":"Christian","full_name":"Beisel, Christian","last_name":"Beisel"},{"first_name":"Lara","full_name":"Bernasconi, Lara","last_name":"Bernasconi"},{"full_name":"Bertolini, Anne","last_name":"Bertolini","first_name":"Anne"},{"last_name":"Bodenmiller","full_name":"Bodenmiller, Bernd","first_name":"Bernd"},{"full_name":"Bonilla, Ximena","last_name":"Bonilla","first_name":"Ximena"},{"full_name":"Casanova, Ruben","last_name":"Casanova","first_name":"Ruben"},{"full_name":"Chevrier, Stéphane","last_name":"Chevrier","first_name":"Stéphane"},{"full_name":"Chicherova, Natalia","last_name":"Chicherova","first_name":"Natalia"},{"last_name":"D'Costa","full_name":"D'Costa, Maya","first_name":"Maya"},{"last_name":"Danenberg","full_name":"Danenberg, Esther","first_name":"Esther"},{"full_name":"Davidson, Natalie","last_name":"Davidson","first_name":"Natalie"},{"full_name":"gan, Monica-Andreea Dră","last_name":"gan","first_name":"Monica-Andreea Dră"},{"first_name":"Reinhard","full_name":"Dummer, Reinhard","last_name":"Dummer"},{"first_name":"Stefanie","last_name":"Engler","full_name":"Engler, Stefanie"},{"first_name":"Martin","full_name":"Erkens, Martin","last_name":"Erkens"},{"first_name":"Katja","last_name":"Eschbach","full_name":"Eschbach, Katja"},{"first_name":"Cinzia","full_name":"Esposito, Cinzia","last_name":"Esposito"},{"last_name":"Fedier","full_name":"Fedier, André","first_name":"André"},{"first_name":"Pedro","last_name":"Ferreira","full_name":"Ferreira, Pedro"},{"last_name":"Ficek","full_name":"Ficek, Joanna","first_name":"Joanna"},{"last_name":"Frei","full_name":"Frei, Anja L","first_name":"Anja L"},{"last_name":"Frey","full_name":"Frey, Bruno","first_name":"Bruno"},{"full_name":"Goetze, Sandra","last_name":"Goetze","first_name":"Sandra"},{"first_name":"Linda","full_name":"Grob, Linda","last_name":"Grob"},{"last_name":"Gut","full_name":"Gut, Gabriele","first_name":"Gabriele"},{"first_name":"Detlef","full_name":"Günther, Detlef","last_name":"Günther"},{"last_name":"Haberecker","full_name":"Haberecker, Martina","first_name":"Martina"},{"last_name":"Haeuptle","full_name":"Haeuptle, Pirmin","first_name":"Pirmin"},{"first_name":"Viola","last_name":"Heinzelmann-Schwarz","full_name":"Heinzelmann-Schwarz, Viola"},{"first_name":"Sylvia","last_name":"Herter","full_name":"Herter, Sylvia"},{"first_name":"Rene","last_name":"Holtackers","full_name":"Holtackers, Rene"},{"last_name":"Huesser","full_name":"Huesser, Tamara","first_name":"Tamara"},{"full_name":"Irmisch, Anja","last_name":"Irmisch","first_name":"Anja"},{"full_name":"Jacob, Francis","last_name":"Jacob","first_name":"Francis"},{"first_name":"Andrea","last_name":"Jacobs","full_name":"Jacobs, Andrea"},{"last_name":"Jaeger","full_name":"Jaeger, Tim M","first_name":"Tim M"},{"full_name":"Jahn, Katharina","last_name":"Jahn","first_name":"Katharina"},{"full_name":"James, Alva R","last_name":"James","first_name":"Alva R"},{"full_name":"Jermann, Philip M","last_name":"Jermann","first_name":"Philip M"},{"full_name":"Kahles, André","last_name":"Kahles","first_name":"André"},{"first_name":"Abdullah","full_name":"Kahraman, Abdullah","last_name":"Kahraman"},{"last_name":"Koelzer","full_name":"Koelzer, Viktor H","first_name":"Viktor H"},{"last_name":"Kuebler","full_name":"Kuebler, Werner","first_name":"Werner"},{"first_name":"Jack","full_name":"Kuipers, Jack","last_name":"Kuipers"},{"last_name":"Kunze","full_name":"Kunze, Christian P","first_name":"Christian P"},{"first_name":"Christian","full_name":"Kurzeder, Christian","last_name":"Kurzeder"},{"first_name":"Kjong-Van","full_name":"Lehmann, Kjong-Van","last_name":"Lehmann"},{"first_name":"Mitchell","last_name":"Levesque","full_name":"Levesque, Mitchell"},{"full_name":"Lugert, Sebastian","last_name":"Lugert","first_name":"Sebastian"},{"full_name":"Maass, Gerd","last_name":"Maass","first_name":"Gerd"},{"first_name":"Markus","full_name":"Manz, Markus","last_name":"Manz"},{"first_name":"Philipp","last_name":"Markolin","full_name":"Markolin, Philipp"},{"last_name":"Mena","full_name":"Mena, Julien","first_name":"Julien"},{"full_name":"Menzel, Ulrike","last_name":"Menzel","first_name":"Ulrike"},{"first_name":"Julian M","full_name":"Metzler, Julian M","last_name":"Metzler"},{"full_name":"Miglino, Nicola","last_name":"Miglino","first_name":"Nicola"},{"last_name":"Milani","full_name":"Milani, Emanuela S","first_name":"Emanuela S"},{"first_name":"Holger","full_name":"Moch, Holger","last_name":"Moch"},{"first_name":"Simone","full_name":"Muenst, Simone","last_name":"Muenst"},{"last_name":"Murri","full_name":"Murri, Riccardo","first_name":"Riccardo"},{"first_name":"Charlotte KY","full_name":"Ng, Charlotte KY","last_name":"Ng"},{"full_name":"Nicolet, Stefan","last_name":"Nicolet","first_name":"Stefan"},{"first_name":"Marta","full_name":"Nowak, Marta","last_name":"Nowak"},{"first_name":"Patrick GA","last_name":"Pedrioli","full_name":"Pedrioli, Patrick GA"},{"full_name":"Pelkmans, Lucas","last_name":"Pelkmans","first_name":"Lucas"},{"first_name":"Salvatore","full_name":"Piscuoglio, Salvatore","last_name":"Piscuoglio"},{"full_name":"Prummer, Michael","last_name":"Prummer","first_name":"Michael"},{"first_name":"Mathilde","last_name":"Ritter","full_name":"Ritter, Mathilde"},{"first_name":"Christian","full_name":"Rommel, Christian","last_name":"Rommel"},{"first_name":"María L","last_name":"Rosano-González","full_name":"Rosano-González, María L"},{"first_name":"Gunnar","full_name":"Rätsch, Gunnar","last_name":"Rätsch"},{"last_name":"Santacroce","full_name":"Santacroce, Natascha","first_name":"Natascha"},{"first_name":"Jacobo Sarabia del","last_name":"Castillo","full_name":"Castillo, Jacobo Sarabia del"},{"full_name":"Schlenker, Ramona","last_name":"Schlenker","first_name":"Ramona"},{"first_name":"Petra C","full_name":"Schwalie, Petra C","last_name":"Schwalie"},{"first_name":"Severin","full_name":"Schwan, Severin","last_name":"Schwan"},{"full_name":"Schär, Tobias","last_name":"Schär","first_name":"Tobias"},{"full_name":"Senti, Gabriela","last_name":"Senti","first_name":"Gabriela"},{"last_name":"Singer","full_name":"Singer, Franziska","first_name":"Franziska"},{"first_name":"Sujana","last_name":"Sivapatham","full_name":"Sivapatham, Sujana"},{"first_name":"Berend","full_name":"Snijder, Berend","last_name":"Snijder"},{"full_name":"Sobottka, Bettina","last_name":"Sobottka","first_name":"Bettina"},{"full_name":"Sreedharan, Vipin T","last_name":"Sreedharan","first_name":"Vipin T"},{"first_name":"Stefan","last_name":"Stark","full_name":"Stark, Stefan"},{"full_name":"Stekhoven, Daniel J","last_name":"Stekhoven","first_name":"Daniel J"},{"last_name":"Theocharides","full_name":"Theocharides, Alexandre PA","first_name":"Alexandre PA"},{"first_name":"Tinu M","full_name":"Thomas, Tinu M","last_name":"Thomas"},{"first_name":"Markus","full_name":"Tolnay, Markus","last_name":"Tolnay"},{"last_name":"Tosevski","full_name":"Tosevski, Vinko","first_name":"Vinko"},{"last_name":"Toussaint","full_name":"Toussaint, Nora C","first_name":"Nora C"},{"first_name":"Mustafa A","last_name":"Tuncel","full_name":"Tuncel, Mustafa A"},{"last_name":"Tusup","full_name":"Tusup, Marina","first_name":"Marina"},{"first_name":"Audrey Van","last_name":"Drogen","full_name":"Drogen, Audrey Van"},{"last_name":"Vetter","full_name":"Vetter, Marcus","first_name":"Marcus"},{"last_name":"Vlajnic","full_name":"Vlajnic, Tatjana","first_name":"Tatjana"},{"first_name":"Sandra","last_name":"Weber","full_name":"Weber, Sandra"},{"first_name":"Walter P","last_name":"Weber","full_name":"Weber, Walter P"},{"full_name":"Wegmann, Rebekka","last_name":"Wegmann","first_name":"Rebekka"},{"first_name":"Michael","last_name":"Weller","full_name":"Weller, Michael"},{"first_name":"Fabian","full_name":"Wendt, Fabian","last_name":"Wendt"},{"full_name":"Wey, Norbert","last_name":"Wey","first_name":"Norbert"},{"first_name":"Andreas","full_name":"Wicki, Andreas","last_name":"Wicki"},{"last_name":"Wollscheid","full_name":"Wollscheid, Bernd","first_name":"Bernd"},{"full_name":"Yu, Shuqing","last_name":"Yu","first_name":"Shuqing"},{"first_name":"Johanna","last_name":"Ziegler","full_name":"Ziegler, Johanna"},{"full_name":"Zimmermann, Marc","last_name":"Zimmermann","first_name":"Marc"},{"last_name":"Zoche","full_name":"Zoche, Martin","first_name":"Martin"},{"first_name":"Gregor","full_name":"Zuend, Gregor","last_name":"Zuend"},{"first_name":"Gunnar","full_name":"Rätsch, Gunnar","last_name":"Rätsch"},{"full_name":"Lehmann, Kjong-Van","last_name":"Lehmann","first_name":"Kjong-Van"}],"article_processing_charge":"No","external_id":{"pmid":["33381818"]},"title":"SCIM: Universal single-cell matching with unpaired feature sets","citation":{"mla":"Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics, vol. 36, no. Supplement_2, Oxford University Press, 2020, pp. i919–27, doi:10.1093/bioinformatics/btaa843.","ama":"Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 2020;36(Supplement_2):i919-i927. doi:10.1093/bioinformatics/btaa843","apa":"Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer, F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. Oxford University Press. https://doi.org/10.1093/bioinformatics/btaa843","short":"S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R. Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger, M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi, A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova, M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens, K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey, S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz, S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger, K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler, J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G. Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S. Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli, L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González, G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan, T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan, S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski, N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S. Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid, S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann, Bioinformatics 36 (2020) i919–i927.","ieee":"S. G. Stark et al., “SCIM: Universal single-cell matching with unpaired feature sets,” Bioinformatics, vol. 36, no. Supplement_2. Oxford University Press, pp. i919–i927, 2020.","chicago":"Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics. Oxford University Press, 2020. https://doi.org/10.1093/bioinformatics/btaa843.","ista":"Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 36(Supplement_2), i919–i927."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"page":"i919-i927","doi":"10.1093/bioinformatics/btaa843","date_published":"2020-12-01T00:00:00Z","date_created":"2023-08-21T12:28:20Z","year":"2020","day":"01","publication":"Bioinformatics","type":"journal_article","article_type":"original","status":"public","keyword":["Computational Mathematics","Computational Theory and Mathematics","Computer Science Applications","Molecular Biology","Biochemistry","Statistics and Probability"],"_id":"14125","department":[{"_id":"FrLo"}],"date_updated":"2023-09-11T10:21:00Z","extern":"1","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1093/bioinformatics/btaa843","open_access":"1"}],"month":"12","intvolume":" 36","abstract":[{"text":"Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed.\r\nResults: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","related_material":{"link":[{"relation":"software","url":"https://github.com/ratschlab/scim"}]},"issue":"Supplement_2","volume":36,"publication_identifier":{"eissn":["1367-4811"]},"publication_status":"published","language":[{"iso":"eng"}]},{"date_published":"2020-07-28T00:00:00Z","doi":"10.1609/aaai.v34i09.7120","date_created":"2023-08-22T14:07:26Z","page":"13681-13684","day":"28","publication":"The 34th AAAI Conference on Artificial Intelligence","year":"2020","quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"title":"A commentary on the unsupervised learning of disentangled representations","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"},{"first_name":"Stefan","full_name":"Bauer, Stefan","last_name":"Bauer"},{"first_name":"Mario","full_name":"Lucic, Mario","last_name":"Lucic"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"first_name":"Sylvain","last_name":"Gelly","full_name":"Gelly, Sylvain"},{"last_name":"Schölkopf","full_name":"Schölkopf, Bernhard","first_name":"Bernhard"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"}],"article_processing_charge":"No","external_id":{"arxiv":["2007.14184"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Commentary on the Unsupervised Learning of Disentangled Representations.” In The 34th AAAI Conference on Artificial Intelligence, 34:13681–84. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i09.7120.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A commentary on the unsupervised learning of disentangled representations. The 34th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 34, 13681–13684.","mla":"Locatello, Francesco, et al. “A Commentary on the Unsupervised Learning of Disentangled Representations.” The 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 9, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–84, doi:10.1609/aaai.v34i09.7120.","ieee":"F. Locatello et al., “A commentary on the unsupervised learning of disentangled representations,” in The 34th AAAI Conference on Artificial Intelligence, New York, NY, United States, 2020, vol. 34, no. 9, pp. 13681–13684.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, in:, The 34th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–13684.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A commentary on the unsupervised learning of disentangled representations. In The 34th AAAI Conference on Artificial Intelligence (Vol. 34, pp. 13681–13684). New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i09.7120","ama":"Locatello F, Bauer S, Lucic M, et al. A commentary on the unsupervised learning of disentangled representations. In: The 34th AAAI Conference on Artificial Intelligence. Vol 34. Association for the Advancement of Artificial Intelligence; 2020:13681-13684. doi:10.1609/aaai.v34i09.7120"},"issue":"9","volume":34,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781577358350"],"eissn":["2374-3468"]},"publication_status":"published","month":"07","intvolume":" 34","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2007.14184","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"The goal of the unsupervised learning of disentangled representations is to\r\nseparate the independent explanatory factors of variation in the data without\r\naccess to supervision. In this paper, we summarize the results of Locatello et\r\nal., 2019, and focus on their implications for practitioners. We discuss the\r\ntheoretical result showing that the unsupervised learning of disentangled\r\nrepresentations is fundamentally impossible without inductive biases and the\r\npractical challenges it entails. Finally, we comment on our experimental\r\nfindings, highlighting the limitations of state-of-the-art approaches and\r\ndirections for future research.","lang":"eng"}],"department":[{"_id":"FrLo"}],"extern":"1","date_updated":"2023-09-12T07:44:48Z","status":"public","type":"conference","conference":{"name":"AAAI: Conference on Artificial Intelligence","start_date":"2020-02-07","location":"New York, NY, United States","end_date":"2020-02-12"},"_id":"14186"},{"date_created":"2023-08-22T14:08:14Z","date_published":"2020-07-07T00:00:00Z","page":"6348–6359","publication":"Proceedings of the 37th International Conference on Machine Learning","day":"07","year":"2020","oa":1,"quality_controlled":"1","title":"Weakly-supervised disentanglement without compromises","article_processing_charge":"No","external_id":{"arxiv":["2002.02886"]},"author":[{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"last_name":"Poole","full_name":"Poole, Ben","first_name":"Ben"},{"last_name":"Rätsch","full_name":"Rätsch, Gunnar","first_name":"Gunnar"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"},{"first_name":"Michael","last_name":"Tschannen","full_name":"Tschannen, Michael"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised disentanglement without compromises. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:6348–6359.","apa":"Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen, M. (2020). Weakly-supervised disentanglement without compromises. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 6348–6359). Virtual.","ieee":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen, “Weakly-supervised disentanglement without compromises,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 6348–6359.","short":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 6348–6359.","mla":"Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 6348–6359.","ista":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020. Weakly-supervised disentanglement without compromises. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 6348–6359.","chicago":"Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.” In Proceedings of the 37th International Conference on Machine Learning, 119:6348–6359, 2020."},"volume":119,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 119","month":"07","main_file_link":[{"url":"https://arxiv.org/abs/2002.02886","open_access":"1"}],"scopus_import":"1","alternative_title":["PMLR"],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Intelligent agents should be able to learn useful representations by\r\nobserving changes in their environment. We model such observations as pairs of\r\nnon-i.i.d. images sharing at least one of the underlying factors of variation.\r\nFirst, we theoretically show that only knowing how many factors have changed,\r\nbut not which ones, is sufficient to learn disentangled representations.\r\nSecond, we provide practical algorithms that learn disentangled representations\r\nfrom pairs of images without requiring annotation of groups, individual\r\nfactors, or the number of factors that have changed. Third, we perform a\r\nlarge-scale empirical study and show that such pairs of observations are\r\nsufficient to reliably learn disentangled representations on several benchmark\r\ndata sets. Finally, we evaluate our learned representations and find that they\r\nare simultaneously useful on a diverse suite of tasks, including generalization\r\nunder covariate shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate that weak supervision enables learning of useful disentangled\r\nrepresentations in realistic scenarios."}],"department":[{"_id":"FrLo"}],"extern":"1","date_updated":"2023-09-12T07:59:29Z","status":"public","conference":{"location":"Virtual","end_date":"2020-07-18","start_date":"2020-07-13","name":"International Conference on Machine Learning"},"type":"conference","_id":"14188"},{"article_processing_charge":"No","external_id":{"arxiv":["2002.11860"]},"author":[{"first_name":"Geoffrey","full_name":"Négiar, Geoffrey","last_name":"Négiar"},{"first_name":"Gideon","full_name":"Dresdner, Gideon","last_name":"Dresdner"},{"first_name":"Alicia","full_name":"Tsai, Alicia","last_name":"Tsai"},{"last_name":"Ghaoui","full_name":"Ghaoui, Laurent El","first_name":"Laurent El"},{"last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"first_name":"Robert M.","full_name":"Freund, Robert M.","last_name":"Freund"},{"full_name":"Pedregosa, Fabian","last_name":"Pedregosa","first_name":"Fabian"}],"title":"Stochastic Frank-Wolfe for constrained finite-sum minimization","department":[{"_id":"FrLo"}],"date_updated":"2023-09-12T08:03:40Z","citation":{"mla":"Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 7253–62.","ama":"Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained finite-sum minimization. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:7253-7262.","apa":"Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R. M., & Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum minimization. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 7253–7262). Virtual.","ieee":"G. Négiar et al., “Stochastic Frank-Wolfe for constrained finite-sum minimization,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 7253–7262.","short":"G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund, F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 7253–7262.","chicago":"Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” In Proceedings of the 37th International Conference on Machine Learning, 119:7253–62, 2020.","ista":"Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 7253–7262."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","conference":{"name":"International Conference on Machine Learning","start_date":"2020-07-13","end_date":"2020-07-18","location":"Virtual"},"type":"conference","status":"public","_id":"14187","page":"7253-7262","date_created":"2023-08-22T14:07:52Z","date_published":"2020-07-27T00:00:00Z","volume":119,"year":"2020","publication_status":"published","language":[{"iso":"eng"}],"publication":"Proceedings of the 37th International Conference on Machine Learning","day":"27","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.11860"}],"oa":1,"alternative_title":["PMLR"],"quality_controlled":"1","intvolume":" 119","month":"07","abstract":[{"text":"We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure. This class of problems includes empirical risk\r\nminimization with sparse, low-rank, or other structured constraints. The\r\nproposed method is simple to implement, does not require step-size tuning, and\r\nhas a constant per-iteration cost that is independent of the dataset size.\r\nFurthermore, as a byproduct of the method we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as a stopping criterion. Depending on the\r\nsetting, the proposed method matches or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which the proposed method exhibits a\r\nfaster empirical convergence than related methods. Finally, we provide an\r\nimplementation of all considered methods in an open-source package.","lang":"eng"}],"oa_version":"Preprint"},{"article_number":"209","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (2020).","ieee":"F. Locatello et al., “A sober look at the unsupervised learning of disentangled representations and their evaluation,” Journal of Machine Learning Research, vol. 21. MIT Press, 2020.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. MIT Press.","ama":"Locatello F, Bauer S, Lucic M, et al. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 2020;21.","mla":"Locatello, Francesco, et al. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research, vol. 21, 209, MIT Press, 2020.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 21, 209.","chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research. MIT Press, 2020."},"title":"A sober look at the unsupervised learning of disentangled representations and their evaluation","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"first_name":"Mario","full_name":"Lucic, Mario","last_name":"Lucic"},{"last_name":"Rätsch","full_name":"Rätsch, Gunnar","first_name":"Gunnar"},{"first_name":"Sylvain","full_name":"Gelly, Sylvain","last_name":"Gelly"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"first_name":"Olivier","full_name":"Bachem, Olivier","last_name":"Bachem"}],"article_processing_charge":"No","external_id":{"arxiv":["2010.14766"]},"quality_controlled":"1","publisher":"MIT Press","oa":1,"day":"01","publication":"Journal of Machine Learning Research","has_accepted_license":"1","year":"2020","date_published":"2020-09-01T00:00:00Z","date_created":"2023-08-22T14:10:34Z","_id":"14195","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"extern":"1","ddc":["000"],"date_updated":"2023-09-12T09:23:56Z","department":[{"_id":"FrLo"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The idea behind the unsupervised learning of disentangled representations is that real-world data is generated by a few explanatory factors of variation which can be recovered by unsupervised learning algorithms. In this paper, we provide a sober look at recent progress in the field and challenge some common assumptions. We first theoretically show that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases on both the models and the data. Then, we train over 14000\r\n models covering most prominent methods and evaluation metrics in a reproducible large-scale experimental study on eight data sets. We observe that while the different methods successfully enforce properties “encouraged” by the corresponding losses, well-disentangled models seemingly cannot be identified without supervision. Furthermore, different evaluation metrics do not always agree on what should be considered “disentangled” and exhibit systematic differences in the estimation. Finally, increased disentanglement does not seem to necessarily lead to a decreased sample complexity of learning for downstream tasks. Our results suggest that future work on disentanglement learning should be explicit about the role of inductive biases and (implicit) supervision, investigate concrete benefits of enforcing disentanglement of the learned representations, and consider a reproducible experimental setup covering several data sets."}],"month":"09","intvolume":" 21","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://jmlr.csail.mit.edu/papers/v21/19-976.html"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":21}]