[{"scopus_import":"1","keyword":["Education","General Mathematics"],"volume":32,"title":"Tangible topology through the lens of limits","language":[{"iso":"eng"}],"day":"28","abstract":[{"text":"Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences.","lang":"eng"}],"date_created":"2023-01-16T10:07:21Z","type":"journal_article","publication":"PRIMUS","intvolume":"        32","citation":{"chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>.","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.","ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609.","apa":"Shipman, B. A., &#38; Stephenson, E. R. (2022). Tangible topology through the lens of limits. <i>PRIMUS</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. <i>PRIMUS</i>. 2022;32(5):593-609. doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>","mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>, vol. 32, no. 5, Taylor &#38; Francis, 2022, pp. 593–609, doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>.","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” <i>PRIMUS</i>, vol. 32, no. 5. Taylor &#38; Francis, pp. 593–609, 2022."},"page":"593-609","author":[{"full_name":"Shipman, Barbara A.","first_name":"Barbara A.","last_name":"Shipman"},{"last_name":"Stephenson","orcid":"0000-0002-6862-208X","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R"}],"quality_controlled":"1","doi":"10.1080/10511970.2021.1872750","_id":"12307","article_type":"original","month":"05","date_published":"2022-05-28T00:00:00Z","date_updated":"2024-10-09T21:03:58Z","publication_status":"published","publisher":"Taylor & Francis","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1935-4053"],"issn":["1051-1970"]},"oa_version":"None","status":"public","issue":"5","year":"2022","corr_author":"1"},{"oa":1,"department":[{"_id":"GaTk"}],"article_processing_charge":"No","article_type":"original","month":"12","date_published":"2022-12-21T00:00:00Z","date_updated":"2025-06-11T13:57:01Z","publication_status":"published","ec_funded":1,"publisher":"Public Library of Science","issue":"12","year":"2022","status":"public","has_accepted_license":"1","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1545-7885"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"file":[{"file_id":"12337","date_created":"2023-01-23T08:46:40Z","file_name":"2022_PloSBiology_Mlynarski.pdf","relation":"main_file","date_updated":"2023-01-23T08:46:40Z","content_type":"application/pdf","checksum":"5d7f1111a87e5f2c1bf92f8886738894","access_level":"open_access","file_size":4248838,"creator":"dernst","success":1}],"oa_version":"Published Version","file_date_updated":"2023-01-23T08:46:40Z","volume":20,"title":"Efficient coding theory of dynamic attentional modulation","language":[{"iso":"eng"}],"day":"21","abstract":[{"lang":"eng","text":"Activity of sensory neurons is driven not only by external stimuli but also by feedback signals from higher brain areas. Attention is one particularly important internal signal whose presumed role is to modulate sensory representations such that they only encode information currently relevant to the organism at minimal cost. This hypothesis has, however, not yet been expressed in a normative computational framework. Here, by building on normative principles of probabilistic inference and efficient coding, we developed a model of dynamic population coding in the visual cortex. By continuously adapting the sensory code to changing demands of the perceptual observer, an attention-like modulation emerges. This modulation can dramatically reduce the amount of neural activity without deteriorating the accuracy of task-specific inferences. Our results suggest that a range of seemingly disparate cortical phenomena such as intrinsic gain modulation, attention-related tuning modulation, and response variability could be manifestations of the same underlying principles, which combine efficient sensory coding with optimal probabilistic inference in dynamic environments."}],"date_created":"2023-01-22T23:00:55Z","isi":1,"scopus_import":"1","pmid":1,"page":"e3001889","author":[{"id":"358A453A-F248-11E8-B48F-1D18A9856A87","full_name":"Mlynarski, Wiktor F","first_name":"Wiktor F","last_name":"Mlynarski"},{"orcid":"1","last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","project":[{"name":"Efficient coding with biophysical realism","grant_number":"P34015","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"},{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.1371/journal.pbio.3001889","_id":"12332","type":"journal_article","publication":"PLoS Biology","intvolume":"        20","acknowledgement":"We thank Robbe Goris for generously providing figures from his work and Ann M. Hermundstad for helpful discussions.\r\nGT & WM were supported by the Austrian Science Fund Standalone Grant P 34015 \"Efficient Coding with Biophysical Realism\" (https://pf.fwf.ac.at/) WM was additionally supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 (https://ec.europa.eu/research/mariecurieactions/). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","citation":{"ama":"Mlynarski WF, Tkačik G. Efficient coding theory of dynamic attentional modulation. <i>PLoS Biology</i>. 2022;20(12):e3001889. doi:<a href=\"https://doi.org/10.1371/journal.pbio.3001889\">10.1371/journal.pbio.3001889</a>","apa":"Mlynarski, W. F., &#38; Tkačik, G. (2022). Efficient coding theory of dynamic attentional modulation. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.3001889\">https://doi.org/10.1371/journal.pbio.3001889</a>","mla":"Mlynarski, Wiktor F., and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” <i>PLoS Biology</i>, vol. 20, no. 12, Public Library of Science, 2022, p. e3001889, doi:<a href=\"https://doi.org/10.1371/journal.pbio.3001889\">10.1371/journal.pbio.3001889</a>.","ieee":"W. F. Mlynarski and G. Tkačik, “Efficient coding theory of dynamic attentional modulation,” <i>PLoS Biology</i>, vol. 20, no. 12. Public Library of Science, p. e3001889, 2022.","short":"W.F. Mlynarski, G. Tkačik, PLoS Biology 20 (2022) e3001889.","chicago":"Mlynarski, Wiktor F, and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” <i>PLoS Biology</i>. Public Library of Science, 2022. <a href=\"https://doi.org/10.1371/journal.pbio.3001889\">https://doi.org/10.1371/journal.pbio.3001889</a>.","ista":"Mlynarski WF, Tkačik G. 2022. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 20(12), e3001889."},"external_id":{"pmid":["36542662"],"isi":["000925192000001"]},"ddc":["570"]},{"publication_identifier":{"eissn":["2050-084X"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":8835954,"checksum":"9321fd5f06ff59d5e2d33daee84b3da1","creator":"dernst","success":1,"date_updated":"2023-01-23T08:56:21Z","date_created":"2023-01-23T08:56:21Z","file_name":"2022_eLife_Tomanek.pdf","relation":"main_file","file_id":"12338"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"status":"public","year":"2022","corr_author":"1","has_accepted_license":"1","date_updated":"2025-03-06T14:03:50Z","publication_status":"published","date_published":"2022-12-22T00:00:00Z","article_type":"original","month":"12","publisher":"eLife Sciences Publications","oa":1,"article_processing_charge":"No","department":[{"_id":"CaGu"}],"article_number":"e82240","publication":"eLife","type":"journal_article","external_id":{"pmid":["36546673"],"isi":["000912674700001"]},"ddc":["570"],"citation":{"chicago":"Tomanek, Isabella, and Calin C Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/ELIFE.82240\">https://doi.org/10.7554/ELIFE.82240</a>.","short":"I. Tomanek, C.C. Guet, ELife 11 (2022).","ista":"Tomanek I, Guet CC. 2022. Adaptation dynamics between copynumber and point mutations. eLife. 11, e82240.","apa":"Tomanek, I., &#38; Guet, C. C. (2022). Adaptation dynamics between copynumber and point mutations. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/ELIFE.82240\">https://doi.org/10.7554/ELIFE.82240</a>","ama":"Tomanek I, Guet CC. Adaptation dynamics between copynumber and point mutations. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/ELIFE.82240\">10.7554/ELIFE.82240</a>","ieee":"I. Tomanek and C. C. Guet, “Adaptation dynamics between copynumber and point mutations,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","mla":"Tomanek, Isabella, and Calin C. Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” <i>ELife</i>, vol. 11, e82240, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/ELIFE.82240\">10.7554/ELIFE.82240</a>."},"acknowledgement":"We are grateful to N Barton, F Kondrashov, M Lagator, M Pleska, R Roemhild, D Siekhaus, and G\r\nTkacik for input on the manuscript and to K Tomasek for help with flow cytometry.","intvolume":"        11","quality_controlled":"1","author":[{"last_name":"Tomanek","orcid":"0000-0001-6197-363X","id":"3981F020-F248-11E8-B48F-1D18A9856A87","full_name":"Tomanek, Isabella","first_name":"Isabella"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","first_name":"Calin C"}],"_id":"12333","doi":"10.7554/ELIFE.82240","scopus_import":"1","isi":1,"pmid":1,"related_material":{"record":[{"id":"12339","relation":"research_data","status":"public"}],"link":[{"url":"https://doi.org/10.5281/zenodo.6974122","relation":"software"}]},"language":[{"iso":"eng"}],"title":"Adaptation dynamics between copynumber and point mutations","volume":11,"file_date_updated":"2023-01-23T08:56:21Z","date_created":"2023-01-22T23:00:55Z","day":"22","abstract":[{"text":"Together, copy-number and point mutations form the basis for most evolutionary novelty, through the process of gene duplication and divergence. While a plethora of genomic data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic reporter system that can distinguish between copy-number and point mutations, we study their early and transient adaptive dynamics in real time in Escherichia coli. We find two qualitatively different routes of adaptation, depending on the level of functional improvement needed. In conditions of high gene expression demand, the two mutation types occur as a combination. However, under low gene expression demand, copy-number and point mutations are mutually exclusive; here, owing to their higher frequency, adaptation is dominated by copy-number mutations, in a process we term amplification hindrance. Ultimately, due to high reversal rates and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation, but also constrain sequence divergence over evolutionary time scales.","lang":"eng"}]},{"date_updated":"2025-03-06T14:03:50Z","month":"12","date_published":"2022-12-23T00:00:00Z","publisher":"Dryad","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.rfj6q57ds"}],"related_material":{"record":[{"relation":"used_in_publication","id":"12333","status":"public"}]},"oa":1,"title":"Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose","department":[{"_id":"CaGu"}],"date_created":"2023-01-23T09:00:37Z","article_processing_charge":"No","day":"23","abstract":[{"text":"Copy-number and point mutations form the basis for most evolutionary novelty through the process of gene duplication and divergence. While a plethora of genomic sequence data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic system that allows us to distinguish copy-number and point mutations, we study their early and transient adaptive dynamics in real-time in Escherichia coli. We find two qualitatively different routes of adaptation depending on the level of functional improvement selected for: In conditions of high gene expression demand, the two types of mutations occur as a combination. Under low gene expression demand, negative epistasis between the two types of mutations renders them mutually exclusive. Thus, owing to their higher frequency, adaptation is dominated by copy-number mutations. Ultimately, due to high rates of reversal and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation but also constrain sequence divergence over evolutionary time scales.","lang":"eng"}],"type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","ddc":["570"],"citation":{"ieee":"I. Tomanek and C. C. Guet, “Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose.” Dryad, 2022.","mla":"Tomanek, Isabella, and Calin C. Guet. <i>Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose</i>. Dryad, 2022, doi:<a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">10.5061/dryad.rfj6q57ds</a>.","apa":"Tomanek, I., &#38; Guet, C. C. (2022). Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. Dryad. <a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">https://doi.org/10.5061/dryad.rfj6q57ds</a>","ama":"Tomanek I, Guet CC. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. 2022. doi:<a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">10.5061/dryad.rfj6q57ds</a>","ista":"Tomanek I, Guet CC. 2022. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose, Dryad, <a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">10.5061/dryad.rfj6q57ds</a>.","chicago":"Tomanek, Isabella, and Calin C Guet. “Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose.” Dryad, 2022. <a href=\"https://doi.org/10.5061/dryad.rfj6q57ds\">https://doi.org/10.5061/dryad.rfj6q57ds</a>.","short":"I. Tomanek, C.C. Guet, (2022)."},"year":"2022","author":[{"orcid":"0000-0001-6197-363X","last_name":"Tomanek","full_name":"Tomanek, Isabella","first_name":"Isabella","id":"3981F020-F248-11E8-B48F-1D18A9856A87"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","full_name":"Guet, Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052"}],"status":"public","corr_author":"1","_id":"12339","doi":"10.5061/dryad.rfj6q57ds"},{"file":[{"description":"This is the main PDF file of the thesis. File size: 105 MB","date_updated":"2023-02-02T09:29:57Z","creator":"cchlebak","checksum":"083722acbb8115e52e3b0fdec6226769","access_level":"open_access","content_type":"application/pdf","file_size":104497530,"file_id":"12371","title":"Thesis","relation":"main_file","file_name":"thesis_gsperl.pdf","date_created":"2023-01-25T12:04:41Z"},{"creator":"cchlebak","access_level":"open_access","file_size":23183710,"checksum":"511f82025e5fcb70bff4731d6896ca07","content_type":"application/pdf","date_updated":"2023-02-02T09:33:37Z","description":"This version of the thesis uses stronger image compression for a smaller file size of 23MB.","relation":"main_file","file_name":"thesis_gsperl_compressed.pdf","date_created":"2023-02-02T09:33:37Z","file_id":"12483","title":"Thesis (compressed 23MB)"},{"date_updated":"2023-02-02T09:39:25Z","content_type":"application/x-zip-compressed","file_size":98382247,"access_level":"open_access","checksum":"ed4cb85225eedff761c25bddfc37a2ed","creator":"cchlebak","file_id":"12484","relation":"source_file","date_created":"2023-02-02T09:39:25Z","file_name":"thesis-source.zip"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","OA_place":"publisher","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-020-6"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","corr_author":"1","degree_awarded":"PhD","status":"public","year":"2022","acknowledged_ssus":[{"_id":"SSU"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"date_published":"2022-09-22T00:00:00Z","month":"09","date_updated":"2026-06-18T19:57:47Z","publication_status":"published","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"oa":1,"citation":{"apa":"Sperl, G. (2022). <i>Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12103\">https://doi.org/10.15479/at:ista:12103</a>","ama":"Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12103\">10.15479/at:ista:12103</a>","ieee":"G. Sperl, “Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting,” Institute of Science and Technology Austria, 2022.","mla":"Sperl, Georg. <i>Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12103\">10.15479/at:ista:12103</a>.","chicago":"Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12103\">https://doi.org/10.15479/at:ista:12103</a>.","short":"G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting, Institute of Science and Technology Austria, 2022.","ista":"Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria."},"ddc":["000","620"],"type":"dissertation","doi":"10.15479/at:ista:12103","_id":"12358","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"page":"138","author":[{"last_name":"Sperl","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","first_name":"Georg"}],"supervisor":[{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan"}],"day":"22","abstract":[{"lang":"eng","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"}],"date_created":"2023-01-24T10:49:46Z","title":"Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"8385","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"11736"},{"relation":"part_of_dissertation","id":"9818","status":"public"}]},"file_date_updated":"2023-02-02T09:39:25Z"},{"supervisor":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"}],"abstract":[{"lang":"eng","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."}],"day":"29","date_created":"2023-01-25T10:43:24Z","title":"Remodeling of E-cadherin-mediated contacts via cortical  flows","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"9350","status":"public"}]},"file_date_updated":"2023-01-25T10:52:46Z","citation":{"ieee":"F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical  flows,” Institute of Science and Technology Austria, 2022.","mla":"Arslan, Feyza N. <i>Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12153\">10.15479/at:ista:12153</a>.","apa":"Arslan, F. N. (2022). <i>Remodeling of E-cadherin-mediated contacts via cortical  flows</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12153\">https://doi.org/10.15479/at:ista:12153</a>","ama":"Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical  flows. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12153\">10.15479/at:ista:12153</a>","ista":"Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical  flows. Institute of Science and Technology Austria.","chicago":"Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12153\">https://doi.org/10.15479/at:ista:12153</a>.","short":"F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows, Institute of Science and Technology Austria, 2022."},"ddc":["570"],"type":"dissertation","doi":"10.15479/at:ista:12153","_id":"12368","project":[{"grant_number":"742573","call_identifier":"H2020","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","_id":"260F1432-B435-11E9-9278-68D0E5697425"}],"page":"113","author":[{"last_name":"Arslan","orcid":"0000-0001-5809-9566","id":"49DA7910-F248-11E8-B48F-1D18A9856A87","first_name":"Feyza N","full_name":"Arslan, Feyza N"}],"publisher":"Institute of Science and Technology Austria","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"NanoFab"}],"ec_funded":1,"date_published":"2022-09-29T00:00:00Z","month":"09","date_updated":"2026-06-18T19:47:50Z","publication_status":"published","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"CaHe"}],"oa":1,"file":[{"file_id":"12369","relation":"main_file","date_created":"2023-01-25T10:52:46Z","file_name":"THESIS_FINAL_FArslan_pdfa.pdf","date_updated":"2023-01-25T10:52:46Z","success":1,"access_level":"open_access","checksum":"e54a3e69b83ebf166544164afd25608e","content_type":"application/pdf","file_size":14581024,"creator":"cchlebak"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"OA_place":"publisher","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-025-1 "]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","corr_author":"1","degree_awarded":"PhD","year":"2022","status":"public"},{"oa":1,"department":[{"_id":"GradSch"},{"_id":"RoSe"}],"article_processing_charge":"No","month":"12","date_published":"2022-12-15T00:00:00Z","publication_status":"published","date_updated":"2026-04-16T08:20:52Z","ec_funded":1,"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","year":"2022","status":"public","has_accepted_license":"1","corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","publication_identifier":{"issn":["2663-337X"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"file":[{"date_updated":"2023-01-26T10:02:34Z","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","file_size":3095225,"checksum":"b31460e937f33b557abb40ebef02b567","success":1,"file_id":"12391","file_name":"Brooks_Thesis.pdf","date_created":"2023-01-26T10:02:34Z","relation":"main_file"},{"relation":"source_file","file_name":"Brooks_Thesis.tex","date_created":"2023-01-26T10:02:42Z","file_id":"12392","creator":"cchlebak","file_size":809842,"content_type":"application/octet-stream","access_level":"closed","checksum":"9751869fa5e7981588ad4228f4fd4bd6","date_updated":"2023-01-26T10:02:42Z"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","file_date_updated":"2023-01-26T10:02:42Z","title":"Translation-invariant quantum systems with effectively broken symmetry","related_material":{"record":[{"id":"9005","relation":"part_of_dissertation","status":"public"}]},"language":[{"iso":"eng"}],"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"}],"day":"15","date_created":"2023-01-26T10:00:42Z","supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521"}],"author":[{"full_name":"Brooks, Morris","first_name":"Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","orcid":"0000-0002-6249-0928","last_name":"Brooks"}],"page":"196","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"doi":"10.15479/at:ista:12390","_id":"12390","type":"dissertation","citation":{"ama":"Brooks M. Translation-invariant quantum systems with effectively broken symmetry. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12390\">10.15479/at:ista:12390</a>","apa":"Brooks, M. (2022). <i>Translation-invariant quantum systems with effectively broken symmetry</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12390\">https://doi.org/10.15479/at:ista:12390</a>","ieee":"M. Brooks, “Translation-invariant quantum systems with effectively broken symmetry,” Institute of Science and Technology Austria, 2022.","mla":"Brooks, Morris. <i>Translation-Invariant Quantum Systems with Effectively Broken Symmetry</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12390\">10.15479/at:ista:12390</a>.","short":"M. Brooks, Translation-Invariant Quantum Systems with Effectively Broken Symmetry, Institute of Science and Technology Austria, 2022.","chicago":"Brooks, Morris. “Translation-Invariant Quantum Systems with Effectively Broken Symmetry.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12390\">https://doi.org/10.15479/at:ista:12390</a>.","ista":"Brooks M. 2022. Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria."},"ddc":["500"]},{"type":"journal_article","publication":"ACM Transactions on Graphics","citation":{"apa":"Ishida, S., Wojtan, C., &#38; Chern, A. (2022). Hidden degrees of freedom in implicit vortex filaments. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3550454.3555459\">https://doi.org/10.1145/3550454.3555459</a>","ama":"Ishida S, Wojtan C, Chern A. Hidden degrees of freedom in implicit vortex filaments. <i>ACM Transactions on Graphics</i>. 2022;41(6). doi:<a href=\"https://doi.org/10.1145/3550454.3555459\">10.1145/3550454.3555459</a>","ieee":"S. Ishida, C. Wojtan, and A. Chern, “Hidden degrees of freedom in implicit vortex filaments,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 6. Association for Computing Machinery, 2022.","mla":"Ishida, Sadashige, et al. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 6, 241, Association for Computing Machinery, 2022, doi:<a href=\"https://doi.org/10.1145/3550454.3555459\">10.1145/3550454.3555459</a>.","chicago":"Ishida, Sadashige, Chris Wojtan, and Albert Chern. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3550454.3555459\">https://doi.org/10.1145/3550454.3555459</a>.","short":"S. Ishida, C. Wojtan, A. Chern, ACM Transactions on Graphics 41 (2022).","ista":"Ishida S, Wojtan C, Chern A. 2022. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 41(6), 241."},"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).","external_id":{"isi":["000891651900061"]},"ddc":["000"],"intvolume":"        41","quality_controlled":"1","author":[{"orcid":"0000-0002-3121-3100","last_name":"Ishida","first_name":"Sadashige","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546"},{"full_name":"Chern, Albert","first_name":"Albert","last_name":"Chern"}],"doi":"10.1145/3550454.3555459","_id":"12431","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"scopus_import":"1","isi":1,"title":"Hidden degrees of freedom in implicit vortex filaments","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20551"}]},"file_date_updated":"2023-01-30T07:15:48Z","volume":41,"day":"01","abstract":[{"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.","lang":"eng"}],"date_created":"2023-01-29T23:00:59Z","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_id":"12433","file_name":"2022_ACM_Ishida.pdf","date_created":"2023-01-30T07:15:48Z","relation":"main_file","date_updated":"2023-01-30T07:15:48Z","creator":"dernst","content_type":"application/pdf","access_level":"open_access","checksum":"a2fba257fdefe0e747182be6c0f7c70c","file_size":15551202,"success":1}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"issue":"6","status":"public","year":"2022","has_accepted_license":"1","date_published":"2022-12-01T00:00:00Z","article_type":"original","month":"12","date_updated":"2026-04-07T12:02:23Z","publication_status":"published","publisher":"Association for Computing Machinery","oa":1,"article_processing_charge":"No","department":[{"_id":"ChWo"}],"article_number":"241"},{"publication":"63rd Annual IEEE Symposium on Foundations of Computer Science","type":"conference","external_id":{"isi":["000909382900084"]},"citation":{"apa":"Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">https://doi.org/10.1109/FOCS54457.2022.00091</a>","ama":"Anastos M. Solving the Hamilton cycle problem fast on average. In: <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:<a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">10.1109/FOCS54457.2022.00091</a>","mla":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:<a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">10.1109/FOCS54457.2022.00091</a>.","ieee":"M. Anastos, “Solving the Hamilton cycle problem fast on average,” in <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930.","chicago":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In <i>63rd Annual IEEE Symposium on Foundations of Computer Science</i>, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/FOCS54457.2022.00091\">https://doi.org/10.1109/FOCS54457.2022.00091</a>.","short":"M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.","ista":"Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2022–October, 919–930."},"acknowledgement":"This project has received funding from the European Union’s Horizon 2020\r\nresearch and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement No 101034413","quality_controlled":"1","page":"919-930","author":[{"last_name":"Anastos","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","full_name":"Anastos, Michael","first_name":"Michael"}],"_id":"12432","doi":"10.1109/FOCS54457.2022.00091","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"title":"Solving the Hamilton cycle problem fast on average","volume":"2022-October","date_created":"2023-01-29T23:00:59Z","abstract":[{"text":"We present CertifyHAM, a deterministic algorithm that takes a graph G as input and either finds a Hamilton cycle of G or outputs that such a cycle does not exist. If G ∼ G(n, p) and p ≥\r\n100 log n/n then the expected running time of CertifyHAM is O(n/p) which is best possible. This improves upon previous results due to Gurevich and Shelah, Thomason and Alon, and\r\nKrivelevich, who proved analogous results for p being constant, p ≥ 12n −1/3 and p ≥ 70n\r\n−1/2 respectively.","lang":"eng"}],"day":"01","publication_identifier":{"issn":["0272-5428"],"isbn":["9781665455190"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","year":"2022","status":"public","corr_author":"1","publication_status":"published","date_updated":"2025-07-10T11:50:26Z","month":"12","date_published":"2022-12-01T00:00:00Z","publisher":"Institute of Electrical and Electronics Engineers","ec_funded":1,"article_processing_charge":"No","department":[{"_id":"MaKw"}],"conference":{"location":"Denver, CO, United States","end_date":"2022-11-03","name":"FOCS: Foundations of Computer Science","start_date":"2022-10-31"}},{"article_processing_charge":"No","conference":{"name":"BMVC: British Machine Vision Conference","start_date":"2022-11-21","location":"London, United Kingdom","end_date":"2022-11-24"},"article_number":"708","department":[{"_id":"BeBi"}],"oa":1,"publisher":"British Machine Vision Association and Society for Pattern Recognition","date_published":"2022-12-01T00:00:00Z","month":"12","date_updated":"2023-10-31T08:40:55Z","publication_status":"published","has_accepted_license":"1","year":"2022","status":"public","file":[{"relation":"main_file","file_name":"vorf_main.pdf","date_created":"2023-01-30T10:48:18Z","file_id":"12453","title":"VoRF: Volumetric Relightable Faces","creator":"bbickel","checksum":"b60b70bb48700aee709c85a69231821d","content_type":"application/pdf","file_size":5202710,"access_level":"open_access","date_updated":"2023-01-30T10:48:18Z"},{"date_updated":"2023-01-30T10:48:29Z","creator":"bbickel","access_level":"open_access","checksum":"ce5f4ce66eaaa1590ee5df989fca6f61","content_type":"application/pdf","file_size":37953188,"title":"VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –","file_id":"12454","file_name":"vorf_supp.pdf","date_created":"2023-01-30T10:48:29Z","relation":"supplementary_material"},{"relation":"supplementary_material","file_name":"video.mp4","date_created":"2023-01-30T10:48:37Z","file_id":"12455","creator":"bbickel","content_type":"video/mp4","access_level":"open_access","checksum":"08aecca434b08fee75ee1efe87943718","file_size":57855492,"date_updated":"2023-01-30T10:48:37Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","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."}],"date_created":"2023-01-30T10:47:06Z","title":"VoRF: Volumetric Relightable Faces","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://bmvc2022.mpi-inf.mpg.de/708/","open_access":"1"}],"file_date_updated":"2023-01-30T10:48:37Z","scopus_import":"1","_id":"12452","quality_controlled":"1","author":[{"last_name":"Rao","first_name":"Pramod","full_name":"Rao, Pramod"},{"last_name":"B R","full_name":"B R, Mallikarjun","first_name":"Mallikarjun"},{"full_name":"Fox, Gereon","first_name":"Gereon","last_name":"Fox"},{"first_name":"Tim","full_name":"Weyrich, Tim","last_name":"Weyrich"},{"first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"first_name":"Hans-Peter","full_name":"Seidel, Hans-Peter","last_name":"Seidel"},{"full_name":"Pfister, Hanspeter","first_name":"Hanspeter","last_name":"Pfister"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"full_name":"Tewari, Ayush","first_name":"Ayush","last_name":"Tewari"},{"last_name":"Theobalt","full_name":"Theobalt, Christian","first_name":"Christian"},{"first_name":"Mohamed","full_name":"Elgharib, Mohamed","last_name":"Elgharib"}],"citation":{"mla":"Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” <i>33rd British Machine Vision Conference</i>, 708, British Machine Vision Association and Society for Pattern Recognition, 2022.","ieee":"P. Rao <i>et al.</i>, “VoRF: Volumetric Relightable Faces,” in <i>33rd British Machine Vision Conference</i>, 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 <i>33rd British Machine Vision Conference</i>. London, United Kingdom: British Machine Vision Association and Society for Pattern Recognition.","ama":"Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: <i>33rd British Machine Vision Conference</i>. 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.","chicago":"Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In <i>33rd British Machine Vision Conference</i>. British Machine Vision Association and Society for Pattern Recognition, 2022.","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."},"acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784).","ddc":["000"],"publication":"33rd British Machine Vision Conference","type":"conference"},{"type":"journal_article","publication":"Journal of Statistical Mechanics: Theory and Experiment","external_id":{"isi":["000889589900001"]},"ddc":["510","530"],"citation":{"ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2022;2022(11). doi:<a href=\"https://doi.org/10.1088/1742-5468/ac9828\">10.1088/1742-5468/ac9828</a>","apa":"Mondelli, M., &#38; Venkataramanan, R. (2022). Approximate message passing with spectral initialization for generalized linear models. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/ac9828\">https://doi.org/10.1088/1742-5468/ac9828</a>","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2022, no. 11, 114003, IOP Publishing, 2022, doi:<a href=\"https://doi.org/10.1088/1742-5468/ac9828\">10.1088/1742-5468/ac9828</a>.","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2022, no. 11. IOP Publishing, 2022.","short":"M. Mondelli, R. Venkataramanan, Journal of Statistical Mechanics: Theory and Experiment 2022 (2022).","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2022. <a href=\"https://doi.org/10.1088/1742-5468/ac9828\">https://doi.org/10.1088/1742-5468/ac9828</a>.","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."},"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.","intvolume":"      2022","quality_controlled":"1","author":[{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco"},{"last_name":"Venkataramanan","first_name":"Ramji","full_name":"Venkataramanan, Ramji"}],"_id":"12480","doi":"10.1088/1742-5468/ac9828","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"scopus_import":"1","isi":1,"related_material":{"record":[{"status":"public","id":"10598","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"title":"Approximate message passing with spectral initialization for generalized linear models","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability","Statistical and Nonlinear Physics"],"volume":2022,"file_date_updated":"2023-02-02T08:35:52Z","date_created":"2023-02-02T08:31:57Z","abstract":[{"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.","lang":"eng"}],"day":"24","publication_identifier":{"issn":["1742-5468"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"date_updated":"2023-02-02T08:35:52Z","success":1,"creator":"dernst","access_level":"open_access","content_type":"application/pdf","file_size":1729997,"checksum":"01411ffa76d3e380a0446baeb89b1ef7","file_id":"12481","relation":"main_file","file_name":"2022_JourStatisticalMechanics_Mondelli.pdf","date_created":"2023-02-02T08:35:52Z"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"year":"2022","issue":"11","status":"public","has_accepted_license":"1","corr_author":"1","date_updated":"2025-04-15T07:50:16Z","publication_status":"published","month":"11","article_type":"original","date_published":"2022-11-24T00:00:00Z","publisher":"IOP Publishing","oa":1,"article_processing_charge":"Yes (via OA deal)","article_number":"114003","department":[{"_id":"MaMo"}]},{"oa":1,"department":[{"_id":"ChLa"}],"article_processing_charge":"No","article_type":"original","month":"12","date_published":"2022-12-22T00:00:00Z","date_updated":"2025-12-30T11:04:31Z","publication_status":"published","acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"ML Research Press","year":"2022","status":"public","corr_author":"1","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2835-8856"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"file":[{"file_name":"2022_TMLR_Iofinova.pdf","date_created":"2023-02-23T10:30:04Z","relation":"main_file","file_id":"12673","creator":"dernst","content_type":"application/pdf","file_size":1948063,"checksum":"97c8a8470759cab597abb973ca137a3b","access_level":"open_access","success":1,"date_updated":"2023-02-23T10:30:04Z"}],"oa_version":"Published Version","file_date_updated":"2023-02-23T10:30:04Z","title":"FLEA: Provably robust fair multisource learning from unreliable training data","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://github.com/ISTAustria-CVML/FLEA","description":"source code","relation":"software"}]},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=XsPopigZXV"}],"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"}],"day":"22","date_created":"2023-02-02T20:29:57Z","author":[{"orcid":"0000-0002-7778-3221","last_name":"Iofinova","first_name":"Eugenia B","full_name":"Iofinova, Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117"},{"last_name":"Konstantinov","orcid":"0009-0009-5204-7621","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","full_name":"Konstantinov, Nikola H"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph"}],"quality_controlled":"1","project":[{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"_id":"12495","publication":"Transactions on Machine Learning Research","type":"journal_article","arxiv":1,"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. ","citation":{"chicago":"Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” <i>Transactions on Machine Learning Research</i>. ML Research Press, 2022.","short":"E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022).","ista":"Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research.","apa":"Iofinova, E. B., Konstantinov, N. H., &#38; Lampert, C. (2022). FLEA: Provably robust fair multisource learning from unreliable training data. <i>Transactions on Machine Learning Research</i>. ML Research Press.","ama":"Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource learning from unreliable training data. <i>Transactions on Machine Learning Research</i>. 2022.","mla":"Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” <i>Transactions on Machine Learning Research</i>, ML Research Press, 2022.","ieee":"E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust fair multisource learning from unreliable training data,” <i>Transactions on Machine Learning Research</i>. ML Research Press, 2022."},"ddc":["000"],"external_id":{"arxiv":["2106.11732"]}},{"month":"09","date_published":"2022-09-06T00:00:00Z","date_updated":"2025-09-08T14:35:16Z","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"oa":1,"article_processing_charge":"No","conference":{"end_date":"2022-09-16","location":"Warsaw, Poland","start_date":"2022-09-13","name":"CONCUR: Conference on Concurrency Theory"},"department":[{"_id":"ToHe"}],"publication_identifier":{"isbn":["9783959772464"],"issn":["1868-8969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"file":[{"file_id":"12520","relation":"main_file","file_name":"2022_LIPICs_Henzinger2.pdf","date_created":"2023-02-06T09:21:09Z","date_updated":"2023-02-06T09:21:09Z","success":1,"creator":"dernst","file_size":717940,"content_type":"application/pdf","access_level":"open_access","checksum":"9e97e15628f66b2ad77f535bb0327dee"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"status":"public","year":"2022","has_accepted_license":"1","corr_author":"1","scopus_import":"1","title":"History-deterministic timed automata","related_material":{"record":[{"id":"18530","relation":"later_version","status":"public"}]},"language":[{"iso":"eng"}],"file_date_updated":"2023-02-06T09:21:09Z","volume":243,"day":"06","abstract":[{"text":"We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.\r\nWe show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.\r\nFor timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states.","lang":"eng"}],"date_created":"2023-02-05T17:24:23Z","type":"conference","publication":"33rd International Conference on Concurrency Theory","acknowledgement":"Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n","citation":{"ama":"Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: <i>33rd International Conference on Concurrency Theory</i>. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>","apa":"Henzinger, T. A., Lehtinen, K., &#38; Totzke, P. (2022). History-deterministic timed automata. In <i>33rd International Conference on Concurrency Theory</i> (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>","mla":"Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” <i>33rd International Conference on Concurrency Theory</i>, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">10.4230/LIPIcs.CONCUR.2022.14</a>.","ieee":"T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in <i>33rd International Conference on Concurrency Theory</i>, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.","short":"T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21.","chicago":"Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In <i>33rd International Conference on Concurrency Theory</i>, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.14\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.14</a>.","ista":"Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21."},"ddc":["000"],"intvolume":"       243","quality_controlled":"1","author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"first_name":"Karoliina","full_name":"Lehtinen, Karoliina","last_name":"Lehtinen"},{"first_name":"Patrick","full_name":"Totzke, Patrick","last_name":"Totzke"}],"page":"14:1-14:21","doi":"10.4230/LIPIcs.CONCUR.2022.14","_id":"12508","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}]},{"oa_version":"Published Version","file":[{"relation":"main_file","date_created":"2023-02-06T09:13:04Z","file_name":"2022_LIPICs_Avni.pdf","file_id":"12519","success":1,"access_level":"open_access","checksum":"1888ec9421622f9526fbec2de035f132","file_size":624586,"content_type":"application/pdf","creator":"dernst","date_updated":"2023-02-06T09:13:04Z"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"isbn":["9783959772563"],"issn":["1868-8969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","corr_author":"1","status":"public","year":"2022","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"date_updated":"2025-07-10T11:50:27Z","publication_status":"published","date_published":"2022-08-22T00:00:00Z","month":"08","article_processing_charge":"No","conference":{"start_date":"2022-08-22","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2022-08-26","location":"Vienna, Austria"},"department":[{"_id":"ToHe"}],"oa":1,"ddc":["000"],"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.","citation":{"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.","chicago":"Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>.","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.","ieee":"G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.","mla":"Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” <i>47th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">10.4230/LIPIcs.MFCS.2022.3</a>.","apa":"Avni, G., &#38; Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In <i>47th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">https://doi.org/10.4230/LIPIcs.MFCS.2022.3</a>","ama":"Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: <i>47th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2022.3\">10.4230/LIPIcs.MFCS.2022.3</a>"},"intvolume":"       241","publication":"47th International Symposium on Mathematical Foundations of Computer Science","place":"Dagstuhl, Germany","type":"conference","_id":"12509","doi":"10.4230/LIPIcs.MFCS.2022.3","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","page":"3:1-3:6","author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"scopus_import":"1","date_created":"2023-02-05T17:26:01Z","day":"22","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","title":"An updated survey of bidding games on graphs","volume":241,"file_date_updated":"2023-02-06T09:13:04Z"},{"oa":1,"department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_published":"2022-06-28T00:00:00Z","article_type":"original","month":"06","publication_status":"published","date_updated":"2025-04-15T06:26:14Z","ec_funded":1,"publisher":"Association for the Advancement of Artificial Intelligence","issue":"6","status":"public","year":"2022","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978577358350"]},"oa_version":"Preprint","volume":36,"keyword":["General Medicine"],"title":"GoTube: Scalable statistical verification of continuous-depth models","main_file_link":[{"url":"https://arxiv.org/abs/2107.08467","open_access":"1"}],"language":[{"iso":"eng"}],"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"}],"day":"28","date_created":"2023-02-05T17:27:42Z","scopus_import":"1","page":"6755-6764","author":[{"last_name":"Gruenbacher","first_name":"Sophie A.","full_name":"Gruenbacher, Sophie A."},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Smolka","full_name":"Smolka, Scott A.","first_name":"Scott A."},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"doi":"10.1609/aaai.v36i6.20631","_id":"12510","type":"journal_article","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","arxiv":1,"intvolume":"        36","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).","citation":{"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.","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.","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.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">https://doi.org/10.1609/aaai.v36i6.20631</a>.","ieee":"S. A. Gruenbacher <i>et al.</i>, “GoTube: Scalable statistical verification of continuous-depth models,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.","mla":"Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:<a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">10.1609/aaai.v36i6.20631</a>.","ama":"Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(6):6755-6764. doi:<a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">10.1609/aaai.v36i6.20631</a>","apa":"Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., &#38; Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i6.20631\">https://doi.org/10.1609/aaai.v36i6.20631</a>"},"external_id":{"arxiv":["2107.08467"]}},{"type":"journal_article","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","intvolume":"        36","arxiv":1,"external_id":{"arxiv":["2112.09495"]},"citation":{"ieee":"M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.","mla":"Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>.","ama":"Lechner M, Zikelic D, Chatterjee K, Henzinger TA. Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2022;36(7):7326-7336. doi:<a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">10.1609/aaai.v36i7.20695</a>","apa":"Lechner, M., Zikelic, D., Chatterjee, K., &#38; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>","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.","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.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i7.20695\">https://doi.org/10.1609/aaai.v36i7.20695</a>."},"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.","page":"7326-7336","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"quality_controlled":"1","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"_id":"12511","doi":"10.1609/aaai.v36i7.20695","scopus_import":"1","volume":36,"keyword":["General Medicine"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2112.09495"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"}]},"title":"Stability verification in stochastic control systems via neural network supermartingales","date_created":"2023-02-05T17:29:50Z","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"}],"day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"],"issn":["2159-5399"]},"oa_version":"Preprint","status":"public","issue":"7","year":"2022","corr_author":"1","date_updated":"2026-04-07T13:27:55Z","publication_status":"published","month":"06","article_type":"original","date_published":"2022-06-28T00:00:00Z","ec_funded":1,"publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_processing_charge":"No"},{"status":"public","year":"2022","corr_author":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"isbn":["9783031223648"],"issn":["0302-9743"],"eissn":["1611-3349"]},"oa_version":"Preprint","alternative_title":["LNCS"],"oa":1,"conference":{"start_date":"2022-11-07","name":"TCC: Theory of Cryptography","end_date":"2022-11-10","location":"Chicago, IL, United States"},"department":[{"_id":"KrPi"}],"article_processing_charge":"No","date_updated":"2024-10-09T21:04:05Z","publication_status":"published","date_published":"2022-12-21T00:00:00Z","month":"12","publisher":"Springer Nature","author":[{"last_name":"Bogdanov","full_name":"Bogdanov, Andrej","first_name":"Andrej"},{"orcid":"0000-0002-2505-4246","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel","first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","full_name":"Hoffmann, Charlotte","first_name":"Charlotte","last_name":"Hoffmann","orcid":"0000-0003-2027-5549"},{"first_name":"Alon","full_name":"Rosen, Alon","last_name":"Rosen"}],"page":"565-592","quality_controlled":"1","_id":"12516","doi":"10.1007/978-3-031-22365-5_20","publication":"Theory of Cryptography","type":"conference","intvolume":"     13748","external_id":{"isi":["000921318200020"]},"citation":{"mla":"Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.” <i>Theory of Cryptography</i>, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:<a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">10.1007/978-3-031-22365-5_20</a>.","ieee":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption from Homogeneous CLWE,” in <i>Theory of Cryptography</i>, Chicago, IL, United States, 2022, vol. 13748, pp. 565–592.","ama":"Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. Public-Key Encryption from Homogeneous CLWE. In: <i>Theory of Cryptography</i>. Vol 13748. Springer Nature; 2022:565-592. doi:<a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">10.1007/978-3-031-22365-5_20</a>","apa":"Bogdanov, A., Cueto Noval, M., Hoffmann, C., &#38; Rosen, A. (2022). Public-Key Encryption from Homogeneous CLWE. In <i>Theory of Cryptography</i> (Vol. 13748, pp. 565–592). Chicago, IL, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">https://doi.org/10.1007/978-3-031-22365-5_20</a>","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.","short":"A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography, Springer Nature, 2022, pp. 565–592.","chicago":"Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen. “Public-Key Encryption from Homogeneous CLWE.” In <i>Theory of Cryptography</i>, 13748:565–92. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-22365-5_20\">https://doi.org/10.1007/978-3-031-22365-5_20</a>."},"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.","volume":13748,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/093"}],"title":"Public-Key Encryption from Homogeneous CLWE","date_created":"2023-02-05T23:01:00Z","day":"21","abstract":[{"lang":"eng","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."}],"isi":1,"scopus_import":"1"},{"department":[{"_id":"GeKa"}],"article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"day":"25","date_created":"2023-02-07T08:13:39Z","file_date_updated":"2023-02-07T08:18:24Z","title":"Data for \"Majorana-like Coulomb spectroscopy in the absence of zero bias peaks\"","oa":1,"related_material":{"record":[{"id":"12118","relation":"used_in_publication","status":"public"},{"status":"public","relation":"used_in_publication","id":"13286"}]},"publisher":"Institute of Science and Technology Austria","month":"09","date_published":"2022-09-25T00:00:00Z","date_updated":"2026-04-07T13:27:22Z","contributor":[{"contributor_type":"contact_person","last_name":"Valentini","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","first_name":"Marco"}],"corr_author":"1","has_accepted_license":"1","doi":"10.15479/AT:ISTA:12102","_id":"12522","author":[{"last_name":"Valentini","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","first_name":"Marco","full_name":"Valentini, Marco"},{"first_name":"Pablo","full_name":"San-Jose, Pablo","last_name":"San-Jose"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Marti-Sanchez","first_name":"Sara","full_name":"Marti-Sanchez, Sara"},{"last_name":"Botifoll","full_name":"Botifoll, Marc","first_name":"Marc"}],"year":"2022","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"citation":{"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. <a href=\"https://doi.org/10.15479/AT:ISTA:12102\">https://doi.org/10.15479/AT:ISTA:12102</a>.","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, <a href=\"https://doi.org/10.15479/AT:ISTA:12102\">10.15479/AT:ISTA:12102</a>.","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:<a href=\"https://doi.org/10.15479/AT:ISTA:12102\">10.15479/AT:ISTA:12102</a>","apa":"Valentini, M., San-Jose, P., Arbiol, J., Marti-Sanchez, S., &#38; Botifoll, M. (2022). Data for “Majorana-like Coulomb spectroscopy in the absence of zero bias peaks.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:12102\">https://doi.org/10.15479/AT:ISTA:12102</a>","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.","mla":"Valentini, Marco, et al. <i>Data for “Majorana-like Coulomb Spectroscopy in the Absence of Zero Bias Peaks.”</i> Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:12102\">10.15479/AT:ISTA:12102</a>."},"file":[{"creator":"dernst","content_type":"application/x-zip-compressed","access_level":"open_access","file_size":3609122411,"checksum":"0dbd6327bf84c7e81b295c4bc9d12826","success":1,"date_updated":"2023-02-07T08:18:24Z","file_name":"Majorana_like.zip","date_created":"2023-02-07T08:18:24Z","relation":"main_file","file_id":"12523"}],"ddc":["530"],"oa_version":"Published Version","type":"research_data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":"1","volume":35,"title":"The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation?","main_file_link":[{"url":"https://arxiv.org/abs/2205.10009","open_access":"1"}],"language":[{"iso":"eng"}],"day":"20","abstract":[{"text":"We consider the problem of estimating a rank-1 signal corrupted by structured rotationally invariant noise, and address the following question: how well do inference algorithms perform when the noise statistics is unknown and hence Gaussian noise is assumed? While the matched Bayes-optimal setting with unstructured noise is well understood, the analysis of this mismatched problem is only at its premises. In this paper, we make a step towards understanding the effect of the strong source of mismatch which is the noise statistics. Our main technical contribution is the rigorous analysis of a Bayes estimator and of an approximate message passing (AMP) algorithm, both of which incorrectly assume a Gaussian setup. The first result exploits the theory of spherical integrals and of low-rank matrix perturbations; the idea behind the second one is to design and analyze an artificial AMP which, by taking advantage of the flexibility in the denoisers, is able to \"correct\" the mismatch. Armed with these sharp asymptotic characterizations, we unveil a rich and often unexpected phenomenology. For example, despite AMP is in principle designed to efficiently compute the Bayes estimator, the former is outperformed by the latter in terms of mean-square error. We show that this performance gap is due to an incorrect estimation of the signal norm. In fact, when the SNR is large enough, the overlaps of the AMP and the Bayes estimator coincide, and they even match those of optimal estimators taking into account the structure of the noise.","lang":"eng"}],"date_created":"2023-02-10T13:45:41Z","publication":"36th Annual Conference on Neural Information Processing Systems","type":"conference","arxiv":1,"intvolume":"        35","citation":{"ieee":"J. Barbier, T. Hou, M. Mondelli, and M. Saenz, “The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation?,” in <i>36th Annual Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2022, vol. 35.","mla":"Barbier, Jean, et al. “The Price of Ignorance: How Much Does It Cost to Forget Noise Structure in Low-Rank Matrix Estimation?” <i>36th Annual Conference on Neural Information Processing Systems</i>, vol. 35, 2022.","apa":"Barbier, J., Hou, T., Mondelli, M., &#38; Saenz, M. (2022). The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation? In <i>36th Annual Conference on Neural Information Processing Systems</i> (Vol. 35). New Orleans, LA, United States.","ama":"Barbier J, Hou T, Mondelli M, Saenz M. The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation? In: <i>36th Annual Conference on Neural Information Processing Systems</i>. Vol 35. ; 2022.","ista":"Barbier J, Hou T, Mondelli M, Saenz M. 2022. The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation? 36th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 35.","chicago":"Barbier, Jean, TianQi Hou, Marco Mondelli, and Manuel Saenz. “The Price of Ignorance: How Much Does It Cost to Forget Noise Structure in Low-Rank Matrix Estimation?” In <i>36th Annual Conference on Neural Information Processing Systems</i>, Vol. 35, 2022.","short":"J. Barbier, T. Hou, M. Mondelli, M. Saenz, in:, 36th Annual Conference on Neural Information Processing Systems, 2022."},"acknowledgement":"M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. The authors acknowledge\r\ndiscussions with A. Krajenbrink, M. Robinson, A. Depope, N. Macris and F. Pourkamali.\r\n","external_id":{"arxiv":["2205.10009"]},"author":[{"full_name":"Barbier, Jean","first_name":"Jean","last_name":"Barbier"},{"full_name":"Hou, TianQi","first_name":"TianQi","last_name":"Hou"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Saenz, Manuel","first_name":"Manuel","last_name":"Saenz"}],"quality_controlled":"1","_id":"12536","date_published":"2022-11-20T00:00:00Z","month":"11","publication_status":"published","date_updated":"2024-10-09T21:04:25Z","oa":1,"department":[{"_id":"MaMo"}],"conference":{"end_date":"2022-12-09","location":"New Orleans, LA, United States","start_date":"2022-11-28","name":"NeurIPS: Neural Information Processing Systems"},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9781713871088"]},"alternative_title":["NeurIPS"],"oa_version":"Preprint","status":"public","year":"2022","corr_author":"1"},{"day":"24","abstract":[{"text":"The Neural Tangent Kernel (NTK) has emerged as a powerful tool to provide memorization, optimization and generalization guarantees in deep neural networks. A line of work has studied the NTK spectrum for two-layer and deep networks with at least a layer with Ω(N) neurons, N being the number of training samples. Furthermore, there is increasing evidence suggesting that deep networks with sub-linear layer widths are powerful memorizers and optimizers, as long as the number of parameters exceeds the number of samples. Thus, a natural open question is whether the NTK is well conditioned in such a challenging sub-linear setup. In this paper, we answer this question in the affirmative. Our key technical contribution is a lower bound on the smallest NTK eigenvalue for deep networks with the minimum possible over-parameterization: the number of parameters is roughly Ω(N) and, hence, the number of neurons is as little as Ω(N−−√). To showcase the applicability of our NTK bounds, we provide two results concerning memorization capacity and optimization guarantees for gradient descent training.","lang":"eng"}],"date_created":"2023-02-10T13:46:37Z","volume":35,"title":"Memorization and optimization in deep neural networks with minimum over-parameterization","language":[{"iso":"eng"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2205.10217","open_access":"1"}],"arxiv":1,"intvolume":"        35","acknowledgement":"The authors were partially supported by the 2019 Lopez-Loreta prize, and they would like to thank\r\nQuynh Nguyen, Mahdi Soltanolkotabi and Adel Javanmard for helpful discussions.\r\n","citation":{"chicago":"Bombari, Simone, Mohammad Hossein Amani, and Marco Mondelli. “Memorization and Optimization in Deep Neural Networks with Minimum Over-Parameterization.” In <i>36th Conference on Neural Information Processing Systems</i>, 35:7628–40. Neural Information Processing Systems Foundation, 2022.","short":"S. Bombari, M.H. Amani, M. Mondelli, in:, 36th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2022, pp. 7628–7640.","ista":"Bombari S, Amani MH, Mondelli M. 2022. Memorization and optimization in deep neural networks with minimum over-parameterization. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 35, 7628–7640.","apa":"Bombari, S., Amani, M. H., &#38; Mondelli, M. (2022). Memorization and optimization in deep neural networks with minimum over-parameterization. In <i>36th Conference on Neural Information Processing Systems</i> (Vol. 35, pp. 7628–7640). New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ama":"Bombari S, Amani MH, Mondelli M. Memorization and optimization in deep neural networks with minimum over-parameterization. In: <i>36th Conference on Neural Information Processing Systems</i>. Vol 35. Neural Information Processing Systems Foundation; 2022:7628-7640.","ieee":"S. Bombari, M. H. Amani, and M. Mondelli, “Memorization and optimization in deep neural networks with minimum over-parameterization,” in <i>36th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2022, vol. 35, pp. 7628–7640.","mla":"Bombari, Simone, et al. “Memorization and Optimization in Deep Neural Networks with Minimum Over-Parameterization.” <i>36th Conference on Neural Information Processing Systems</i>, vol. 35, Neural Information Processing Systems Foundation, 2022, pp. 7628–40."},"external_id":{"arxiv":["2205.10217"]},"publication":"36th Conference on Neural Information Processing Systems","type":"conference","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"_id":"12537","author":[{"last_name":"Bombari","full_name":"Bombari, Simone","first_name":"Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa"},{"last_name":"Amani","first_name":"Mohammad Hossein","full_name":"Amani, Mohammad Hossein"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"}],"page":"7628-7640","quality_controlled":"1","publisher":"Neural Information Processing Systems Foundation","date_published":"2022-07-24T00:00:00Z","month":"07","date_updated":"2025-05-14T11:28:22Z","publication_status":"published","conference":{"start_date":"2022-11-28","name":"NeurIPS: Neural Information Processing Systems","end_date":"2022-12-09","location":"New Orleans, LA, United States"},"department":[{"_id":"MaMo"}],"article_processing_charge":"No","oa":1,"OA_type":"green","alternative_title":["Advances in Neural Information Processing Systems"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","publication_identifier":{"eissn":["1049-5258"],"isbn":["9781713871088"]},"corr_author":"1","status":"public","year":"2022"}]