[{"department":[{"_id":"GradSch"},{"_id":"NiBa"}],"author":[{"first_name":"Parvathy","id":"455235B8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6395-386X","last_name":"Surendranadh","full_name":"Surendranadh, Parvathy"},{"last_name":"Arathoon","full_name":"Arathoon, Louise S","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1771-714X","first_name":"Louise S"},{"full_name":"Baskett, Carina","last_name":"Baskett","orcid":"0000-0002-7354-8574","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","first_name":"Carina"},{"full_name":"Field, David","last_name":"Field","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David"},{"full_name":"Pickup, Melinda","last_name":"Pickup","first_name":"Melinda","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H"}],"citation":{"mla":"Surendranadh, Parvathy, et al. <i>Effects of Fine-Scale Population Structure on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9192\">10.15479/AT:ISTA:9192</a>.","chicago":"Surendranadh, Parvathy, Louise S Arathoon, Carina Baskett, David Field, Melinda Pickup, and Nicholas H Barton. “Effects of Fine-Scale Population Structure on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9192\">https://doi.org/10.15479/AT:ISTA:9192</a>.","ieee":"P. Surendranadh, L. S. Arathoon, C. Baskett, D. Field, M. Pickup, and N. H. Barton, “Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus.” Institute of Science and Technology Austria, 2021.","apa":"Surendranadh, P., Arathoon, L. S., Baskett, C., Field, D., Pickup, M., &#38; Barton, N. H. (2021). Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9192\">https://doi.org/10.15479/AT:ISTA:9192</a>","ista":"Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. 2021. Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9192\">10.15479/AT:ISTA:9192</a>.","short":"P. Surendranadh, L.S. Arathoon, C. Baskett, D. Field, M. Pickup, N.H. Barton, (2021).","ama":"Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9192\">10.15479/AT:ISTA:9192</a>"},"related_material":{"record":[{"id":"8254","status":"public","relation":"earlier_version"},{"status":"public","id":"11321","relation":"later_version"},{"relation":"used_in_publication","status":"public","id":"11411"}]},"file_date_updated":"2021-02-24T17:45:13Z","abstract":[{"text":"Here are the research data underlying the publication \" Effects of fine-scale population structure on inbreeding in a long-term study of snapdragons (Antirrhinum majus).\" Further information are summed up in the README document.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","publisher":"Institute of Science and Technology Austria","contributor":[{"id":"455235B8-F248-11E8-B48F-1D18A9856A87","first_name":"Parvathy","contributor_type":"project_member","last_name":"Surendranadh"},{"contributor_type":"project_member","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","first_name":"Louise S","last_name":"Arathoon"},{"contributor_type":"project_member","first_name":"Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","last_name":"Baskett"},{"contributor_type":"project_member","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","last_name":"Field"},{"contributor_type":"project_member","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","last_name":"Pickup"},{"last_name":"Barton","contributor_type":"project_leader","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"date_updated":"2025-04-15T08:20:40Z","oa":1,"article_processing_charge":"No","_id":"9192","doi":"10.15479/AT:ISTA:9192","day":"26","date_created":"2021-02-24T17:49:21Z","ddc":["576"],"has_accepted_license":"1","type":"research_data","oa_version":"Published Version","fulldoi":"https://doi.org/10.15479/AT:ISTA:9192","year":"2021","date_published":"2021-02-26T00:00:00Z","file":[{"date_created":"2021-02-24T17:45:13Z","creator":"larathoo","access_level":"open_access","relation":"main_file","success":1,"date_updated":"2021-02-24T17:45:13Z","file_name":"Data_Code.zip","checksum":"f85537815809a8a4b7da9d01163f88c0","file_id":"9193","file_size":5934452,"content_type":"application/x-zip-compressed"}],"month":"02","title":"Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus"},{"date_updated":"2025-06-12T06:57:18Z","contributor":[{"id":"4C473F58-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","contributor_type":"project_member","last_name":"Jirovec"}],"_id":"9323","doi":"10.15479/AT:ISTA:9323","oa":1,"article_processing_charge":"No","abstract":[{"text":"This .zip File contains the data for figures presented in the main text and supplementary material of \"A singlet triplet hole spin qubit in planar Ge\" by D. Jirovec, et. al. The measurements were done using Labber Software and the data is stored in the hdf5 file format. The files can be opened using either the Labber Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html). A single file is acquired with QCodes and features the corresponding data type. XRD data are in .dat format and a code to open the data is provided. The code for simulations is as well provided in Python.","lang":"eng"}],"author":[{"last_name":"Jirovec","full_name":"Jirovec, Daniel","orcid":"0000-0002-7197-4801","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel"}],"department":[{"_id":"GradSch"},{"_id":"GeKa"}],"file_date_updated":"2021-04-14T09:49:30Z","related_material":{"record":[{"relation":"used_in_publication","id":"8909","status":"public"}]},"citation":{"short":"D. Jirovec, (2021).","ama":"Jirovec D. Research data for “A singlet-triplet hole spin qubit planar Ge.” 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9323\">10.15479/AT:ISTA:9323</a>","ista":"Jirovec D. 2021. Research data for ‘A singlet-triplet hole spin qubit planar Ge’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9323\">10.15479/AT:ISTA:9323</a>.","apa":"Jirovec, D. (2021). Research data for “A singlet-triplet hole spin qubit planar Ge.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9323\">https://doi.org/10.15479/AT:ISTA:9323</a>","chicago":"Jirovec, Daniel. “Research Data for ‘A Singlet-Triplet Hole Spin Qubit Planar Ge.’” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9323\">https://doi.org/10.15479/AT:ISTA:9323</a>.","ieee":"D. Jirovec, “Research data for ‘A singlet-triplet hole spin qubit planar Ge.’” Institute of Science and Technology Austria, 2021.","mla":"Jirovec, Daniel. <i>Research Data for “A Singlet-Triplet Hole Spin Qubit Planar Ge.”</i> Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9323\">10.15479/AT:ISTA:9323</a>."},"status":"public","publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_0.png","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"year":"2021","fulldoi":"https://doi.org/10.15479/AT:ISTA:9323","title":"Research data for \"A singlet-triplet hole spin qubit planar Ge\"","month":"04","file":[{"date_updated":"2021-04-14T09:48:47Z","file_name":"DataRepositorySTqubit.zip","checksum":"c569d2a2ce1694445cdbca19cf8ae023","file_id":"9324","file_size":221832287,"content_type":"application/x-zip-compressed","date_created":"2021-04-14T09:48:47Z","access_level":"open_access","creator":"djirovec","relation":"main_file","success":1},{"file_size":4323,"content_type":"application/octet-stream","checksum":"845bdf87430718ad6aff47eda7b5fc92","file_name":"ReadMe","file_id":"9325","date_updated":"2021-04-14T09:49:30Z","success":1,"relation":"main_file","date_created":"2021-04-14T09:49:30Z","access_level":"open_access","creator":"djirovec"}],"date_published":"2021-04-14T00:00:00Z","has_accepted_license":"1","ddc":["530"],"day":"14","date_created":"2021-04-14T09:50:22Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","oa_version":"Published Version","type":"research_data"},{"ddc":["005"],"has_accepted_license":"1","date_created":"2021-04-16T14:26:19Z","license":"https://opensource.org/licenses/MIT","type":"software","gitlab_commit_id":"6a77e7e22769230ae5f5edaa090fb4b828e57573","year":"2021","fulldoi":"https://doi.org/10.15479/AT:ISTA:9327","title":"Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data)","month":"05","date_published":"2021-05-01T00:00:00Z","file":[{"date_created":"2021-04-16T14:15:12Z","creator":"gsperl","access_level":"open_access","relation":"main_file","success":1,"date_updated":"2021-04-16T14:15:12Z","checksum":"0324cb519273371708743f3282e7c081","file_name":"MADYPG_extra_data.zip","file_id":"9328","file_size":802586232,"content_type":"application/zip"},{"file_size":64962865,"content_type":"application/gzip","date_updated":"2021-04-26T09:33:44Z","checksum":"4c224551adf852b136ec21a4e13f0c1b","file_name":"MADYPG.zip","file_id":"9353","relation":"main_file","date_created":"2021-04-26T09:33:44Z","creator":"pub-gitlab-bot","access_level":"open_access"}],"abstract":[{"text":"This archive contains the missing sweater mesh animations and displacement models for the code of \"Mechanics-Aware Deformation of Yarn Pattern Geometry\"\r\n\r\nCode Repository: https://git.ist.ac.at/gsperl/MADYPG","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"author":[{"full_name":"Sperl, Georg","last_name":"Sperl","first_name":"Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rahul","last_name":"Narain","full_name":"Narain, Rahul"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J"}],"citation":{"chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data).” IST Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9327\">https://doi.org/10.15479/AT:ISTA:9327</a>.","mla":"Sperl, Georg, et al. <i>Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data)</i>. IST Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9327\">10.15479/AT:ISTA:9327</a>.","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data).” IST Austria, 2021.","apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data). IST Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9327\">https://doi.org/10.15479/AT:ISTA:9327</a>","ista":"Sperl G, Narain R, Wojtan C. 2021. Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data), IST Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9327\">10.15479/AT:ISTA:9327</a>.","ama":"Sperl G, Narain R, Wojtan C. Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data). 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9327\">10.15479/AT:ISTA:9327</a>","short":"G. Sperl, R. Narain, C. Wojtan, (2021)."},"related_material":{"record":[{"relation":"used_for_analysis_in","id":"9818","status":"public"}]},"file_date_updated":"2021-04-26T09:33:44Z","status":"public","publisher":"IST Austria","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"legal_code_url":"https://opensource.org/licenses/MIT","name":"The MIT License","short":"MIT"},"gitlab_url":"https://git.ist.ac.at/gsperl/MADYPG","date_updated":"2026-06-18T19:57:47Z","_id":"9327","doi":"10.15479/AT:ISTA:9327","oa":1},{"date_created":"2021-05-14T12:07:53Z","ddc":["530"],"has_accepted_license":"1","type":"research_data","oa_version":"Published Version","year":"2021","fulldoi":"https://doi.org/10.15479/AT:ISTA:9389","date_published":"2021-01-01T00:00:00Z","file":[{"file_name":"Notebook_Valentini.pdf","checksum":"80a905c4eef24dab6fb247e81a3d67f5","file_id":"9390","date_updated":"2021-05-14T11:42:23Z","file_size":10572981,"content_type":"application/pdf","date_created":"2021-05-14T11:42:23Z","access_level":"open_access","creator":"mvalenti","relation":"main_file"},{"relation":"main_file","date_created":"2021-05-14T11:56:48Z","access_level":"open_access","creator":"mvalenti","file_size":99076111,"content_type":"application/x-zip-compressed","date_updated":"2021-05-14T11:56:48Z","checksum":"1e61a7e63949448a8db0091cdac23570","file_name":"Experimental_data.zip","file_id":"9391"}],"title":"Research data for \"Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states\"","author":[{"id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","first_name":"Marco","last_name":"Valentini","full_name":"Valentini, Marco"}],"department":[{"_id":"GradSch"},{"_id":"GeKa"}],"citation":{"ista":"Valentini M. 2021. Research data for ‘Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9389\">10.15479/AT:ISTA:9389</a>.","short":"M. Valentini, (2021).","ama":"Valentini M. Research data for “Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states.” 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9389\">10.15479/AT:ISTA:9389</a>","chicago":"Valentini, Marco. “Research Data for ‘Non-Topological Zero Bias Peaks in Full-Shell Nanowires Induced by Flux Tunable Andreev States.’” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9389\">https://doi.org/10.15479/AT:ISTA:9389</a>.","mla":"Valentini, Marco. <i>Research Data for “Non-Topological Zero Bias Peaks in Full-Shell Nanowires Induced by Flux Tunable Andreev States.”</i> Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9389\">10.15479/AT:ISTA:9389</a>.","ieee":"M. Valentini, “Research data for ‘Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states.’” Institute of Science and Technology Austria, 2021.","apa":"Valentini, M. (2021). Research data for “Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9389\">https://doi.org/10.15479/AT:ISTA:9389</a>"},"related_material":{"record":[{"relation":"used_in_publication","id":"8910","status":"public"}]},"file_date_updated":"2021-05-14T11:56:48Z","abstract":[{"text":"This .zip File contains the transport data for  \"Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states\" by M. Valentini, et. al.  \r\nThe measurements were done using Labber Software and the data is stored in the hdf5 file format.\r\nInstructions of how to read the data are in \"Notebook_Valentini.pdf\".","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_0.png","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"status":"public","acknowledged_ssus":[{"_id":"NanoFab"}],"publisher":"Institute of Science and Technology Austria","contributor":[{"last_name":"Valentini","first_name":"Marco","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","contributor_type":"contact_person"}],"date_updated":"2025-06-12T06:32:43Z","article_processing_charge":"No","oa":1,"_id":"9389","doi":"10.15479/AT:ISTA:9389"},{"ddc":["000"],"date_created":"2021-05-19T12:25:42Z","publication":"Deliberate Ignorance: Choosing Not To Know","day":"01","oa_version":"Published Version","language":[{"iso":"eng"}],"type":"book_chapter","main_file_link":[{"url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf","open_access":"1"}],"intvolume":"        29","volume":29,"year":"2021","month":"03","title":"The evolution of strategic ignorance in strategic interaction","date_published":"2021-03-01T00:00:00Z","abstract":[{"lang":"eng","text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore."}],"citation":{"ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. <i>Deliberate Ignorance: Choosing Not To Know</i>. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.","short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.","ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.","apa":"Schmid, L., &#38; Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig &#38; C. Engel (Eds.), <i>Deliberate Ignorance: Choosing Not To Know</i> (Vol. 29, pp. 139–152). MIT Press.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in <i>Deliberate Ignorance: Choosing Not To Know</i>, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021."},"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"author":[{"last_name":"Schmid","full_name":"Schmid, Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","orcid":"0000-0002-6978-7329"},{"full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian"}],"publisher":"MIT Press","status":"public","editor":[{"last_name":"Hertwig","full_name":"Hertwig, Ralph","first_name":"Ralph"},{"full_name":"Engel, Christoph","last_name":"Engel","first_name":"Christoph"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-06-18T19:49:35Z","quality_controlled":"1","page":"139-152","_id":"9403","publication_identifier":{"isbn":["978-0-262-04559-9"]},"series_title":"Strüngmann Forum Reports","oa":1,"article_processing_charge":"No"},{"external_id":{"arxiv":["2106.11247"]},"oa_version":"Published Version","language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2021-06-22T15:57:11Z","_id":"9592","conference":{"location":"Halifax, NS, Canada; Virtual","name":"CCCG: Canadian Conference on Computational Geometry","start_date":"2021-08-10","end_date":"2021-08-12"},"article_processing_charge":"No","date_updated":"2025-05-14T11:23:45Z","keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"month":"06","title":"Massively winning configurations in the convex grabbing game on the plane","date_published":"2021-06-29T00:00:00Z","file":[{"file_id":"9616","checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","date_updated":"2021-06-28T20:23:13Z","content_type":"application/pdf","file_size":381306,"creator":"mdvorak","access_level":"open_access","date_created":"2021-06-28T20:23:13Z","success":1,"relation":"main_file"},{"date_updated":"2021-08-12T10:57:21Z","file_id":"9902","file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf","checksum":"9199cf18c65658553487458cc24d0ab2","content_type":"application/pdf","file_size":403645,"creator":"kschuh","access_level":"open_access","date_created":"2021-08-12T10:57:21Z","success":1,"relation":"main_file"}],"year":"2021","type":"conference","ddc":["516"],"publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry","day":"29","arxiv":1,"oa":1,"quality_controlled":"1","publication_status":"published","publisher":"Canadian Conference on Computational Geometry","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general."}],"citation":{"ista":"Dvorak M, Nicholson S. 2021. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.","short":"M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2021.","ama":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry; 2021.","ieee":"M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Halifax, NS, Canada; Virtual, 2021.","chicago":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry, 2021.","mla":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Canadian Conference on Computational Geometry, 2021.","apa":"Dvorak, M., &#38; Nicholson, S. (2021). Massively winning configurations in the convex grabbing game on the plane. In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Halifax, NS, Canada; Virtual: Canadian Conference on Computational Geometry."},"file_date_updated":"2021-08-12T10:57:21Z","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","first_name":"Martin","last_name":"Dvorak","full_name":"Dvorak, Martin"},{"last_name":"Nicholson","full_name":"Nicholson, Sara","first_name":"Sara"}]},{"date_updated":"2026-06-18T19:57:47Z","scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","ec_funded":1,"doi":"10.1145/3450626.3459816","_id":"9818","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"article_number":"168","status":"public","acknowledged_ssus":[{"_id":"ScienComp"}],"fulldoi":"https://doi.org/10.1145/3450626.3459816","external_id":{"isi":["000674930900132"]},"volume":40,"date_created":"2021-08-08T22:01:27Z","isi":1,"main_file_link":[{"url":"https://doi.org/10.1145/3450626.3459816","open_access":"1"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","publication_status":"published","quality_controlled":"1","oa":1,"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"project":[{"grant_number":"638176","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Sperl","full_name":"Sperl, Georg"},{"full_name":"Narain, Rahul","last_name":"Narain","first_name":"Rahul"},{"first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","last_name":"Wojtan"}],"citation":{"chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459816\">https://doi.org/10.1145/3450626.3459816</a>.","mla":"Sperl, Georg, et al. “Mechanics-Aware Deformation of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 168, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459816\">10.1145/3450626.3459816</a>.","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Mechanics-aware deformation of yarn pattern geometry,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-aware deformation of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459816\">https://doi.org/10.1145/3450626.3459816</a>","ista":"Sperl G, Narain R, Wojtan C. 2021. Mechanics-aware deformation of yarn pattern geometry. ACM Transactions on Graphics. 40(4), 168.","ama":"Sperl G, Narain R, Wojtan C. Mechanics-aware deformation of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459816\">10.1145/3450626.3459816</a>","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 40 (2021)."},"related_material":{"record":[{"id":"9327","status":"public","relation":"software"},{"relation":"dissertation_contains","status":"public","id":"12358"}],"link":[{"url":"https://ist.ac.at/en/news/knitting-virtual-yarn/","relation":"press_release","description":"News on IST Webpage"}]},"abstract":[{"lang":"eng","text":"Triangle mesh-based simulations are able to produce satisfying animations of knitted and woven cloth; however, they lack the rich geometric detail of yarn-level simulations. Naive texturing approaches do not consider yarn-level physics, while full yarn-level simulations may become prohibitively expensive for large garments. We propose a method to animate yarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware fashion. Using triangle strains to interpolate precomputed yarn geometry, we are able to reproduce effects such as knit loops tightening under stretching. In combination with precomputed mesh animation or real-time mesh simulation, our method is able to animate yarn-level cloth in real-time at large scales."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","year":"2021","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. We also thank Seddi Labs for providing the garment model with fold-over seams.\r\nThis research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific\r\nComputing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young Faculty Fellowship and a gift from Adobe Inc.","date_published":"2021-08-01T00:00:00Z","month":"08","title":"Mechanics-aware deformation of yarn pattern geometry","day":"01","publication":"ACM Transactions on Graphics","ddc":["000"],"issue":"4","intvolume":"        40","article_type":"original","type":"journal_article"},{"citation":{"ista":"Samarasinghe RA, Miranda O, Buth JE, Mitchell S, Ferando I, Watanabe M, Kurdian A, Golshani P, Plath K, Lowry WE, Parent JM, Mody I, Novitch BG. 2021. Identification of neural oscillations and epileptiform changes in human brain organoids. Nature Neuroscience. 24, 32.","short":"R.A. Samarasinghe, O. Miranda, J.E. Buth, S. Mitchell, I. Ferando, M. Watanabe, A. Kurdian, P. Golshani, K. Plath, W.E. Lowry, J.M. Parent, I. Mody, B.G. Novitch, Nature Neuroscience 24 (2021) 32.","ama":"Samarasinghe RA, Miranda O, Buth JE, et al. Identification of neural oscillations and epileptiform changes in human brain organoids. <i>Nature Neuroscience</i>. 2021;24:32. doi:<a href=\"https://doi.org/10.1038/s41593-021-00906-5\">10.1038/s41593-021-00906-5</a>","ieee":"R. A. Samarasinghe <i>et al.</i>, “Identification of neural oscillations and epileptiform changes in human brain organoids,” <i>Nature Neuroscience</i>, vol. 24. Springer Nature, p. 32, 2021.","mla":"Samarasinghe, Ranmal A., et al. “Identification of Neural Oscillations and Epileptiform Changes in Human Brain Organoids.” <i>Nature Neuroscience</i>, vol. 24, Springer Nature, 2021, p. 32, doi:<a href=\"https://doi.org/10.1038/s41593-021-00906-5\">10.1038/s41593-021-00906-5</a>.","chicago":"Samarasinghe, Ranmal A., Osvaldo Miranda, Jessie E. Buth, Simon Mitchell, Isabella Ferando, Momoko Watanabe, Arinnae Kurdian, et al. “Identification of Neural Oscillations and Epileptiform Changes in Human Brain Organoids.” <i>Nature Neuroscience</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41593-021-00906-5\">https://doi.org/10.1038/s41593-021-00906-5</a>.","apa":"Samarasinghe, R. A., Miranda, O., Buth, J. E., Mitchell, S., Ferando, I., Watanabe, M., … Novitch, B. G. (2021). Identification of neural oscillations and epileptiform changes in human brain organoids. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41593-021-00906-5\">https://doi.org/10.1038/s41593-021-00906-5</a>"},"author":[{"full_name":"Samarasinghe, Ranmal A.","last_name":"Samarasinghe","first_name":"Ranmal A."},{"full_name":"Miranda, Osvaldo","last_name":"Miranda","id":"862A3C56-A8BF-11E9-B4FA-D9E3E5697425","orcid":"0000-0001-6618-6889","first_name":"Osvaldo"},{"first_name":"Jessie E.","last_name":"Buth","full_name":"Buth, Jessie E."},{"last_name":"Mitchell","full_name":"Mitchell, Simon","first_name":"Simon"},{"first_name":"Isabella","full_name":"Ferando, Isabella","last_name":"Ferando"},{"first_name":"Momoko","full_name":"Watanabe, Momoko","last_name":"Watanabe"},{"first_name":"Arinnae","last_name":"Kurdian","full_name":"Kurdian, Arinnae"},{"full_name":"Golshani, Peyman","last_name":"Golshani","first_name":"Peyman"},{"full_name":"Plath, Kathrin","last_name":"Plath","first_name":"Kathrin"},{"last_name":"Lowry","full_name":"Lowry, William E.","first_name":"William E."},{"last_name":"Parent","full_name":"Parent, Jack M.","first_name":"Jack M."},{"first_name":"Istvan","full_name":"Mody, Istvan","last_name":"Mody"},{"last_name":"Novitch","full_name":"Novitch, Bennett G.","first_name":"Bennett G."}],"abstract":[{"lang":"eng","text":"Human brain organoids represent a powerful tool for the study of human neurological diseases particularly those that impact brain growth and structure. However, many neurological diseases lack obvious anatomical abnormalities, yet significantly impact neural network functions, raising the question of whether organoids possess sufficient neural network architecture and complexity to model these conditions. Here, we explore the network level functions of brain organoids using calcium sensor imaging and extracellular recording approaches that together reveal the existence of complex oscillatory network behaviors reminiscent of intact brain preparations. We further demonstrate strikingly abnormal epileptiform network activity in organoids derived from a Rett Syndrome patient despite only modest anatomical differences from isogenically matched controls, and rescue with an unconventional neuromodulatory drug Pifithrin-α. Together, these findings provide an essential foundation for the utilization of human brain organoids to study intact and disordered human brain network formation and illustrate their utility in therapeutic discovery."}],"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","publication_status":"published","quality_controlled":"1","oa":1,"publication_identifier":{"eissn":["1546-1726"],"issn":["1097-6256"]},"publication":"Nature Neuroscience","day":"23","OA_type":"green","type":"journal_article","article_type":"review","intvolume":"        24","year":"2021","acknowledgement":"We thank S. Butler, T. Carmichael and members of the laboratory of B.G.N. for helpful discussions and comments on the manuscript; N. Vishlaghi and F. Turcios-Hernandez for technical assistance, and J. Lee, S.-K. Lee, H. Shinagawa and K. Yoshikawa for valuable reagents. We also thank the UCLA Eli and Edythe Broad Stem Cell Research Center (BSCRC) and Intellectual and Developmental Disabilities Research Center microscopy cores for access to imaging facilities. This work was supported by grants from the California Institute for Regenerative Medicine (CIRM) (DISC1-08819 to B.G.N.), the National Institute of Health (R01NS089817, R01DA051897 and P50HD103557 to B.G.N.; K08NS119747 to R.A.S.; K99HD096105 to M.W.; R01MH123922, R01MH121521 and P50HD103557 to M.J.G.; R01GM099134 to K.P.; R01NS103788 to W.E.L.; R01NS088571 to J.M.P.; R01NS030549 and R01AG050474 to I.M.), and research awards from the UCLA Jonsson Comprehensive Cancer Center and BSCRC Ablon Scholars Program (to B.G.N.), the BSCRC Innovation Program (to B.G.N., K.P. and W.E.L.), the UCLA BSCRC Steffy Brain Aging Research Fund (to B.G.N. and W.E.L.) and the UCLA Clinical and Translational Science Institute (to B.G.N.), Paul Allen Family Foundation Frontiers Group (to K.P. and W.E.L.), the March of Dimes Foundation (to W.E.L.) and the Simons Foundation Autism Research Initiative Bridge to Independence Program (to R.A.S. and M.J.G.). R.A.S. was also supported by the UCLA/NINDS Translational Neuroscience Training Grant (R25NS065723), a Research and Training Fellowship from the American Epilepsy Society, a Taking Flight Award from CURE Epilepsy and a Clinician Scientist training award from the UCLA BSCRC. J.E.B. was supported by the UCLA BSCRC Rose Hills Foundation Graduate Scholarship Training Program. M.W. was supported by postdoctoral training awards provided by the UCLA BSCRC and the Uehara Memorial Foundation. O.A.M. and A.K. were supported in part by the UCLA-California State University Northridge CIRM-Bridges training program (EDUC2-08411). We also acknowledge the support of the IDDRC Cells, Circuits and Systems Analysis, Microscopy and Genetics and Genomics Cores of the Semel Institute of Neuroscience at UCLA, which are supported by the NICHD (U54HD087101 and P50HD10355701). We lastly acknowledge support from a Quantitative and Computational Biosciences Collaboratory Postdoctoral Fellowship to S.M. and the Quantitative and Computational Biosciences Collaboratory community, directed by M. Pellegrini.","date_published":"2021-08-23T00:00:00Z","title":"Identification of neural oscillations and epileptiform changes in human brain organoids","month":"08","department":[{"_id":"GradSch"},{"_id":"SiHi"}],"OA_place":"publisher","status":"public","page":"32","scopus_import":"1","date_updated":"2025-07-09T09:00:12Z","article_processing_charge":"No","doi":"10.1038/s41593-021-00906-5","_id":"6995","date_created":"2019-11-10T11:23:58Z","isi":1,"main_file_link":[{"url":"https://doi.org/10.1101/820183","open_access":"1"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"isi":["000687516300001"],"pmid":["34426698 "]},"fulldoi":"https://doi.org/10.1038/s41593-021-00906-5","volume":24},{"external_id":{"arxiv":["2103.07975"],"isi":["000683960800003"]},"fulldoi":"https://doi.org/10.1063/5.0053494","volume":62,"date_created":"2021-08-12T07:08:36Z","has_accepted_license":"1","isi":1,"oa_version":"Published Version","language":[{"iso":"eng"}],"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"scopus_import":"1","date_updated":"2024-10-09T21:00:48Z","article_processing_charge":"No","doi":"10.1063/5.0053494","_id":"9891","article_number":"083305","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","year":"2021","acknowledgement":"The author would like to thank Robert Seiringer for guidance and many helpful comments on this project. The author would also like to thank Mathieu Lewin for his comments on the manuscript and Lorenzo Portinale for providing his lecture notes for the course “Mathematics of quantum many-body systems” in spring 2020, taught by Robert Seiringer. The Proof of Theorem III.1 is inspired by these lecture notes.","file":[{"file_size":4352640,"content_type":"application/pdf","file_name":"2021_JMathPhy_Lauritsen.pdf","checksum":"d035be2b894c4d50d90ac5ce252e27cd","file_id":"10188","date_updated":"2021-10-27T12:57:06Z","success":1,"relation":"main_file","date_created":"2021-10-27T12:57:06Z","creator":"cziletti","access_level":"open_access"}],"date_published":"2021-08-01T00:00:00Z","month":"08","title":"Floating Wigner crystal and periodic jellium configurations","publication":"Journal of Mathematical Physics","day":"01","ddc":["530"],"issue":"8","type":"journal_article","intvolume":"        62","article_type":"original","publication_status":"published","quality_controlled":"1","arxiv":1,"oa":1,"publication_identifier":{"issn":["0022-2488"],"eissn":["1089-7658"]},"citation":{"apa":"Lauritsen, A. B. (2021). Floating Wigner crystal and periodic jellium configurations. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0053494\">https://doi.org/10.1063/5.0053494</a>","mla":"Lauritsen, Asbjørn Bækgaard. “Floating Wigner Crystal and Periodic Jellium Configurations.” <i>Journal of Mathematical Physics</i>, vol. 62, no. 8, 083305, AIP Publishing, 2021, doi:<a href=\"https://doi.org/10.1063/5.0053494\">10.1063/5.0053494</a>.","ieee":"A. B. Lauritsen, “Floating Wigner crystal and periodic jellium configurations,” <i>Journal of Mathematical Physics</i>, vol. 62, no. 8. AIP Publishing, 2021.","chicago":"Lauritsen, Asbjørn Bækgaard. “Floating Wigner Crystal and Periodic Jellium Configurations.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2021. <a href=\"https://doi.org/10.1063/5.0053494\">https://doi.org/10.1063/5.0053494</a>.","ama":"Lauritsen AB. Floating Wigner crystal and periodic jellium configurations. <i>Journal of Mathematical Physics</i>. 2021;62(8). doi:<a href=\"https://doi.org/10.1063/5.0053494\">10.1063/5.0053494</a>","short":"A.B. Lauritsen, Journal of Mathematical Physics 62 (2021).","ista":"Lauritsen AB. 2021. Floating Wigner crystal and periodic jellium configurations. Journal of Mathematical Physics. 62(8), 083305."},"file_date_updated":"2021-10-27T12:57:06Z","author":[{"id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288","first_name":"Asbjørn Bækgaard","full_name":"Lauritsen, Asbjørn Bækgaard","last_name":"Lauritsen"}],"abstract":[{"text":"Extending on ideas of Lewin, Lieb, and Seiringer [Phys. Rev. B 100, 035127 (2019)], we present a modified “floating crystal” trial state for jellium (also known as the classical homogeneous electron gas) with density equal to a characteristic function. This allows us to show that three definitions of the jellium energy coincide in dimensions d ≥ 2, thus extending the result of Cotar and Petrache [“Equality of the Jellium and uniform electron gas next-order asymptotic terms for Coulomb and Riesz potentials,” arXiv: 1707.07664 (2019)] and Lewin, Lieb, and Seiringer [Phys. Rev. B 100, 035127 (2019)] that the three definitions coincide in dimension d ≥ 3. We show that the jellium energy is also equivalent to a “renormalized energy” studied in a series of papers by Serfaty and others, and thus, by the work of Bétermin and Sandier [Constr. Approximation 47, 39–74 (2018)], we relate the jellium energy to the order n term in the logarithmic energy of n points on the unit 2-sphere. We improve upon known lower bounds for this renormalized energy. Additionally, we derive formulas for the jellium energy of periodic configurations.","lang":"eng"}],"corr_author":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"AIP Publishing"},{"quality_controlled":"1","publication_status":"published","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"project":[{"grant_number":"850899","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"arxiv":1,"oa":1,"abstract":[{"lang":"eng","text":"Eigenstate thermalization in quantum many-body systems implies that eigenstates at high energy are similar to random vectors. Identifying systems where at least some eigenstates are nonthermal is an outstanding question. In this Letter we show that interacting quantum models that have a nullspace—a degenerate subspace of eigenstates at zero energy (zero modes), which corresponds to infinite temperature, provide a route to nonthermal eigenstates. We analytically show the existence of a zero mode which can be represented as a matrix product state for a certain class of local Hamiltonians. In the more general case we use a subspace disentangling algorithm to generate an orthogonal basis of zero modes characterized by increasing entanglement entropy. We show evidence for an area-law entanglement scaling of the least-entangled zero mode in the broad parameter regime, leading to a conjecture that all local Hamiltonians with the nullspace feature zero modes with area-law entanglement scaling and, as such, break the strong thermalization hypothesis. Finally, we find zero modes in constrained models and propose a setup for observing their experimental signatures."}],"file_date_updated":"2021-08-13T09:28:08Z","related_material":{"record":[{"id":"19393","status":"public","relation":"dissertation_contains"}]},"citation":{"ista":"Karle V, Serbyn M, Michailidis A. 2021. Area-law entangled eigenstates from nullspaces of local Hamiltonians. Physical Review Letters. 127(6), 060602.","short":"V. Karle, M. Serbyn, A. Michailidis, Physical Review Letters 127 (2021).","ama":"Karle V, Serbyn M, Michailidis A. Area-law entangled eigenstates from nullspaces of local Hamiltonians. <i>Physical Review Letters</i>. 2021;127(6). doi:<a href=\"https://doi.org/10.1103/physrevlett.127.060602\">10.1103/physrevlett.127.060602</a>","mla":"Karle, Volker, et al. “Area-Law Entangled Eigenstates from Nullspaces of Local Hamiltonians.” <i>Physical Review Letters</i>, vol. 127, no. 6, 060602, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevlett.127.060602\">10.1103/physrevlett.127.060602</a>.","chicago":"Karle, Volker, Maksym Serbyn, and Alexios Michailidis. “Area-Law Entangled Eigenstates from Nullspaces of Local Hamiltonians.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevlett.127.060602\">https://doi.org/10.1103/physrevlett.127.060602</a>.","ieee":"V. Karle, M. Serbyn, and A. Michailidis, “Area-law entangled eigenstates from nullspaces of local Hamiltonians,” <i>Physical Review Letters</i>, vol. 127, no. 6. American Physical Society, 2021.","apa":"Karle, V., Serbyn, M., &#38; Michailidis, A. (2021). Area-law entangled eigenstates from nullspaces of local Hamiltonians. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.127.060602\">https://doi.org/10.1103/physrevlett.127.060602</a>"},"author":[{"first_name":"Volker","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425","orcid":"0000-0002-6963-0129","last_name":"Karle","full_name":"Karle, Volker"},{"id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym","full_name":"Serbyn, Maksym","last_name":"Serbyn"},{"orcid":"0000-0002-8443-1064","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","first_name":"Alexios","last_name":"Michailidis","full_name":"Michailidis, Alexios"}],"publisher":"American Physical Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2021","title":"Area-law entangled eigenstates from nullspaces of local Hamiltonians","month":"08","acknowledgement":"We acknowledge useful discussions with V. Gritsev and A. Garkun and suggestions on implementation of the\r\nPPXPP model by D. Bluvstein. A. M. and M. S. were supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899)","file":[{"date_updated":"2021-08-13T09:28:08Z","checksum":"51218f302dcef99d90d1209809fcc874","file_name":"PhysRevLett.127.060602_SOM.pdf","file_id":"9904","file_size":5064231,"content_type":"application/pdf","date_created":"2021-08-13T09:28:08Z","creator":"mserbyn","access_level":"open_access","relation":"main_file","success":1}],"date_published":"2021-08-06T00:00:00Z","ddc":["539"],"issue":"6","publication":"Physical Review Letters","day":"06","type":"journal_article","article_type":"letter_note","intvolume":"       127","date_updated":"2026-04-07T11:48:53Z","scopus_import":"1","doi":"10.1103/physrevlett.127.060602","_id":"9903","article_processing_charge":"Yes (in subscription journal)","ec_funded":1,"article_number":"060602","department":[{"_id":"MaSe"},{"_id":"GradSch"},{"_id":"MiLe"}],"status":"public","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":127,"external_id":{"arxiv":["2102.13633"],"isi":["000684276000002"]},"fulldoi":"https://doi.org/10.1103/physrevlett.127.060602","has_accepted_license":"1","isi":1,"date_created":"2021-08-13T09:27:39Z","oa_version":"Published Version","language":[{"iso":"eng"}]},{"OA_place":"publisher","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"status":"public","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"article_processing_charge":"No","doi":"10.15479/at:ista:9920","_id":"9920","page":"149","keyword":["quantum computing","superinductor","quantum metrology"],"date_updated":"2026-04-15T06:43:02Z","oa_version":"Published Version","language":[{"iso":"eng"}],"date_created":"2021-08-16T09:44:09Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.15479/at:ista:9920","alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","file_date_updated":"2021-09-06T08:39:47Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"9928","status":"public"},{"status":"public","id":"8755","relation":"part_of_dissertation"}]},"citation":{"ista":"Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria.","ama":"Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9920\">10.15479/at:ista:9920</a>","short":"M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021.","chicago":"Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9920\">https://doi.org/10.15479/at:ista:9920</a>.","mla":"Peruzzo, Matilda. <i>Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9920\">10.15479/at:ista:9920</a>.","ieee":"M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021.","apa":"Peruzzo, M. (2021). <i>Geometric superinductors and their applications in circuit quantum electrodynamics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9920\">https://doi.org/10.15479/at:ista:9920</a>"},"author":[{"full_name":"Peruzzo, Matilda","last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628","first_name":"Matilda"}],"abstract":[{"text":"This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented.","lang":"eng"}],"corr_author":"1","oa":1,"publication_identifier":{"isbn":["978-3-99078-013-8"],"issn":["2663-337X"]},"publication_status":"published","type":"dissertation","day":"19","ddc":["539"],"date_published":"2021-08-19T00:00:00Z","file":[{"relation":"source_file","date_created":"2021-08-16T09:33:21Z","creator":"mperuzzo","access_level":"closed","file_size":151387283,"content_type":"application/x-zip-compressed","date_updated":"2021-09-06T08:39:47Z","checksum":"3cd1986efde5121d7581f6fcf9090da8","file_name":"GeometricSuperinductorsForCQED.zip","file_id":"9924"},{"checksum":"50928c621cdf0775d7a5906b9dc8602c","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf","file_id":"9939","date_updated":"2021-09-06T08:39:47Z","file_size":17596344,"content_type":"application/pdf","date_created":"2021-08-18T14:20:06Z","access_level":"open_access","creator":"mperuzzo","relation":"main_file"},{"file_size":17592425,"content_type":"application/pdf","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf","checksum":"37f486aa1b622fe44af00d627ec13f6c","file_id":"9940","date_updated":"2021-09-06T08:39:47Z","description":"Extra copy of the thesis as PDF/A-2b","relation":"other","date_created":"2021-08-18T14:20:09Z","access_level":"closed","creator":"mperuzzo"}],"title":"Geometric superinductors and their applications in circuit quantum electrodynamics","month":"08","supervisor":[{"last_name":"Fink","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M"}],"year":"2021"},{"publication":"Journal of Theoretical Biology","day":"24","type":"journal_article","article_type":"original","intvolume":"       524","year":"2021","date_published":"2021-04-24T00:00:00Z","acknowledgement":"This work was supported by the Russian Science Foundation grant N 16-14-10173.","month":"04","title":"Two linked loci under mutation-selection balance and Muller’s ratchet","citation":{"ista":"Khudiakova K, Neretina TY, Kondrashov AS. 2021. Two linked loci under mutation-selection balance and Muller’s ratchet. Journal of Theoretical Biology. 524, 110729.","ama":"Khudiakova K, Neretina TY, Kondrashov AS. Two linked loci under mutation-selection balance and Muller’s ratchet. <i>Journal of Theoretical Biology</i>. 2021;524. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">10.1016/j.jtbi.2021.110729</a>","short":"K. Khudiakova, T.Y. Neretina, A.S. Kondrashov, Journal of Theoretical Biology 524 (2021).","mla":"Khudiakova, Kseniia, et al. “Two Linked Loci under Mutation-Selection Balance and Muller’s Ratchet.” <i>Journal of Theoretical Biology</i>, vol. 524, 110729, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">10.1016/j.jtbi.2021.110729</a>.","chicago":"Khudiakova, Kseniia, Tatiana Yu. Neretina, and Alexey S. Kondrashov. “Two Linked Loci under Mutation-Selection Balance and Muller’s Ratchet.” <i>Journal of Theoretical Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">https://doi.org/10.1016/j.jtbi.2021.110729</a>.","ieee":"K. Khudiakova, T. Y. Neretina, and A. S. Kondrashov, “Two linked loci under mutation-selection balance and Muller’s ratchet,” <i>Journal of Theoretical Biology</i>, vol. 524. Elsevier, 2021.","apa":"Khudiakova, K., Neretina, T. Y., &#38; Kondrashov, A. S. (2021). Two linked loci under mutation-selection balance and Muller’s ratchet. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">https://doi.org/10.1016/j.jtbi.2021.110729</a>"},"author":[{"first_name":"Kseniia","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","orcid":"0000-0002-6246-1465","last_name":"Khudiakova","full_name":"Khudiakova, Kseniia"},{"last_name":"Neretina","full_name":"Neretina, Tatiana Yu.","first_name":"Tatiana Yu."},{"full_name":"Kondrashov, Alexey S.","last_name":"Kondrashov","first_name":"Alexey S."}],"abstract":[{"text":"We report the complete analysis of a deterministic model of deleterious mutations and negative selection against them at two haploid loci without recombination. As long as mutation is a weaker force than selection, mutant alleles remain rare at the only stable equilibrium, and otherwise, a variety of dynamics are possible. If the mutation-free genotype is absent, generally the only stable equilibrium is the one that corresponds to fixation of the mutant allele at the locus where it is less deleterious. This result suggests that fixation of a deleterious allele that follows a click of the Muller’s ratchet is governed by natural selection, instead of random drift.","lang":"eng"}],"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","publication_status":"published","quality_controlled":"1","oa":1,"publication_identifier":{"issn":["0022-5193"]},"date_created":"2021-05-12T05:58:42Z","isi":1,"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/477489v1"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"isi":["000659161500002"],"pmid":["33901507"]},"fulldoi":"https://doi.org/10.1016/j.jtbi.2021.110729","volume":524,"das_tickbox":"1","article_number":"110729","department":[{"_id":"GradSch"}],"status":"public","keyword":["General Biochemistry","Genetics and Molecular Biology","Modelling and Simulation","Statistics and Probability","General Immunology and Microbiology","Applied Mathematics","General Agricultural and Biological Sciences","General Medicine"],"date_updated":"2026-07-06T12:58:31Z","scopus_import":"1","article_processing_charge":"No","doi":"10.1016/j.jtbi.2021.110729","_id":"9387"},{"oa_version":"Published Version","language":[{"iso":"eng"}],"date_created":"2021-07-27T15:48:30Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.15479/at:ista:9733","alternative_title":["ISTA Thesis"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"OA_place":"publisher","status":"public","department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"ec_funded":1,"article_processing_charge":"No","_id":"9733","doi":"10.15479/at:ista:9733","page":"180","date_updated":"2026-07-06T14:02:25Z","type":"dissertation","day":"20","ddc":["515","519","539"],"file":[{"date_updated":"2021-09-06T09:28:56Z","file_name":"Thesis_FeliciangeliA.pdf","checksum":"e88bb8ca43948abe060eb2d2fa719881","file_id":"9944","file_size":1958710,"content_type":"application/pdf","date_created":"2021-08-19T14:03:48Z","creator":"dfelicia","access_level":"open_access","relation":"main_file"},{"relation":"source_file","date_created":"2021-08-19T14:06:35Z","creator":"dfelicia","access_level":"closed","file_size":3771669,"content_type":"application/octet-stream","checksum":"72810843abee83705853505b3f8348aa","file_name":"thesis.7z","file_id":"9945","date_updated":"2022-03-10T12:13:57Z"}],"date_published":"2021-08-20T00:00:00Z","month":"08","title":"The polaron at strong coupling","year":"2021","supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert"},{"full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9787"},{"relation":"part_of_dissertation","status":"public","id":"9792"},{"id":"9791","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9225"},{"relation":"part_of_dissertation","status":"public","id":"9781"}]},"citation":{"apa":"Feliciangeli, D. (2021). <i>The polaron at strong coupling</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>","mla":"Feliciangeli, Dario. <i>The Polaron at Strong Coupling</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>.","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021.","chicago":"Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>.","ama":"Feliciangeli D. The polaron at strong coupling. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>","short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria."},"file_date_updated":"2022-03-10T12:13:57Z","author":[{"full_name":"Feliciangeli, Dario","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","first_name":"Dario"}],"abstract":[{"lang":"eng","text":"This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author."}],"corr_author":"1","oa":1,"project":[{"name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","call_identifier":"H2020"},{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published"},{"language":[{"iso":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}],"isi":1,"has_accepted_license":"1","date_created":"2022-01-25T15:44:54Z","das_tickbox":"1","fulldoi":"https://doi.org/10.1109/ICRA48506.2021.9561036","external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"status":"public","OA_place":"repository","tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"_id":"10666","doi":"10.1109/ICRA48506.2021.9561036","conference":{"location":"Xi'an, China","name":"ICRA: International Conference on Robotics and Automation","end_date":"2021-06-05","start_date":"2021-05-30"},"article_processing_charge":"No","date_updated":"2026-07-07T06:20:35Z","scopus_import":"1","page":"4140-4147","type":"conference","OA_type":"green","ddc":["000"],"day":"01","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","publication":"2021 IEEE International Conference on Robotics and Automation","title":"Adversarial training is not ready for robot learning","month":"06","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","date_published":"2021-06-01T00:00:00Z","year":"2021","publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"citation":{"apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China: IEEE. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, IEEE, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. IEEE, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, IEEE, 2021, pp. 4140–4147.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. IEEE; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 4140–4147."},"related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"publication_identifier":{"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"],"eissn":["2577-087X"],"eisbn":["978-1-7281-9077-8"]},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"oa":1,"arxiv":1,"quality_controlled":"1","publication_status":"published"},{"date_created":"2022-01-25T15:45:58Z","has_accepted_license":"1","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"external_id":{"arxiv":["2111.03165"]},"fulldoi":"https://doi.org/10.48550/arXiv.2111.03165","alternative_title":[" Advances in Neural Information Processing Systems"],"das_tickbox":"1","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"status":"public","date_updated":"2026-07-07T06:49:10Z","ec_funded":1,"conference":{"end_date":"2021-12-10","start_date":"2021-12-06","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems"},"article_processing_charge":"No","doi":"10.48550/arXiv.2111.03165","_id":"10667","publication":"35th Conference on Neural Information Processing Systems","day":"01","ddc":["000"],"type":"conference","year":"2021","date_published":"2021-12-01T00:00:00Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","file":[{"relation":"main_file","success":1,"date_created":"2022-01-26T07:39:59Z","access_level":"open_access","creator":"mlechner","file_size":452492,"content_type":"application/pdf","date_updated":"2022-01-26T07:39:59Z","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_name":"infinite_time_horizon_safety_o.pdf","file_id":"10682"}],"title":"Infinite time horizon safety of Bayesian neural networks","month":"12","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"citation":{"ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>"},"file_date_updated":"2022-01-26T07:39:59Z","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724"}],"abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Neural Information Processing Systems Foundation","publication_status":"published","quality_controlled":"1","arxiv":1,"oa":1,"publication_identifier":{"issn":["1049-5258"]},"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}]},{"year":"2021","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","file":[{"creator":"mlechner","access_level":"open_access","date_created":"2022-01-26T07:37:24Z","relation":"main_file","success":1,"file_id":"10679","checksum":"be81f0ade174a8c9b2d4fe09590b2021","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_updated":"2022-01-26T07:37:24Z","content_type":"application/pdf","file_size":6841228}],"date_published":"2021-12-01T00:00:00Z","title":"Causal navigation by continuous-time neural networks","month":"12","publication":"35th Conference on Neural Information Processing Systems","day":"01","ddc":["000"],"type":"conference","publication_status":"published","quality_controlled":"1","arxiv":1,"oa":1,"publication_identifier":{"issn":["1049-5258"]},"project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"citation":{"chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021."},"file_date_updated":"2022-01-26T07:37:24Z","author":[{"first_name":"Charles J","full_name":"Vorbach, Charles J","last_name":"Vorbach"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Neural Information Processing Systems Foundation","external_id":{"arxiv":["2106.08314"]},"alternative_title":[" Advances in Neural Information Processing Systems"],"das_tickbox":"1","date_created":"2022-01-25T15:47:50Z","has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"date_updated":"2026-07-07T06:49:46Z","conference":{"start_date":"2021-12-06","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual"},"article_processing_charge":"No","_id":"10670","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"tmp":{"short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"status":"public"},{"title":"The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus","das_tickbox":"1","month":"10","date_published":"2021-10-02T00:00:00Z","acknowledgement":"We thank Federico Stella for invaluable suggestions and discussions. We thank Yosman BapatDhar and Andrea Cumpelik for comments, help and suggestions on the exposure of the text. We thank Predrag Živadinović and Juliana Couras for comments on the text and the figures. This work was supported by the EU-FP7 MC-ITN IN-SENS (grant 607616).","external_id":{"biorxivid":["10.1101/2021.09.30.462269"]},"year":"2021","fulldoi":"https://doi.org/10.1101/2021.09.30.462269","oa_version":"Preprint","language":[{"iso":"eng"}],"type":"preprint","main_file_link":[{"url":"https://doi.org/10.1101/2021.09.30.462269","open_access":"1"}],"date_created":"2021-10-04T06:28:32Z","publication":"bioRxiv","day":"02","doi":"10.1101/2021.09.30.462269","_id":"10080","project":[{"name":"inter-and intracellular signalling in schizophrenia","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","grant_number":"607616","call_identifier":"FP7"}],"oa":1,"ec_funded":1,"article_processing_charge":"No","biorxivid":1,"date_updated":"2026-07-29T06:33:53Z","publication_status":"submitted","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Hippocampal and neocortical neural activity is modulated by the position of the individual in space. While hippocampal neurons provide the basis for a spatial map, prefrontal cortical neurons generalize over environmental features. Whether these generalized representations result from a bidirectional interaction with, or are mainly derived from hippocampal spatial representations is not known. By examining simultaneously recorded hippocampal and medial prefrontal neurons, we observed that prefrontal spatial representations show a delayed coherence with hippocampal ones. We also identified subpopulations of cells in the hippocampus and medial prefrontal cortex that formed functional cross-area couplings; these resembled the optimal connections predicted by a probabilistic model of spatial information transfer and generalization. Moreover, cross-area couplings were strongest and had the shortest delay preceding spatial decision-making. Our results suggest that generalized spatial coding in the medial prefrontal cortex is inherited from spatial representations in the hippocampus, and that the routing of information can change dynamically with behavioral demands."}],"citation":{"apa":"Nardin, M., Käfer, K., &#38; Csicsvari, J. L. (n.d.). The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>","ieee":"M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus,” <i>bioRxiv</i>. .","chicago":"Nardin, Michele, Karola Käfer, and Jozsef L Csicsvari. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>.","mla":"Nardin, Michele, et al. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>.","short":"M. Nardin, K. Käfer, J.L. Csicsvari, BioRxiv (n.d.).","ama":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>","ista":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv, <a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>."},"author":[{"full_name":"Nardin, Michele","last_name":"Nardin","first_name":"Michele","orcid":"0000-0001-8849-6570","id":"30BD0376-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Käfer, Karola","last_name":"Käfer","first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L"}],"department":[{"_id":"GradSch"},{"_id":"JoCs"}]},{"oa_version":"Published Version","language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2021-05-24T13:06:23Z","alternative_title":["ISTA Thesis"],"fulldoi":"https://doi.org/10.15479/AT:ISTA:9418","OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"status":"public","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"_id":"9418","doi":"10.15479/AT:ISTA:9418","article_processing_charge":"No","date_updated":"2026-07-30T05:33:52Z","page":"125","type":"dissertation","ddc":["000"],"day":"30","title":"Underspecification in deep learning","month":"05","date_published":"2021-05-30T00:00:00Z","file":[{"relation":"main_file","success":1,"date_created":"2021-05-24T11:22:29Z","access_level":"open_access","creator":"bphuong","file_size":2673905,"content_type":"application/pdf","date_updated":"2021-05-24T11:22:29Z","checksum":"4f0abe64114cfed264f9d36e8d1197e3","file_name":"mph-thesis-v519-pdfimages.pdf","file_id":"9419"},{"relation":"source_file","access_level":"closed","creator":"bphuong","date_created":"2021-05-24T11:56:02Z","content_type":"application/zip","file_size":92995100,"file_id":"9420","file_name":"thesis.zip","checksum":"f5699e876bc770a9b0df8345a77720a2","date_updated":"2021-05-24T11:56:02Z"}],"year":"2021","supervisor":[{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"publisher":"Institute of Science and Technology Austria","doi_confirm":"1","degree_awarded":"PhD","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"corr_author":"1","file_date_updated":"2021-05-24T11:56:02Z","citation":{"ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>","mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>.","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>"},"related_material":{"record":[{"status":"deleted","id":"7435","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7481","status":"public"},{"status":"public","id":"9416","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"7479"}]},"author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong","full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai"}],"publication_identifier":{"issn":["2663-337X"]},"oa":1,"publication_status":"published"},{"scopus_import":"1","date_updated":"2026-07-30T05:33:51Z","_id":"9416","article_processing_charge":"No","conference":{"end_date":"2021-05-07","start_date":"2021-05-03","location":"Virtual","name":"ICLR: International Conference on Learning Representations"},"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"status":"public","has_accepted_license":"1","date_created":"2021-05-24T11:16:46Z","oa_version":"Published Version","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=krz7T0xU9Z_"}],"quality_controlled":"1","publication_status":"published","oa":1,"abstract":[{"lang":"eng","text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time  onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks."}],"corr_author":"1","file_date_updated":"2021-05-24T11:15:57Z","related_material":{"record":[{"status":"public","id":"9418","relation":"dissertation_contains"}]},"citation":{"ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>, 2021.","chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In <i>9th International Conference on Learning Representations</i>, 2021.","apa":"Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In <i>9th International Conference on Learning Representations</i>. Virtual.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021."},"author":[{"full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","month":"05","title":"The inductive bias of ReLU networks on orthogonally separable data","file":[{"date_updated":"2021-05-24T11:15:57Z","file_id":"9417","file_name":"iclr2021_conference.pdf","checksum":"f34ff17017527db5ba6927f817bdd125","content_type":"application/pdf","file_size":502356,"access_level":"open_access","creator":"bphuong","date_created":"2021-05-24T11:15:57Z","relation":"main_file"}],"date_published":"2021-05-01T00:00:00Z","ddc":["000"],"publication":"9th International Conference on Learning Representations","day":"01","type":"conference"},{"oa_version":"Published Version","language":[{"iso":"eng"}],"date_created":"2021-04-30T17:30:47Z","has_accepted_license":"1","isi":1,"external_id":{"arxiv":["2105.08353"],"isi":["000947350400021"]},"fulldoi":"https://doi.org/10.1109/LICS52264.2021.9470547","status":"public","article_number":"9470547","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"conference":{"end_date":"2021-07-02","start_date":"2021-06-29","location":"Online","name":"LICS: Logic in Computer Science"},"article_processing_charge":"No","_id":"9356","doi":"10.1109/LICS52264.2021.9470547","scopus_import":"1","date_updated":"2026-08-12T06:39:11Z","type":"conference","publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"29","ddc":["000"],"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","date_published":"2021-06-29T00:00:00Z","file":[{"relation":"main_file","success":1,"date_created":"2021-06-16T08:23:54Z","creator":"esarac","access_level":"open_access","file_size":641990,"content_type":"application/pdf","date_updated":"2021-06-16T08:23:54Z","file_name":"qam.pdf","checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","file_id":"9557"}],"month":"06","title":"Quantitative and approximate monitoring","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","file_date_updated":"2021-06-16T08:23:54Z","citation":{"ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 9470547.","short":"T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021.","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>","ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Online, 2021.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>.","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 9470547, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Online: IEEE. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>"},"related_material":{"record":[{"id":"20147","status":"public","relation":"dissertation_contains"}]},"author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Sarac","full_name":"Sarac, Naci E","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"abstract":[{"text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.","lang":"eng"}],"arxiv":1,"oa":1,"project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"publication_status":"published","quality_controlled":"1"}]