[{"corr_author":"1","fulldoi":"https://doi.org/10.15479/at:ista:12103","file_date_updated":"2023-02-02T09:39:25Z","has_accepted_license":"1","article_processing_charge":"No","_id":"12358","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-020-6"]},"alternative_title":["ISTA Thesis"],"related_material":{"record":[{"id":"8385","status":"public","relation":"part_of_dissertation"},{"id":"11736","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9818"}]},"publication_status":"published","type":"dissertation","doi":"10.15479/at:ista:12103","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","supervisor":[{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"month":"09","date_published":"2022-09-22T00:00:00Z","page":"138","project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"file":[{"checksum":"083722acbb8115e52e3b0fdec6226769","date_created":"2023-01-25T12:04:41Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"thesis_gsperl.pdf","description":"This is the main PDF file of the thesis. File size: 105 MB","creator":"cchlebak","title":"Thesis","file_id":"12371","file_size":104497530,"date_updated":"2023-02-02T09:29:57Z"},{"relation":"main_file","content_type":"application/pdf","file_name":"thesis_gsperl_compressed.pdf","description":"This version of the thesis uses stronger image compression for a smaller file size of 23MB.","title":"Thesis (compressed 23MB)","file_id":"12483","creator":"cchlebak","date_updated":"2023-02-02T09:33:37Z","file_size":23183710,"checksum":"511f82025e5fcb70bff4731d6896ca07","access_level":"open_access","date_created":"2023-02-02T09:33:37Z"},{"creator":"cchlebak","file_id":"12484","file_size":98382247,"date_updated":"2023-02-02T09:39:25Z","content_type":"application/x-zip-compressed","relation":"source_file","file_name":"thesis-source.zip","checksum":"ed4cb85225eedff761c25bddfc37a2ed","date_created":"2023-02-02T09:39:25Z","access_level":"open_access"}],"ec_funded":1,"year":"2022","day":"22","date_created":"2023-01-24T10:49:46Z","author":[{"first_name":"Georg","last_name":"Sperl","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87"}],"citation":{"mla":"Sperl, Georg. Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12103.","ista":"Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria.","short":"G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting, Institute of Science and Technology Austria, 2022.","chicago":"Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12103.","ama":"Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. 2022. doi:10.15479/at:ista:12103","ieee":"G. Sperl, “Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting,” Institute of Science and Technology Austria, 2022.","apa":"Sperl, G. (2022). Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12103"},"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"The complex yarn structure of knitted and woven fabrics gives rise to both a mechanical and\r\nvisual complexity. The small-scale interactions of yarns colliding with and pulling on each\r\nother result in drastically different large-scale stretching and bending behavior, introducing\r\nanisotropy, curling, and more. While simulating cloth as individual yarns can reproduce this\r\ncomplexity and match the quality of real fabric, it may be too computationally expensive for\r\nlarge fabrics. On the other hand, continuum-based approaches do not need to discretize the\r\ncloth at a stitch-level, but it is non-trivial to find a material model that would replicate the\r\nlarge-scale behavior of yarn fabrics, and they discard the intricate visual detail. In this thesis,\r\nwe discuss three methods to try and bridge the gap between small-scale and large-scale yarn\r\nmechanics using numerical homogenization: fitting a continuum model to periodic yarn simulations, adding mechanics-aware yarn detail onto thin-shell simulations, and quantitatively\r\nfitting yarn parameters to physical measurements of real fabric.\r\nTo start, we present a method for animating yarn-level cloth effects using a thin-shell solver.\r\nWe first use a large number of periodic yarn-level simulations to build a model of the potential\r\nenergy density of the cloth, and then use it to compute forces in a thin-shell simulator. The\r\nresulting simulations faithfully reproduce expected effects like the stiffening of woven fabrics\r\nand the highly deformable nature and anisotropy of knitted fabrics at a fraction of the cost of\r\nfull yarn-level simulation.\r\nWhile our thin-shell simulations are able to capture large-scale yarn mechanics, they lack\r\nthe rich visual detail of yarn-level simulations. Therefore, we propose a method to animate\r\nyarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware\r\nfashion in real time. Using triangle strains to interpolate precomputed yarn geometry, we are\r\nable to reproduce effects such as knit loops tightening under stretching at negligible cost.\r\nFinally, we introduce a methodology for inverse-modeling of yarn-level mechanics of cloth,\r\nbased on the mechanical response of fabrics in the real world. We compile a database from\r\nphysical tests of several knitted fabrics used in the textile industry spanning diverse physical\r\nproperties like stiffness, nonlinearity, and anisotropy. We then develop a system for approximating these mechanical responses with yarn-level cloth simulation, using homogenized\r\nshell models to speed up computation and adding some small-but-necessary extensions to\r\nyarn-level models used in computer graphics.\r\n","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"language":[{"iso":"eng"}],"oa":1,"OA_place":"publisher","ddc":["000","620"],"acknowledged_ssus":[{"_id":"SSU"}],"oa_version":"Published Version","degree_awarded":"PhD","date_updated":"2026-06-18T19:57:47Z","title":"Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting","status":"public"},{"year":"2022","ec_funded":1,"file":[{"file_name":"THESIS_FINAL_FArslan_pdfa.pdf","content_type":"application/pdf","relation":"main_file","file_size":14581024,"date_updated":"2023-01-25T10:52:46Z","creator":"cchlebak","file_id":"12369","date_created":"2023-01-25T10:52:46Z","success":1,"access_level":"open_access","checksum":"e54a3e69b83ebf166544164afd25608e"}],"project":[{"grant_number":"742573","_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation"}],"page":"113","supervisor":[{"first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"date_published":"2022-09-29T00:00:00Z","month":"09","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","title":"Remodeling of E-cadherin-mediated contacts via cortical flows","date_updated":"2026-06-18T19:47:50Z","degree_awarded":"PhD","oa_version":"Published Version","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"NanoFab"}],"ddc":["570"],"OA_place":"publisher","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"CaHe"}],"abstract":[{"text":"Metazoan development relies on the formation and remodeling of cell-cell contacts. The \r\nbinding of adhesion receptors and remodeling of the actomyosin cell cortex at cell-cell \r\ninteraction sites have been implicated in cell-cell contact formation. Yet, how these two \r\nprocesses functionally interact to drive cell-cell contact expansion and strengthening \r\nremains unclear. Here, we study how primary germ layer progenitor cells from zebrafish \r\nbind to supported lipid bilayers (SLB) functionalized with E-cadherin ectodomains as an \r\nassay system for monitoring cell-cell contact formation at high spatiotemporal resolution. \r\nWe show that cell-cell contact formation represents a two-tiered process: E-cadherin\u0002mediated downregulation of the small GTPase RhoA at the forming contact leads to both \r\ndepletion of Myosin-2 and decrease of F-actin. This is followed by centrifugal actin \r\nnetwork flows at the contact triggered by a sharp gradient of Myosin-2 at the rim of the \r\ncontact zone, with Myosin-2 displaying higher cortical localization outside than inside of \r\nthe contact. These centrifugal cortical actin flows, in turn, not only further dilute the actin \r\nnetwork at the contact disc, but also lead to an accumulation of both F-actin and E\u0002cadherin at the contact rim. Eventually, this combination of actomyosin downregulation \r\nand flows at the contact contribute to the characteristic molecular organization implicated \r\nin contact formation and maintenance: depletion of cortical actomyosin at the contact disc, \r\ndriving contact expansion by lowering interfacial tension at the contact, and accumulation \r\nof both E-cadherin and F-actin at the contact rim, mechanically linking the contractile \r\ncortices of the adhering cells. Thus, using a biomimetic assay, we exemplify how \r\nadhesion signaling and cell mechanics function together to modulate the spatial \r\norganization of cell-cell contacts.","lang":"eng"}],"citation":{"ieee":"F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical flows,” Institute of Science and Technology Austria, 2022.","apa":"Arslan, F. N. (2022). Remodeling of E-cadherin-mediated contacts via cortical flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12153","short":"F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows, Institute of Science and Technology Austria, 2022.","ama":"Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical flows. 2022. doi:10.15479/at:ista:12153","chicago":"Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12153.","ista":"Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical flows. Institute of Science and Technology Austria.","mla":"Arslan, Feyza N. Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12153."},"author":[{"last_name":"Arslan","first_name":"Feyza N","full_name":"Arslan, Feyza N","orcid":"0000-0001-5809-9566","id":"49DA7910-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","date_created":"2023-01-25T10:43:24Z","day":"29","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2023-01-25T10:52:46Z","fulldoi":"https://doi.org/10.15479/at:ista:12153","corr_author":"1","doi":"10.15479/at:ista:12153","type":"dissertation","publication_status":"published","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"id":"9350","status":"public","relation":"part_of_dissertation"}]},"publication_identifier":{"isbn":["978-3-99078-025-1 "],"issn":["2663-337X"]},"_id":"12368"},{"year":"2022","ec_funded":1,"file":[{"file_id":"12391","creator":"cchlebak","file_size":3095225,"date_updated":"2023-01-26T10:02:34Z","relation":"main_file","content_type":"application/pdf","file_name":"Brooks_Thesis.pdf","checksum":"b31460e937f33b557abb40ebef02b567","access_level":"open_access","success":1,"date_created":"2023-01-26T10:02:34Z"},{"checksum":"9751869fa5e7981588ad4228f4fd4bd6","access_level":"closed","date_created":"2023-01-26T10:02:42Z","relation":"source_file","content_type":"application/octet-stream","file_name":"Brooks_Thesis.tex","creator":"cchlebak","file_id":"12392","date_updated":"2023-01-26T10:02:42Z","file_size":809842}],"project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"page":"196","date_published":"2022-12-15T00:00:00Z","month":"12","supervisor":[{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"title":"Translation-invariant quantum systems with effectively broken symmetry","date_updated":"2026-04-16T08:20:52Z","degree_awarded":"PhD","oa_version":"Published Version","ddc":["500"],"OA_place":"publisher","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"RoSe"}],"abstract":[{"text":"The scope of this thesis is to study quantum systems exhibiting a continuous symmetry that\r\nis broken on the level of the corresponding effective theory. In particular we are going to\r\ninvestigate translation-invariant Bose gases in the mean field limit, effectively described by\r\nthe Hartree functional, and the Fröhlich Polaron in the regime of strong coupling, effectively\r\ndescribed by the Pekar functional. The latter is a model describing the interaction between a\r\ncharged particle and the optical modes of a polar crystal. Regarding the former, we assume in\r\naddition that the particles in the gas are unconfined, and typically we will consider particles\r\nthat are subject to an attractive interaction. In both cases the ground state energy of the\r\nHamiltonian is not a proper eigenvalue due to the underlying translation-invariance, while on\r\nthe contrary there exists a whole invariant orbit of minimizers for the corresponding effective\r\nfunctionals. Both, the absence of proper eigenstates and the broken symmetry of the effective\r\ntheory, make the study significantly more involved and it is the content of this thesis to\r\ndevelop a frameworks which allows for a systematic way to circumvent these issues.\r\nIt is a well-established result that the ground state energy of Bose gases in the mean field limit,\r\nas well as the ground state energy of the Fröhlich Polaron in the regime of strong coupling, is\r\nto leading order given by the minimal energy of the corresponding effective theory. As part\r\nof this thesis we identify the sub-leading term in the expansion of the ground state energy,\r\nwhich can be interpreted as the quantum correction to the classical energy, since the effective\r\ntheories under consideration can be seen as classical counterparts.\r\nWe are further going to establish an asymptotic expression for the energy-momentum relation\r\nof the Fröhlich Polaron in the strong coupling limit. In the regime of suitably small momenta,\r\nthis asymptotic expression agrees with the energy-momentum relation of a free particle having\r\nan effectively increased mass, and we find that this effectively increased mass agrees with the\r\nconjectured value in the physics literature.\r\nIn addition we will discuss two unrelated papers written by the author during his stay at ISTA\r\nin the appendix. The first one concerns the realization of anyons, which are quasi-particles\r\nacquiring a non-trivial phase under the exchange of two particles, as molecular impurities.\r\nThe second one provides a classification of those vector fields defined on a given manifold\r\nthat can be written as the gradient of a given functional with respect to a suitable metric,\r\nprovided that some mild smoothness assumptions hold. This classification is subsequently\r\nused to identify those quantum Markov semigroups that can be written as a gradient flow of\r\nthe relative entropy.\r\n","lang":"eng"}],"publisher":"Institute of Science and Technology Austria","author":[{"id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","orcid":"0000-0002-6249-0928","full_name":"Brooks, Morris","last_name":"Brooks","first_name":"Morris"}],"citation":{"apa":"Brooks, M. (2022). Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12390","ieee":"M. Brooks, “Translation-invariant quantum systems with effectively broken symmetry,” Institute of Science and Technology Austria, 2022.","ama":"Brooks M. Translation-invariant quantum systems with effectively broken symmetry. 2022. doi:10.15479/at:ista:12390","chicago":"Brooks, Morris. “Translation-Invariant Quantum Systems with Effectively Broken Symmetry.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12390.","short":"M. Brooks, Translation-Invariant Quantum Systems with Effectively Broken Symmetry, Institute of Science and Technology Austria, 2022.","ista":"Brooks M. 2022. Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria.","mla":"Brooks, Morris. Translation-Invariant Quantum Systems with Effectively Broken Symmetry. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12390."},"date_created":"2023-01-26T10:00:42Z","day":"15","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2023-01-26T10:02:42Z","fulldoi":"https://doi.org/10.15479/at:ista:12390","corr_author":"1","doi":"10.15479/at:ista:12390","type":"dissertation","publication_status":"published","related_material":{"record":[{"status":"public","id":"9005","relation":"part_of_dissertation"}]},"alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"_id":"12390"},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20551"}]},"publication_status":"published","type":"journal_article","doi":"10.1145/3550454.3555459","article_number":"241","intvolume":" 41","issue":"6","_id":"12431","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"file_date_updated":"2023-01-30T07:15:48Z","quality_controlled":"1","has_accepted_license":"1","article_processing_charge":"No","isi":1,"fulldoi":"https://doi.org/10.1145/3550454.3555459","article_type":"original","ddc":["000"],"oa_version":"Published Version","date_updated":"2026-04-07T12:02:23Z","volume":41,"title":"Hidden degrees of freedom in implicit vortex filaments","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","date_created":"2023-01-29T23:00:59Z","day":"01","publisher":"Association for Computing Machinery","author":[{"last_name":"Ishida","first_name":"Sadashige","orcid":"0000-0002-3121-3100","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige"},{"orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J"},{"last_name":"Chern","first_name":"Albert","full_name":"Chern, Albert"}],"citation":{"ista":"Ishida S, Wojtan C, Chern A. 2022. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 41(6), 241.","mla":"Ishida, Sadashige, et al. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” ACM Transactions on Graphics, vol. 41, no. 6, 241, Association for Computing Machinery, 2022, doi:10.1145/3550454.3555459.","short":"S. Ishida, C. Wojtan, A. Chern, ACM Transactions on Graphics 41 (2022).","ama":"Ishida S, Wojtan C, Chern A. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 2022;41(6). doi:10.1145/3550454.3555459","chicago":"Ishida, Sadashige, Chris Wojtan, and Albert Chern. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3550454.3555459.","ieee":"S. Ishida, C. Wojtan, and A. Chern, “Hidden degrees of freedom in implicit vortex filaments,” ACM Transactions on Graphics, vol. 41, no. 6. Association for Computing Machinery, 2022.","apa":"Ishida, S., Wojtan, C., & Chern, A. (2022). Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3550454.3555459"},"department":[{"_id":"ChWo"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"This paper presents a new representation of curve dynamics, with applications to vortex filaments in fluid dynamics. Instead of representing these filaments with explicit curve geometry and Lagrangian equations of motion, we represent curves implicitly with a new co-dimensional 2 level set description. Our implicit representation admits several redundant mathematical degrees of freedom in both the configuration and the dynamics of the curves, which can be tailored specifically to improve numerical robustness, in contrast to naive approaches for implicit curve dynamics that suffer from overwhelming numerical stability problems. Furthermore, we note how these hidden degrees of freedom perfectly map to a Clebsch representation in fluid dynamics. Motivated by these observations, we introduce untwisted level set functions and non-swirling dynamics which successfully regularize sources of numerical instability, particularly in the twisting modes around curve filaments. A consequence is a novel simulation method which produces stable dynamics for large numbers of interacting vortex filaments and effortlessly handles topological changes and re-connection events."}],"oa":1,"external_id":{"isi":["000891651900061"]},"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"file":[{"checksum":"a2fba257fdefe0e747182be6c0f7c70c","success":1,"date_created":"2023-01-30T07:15:48Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2022_ACM_Ishida.pdf","file_id":"12433","creator":"dernst","file_size":15551202,"date_updated":"2023-01-30T07:15:48Z"}],"publication":"ACM Transactions on Graphics","year":"2022","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2022-12-01T00:00:00Z","month":"12","scopus_import":"1","acknowledgement":"We thank the visual computing group at IST Austria for their valuable discussions and feedback. Houdini Education licenses were provided by SideFX software. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA)."},{"quality_controlled":"1","has_accepted_license":"1","file_date_updated":"2023-01-30T10:48:37Z","article_processing_charge":"No","_id":"12452","article_number":"708","publication_status":"published","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2022-12-01T00:00:00Z","month":"12","acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784).","scopus_import":"1","publication":"33rd British Machine Vision Conference","file":[{"title":"VoRF: Volumetric Relightable Faces","file_id":"12453","creator":"bbickel","date_updated":"2023-01-30T10:48:18Z","file_size":5202710,"relation":"main_file","content_type":"application/pdf","file_name":"vorf_main.pdf","checksum":"b60b70bb48700aee709c85a69231821d","access_level":"open_access","date_created":"2023-01-30T10:48:18Z"},{"file_name":"vorf_supp.pdf","relation":"supplementary_material","content_type":"application/pdf","file_size":37953188,"date_updated":"2023-01-30T10:48:29Z","creator":"bbickel","title":"VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –","file_id":"12454","access_level":"open_access","date_created":"2023-01-30T10:48:29Z","checksum":"ce5f4ce66eaaa1590ee5df989fca6f61"},{"file_size":57855492,"date_updated":"2023-01-30T10:48:37Z","creator":"bbickel","file_id":"12455","file_name":"video.mp4","relation":"supplementary_material","content_type":"video/mp4","access_level":"open_access","date_created":"2023-01-30T10:48:37Z","checksum":"08aecca434b08fee75ee1efe87943718"}],"conference":{"end_date":"2022-11-24","name":"BMVC: British Machine Vision Conference","start_date":"2022-11-21","location":"London, United Kingdom"},"year":"2022","publisher":"British Machine Vision Association and Society for Pattern Recognition","author":[{"full_name":"Rao, Pramod","last_name":"Rao","first_name":"Pramod"},{"full_name":"B R, Mallikarjun","first_name":"Mallikarjun","last_name":"B R"},{"full_name":"Fox, Gereon","last_name":"Fox","first_name":"Gereon"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"full_name":"Seidel, Hans-Peter","last_name":"Seidel","first_name":"Hans-Peter"},{"full_name":"Pfister, Hanspeter","last_name":"Pfister","first_name":"Hanspeter"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"first_name":"Ayush","last_name":"Tewari","full_name":"Tewari, Ayush"},{"last_name":"Theobalt","first_name":"Christian","full_name":"Theobalt, Christian"},{"last_name":"Elgharib","first_name":"Mohamed","full_name":"Elgharib, Mohamed"}],"citation":{"short":"P. Rao, M. B R, G. Fox, T. Weyrich, B. Bickel, H.-P. Seidel, H. Pfister, W. Matusik, A. Tewari, C. Theobalt, M. Elgharib, in:, 33rd British Machine Vision Conference, British Machine Vision Association and Society for Pattern Recognition, 2022.","ama":"Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: 33rd British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition; 2022.","chicago":"Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In 33rd British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition, 2022.","mla":"Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” 33rd British Machine Vision Conference, 708, British Machine Vision Association and Society for Pattern Recognition, 2022.","ista":"Rao P, B R M, Fox G, Weyrich T, Bickel B, Seidel H-P, Pfister H, Matusik W, Tewari A, Theobalt C, Elgharib M. 2022. VoRF: Volumetric Relightable Faces. 33rd British Machine Vision Conference. BMVC: British Machine Vision Conference, 708.","ieee":"P. Rao et al., “VoRF: Volumetric Relightable Faces,” in 33rd British Machine Vision Conference, London, United Kingdom, 2022.","apa":"Rao, P., B R, M., Fox, G., Weyrich, T., Bickel, B., Seidel, H.-P., … Elgharib, M. (2022). VoRF: Volumetric Relightable Faces. In 33rd British Machine Vision Conference. London, United Kingdom: British Machine Vision Association and Society for Pattern Recognition."},"main_file_link":[{"url":"https://bmvc2022.mpi-inf.mpg.de/708/","open_access":"1"}],"date_created":"2023-01-30T10:47:06Z","day":"01","oa":1,"department":[{"_id":"BeBi"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Portrait viewpoint and illumination editing is an important problem with several applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry and illumination is critical for obtaining photorealistic results. Current methods are unable to explicitly model in 3D while handing both viewpoint and illumination editing from a single image. In this paper, we propose VoRF, a novel approach that can take even a single portrait image as input and relight human heads under novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents a human head as a continuous volumetric field and learns a prior model of human heads using a coordinate-based MLP with separate latent spaces for identity and illumination. The prior model is learnt in an auto-decoder manner over a diverse class of head shapes and appearances, allowing VoRF to generalize to novel test identities from a single input image. Additionally, VoRF has a reflectance MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time (OLAT) images under novel views. We synthesize novel illuminations by combining these OLAT images with target environment maps. Qualitative and quantitative evaluations demonstrate the effectiveness of VoRF for relighting and novel view synthesis even when applied to unseen subjects under uncontrolled illuminations."}],"oa_version":"Published Version","ddc":["000"],"title":"VoRF: Volumetric Relightable Faces","status":"public","date_updated":"2023-10-31T08:40:55Z"},{"publication_identifier":{"issn":["1742-5468"]},"_id":"12480","issue":"11","intvolume":" 2022","article_number":"114003","doi":"10.1088/1742-5468/ac9828","type":"journal_article","publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10598"}]},"article_type":"original","fulldoi":"https://doi.org/10.1088/1742-5468/ac9828","corr_author":"1","isi":1,"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","quality_controlled":"1","file_date_updated":"2023-02-02T08:35:52Z","oa":1,"abstract":[{"lang":"eng","text":"We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach."}],"department":[{"_id":"MaMo"}],"language":[{"iso":"eng"}],"citation":{"ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2022, no. 11. IOP Publishing, 2022.","apa":"Mondelli, M., & Venkataramanan, R. (2022). Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ac9828","ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. 2022;2022(11). doi:10.1088/1742-5468/ac9828","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2022. https://doi.org/10.1088/1742-5468/ac9828.","short":"M. Mondelli, R. Venkataramanan, Journal of Statistical Mechanics: Theory and Experiment 2022 (2022).","ista":"Mondelli M, Venkataramanan R. 2022. Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. 2022(11), 114003.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2022, no. 11, 114003, IOP Publishing, 2022, doi:10.1088/1742-5468/ac9828."},"publisher":"IOP Publishing","author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli"},{"full_name":"Venkataramanan, Ramji","first_name":"Ramji","last_name":"Venkataramanan"}],"day":"24","date_created":"2023-02-02T08:31:57Z","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Approximate message passing with spectral initialization for generalized linear models","volume":2022,"date_updated":"2025-04-15T07:50:16Z","oa_version":"Published Version","ddc":["510","530"],"scopus_import":"1","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability","Statistical and Nonlinear Physics"],"acknowledgement":"The authors would like to thank Andrea Montanari for helpful discussions.\r\nM Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC Grant\r\nEP/N510129/1.","date_published":"2022-11-24T00:00:00Z","month":"11","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2022","publication":"Journal of Statistical Mechanics: Theory and Experiment","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"2022_JourStatisticalMechanics_Mondelli.pdf","creator":"dernst","file_id":"12481","file_size":1729997,"date_updated":"2023-02-02T08:35:52Z","checksum":"01411ffa76d3e380a0446baeb89b1ef7","access_level":"open_access","date_created":"2023-02-02T08:35:52Z","success":1}],"external_id":{"isi":["000889589900001"]},"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}]},{"corr_author":"1","article_type":"original","has_accepted_license":"1","quality_controlled":"1","file_date_updated":"2023-02-23T10:30:04Z","article_processing_charge":"No","_id":"12495","publication_identifier":{"issn":["2835-8856"]},"publication_status":"published","related_material":{"link":[{"relation":"software","url":"https://github.com/ISTAustria-CVML/FLEA","description":"source code"}]},"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to thank Bernd Prach, Elias Frantar, Alexandra Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). This publication was made possible by an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. ","month":"12","arxiv":1,"date_published":"2022-12-22T00:00:00Z","file":[{"success":1,"date_created":"2023-02-23T10:30:04Z","access_level":"open_access","checksum":"97c8a8470759cab597abb973ca137a3b","file_size":1948063,"date_updated":"2023-02-23T10:30:04Z","file_id":"12673","creator":"dernst","file_name":"2022_TMLR_Iofinova.pdf","content_type":"application/pdf","relation":"main_file"}],"publication":"Transactions on Machine Learning Research","project":[{"grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization"}],"external_id":{"arxiv":["2106.11732"]},"year":"2022","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=XsPopigZXV"}],"citation":{"short":"E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022).","chicago":"Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research. ML Research Press, 2022.","ama":"Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. 2022.","mla":"Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research, ML Research Press, 2022.","ista":"Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research.","ieee":"E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust fair multisource learning from unreliable training data,” Transactions on Machine Learning Research. ML Research Press, 2022.","apa":"Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. ML Research Press."},"author":[{"last_name":"Iofinova","first_name":"Eugenia B","full_name":"Iofinova, Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221"},{"last_name":"Konstantinov","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","orcid":"0009-0009-5204-7621","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"publisher":"ML Research Press","day":"22","date_created":"2023-02-02T20:29:57Z","oa":1,"abstract":[{"text":"Fairness-aware learning aims at constructing classifiers that not only make accurate predictions, but also do not discriminate against specific groups. It is a fast-growing area of\r\nmachine learning with far-reaching societal impact. However, existing fair learning methods\r\nare vulnerable to accidental or malicious artifacts in the training data, which can cause\r\nthem to unknowingly produce unfair classifiers. In this work we address the problem of\r\nfair learning from unreliable training data in the robust multisource setting, where the\r\navailable training data comes from multiple sources, a fraction of which might not be representative of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat identifies and suppresses those data sources that would have a negative impact on\r\nfairness or accuracy if they were used for training. As such, FLEA is not a replacement of\r\nprior fairness-aware learning methods but rather an augmentation that makes any of them\r\nrobust against unreliable training data. We show the effectiveness of our approach by a\r\ndiverse range of experiments on multiple datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects the learner against corruptions as long as the fraction of\r\naffected data sources is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"oa_version":"Published Version","ddc":["000"],"acknowledged_ssus":[{"_id":"ScienComp"}],"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"FLEA: Provably robust fair multisource learning from unreliable training data","date_updated":"2025-12-30T11:04:31Z"},{"article_processing_charge":"No","file_date_updated":"2023-02-06T09:13:04Z","has_accepted_license":"1","quality_controlled":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.MFCS.2022.3","corr_author":"1","type":"conference","doi":"10.4230/LIPIcs.MFCS.2022.3","publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772563"]},"intvolume":" 241","_id":"12509","ec_funded":1,"year":"2022","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"place":"Dagstuhl, Germany","conference":{"location":"Vienna, Austria","end_date":"2022-08-26","start_date":"2022-08-22","name":"MFCS: Mathematical Foundations of Computer Science"},"publication":"47th International Symposium on Mathematical Foundations of Computer Science","file":[{"checksum":"1888ec9421622f9526fbec2de035f132","access_level":"open_access","success":1,"date_created":"2023-02-06T09:13:04Z","relation":"main_file","content_type":"application/pdf","file_name":"2022_LIPICs_Avni.pdf","creator":"dernst","file_id":"12519","date_updated":"2023-02-06T09:13:04Z","file_size":624586}],"scopus_import":"1","acknowledgement":"Guy Avni: Work partially supported by the Israel Science Foundation, ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","month":"08","date_published":"2022-08-22T00:00:00Z","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","page":"3:1-3:6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-07-10T11:50:27Z","volume":241,"title":"An updated survey of bidding games on graphs","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","ddc":["000"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"oa":1,"day":"22","date_created":"2023-02-05T17:26:01Z","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ieee":"G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.","apa":"Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3","mla":"Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” 47th International Symposium on Mathematical Foundations of Computer Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.","ista":"Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.","ama":"Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3","short":"G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6.","chicago":"Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3."}},{"fulldoi":"https://doi.org/10.1609/aaai.v36i6.20631","article_type":"original","article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"isbn":["978577358350"],"eissn":["2374-3468"],"issn":["2159-5399"]},"issue":"6","_id":"12510","intvolume":" 36","doi":"10.1609/aaai.v36i6.20631","type":"journal_article","publication_status":"published","page":"6755-6764","arxiv":1,"month":"06","date_published":"2022-06-28T00:00:00Z","keyword":["General Medicine"],"acknowledgement":"SG is funded by the Austrian Science Fund (FWF) project number W1255-N23. ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40).","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2022","ec_funded":1,"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","external_id":{"arxiv":["2107.08467"]},"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"abstract":[{"text":"We introduce a new statistical verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. Our algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability and up to a desired tightness.\r\n GoTube is implemented in JAX and optimized to scale to complex continuous-depth neural network models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube does not accumulate overapproximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art in terms of its ability to scale to time horizons well beyond what has been previously possible.","lang":"eng"}],"publisher":"Association for the Advancement of Artificial Intelligence","author":[{"last_name":"Gruenbacher","first_name":"Sophie A.","full_name":"Gruenbacher, Sophie A."},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Scott A.","last_name":"Smolka","full_name":"Smolka, Scott A."},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"citation":{"ieee":"S. A. Gruenbacher et al., “GoTube: Scalable statistical verification of continuous-depth models,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.","apa":"Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., & Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i6.20631","chicago":"Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i6.20631.","ama":"Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(6):6755-6764. doi:10.1609/aaai.v36i6.20631","short":"S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka, R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 6755–6764.","mla":"Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631.","ista":"Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu R. 2022. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764."},"main_file_link":[{"url":"https://arxiv.org/abs/2107.08467","open_access":"1"}],"date_created":"2023-02-05T17:27:42Z","day":"28","title":"GoTube: Scalable statistical verification of continuous-depth models","status":"public","date_updated":"2025-04-15T06:26:14Z","volume":36,"oa_version":"Preprint"},{"corr_author":"1","fulldoi":"https://doi.org/10.1609/aaai.v36i7.20695","article_type":"original","quality_controlled":"1","article_processing_charge":"No","issue":"7","_id":"12511","intvolume":" 36","publication_identifier":{"isbn":["9781577358350"],"eissn":["2374-3468"],"issn":["2159-5399"]},"publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14539"}]},"doi":"10.1609/aaai.v36i7.20695","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"7326-7336","month":"06","arxiv":1,"date_published":"2022-06-28T00:00:00Z","keyword":["General Medicine"],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie Grant Agreement No. 665385.","scopus_import":"1","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["2112.09495"]},"year":"2022","ec_funded":1,"publisher":"Association for the Advancement of Artificial Intelligence","citation":{"short":"M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.","chicago":"Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i7.20695.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(7):7326-7336. doi:10.1609/aaai.v36i7.20695","mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.","ista":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.","ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","apa":"Lechner, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i7.20695"},"author":[{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2112.09495"}],"date_created":"2023-02-05T17:29:50Z","day":"28","oa":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"abstract":[{"text":"We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. \r\n In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking supermartingales (RSMs) to certify a.s. asymptotic stability, and (b) we present a method for learning neural network RSMs. \r\n We prove that our approach guarantees a.s. asymptotic stability of the system and\r\n provides the first method to obtain bounds on the stabilization time, which stochastic Lyapunov functions do not.\r\n Finally, we validate our approach experimentally on a set of nonlinear stochastic reinforcement learning environments with neural network policies.","lang":"eng"}],"oa_version":"Preprint","status":"public","title":"Stability verification in stochastic control systems via neural network supermartingales","date_updated":"2026-04-07T13:27:55Z","volume":36},{"fulldoi":"https://doi.org/10.1007/978-3-031-22365-5_20","isi":1,"corr_author":"1","article_processing_charge":"No","quality_controlled":"1","publication_identifier":{"isbn":["9783031223648"],"eissn":["1611-3349"],"issn":["0302-9743"]},"_id":"12516","intvolume":" 13748","doi":"10.1007/978-3-031-22365-5_20","type":"conference","publication_status":"published","alternative_title":["LNCS"],"page":"565-592","month":"12","date_published":"2022-12-21T00:00:00Z","acknowledgement":"We are grateful to Devika Sharma and Luca Trevisan for their insight and advice and to an anonymous reviewer for helpful comments.\r\n\r\nThis work was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019547). The first author was additionally supported by RGC GRF CUHK14209920 and the fourth author was additionally supported by ISF grant No. 1399/17, project PROMETHEUS (Grant 780701), and Cariplo CRYPTONOMEX grant.","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2022","publication":"Theory of Cryptography","conference":{"start_date":"2022-11-07","name":"TCC: Theory of Cryptography","end_date":"2022-11-10","location":"Chicago, IL, United States"},"external_id":{"isi":["000921318200020"]},"oa":1,"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"abstract":[{"text":"The homogeneous continuous LWE (hCLWE) problem is to distinguish samples of a specific high-dimensional Gaussian mixture from standard normal samples. It was shown to be at least as hard as Learning with Errors, but no reduction in the other direction is currently known.\r\nWe present four new public-key encryption schemes based on the hardness of hCLWE, with varying tradeoffs between decryption and security errors, and different discretization techniques. Our schemes yield a polynomial-time algorithm for solving hCLWE using a Statistical Zero-Knowledge oracle.","lang":"eng"}],"citation":{"mla":"Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.” Theory of Cryptography, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:10.1007/978-3-031-22365-5_20.","ista":"Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. 2022. Public-Key Encryption from Homogeneous CLWE. Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 13748, 565–592.","chicago":"Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen. “Public-Key Encryption from Homogeneous CLWE.” In Theory of Cryptography, 13748:565–92. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-22365-5_20.","short":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography, Springer Nature, 2022, pp. 565–592.","ama":"Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. Public-Key Encryption from Homogeneous CLWE. In: Theory of Cryptography. Vol 13748. Springer Nature; 2022:565-592. doi:10.1007/978-3-031-22365-5_20","apa":"Bogdanov, A., Cueto Noval, M., Hoffmann, C., & Rosen, A. (2022). Public-Key Encryption from Homogeneous CLWE. In Theory of Cryptography (Vol. 13748, pp. 565–592). Chicago, IL, United States: Springer Nature. https://doi.org/10.1007/978-3-031-22365-5_20","ieee":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption from Homogeneous CLWE,” in Theory of Cryptography, Chicago, IL, United States, 2022, vol. 13748, pp. 565–592."},"author":[{"full_name":"Bogdanov, Andrej","last_name":"Bogdanov","first_name":"Andrej"},{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel","first_name":"Miguel","last_name":"Cueto Noval"},{"last_name":"Hoffmann","first_name":"Charlotte","full_name":"Hoffmann, Charlotte","orcid":"0000-0003-2027-5549","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"},{"full_name":"Rosen, Alon","last_name":"Rosen","first_name":"Alon"}],"publisher":"Springer Nature","main_file_link":[{"url":"https://eprint.iacr.org/2022/093","open_access":"1"}],"date_created":"2023-02-05T23:01:00Z","day":"21","title":"Public-Key Encryption from Homogeneous CLWE","status":"public","volume":13748,"date_updated":"2024-10-09T21:04:05Z","oa_version":"Preprint"},{"month":"09","date_published":"2022-09-25T00:00:00Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:12102","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","contributor":[{"contributor_type":"contact_person","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","last_name":"Valentini","first_name":"Marco"}],"article_processing_charge":"No","year":"2022","file_date_updated":"2023-02-07T08:18:24Z","has_accepted_license":"1","file":[{"checksum":"0dbd6327bf84c7e81b295c4bc9d12826","access_level":"open_access","success":1,"date_created":"2023-02-07T08:18:24Z","relation":"main_file","content_type":"application/x-zip-compressed","file_name":"Majorana_like.zip","file_id":"12523","creator":"dernst","date_updated":"2023-02-07T08:18:24Z","file_size":3609122411}],"abstract":[{"lang":"eng","text":"This .zip File contains the transport data, the codes for the data analysis, the microscopy analysis and the codes for the theoretical simulations for \"Majorana-like Coulomb spectroscopy in the absence of zero bias peaks\" by M. Valentini, et. al. The transport data are saved with hdf5 file format. The files can be open with the log browser of Labber."}],"department":[{"_id":"GeKa"}],"oa":1,"day":"25","date_created":"2023-02-07T08:13:39Z","_id":"12522","author":[{"last_name":"Valentini","first_name":"Marco","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","full_name":"Valentini, Marco"},{"first_name":"Pablo","last_name":"San-Jose","full_name":"San-Jose, Pablo"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"full_name":"Marti-Sanchez, Sara","first_name":"Sara","last_name":"Marti-Sanchez"},{"full_name":"Botifoll, Marc","first_name":"Marc","last_name":"Botifoll"}],"citation":{"ista":"Valentini M, San-Jose P, Arbiol J, Marti-Sanchez S, Botifoll M. 2022. Data for ‘Majorana-like Coulomb spectroscopy in the absence of zero bias peaks’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:12102.","mla":"Valentini, Marco, et al. Data for “Majorana-like Coulomb Spectroscopy in the Absence of Zero Bias Peaks.” Institute of Science and Technology Austria, 2022, doi:10.15479/AT:ISTA:12102.","ama":"Valentini M, San-Jose P, Arbiol J, Marti-Sanchez S, Botifoll M. Data for “Majorana-like Coulomb spectroscopy in the absence of zero bias peaks.” 2022. doi:10.15479/AT:ISTA:12102","short":"M. Valentini, P. San-Jose, J. Arbiol, S. Marti-Sanchez, M. Botifoll, (2022).","chicago":"Valentini, Marco, Pablo San-Jose, Jordi Arbiol, Sara Marti-Sanchez, and Marc Botifoll. “Data for ‘Majorana-like Coulomb Spectroscopy in the Absence of Zero Bias Peaks.’” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/AT:ISTA:12102.","apa":"Valentini, M., San-Jose, P., Arbiol, J., Marti-Sanchez, S., & Botifoll, M. (2022). Data for “Majorana-like Coulomb spectroscopy in the absence of zero bias peaks.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12102","ieee":"M. Valentini, P. San-Jose, J. Arbiol, S. Marti-Sanchez, and M. Botifoll, “Data for ‘Majorana-like Coulomb spectroscopy in the absence of zero bias peaks.’” Institute of Science and Technology Austria, 2022."},"publisher":"Institute of Science and Technology Austria","type":"research_data","date_updated":"2026-04-07T13:27:22Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"status":"public","title":"Data for \"Majorana-like Coulomb spectroscopy in the absence of zero bias peaks\"","doi":"10.15479/AT:ISTA:12102","ddc":["530"],"related_material":{"record":[{"status":"public","id":"12118","relation":"used_in_publication"},{"relation":"used_in_publication","status":"public","id":"13286"}]},"oa_version":"Published Version"},{"publication_identifier":{"eisbn":["9783030995270"]},"intvolume":" 13244","_id":"12529","type":"conference","doi":"10.1007/978-3-030-99527-0_5","alternative_title":["LNCS"],"publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-030-99527-0_5","corr_author":"1","article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider turn-based stochastic 2-player games on graphs with ω-regular winning conditions. We provide a direct symbolic algorithm for solving such games when the winning condition is formulated as a Rabin condition. For a stochastic Rabin game with k pairs over a game graph with n vertices, our algorithm runs in O(nk+2k!) symbolic steps, which improves the state of the art.\r\nWe have implemented our symbolic algorithm, along with performance optimizations including parallellization and acceleration, in a BDD-based synthesis tool called Fairsyn. We demonstrate the superiority of Fairsyn compared to the state of the art on a set of synthetic benchmarks derived from the VLTS benchmark suite and on a control system benchmark from the literature. In our experiments, Fairsyn performed significantly faster with up to two orders of magnitude improvement in computation time."}],"language":[{"iso":"eng"}],"oa":1,"day":"29","date_created":"2023-02-08T11:43:34Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-99527-0_5"}],"citation":{"apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., & Soudjani, S. (2022). A direct symbolic algorithm for solving stochastic rabin games. In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-99527-0_5","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct symbolic algorithm for solving stochastic rabin games,” in 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Munich, Germany, 2022, vol. 13244, pp. 81–98.","short":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, in:, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2022, pp. 81–98.","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic algorithm for solving stochastic rabin games. In: 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 13244. Springer Nature; 2022:81-98. doi:10.1007/978-3-030-99527-0_5","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 13244:81–98. Springer Nature, 2022. https://doi.org/10.1007/978-3-030-99527-0_5.","ista":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2022. A direct symbolic algorithm for solving stochastic rabin games. 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13244, 81–98.","mla":"Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 13244, Springer Nature, 2022, pp. 81–98, doi:10.1007/978-3-030-99527-0_5."},"author":[{"first_name":"Tamajit","last_name":"Banerjee","full_name":"Banerjee, Tamajit"},{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"last_name":"Mallik","first_name":"Kaushik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Schmuck, Anne-Kathrin","first_name":"Anne-Kathrin","last_name":"Schmuck"},{"full_name":"Soudjani, Sadegh","first_name":"Sadegh","last_name":"Soudjani"}],"publisher":"Springer Nature","date_updated":"2024-10-09T21:04:10Z","volume":13244,"title":"A direct symbolic algorithm for solving stochastic rabin games","status":"public","oa_version":"Published Version","scopus_import":"1","date_published":"2022-03-29T00:00:00Z","month":"03","page":"81-98","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","year":"2022","conference":{"end_date":"2022-04-07","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2022-04-02","location":"Munich, Germany"},"publication":"28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems"},{"day":"01","date_created":"2023-02-08T11:43:50Z","_id":"12530","author":[{"first_name":"Bernd","last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","first_name":"Kaushik","last_name":"Mallik"},{"first_name":"Noemi","last_name":"Passing","full_name":"Passing, Noemi"},{"full_name":"Schledjewski, Malte","first_name":"Malte","last_name":"Schledjewski"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"}],"citation":{"ista":"Finkbeiner B, Mallik K, Passing N, Schledjewski M, Schmuck A-K. 2022. BOCoSy: Small but powerful symbolic output-feedback control. 25th ACM International Conference on Hybrid Systems: Computation and Control. HSCC: International Conference on Hybrid Systems Computation and Control, 24:1-24:11.","mla":"Finkbeiner, Bernd, et al. “BOCoSy: Small but Powerful Symbolic Output-Feedback Control.” 25th ACM International Conference on Hybrid Systems: Computation and Control, ACM, 2022, p. 24:1-24:11, doi:10.1145/3501710.3519535.","short":"B. Finkbeiner, K. Mallik, N. Passing, M. Schledjewski, A.-K. Schmuck, in:, 25th ACM International Conference on Hybrid Systems: Computation and Control, ACM, 2022, p. 24:1-24:11.","chicago":"Finkbeiner, Bernd, Kaushik Mallik, Noemi Passing, Malte Schledjewski, and Anne-Kathrin Schmuck. “BOCoSy: Small but Powerful Symbolic Output-Feedback Control.” In 25th ACM International Conference on Hybrid Systems: Computation and Control, 24:1-24:11. ACM, 2022. https://doi.org/10.1145/3501710.3519535.","ama":"Finkbeiner B, Mallik K, Passing N, Schledjewski M, Schmuck A-K. BOCoSy: Small but powerful symbolic output-feedback control. In: 25th ACM International Conference on Hybrid Systems: Computation and Control. ACM; 2022:24:1-24:11. doi:10.1145/3501710.3519535","apa":"Finkbeiner, B., Mallik, K., Passing, N., Schledjewski, M., & Schmuck, A.-K. (2022). BOCoSy: Small but powerful symbolic output-feedback control. In 25th ACM International Conference on Hybrid Systems: Computation and Control (p. 24:1-24:11). Milan, Italy: ACM. https://doi.org/10.1145/3501710.3519535","ieee":"B. Finkbeiner, K. Mallik, N. Passing, M. Schledjewski, and A.-K. Schmuck, “BOCoSy: Small but powerful symbolic output-feedback control,” in 25th ACM International Conference on Hybrid Systems: Computation and Control, Milan, Italy, 2022, p. 24:1-24:11."},"publisher":"ACM","abstract":[{"text":"We present BOCoSy, a tool for Bounded symbolic Output-feedback Controller Synthesis. Given a specification, BOCoSy synthesizes symbolic output-feedback controllers which interact with a given plant via a pre-defined finite symbolic interface. BOCoSy solves this problem by a new lazy abstraction-refinement technique which starts with a very coarse abstraction of the external trace semantics of the given plant and iteratively removes non-admissible behavior from this abstract model until a controller is found. BOCoSy steers the search for controllers towards small and concise state space representations by utilizing ideas from bounded synthesis. As a result, BOCoSy returns small and explainable controllers that are still powerful enough to solve the given synthesis problem. We show that BOCoSy is able to synthesize small, human readable symbolic controllers quickly on a set of benchmarks.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450391962"]},"publication_status":"published","oa_version":"None","type":"conference","date_updated":"2023-02-09T08:53:13Z","status":"public","doi":"10.1145/3501710.3519535","title":"BOCoSy: Small but powerful symbolic output-feedback control","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_published":"2022-05-01T00:00:00Z","month":"05","page":"24:1-24:11","fulldoi":"https://doi.org/10.1145/3501710.3519535","conference":{"location":"Milan, Italy","end_date":"2022-05-06","start_date":"2022-05-04","name":"HSCC: International Conference on Hybrid Systems Computation and Control"},"publication":"25th ACM International Conference on Hybrid Systems: Computation and Control","quality_controlled":"1","extern":"1","article_processing_charge":"No","year":"2022"},{"doi":"10.1109/ITW54588.2022.9965870","type":"journal_article","publication_status":"published","publication_identifier":{"isbn":["9781665483414"]},"_id":"12538","article_processing_charge":"No","quality_controlled":"1","fulldoi":"https://doi.org/10.1109/ITW54588.2022.9965870","article_type":"original","isi":1,"title":"Sharp asymptotics on the compression of two-layer neural networks","status":"public","date_updated":"2025-09-10T09:53:31Z","oa_version":"Preprint","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"MaMo"}],"abstract":[{"lang":"eng","text":"In this paper, we study the compression of a target two-layer neural network with N nodes into a compressed network with MIEEE Information Theory Workshop. IEEE, pp. 588–593, 2022.","apa":"Amani, M. H., Bombari, S., Mondelli, M., Pukdee, R., & Rini, S. (2022). Sharp asymptotics on the compression of two-layer neural networks. IEEE Information Theory Workshop. Mumbai, India: IEEE. https://doi.org/10.1109/ITW54588.2022.9965870","ama":"Amani MH, Bombari S, Mondelli M, Pukdee R, Rini S. Sharp asymptotics on the compression of two-layer neural networks. IEEE Information Theory Workshop. 2022:588-593. doi:10.1109/ITW54588.2022.9965870","short":"M.H. Amani, S. Bombari, M. Mondelli, R. Pukdee, S. Rini, IEEE Information Theory Workshop (2022) 588–593.","chicago":"Amani, Mohammad Hossein, Simone Bombari, Marco Mondelli, Rattana Pukdee, and Stefano Rini. “Sharp Asymptotics on the Compression of Two-Layer Neural Networks.” IEEE Information Theory Workshop. IEEE, 2022. https://doi.org/10.1109/ITW54588.2022.9965870.","mla":"Amani, Mohammad Hossein, et al. “Sharp Asymptotics on the Compression of Two-Layer Neural Networks.” IEEE Information Theory Workshop, IEEE, 2022, pp. 588–93, doi:10.1109/ITW54588.2022.9965870.","ista":"Amani MH, Bombari S, Mondelli M, Pukdee R, Rini S. 2022. Sharp asymptotics on the compression of two-layer neural networks. IEEE Information Theory Workshop., 588–593."},"author":[{"full_name":"Amani, Mohammad Hossein","last_name":"Amani","first_name":"Mohammad Hossein"},{"last_name":"Bombari","first_name":"Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa","full_name":"Bombari, Simone"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco"},{"full_name":"Pukdee, Rattana","first_name":"Rattana","last_name":"Pukdee"},{"first_name":"Stefano","last_name":"Rini","full_name":"Rini, Stefano"}],"publisher":"IEEE","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2205.08199"}],"date_created":"2023-02-10T13:47:56Z","day":"16","year":"2022","publication":"IEEE Information Theory Workshop","conference":{"location":"Mumbai, India","start_date":"2022-11-01","name":"ITW: Information Theory Workshop","end_date":"2022-11-09"},"external_id":{"isi":["000904341100099"],"arxiv":["2205.08199"]},"page":"588-593","month":"11","date_published":"2022-11-16T00:00:00Z","arxiv":1,"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"publication_status":"published","type":"conference","intvolume":" 162","article_number":"22","_id":"12540","file_date_updated":"2023-02-13T10:53:11Z","has_accepted_license":"1","quality_controlled":"1","article_processing_charge":"No","corr_author":"1","ddc":["000"],"oa_version":"Published Version","volume":162,"date_updated":"2025-04-15T07:50:16Z","title":"Estimation in rotationally invariant generalized linear models via approximate message passing","status":"public","date_created":"2023-02-10T13:49:04Z","citation":{"chicago":"Venkataramanan, Ramji, Kevin Kögler, and Marco Mondelli. “Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing.” In Proceedings of the 39th International Conference on Machine Learning, Vol. 162. ML Research Press, 2022.","short":"R. Venkataramanan, K. Kögler, M. Mondelli, in:, Proceedings of the 39th International Conference on Machine Learning, ML Research Press, 2022.","ama":"Venkataramanan R, Kögler K, Mondelli M. Estimation in rotationally invariant generalized linear models via approximate message passing. In: Proceedings of the 39th International Conference on Machine Learning. Vol 162. ML Research Press; 2022.","ista":"Venkataramanan R, Kögler K, Mondelli M. 2022. Estimation in rotationally invariant generalized linear models via approximate message passing. Proceedings of the 39th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 162, 22.","mla":"Venkataramanan, Ramji, et al. “Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing.” Proceedings of the 39th International Conference on Machine Learning, vol. 162, 22, ML Research Press, 2022.","apa":"Venkataramanan, R., Kögler, K., & Mondelli, M. (2022). Estimation in rotationally invariant generalized linear models via approximate message passing. In Proceedings of the 39th International Conference on Machine Learning (Vol. 162). Baltimore, MD, United States: ML Research Press.","ieee":"R. Venkataramanan, K. Kögler, and M. Mondelli, “Estimation in rotationally invariant generalized linear models via approximate message passing,” in Proceedings of the 39th International Conference on Machine Learning, Baltimore, MD, United States, 2022, vol. 162."},"author":[{"last_name":"Venkataramanan","first_name":"Ramji","full_name":"Venkataramanan, Ramji"},{"full_name":"Kögler, Kevin","id":"94ec913c-dc85-11ea-9058-e5051ab2428b","last_name":"Kögler","first_name":"Kevin"},{"first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"}],"publisher":"ML Research Press","abstract":[{"lang":"eng","text":"We consider the problem of signal estimation in generalized linear models defined via rotationally invariant design matrices. Since these matrices can have an arbitrary spectral distribution, this model is well suited for capturing complex correlation structures which often arise in applications. We propose a novel family of approximate message passing (AMP) algorithms for signal estimation, and rigorously characterize their performance in the high-dimensional limit via a state evolution recursion. Our rotationally invariant AMP has complexity of the same order as the existing AMP derived under the restrictive assumption of a Gaussian design; our algorithm also recovers this existing AMP as a special case. Numerical results showcase a performance close to Vector AMP (which is conjectured to be Bayes-optimal in some settings), but obtained with a much lower complexity, as the proposed algorithm does not require a computationally expensive singular value decomposition."}],"language":[{"iso":"eng"}],"department":[{"_id":"MaMo"}],"oa":1,"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"conference":{"location":"Baltimore, MD, United States","start_date":"2022-07-17","name":"ICML: International Conference on Machine Learning","end_date":"2022-07-23"},"file":[{"checksum":"67436eb0a660789514cdf9db79e84683","date_created":"2023-02-13T10:53:11Z","success":1,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2022_PMLR_Venkataramanan.pdf","creator":"dernst","file_id":"12547","date_updated":"2023-02-13T10:53:11Z","file_size":2341343}],"publication":"Proceedings of the 39th International Conference on Machine Learning","year":"2022","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to thank the anonymous reviewers for their helpful comments. KK and MM were partially supported by the 2019 Lopez-Loreta Prize.","date_published":"2022-01-01T00:00:00Z"},{"publication_identifier":{"eissn":["2374-3468"],"isbn":["1577358767"]},"issue":"9","_id":"12568","intvolume":" 36","doi":"10.1609/aaai.v36i9.21222","type":"conference","publication_status":"published","fulldoi":"https://doi.org/10.1609/aaai.v36i9.21222","corr_author":"1","article_processing_charge":"No","quality_controlled":"1","oa":1,"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered for SSP, which however is oblivious to the incurred risk. We present an alternative view, instead optimizing conditional value-at-risk (CVaR), an established risk measure. We treat both Markov chains as well as MDP and introduce, through novel insights, two algorithms, based on linear programming and value iteration, respectively. Both algorithms offer precise and provably correct solutions. Evaluation of our prototype implementation shows that risk-aware control is feasible on several moderately sized models."}],"publisher":"Association for the Advancement of Artificial Intelligence","author":[{"orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer"}],"citation":{"ama":"Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222","chicago":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 36:9858–67. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i9.21222.","short":"T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.","mla":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222.","ista":"Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867.","ieee":"T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.","apa":"Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21222"},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2203.01640","open_access":"1"}],"date_created":"2023-02-19T23:00:56Z","day":"28","status":"public","title":"Risk-aware stochastic shortest path","volume":36,"date_updated":"2024-10-09T21:04:32Z","oa_version":"Preprint","page":"9858-9867","date_published":"2022-06-28T00:00:00Z","month":"06","arxiv":1,"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2022","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022","conference":{"location":"Virtual","end_date":"2022-03-01","name":"Conference on Artificial Intelligence","start_date":"2022-02-22"},"external_id":{"arxiv":["2203.01640"]}},{"publication":"The Cryosphere","year":"2022","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","date_published":"2022-11-11T00:00:00Z","keyword":["Earth-Surface Processes","Water Science and Technology"],"scopus_import":"1","page":"4701-4725","oa_version":"Published Version","volume":16,"date_updated":"2023-02-28T13:59:22Z","status":"public","title":"Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry","date_created":"2023-02-20T08:09:42Z","day":"11","author":[{"first_name":"Marin","last_name":"Kneib","full_name":"Kneib, Marin"},{"full_name":"Miles, Evan S.","first_name":"Evan S.","last_name":"Miles"},{"full_name":"Buri, Pascal","last_name":"Buri","first_name":"Pascal"},{"full_name":"Fugger, Stefan","last_name":"Fugger","first_name":"Stefan"},{"first_name":"Michael","last_name":"McCarthy","full_name":"McCarthy, Michael"},{"first_name":"Thomas E.","last_name":"Shaw","full_name":"Shaw, Thomas E."},{"last_name":"Chuanxi","first_name":"Zhao","full_name":"Chuanxi, Zhao"},{"first_name":"Martin","last_name":"Truffer","full_name":"Truffer, Martin"},{"last_name":"Westoby","first_name":"Matthew J.","full_name":"Westoby, Matthew J."},{"first_name":"Wei","last_name":"Yang","full_name":"Yang, Wei"},{"first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"}],"citation":{"ieee":"M. Kneib et al., “Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry,” The Cryosphere, vol. 16, no. 11. Copernicus Publications, pp. 4701–4725, 2022.","apa":"Kneib, M., Miles, E. S., Buri, P., Fugger, S., McCarthy, M., Shaw, T. E., … Pellicciotti, F. (2022). Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry. The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-16-4701-2022","ista":"Kneib M, Miles ES, Buri P, Fugger S, McCarthy M, Shaw TE, Chuanxi Z, Truffer M, Westoby MJ, Yang W, Pellicciotti F. 2022. Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry. The Cryosphere. 16(11), 4701–4725.","mla":"Kneib, Marin, et al. “Sub-Seasonal Variability of Supraglacial Ice Cliff Melt Rates and Associated Processes from Time-Lapse Photogrammetry.” The Cryosphere, vol. 16, no. 11, Copernicus Publications, 2022, pp. 4701–25, doi:10.5194/tc-16-4701-2022.","short":"M. Kneib, E.S. Miles, P. Buri, S. Fugger, M. McCarthy, T.E. Shaw, Z. Chuanxi, M. Truffer, M.J. Westoby, W. Yang, F. Pellicciotti, The Cryosphere 16 (2022) 4701–4725.","chicago":"Kneib, Marin, Evan S. Miles, Pascal Buri, Stefan Fugger, Michael McCarthy, Thomas E. Shaw, Zhao Chuanxi, et al. “Sub-Seasonal Variability of Supraglacial Ice Cliff Melt Rates and Associated Processes from Time-Lapse Photogrammetry.” The Cryosphere. Copernicus Publications, 2022. https://doi.org/10.5194/tc-16-4701-2022.","ama":"Kneib M, Miles ES, Buri P, et al. Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry. The Cryosphere. 2022;16(11):4701-4725. doi:10.5194/tc-16-4701-2022"},"publisher":"Copernicus Publications","main_file_link":[{"url":"https://doi.org/10.5194/tc-16-4701-2022","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Melt from supraglacial ice cliffs is an important contributor to the mass loss of debris-covered glaciers. However, ice cliff contribution is difficult to quantify as they are highly dynamic features, and the paucity of observations of melt rates and their variability leads to large modelling uncertainties. We quantify monsoon season melt and 3D evolution of four ice cliffs over two debris-covered glaciers in High Mountain Asia (Langtang Glacier, Nepal, and 24K Glacier, China) at very high resolution using terrestrial photogrammetry applied to imagery captured from time-lapse cameras installed on lateral moraines. We derive weekly flow-corrected digital elevation models (DEMs) of the glacier surface with a maximum vertical bias of ±0.2 m for Langtang Glacier and ±0.05 m for 24K Glacier and use change detection to determine distributed melt rates at the surfaces of the ice cliffs throughout the study period. We compare the measured melt patterns with those derived from a 3D energy balance model to derive the contribution of the main energy fluxes. We find that ice cliff melt varies considerably throughout the melt season, with maximum melt rates of 5 to 8 cm d−1, and their average melt rates are 11–14 (Langtang) and 4.5 (24K) times higher than the surrounding debris-covered ice. Our results highlight the influence of redistributed supraglacial debris on cliff melt. At both sites, ice cliff albedo is influenced by the presence of thin debris at the ice cliff surface, which is largely controlled on 24K Glacier by liquid precipitation events that wash away this debris. Slightly thicker or patchy debris reduces melt by 1–3 cm d−1 at all sites. Ultimately, our observations show a strong spatio-temporal variability in cliff area at each site, which is controlled by supraglacial streams and ponds and englacial cavities that promote debris slope destabilisation and the lateral expansion of the cliffs. These findings highlight the need to better represent processes of debris redistribution in ice cliff models, to in turn improve estimates of ice cliff contribution to glacier melt and the long-term geomorphological evolution of debris-covered glacier surfaces.","lang":"eng"}],"oa":1,"quality_controlled":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.5194/tc-16-4701-2022","article_type":"original","publication_status":"published","type":"journal_article","doi":"10.5194/tc-16-4701-2022","intvolume":" 16","issue":"11","_id":"12574","publication_identifier":{"issn":["1994-0424"]}},{"extern":"1","year":"2022","publication":"Earth's Future","scopus_import":"1","keyword":["Earth and Planetary Sciences (miscellaneous)","General Environmental Science"],"date_published":"2022-10-01T00:00:00Z","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Glacier contributions to river discharge during the current Chilean megadrought","date_updated":"2023-02-28T13:55:32Z","volume":10,"oa_version":"Published Version","oa":1,"abstract":[{"lang":"eng","text":"The current Chilean megadrought has led to acute water shortages in central Chile since 2010. Glaciers have provided vital fresh water to the region's rivers, but the quantity, timing and sustainability of that provision remain unclear. Here we combine in-situ, remote sensing and climate reanalysis data to show that from 2010 to 2018 during the megadrought, unsustainable imbalance ablation of glaciers (ablation not balanced by new snowfall) strongly buffered the late-summer discharge of the Maipo River, a primary source of water to Santiago. If there had been no glaciers, water availability would have been reduced from December through May, with a 31 ± 19% decrease during March. Our results indicate that while the annual contributions of imbalance ablation to river discharge during the megadrought have been small compared to those from precipitation and sustainable balance ablation, they have nevertheless been a substantial input to a hydrological system that was already experiencing high water stress. The water-equivalent volume of imbalance ablation generated in the Maipo Basin between 2010 and 2018 was 740 × 106 m3 (19 ± 12 mm yr−1), approximately 3.4 times the capacity of the basin's El Yeso Reservoir. This is equivalent to 14% of Santiago's potable water use in that time, while total glacier ablation was equivalent to 59%. We show that glacier retreat will exacerbate river discharge deficits and further jeopardize water availability in central Chile if precipitation deficits endure, and conjecture that these effects will be amplified by climatic warming."}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1029/2022EF002852","open_access":"1"}],"citation":{"ama":"McCarthy M, Meier F, Fatichi S, et al. Glacier contributions to river discharge during the current Chilean megadrought. Earth’s Future. 2022;10(10). doi:10.1029/2022ef002852","chicago":"McCarthy, Michael, Fabienne Meier, Simone Fatichi, Benjamin D. Stocker, Thomas E. Shaw, Evan Miles, Inés Dussaillant, and Francesca Pellicciotti. “Glacier Contributions to River Discharge during the Current Chilean Megadrought.” Earth’s Future. American Geophysical Union, 2022. https://doi.org/10.1029/2022ef002852.","short":"M. McCarthy, F. Meier, S. Fatichi, B.D. Stocker, T.E. Shaw, E. Miles, I. Dussaillant, F. Pellicciotti, Earth’s Future 10 (2022).","ista":"McCarthy M, Meier F, Fatichi S, Stocker BD, Shaw TE, Miles E, Dussaillant I, Pellicciotti F. 2022. Glacier contributions to river discharge during the current Chilean megadrought. Earth’s Future. 10(10), e2022EF002852.","mla":"McCarthy, Michael, et al. “Glacier Contributions to River Discharge during the Current Chilean Megadrought.” Earth’s Future, vol. 10, no. 10, e2022EF002852, American Geophysical Union, 2022, doi:10.1029/2022ef002852.","apa":"McCarthy, M., Meier, F., Fatichi, S., Stocker, B. D., Shaw, T. E., Miles, E., … Pellicciotti, F. (2022). Glacier contributions to river discharge during the current Chilean megadrought. Earth’s Future. American Geophysical Union. https://doi.org/10.1029/2022ef002852","ieee":"M. McCarthy et al., “Glacier contributions to river discharge during the current Chilean megadrought,” Earth’s Future, vol. 10, no. 10. American Geophysical Union, 2022."},"publisher":"American Geophysical Union","author":[{"first_name":"Michael","last_name":"McCarthy","full_name":"McCarthy, Michael"},{"full_name":"Meier, Fabienne","last_name":"Meier","first_name":"Fabienne"},{"first_name":"Simone","last_name":"Fatichi","full_name":"Fatichi, Simone"},{"full_name":"Stocker, Benjamin D.","last_name":"Stocker","first_name":"Benjamin D."},{"last_name":"Shaw","first_name":"Thomas E.","full_name":"Shaw, Thomas E."},{"first_name":"Evan","last_name":"Miles","full_name":"Miles, Evan"},{"full_name":"Dussaillant, Inés","last_name":"Dussaillant","first_name":"Inés"},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca"}],"day":"01","date_created":"2023-02-20T08:09:49Z","article_processing_charge":"No","quality_controlled":"1","article_type":"original","fulldoi":"https://doi.org/10.1029/2022ef002852","doi":"10.1029/2022ef002852","type":"journal_article","publication_status":"published","publication_identifier":{"issn":["2328-4277"]},"_id":"12575","issue":"10","intvolume":" 10","article_number":"e2022EF002852"},{"title":"Multi-decadal monsoon characteristics and glacier response in High Mountain Asia","status":"public","volume":17,"date_updated":"2023-02-28T13:53:16Z","oa_version":"Published Version","oa":1,"abstract":[{"lang":"eng","text":"Glacier health across High Mountain Asia (HMA) is highly heterogeneous and strongly governed by regional climate, which is variably influenced by monsoon dynamics and the westerlies. We explore four decades of glacier energy and mass balance at three climatically distinct sites across HMA by utilising a detailed land surface model driven by bias-corrected Weather Research and Forecasting meteorological forcing. All three glaciers have experienced long-term mass losses (ranging from −0.04 ± 0.09 to −0.59 ± 0.20 m w.e. a−1) consistent with widespread warming across the region. However, complex and contrasting responses of glacier energy and mass balance to the patterns of the Indian Summer Monsoon were evident, largely driven by the role snowfall timing, amount and phase. A later monsoon onset generates less total snowfall to the glacier in the southeastern Tibetan Plateau during May–June, augmenting net shortwave radiation and affecting annual mass balance (−0.5 m w.e. on average compared to early onset years). Conversely, timing of the monsoon’s arrival has limited impact for the Nepalese Himalaya which is more strongly governed by the temperature and snowfall amount during the core monsoon season. In the arid central Tibetan Plateau, a later monsoon arrival results in a 40 mm (58%) increase of May–June snowfall on average compared to early onset years, likely driven by the greater interaction of westerly storm events. Meanwhile, a late monsoon cessation at this site sees an average 200 mm (192%) increase in late summer precipitation due to monsoonal storms. A trend towards weaker intensity monsoon conditions in recent decades, combined with long-term warming patterns, has produced predominantly negative glacier mass balances for all sites (up to 1 m w.e. more mass loss in the Nepalese Himalaya compared to strong monsoon intensity years) but sub-regional variability in monsoon timing can additionally complicate this response."}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1748-9326/ac9008"}],"citation":{"ama":"Shaw TE, Miles ES, Chen D, et al. Multi-decadal monsoon characteristics and glacier response in High Mountain Asia. Environmental Research Letters. 2022;17(10). doi:10.1088/1748-9326/ac9008","short":"T.E. Shaw, E.S. Miles, D. Chen, A. Jouberton, M. Kneib, S. Fugger, T. Ou, H.-W. Lai, K. Fujita, W. Yang, S. Fatichi, F. Pellicciotti, Environmental Research Letters 17 (2022).","chicago":"Shaw, T E, E S Miles, D Chen, A Jouberton, M Kneib, S Fugger, T Ou, et al. “Multi-Decadal Monsoon Characteristics and Glacier Response in High Mountain Asia.” Environmental Research Letters. IOP Publishing, 2022. https://doi.org/10.1088/1748-9326/ac9008.","ista":"Shaw TE, Miles ES, Chen D, Jouberton A, Kneib M, Fugger S, Ou T, Lai H-W, Fujita K, Yang W, Fatichi S, Pellicciotti F. 2022. Multi-decadal monsoon characteristics and glacier response in High Mountain Asia. Environmental Research Letters. 17(10), 104001.","mla":"Shaw, T. E., et al. “Multi-Decadal Monsoon Characteristics and Glacier Response in High Mountain Asia.” Environmental Research Letters, vol. 17, no. 10, 104001, IOP Publishing, 2022, doi:10.1088/1748-9326/ac9008.","ieee":"T. E. Shaw et al., “Multi-decadal monsoon characteristics and glacier response in High Mountain Asia,” Environmental Research Letters, vol. 17, no. 10. IOP Publishing, 2022.","apa":"Shaw, T. E., Miles, E. S., Chen, D., Jouberton, A., Kneib, M., Fugger, S., … Pellicciotti, F. (2022). Multi-decadal monsoon characteristics and glacier response in High Mountain Asia. Environmental Research Letters. IOP Publishing. https://doi.org/10.1088/1748-9326/ac9008"},"author":[{"last_name":"Shaw","first_name":"T E","full_name":"Shaw, T E"},{"full_name":"Miles, E S","first_name":"E S","last_name":"Miles"},{"full_name":"Chen, D","last_name":"Chen","first_name":"D"},{"first_name":"A","last_name":"Jouberton","full_name":"Jouberton, A"},{"full_name":"Kneib, M","first_name":"M","last_name":"Kneib"},{"full_name":"Fugger, S","last_name":"Fugger","first_name":"S"},{"last_name":"Ou","first_name":"T","full_name":"Ou, T"},{"full_name":"Lai, H-W","last_name":"Lai","first_name":"H-W"},{"last_name":"Fujita","first_name":"K","full_name":"Fujita, K"},{"full_name":"Yang, W","last_name":"Yang","first_name":"W"},{"full_name":"Fatichi, S","first_name":"S","last_name":"Fatichi"},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti"}],"publisher":"IOP Publishing","day":"16","date_created":"2023-02-20T08:09:56Z","extern":"1","year":"2022","publication":"Environmental Research Letters","keyword":["Public Health","Environmental and Occupational Health","General Environmental Science","Renewable Energy","Sustainability and the Environment"],"scopus_import":"1","date_published":"2022-09-16T00:00:00Z","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1088/1748-9326/ac9008","type":"journal_article","publication_status":"published","publication_identifier":{"issn":["1748-9326"]},"_id":"12576","issue":"10","article_number":"104001","intvolume":" 17","article_processing_charge":"No","quality_controlled":"1","article_type":"letter_note","fulldoi":"https://doi.org/10.1088/1748-9326/ac9008"}]