[{"year":"2022","status":"public","author":[{"full_name":"Das, Sourav","first_name":"Sourav","last_name":"Das"},{"full_name":"Yurek, Thomas","first_name":"Thomas","last_name":"Yurek"},{"last_name":"Xiang","full_name":"Xiang, Zhuolun","first_name":"Zhuolun"},{"first_name":"Andrew","full_name":"Miller, Andrew","last_name":"Miller"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"full_name":"Ren, Ling","first_name":"Ling","last_name":"Ren"}],"page":"2518-2534","quality_controlled":"1","doi":"10.1109/sp46214.2022.9833584","_id":"12300","publication":"2022 IEEE Symposium on Security and Privacy","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication_identifier":{"eissn":["2375-1207"],"eisbn":["9781665413169"]},"acknowledgement":"The authors would like to thank Amit Agarwal, Adithya Bhat, Kobi Gurkan, Dakshita Khurana, Nibesh Shrestha, and Gilad Stern for the helpful discussions related to the paper.\r\nAlso, the authors would like to thank Sylvain Bellemare for helping with the hbACSS codebase and Nicolas Gailly for helping with running the Drand experiments.","citation":{"ieee":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical asynchronous distributed key generation,” in 2022 IEEE Symposium on Security and Privacy, San Francisco, CA, United States, 2022, pp. 2518–2534.","mla":"Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–34, doi:10.1109/sp46214.2022.9833584.","ama":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. Practical asynchronous distributed key generation. In: 2022 IEEE Symposium on Security and Privacy. Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:10.1109/sp46214.2022.9833584","apa":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., & Ren, L. (2022). Practical asynchronous distributed key generation. In 2022 IEEE Symposium on Security and Privacy (pp. 2518–2534). San Francisco, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/sp46214.2022.9833584","ista":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy. SP: Symposium on Security and Privacy, 2518–2534.","short":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–2534.","chicago":"Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In 2022 IEEE Symposium on Security and Privacy, 2518–34. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/sp46214.2022.9833584."},"oa_version":"Preprint","title":"Practical asynchronous distributed key generation","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2021/1591","open_access":"1"}],"oa":1,"department":[{"_id":"ElKo"}],"conference":{"start_date":"2022-05-23","name":"SP: Symposium on Security and Privacy","end_date":"2022-05-26","location":"San Francisco, CA, United States"},"article_processing_charge":"No","day":"27","abstract":[{"lang":"eng","text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to tComputer Aided Verification, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:10.1007/978-3-031-13188-2_6.","ieee":"K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in Computer Aided Verification, Haifa, Israel, 2022, vol. 13372, pp. 109–129.","apa":"Doveri, K., Ganty, P., & Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In Computer Aided Verification (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-13188-2_6","ama":"Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing. In: Computer Aided Verification. Vol 13372. Springer Nature; 2022:109-129. doi:10.1007/978-3-031-13188-2_6","ista":"Doveri K, Ganty P, Mazzocchi NA. 2022. FORQ-based language inclusion formal testing. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13372, 109–129.","chicago":"Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.” In Computer Aided Verification, 13372:109–29. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-13188-2_6.","short":"K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer Nature, 2022, pp. 109–129."},"intvolume":" 13372","arxiv":1},{"doi":"10.1007/978-3-030-82007-7_8","_id":"12303","project":[{"_id":"25E549F4-B435-11E9-9278-68D0E5697425","name":"Arithmetic and physics of Higgs moduli spaces","grant_number":"320593","call_identifier":"FP7"}],"quality_controlled":"1","page":"347-392","author":[{"first_name":"Ivan","full_name":"Mirković, Ivan","last_name":"Mirković"},{"full_name":"Yang, Yaping","first_name":"Yaping","last_name":"Yang"},{"first_name":"Gufang","full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao"}],"acknowledgement":"I.M. thanks Zhijie Dong for long-term discussions on the material that entered this work. We thank Misha Finkelberg for pointing out errors in earlier versions. His advice and his insistence have led to a much better paper. A part of the writing was done at the conference at IST (Vienna) attended by all coauthors. We therefore thank the organizers of the conference and the support of ERC Advanced Grant Arithmetic and Physics of Higgs moduli spaces No. 320593. The work of I.M. was partially supported by NSF grants. The work of Y.Y. was partially supported by the Australian Research Council (ARC) via the award DE190101231. The work of G.Z. was partially supported by ARC via the award DE190101222.","citation":{"ista":"Mirković I, Yang Y, Zhao G. 2022.Loop Grassmannians of Quivers and Affine Quantum Groups. In: Representation Theory and Algebraic Geometry. Trends in Mathematics, , 347–392.","chicago":"Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers and Affine Quantum Groups.” In Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92. TM. Cham: Springer Nature; Birkhäuser, 2022. https://doi.org/10.1007/978-3-030-82007-7_8.","short":"I. Mirković, Y. Yang, G. Zhao, in:, V. Baranovskky, N. Guay, T. Schedler (Eds.), Representation Theory and Algebraic Geometry, 1st ed., Springer Nature; Birkhäuser, Cham, 2022, pp. 347–392.","mla":"Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.” Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:10.1007/978-3-030-82007-7_8.","ieee":"I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine Quantum Groups,” in Representation Theory and Algebraic Geometry, 1st ed., V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser, 2022, pp. 347–392.","apa":"Mirković, I., Yang, Y., & Zhao, G. (2022). Loop Grassmannians of Quivers and Affine Quantum Groups. In V. Baranovskky, N. Guay, & T. Schedler (Eds.), Representation Theory and Algebraic Geometry (1st ed., pp. 347–392). Cham: Springer Nature; Birkhäuser. https://doi.org/10.1007/978-3-030-82007-7_8","ama":"Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum Groups. In: Baranovskky V, Guay N, Schedler T, eds. Representation Theory and Algebraic Geometry. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392. doi:10.1007/978-3-030-82007-7_8"},"external_id":{"arxiv":["1810.10095"]},"arxiv":1,"type":"book_chapter","place":"Cham","publication":"Representation Theory and Algebraic Geometry","day":"16","abstract":[{"text":"We construct for each choice of a quiver Q, a cohomology theory A, and a poset P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple groups and the loop Grassmannians of based quadratic forms. The addition of a “dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated by the program of introducing an inner cohomology theory in algebraic geometry adequate for the Geometric Langlands program (Mirković, Some extensions of the notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic quantum groups, preprint. arxiv1708.01418).","lang":"eng"}],"date_created":"2023-01-16T10:06:41Z","series_title":"TM","title":"Loop Grassmannians of Quivers and Affine Quantum Groups","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1810.10095"}],"scopus_import":"1","editor":[{"last_name":"Baranovskky","first_name":"Vladimir","full_name":"Baranovskky, Vladimir"},{"first_name":"Nicolas","full_name":"Guay, Nicolas","last_name":"Guay"},{"last_name":"Schedler","full_name":"Schedler, Travis","first_name":"Travis"}],"edition":"1","year":"2022","status":"public","alternative_title":["Trends in Mathematics"],"oa_version":"Preprint","publication_identifier":{"issn":["2297-0215"],"isbn":["9783030820060"],"eissn":["2297-024X"],"eisbn":["9783030820077"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"TaHa"}],"oa":1,"publisher":"Springer Nature; Birkhäuser","ec_funded":1,"date_published":"2022-06-16T00:00:00Z","month":"06","date_updated":"2025-04-14T09:12:46Z","publication_status":"published"},{"publisher":"Taylor & Francis","date_published":"2022-07-01T00:00:00Z","article_type":"original","month":"07","publication_status":"published","date_updated":"2024-10-09T21:03:57Z","department":[{"_id":"JuFi"}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"eissn":["1532-4133"],"issn":["0360-5302"]},"corr_author":"1","year":"2022","status":"public","issue":"7","isi":1,"scopus_import":"1","day":"01","abstract":[{"lang":"eng","text":"We establish sharp criteria for the instantaneous propagation of free boundaries in solutions to the thin-film equation. The criteria are formulated in terms of the initial distribution of mass (as opposed to previous almost-optimal results), reflecting the fact that mass is a locally conserved quantity for the thin-film equation. In the regime of weak slippage, our criteria are at the same time necessary and sufficient. The proof of our upper bounds on free boundary propagation is based on a strategy of “propagation of degeneracy” down to arbitrarily small spatial scales: We combine estimates on the local mass and estimates on energies to show that “degeneracy” on a certain space-time cylinder entails “degeneracy” on a spatially smaller space-time cylinder with the same time horizon. The derivation of our lower bounds on free boundary propagation is based on a combination of a monotone quantity and almost optimal estimates established previously by the second author with a new estimate connecting motion of mass to entropy production."}],"date_created":"2023-01-16T10:06:50Z","keyword":["Applied Mathematics","Analysis"],"volume":47,"title":"Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1907.05342"}],"language":[{"iso":"eng"}],"arxiv":1,"intvolume":" 47","citation":{"short":"N. De Nitti, J.L. Fischer, Communications in Partial Differential Equations 47 (2022) 1394–1434.","chicago":"De Nitti, Nicola, and Julian L Fischer. “Sharp Criteria for the Waiting Time Phenomenon in Solutions to the Thin-Film Equation.” Communications in Partial Differential Equations. Taylor & Francis, 2022. https://doi.org/10.1080/03605302.2022.2056702.","ista":"De Nitti N, Fischer JL. 2022. Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. Communications in Partial Differential Equations. 47(7), 1394–1434.","ama":"De Nitti N, Fischer JL. Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. Communications in Partial Differential Equations. 2022;47(7):1394-1434. doi:10.1080/03605302.2022.2056702","apa":"De Nitti, N., & Fischer, J. L. (2022). Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. Communications in Partial Differential Equations. Taylor & Francis. https://doi.org/10.1080/03605302.2022.2056702","mla":"De Nitti, Nicola, and Julian L. Fischer. “Sharp Criteria for the Waiting Time Phenomenon in Solutions to the Thin-Film Equation.” Communications in Partial Differential Equations, vol. 47, no. 7, Taylor & Francis, 2022, pp. 1394–434, doi:10.1080/03605302.2022.2056702.","ieee":"N. De Nitti and J. L. Fischer, “Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation,” Communications in Partial Differential Equations, vol. 47, no. 7. Taylor & Francis, pp. 1394–1434, 2022."},"acknowledgement":"N. De Nitti acknowledges the kind hospitality of IST Austria within the framework of the ISTernship Summer Program 2018, during which most of the present article was written. N. DeNitti has received funding by The Austrian Agency for International Cooperation in Education &Research (OeAD-GmbH) via its financial support of the ISTernship Summer Program 2018. N.De Nitti would also like to thank Giuseppe Coclite, Giuseppe Devillanova, Giuseppe Florio, Sebastian Hensel, and Francesco Maddalena for several helpful conversations on topics related to this work.","external_id":{"isi":["000805689800001"],"arxiv":["1907.05342"]},"type":"journal_article","publication":"Communications in Partial Differential Equations","doi":"10.1080/03605302.2022.2056702","_id":"12304","author":[{"last_name":"De Nitti","full_name":"De Nitti, Nicola","first_name":"Nicola"},{"orcid":"0000-0002-0479-558X","last_name":"Fischer","first_name":"Julian L","full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"page":"1394-1434","quality_controlled":"1"},{"doi":"10.1137/21m1424925","_id":"12305","quality_controlled":"1","author":[{"full_name":"Abels, Helmut","first_name":"Helmut","last_name":"Abels"},{"id":"a60047a9-da77-11eb-85b4-c4dc385ebb8c","first_name":"Maximilian","full_name":"Moser, Maximilian","last_name":"Moser"}],"page":"114-172","citation":{"ieee":"H. Abels and M. Moser, “Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°,” SIAM Journal on Mathematical Analysis, vol. 54, no. 1. Society for Industrial and Applied Mathematics, pp. 114–172, 2022.","mla":"Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” SIAM Journal on Mathematical Analysis, vol. 54, no. 1, Society for Industrial and Applied Mathematics, 2022, pp. 114–72, doi:10.1137/21m1424925.","ama":"Abels H, Moser M. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. 2022;54(1):114-172. doi:10.1137/21m1424925","apa":"Abels, H., & Moser, M. (2022). Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21m1424925","ista":"Abels H, Moser M. 2022. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. 54(1), 114–172.","short":"H. Abels, M. Moser, SIAM Journal on Mathematical Analysis 54 (2022) 114–172.","chicago":"Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/21m1424925."},"external_id":{"isi":["000762768000004"],"arxiv":["2105.08434"]},"arxiv":1,"intvolume":" 54","publication":"SIAM Journal on Mathematical Analysis","type":"journal_article","day":"04","abstract":[{"lang":"eng","text":"This paper is concerned with the sharp interface limit for the Allen--Cahn equation with a nonlinear Robin boundary condition in a bounded smooth domain Ω⊂\\R2. We assume that a diffuse interface already has developed and that it is in contact with the boundary ∂Ω. The boundary condition is designed in such a way that the limit problem is given by the mean curvature flow with constant α-contact angle. For α close to 90° we prove a local in time convergence result for well-prepared initial data for times when a smooth solution to the limit problem exists. Based on the latter we construct a suitable curvilinear coordinate system and carry out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear Robin boundary condition. Moreover, we show a spectral estimate for the corresponding linearized Allen--Cahn operator and with its aid we derive strong norm estimates for the difference of the exact and approximate solutions using a Gronwall-type argument."}],"date_created":"2023-01-16T10:07:00Z","title":"Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°","language":[{"iso":"eng"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2105.08434","open_access":"1"}],"keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"volume":54,"scopus_import":"1","isi":1,"corr_author":"1","status":"public","issue":"1","year":"2022","oa_version":"Preprint","publication_identifier":{"eissn":["1095-7154"],"issn":["0036-1410"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","department":[{"_id":"JuFi"}],"oa":1,"publisher":"Society for Industrial and Applied Mathematics","article_type":"original","date_published":"2022-01-04T00:00:00Z","month":"01","publication_status":"published","date_updated":"2024-10-09T21:03:58Z"},{"publisher":"Taylor & Francis","date_updated":"2024-10-09T21:03:58Z","publication_status":"published","date_published":"2022-05-28T00:00:00Z","article_type":"original","month":"05","article_processing_charge":"No","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"oa_version":"None","publication_identifier":{"eissn":["1935-4053"],"issn":["1051-1970"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","issue":"5","year":"2022","status":"public","scopus_import":"1","date_created":"2023-01-16T10:07:21Z","abstract":[{"lang":"eng","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."}],"day":"28","language":[{"iso":"eng"}],"title":"Tangible topology through the lens of limits","volume":32,"keyword":["Education","General Mathematics"],"citation":{"ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609.","chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750.","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.","mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022, pp. 593–609, doi:10.1080/10511970.2021.1872750.","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022.","apa":"Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS. 2022;32(5):593-609. doi:10.1080/10511970.2021.1872750"},"intvolume":" 32","type":"journal_article","publication":"PRIMUS","_id":"12307","doi":"10.1080/10511970.2021.1872750","quality_controlled":"1","page":"593-609","author":[{"full_name":"Shipman, Barbara A.","first_name":"Barbara A.","last_name":"Shipman"},{"id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X"}]},{"project":[{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","name":"Efficient coding with biophysical realism","grant_number":"P34015"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.1371/journal.pbio.3001889","_id":"12332","author":[{"first_name":"Wiktor F","full_name":"Mlynarski, Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87","last_name":"Mlynarski"},{"first_name":"Gašper","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"1","last_name":"Tkačik"}],"page":"e3001889","quality_controlled":"1","intvolume":" 20","citation":{"apa":"Mlynarski, W. F., & Tkačik, G. (2022). Efficient coding theory of dynamic attentional modulation. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3001889","ama":"Mlynarski WF, Tkačik G. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 2022;20(12):e3001889. doi:10.1371/journal.pbio.3001889","mla":"Mlynarski, Wiktor F., and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” PLoS Biology, vol. 20, no. 12, Public Library of Science, 2022, p. e3001889, doi:10.1371/journal.pbio.3001889.","ieee":"W. F. Mlynarski and G. Tkačik, “Efficient coding theory of dynamic attentional modulation,” PLoS Biology, vol. 20, no. 12. Public Library of Science, p. e3001889, 2022.","chicago":"Mlynarski, Wiktor F, and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” PLoS Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pbio.3001889.","short":"W.F. Mlynarski, G. Tkačik, PLoS Biology 20 (2022) e3001889.","ista":"Mlynarski WF, Tkačik G. 2022. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 20(12), e3001889."},"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.","external_id":{"pmid":["36542662"],"isi":["000925192000001"]},"ddc":["570"],"publication":"PLoS Biology","type":"journal_article","abstract":[{"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.","lang":"eng"}],"day":"21","date_created":"2023-01-22T23:00:55Z","file_date_updated":"2023-01-23T08:46:40Z","volume":20,"title":"Efficient coding theory of dynamic attentional modulation","language":[{"iso":"eng"}],"pmid":1,"isi":1,"scopus_import":"1","corr_author":"1","has_accepted_license":"1","year":"2022","issue":"12","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"},"file":[{"relation":"main_file","date_created":"2023-01-23T08:46:40Z","file_name":"2022_PloSBiology_Mlynarski.pdf","file_id":"12337","success":1,"content_type":"application/pdf","checksum":"5d7f1111a87e5f2c1bf92f8886738894","file_size":4248838,"access_level":"open_access","creator":"dernst","date_updated":"2023-01-23T08:46:40Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1545-7885"]},"department":[{"_id":"GaTk"}],"article_processing_charge":"No","oa":1,"ec_funded":1,"publisher":"Public Library of Science","article_type":"original","date_published":"2022-12-21T00:00:00Z","month":"12","publication_status":"published","date_updated":"2025-06-11T13:57:01Z"},{"intvolume":" 11","ddc":["570"],"external_id":{"pmid":["36546673"],"isi":["000912674700001"]},"citation":{"ista":"Tomanek I, Guet CC. 2022. Adaptation dynamics between copynumber and point mutations. eLife. 11, e82240.","short":"I. Tomanek, C.C. Guet, ELife 11 (2022).","chicago":"Tomanek, Isabella, and Calin C Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” ELife. eLife Sciences Publications, 2022. https://doi.org/10.7554/ELIFE.82240.","mla":"Tomanek, Isabella, and Calin C. Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” ELife, vol. 11, e82240, eLife Sciences Publications, 2022, doi:10.7554/ELIFE.82240.","ieee":"I. Tomanek and C. C. Guet, “Adaptation dynamics between copynumber and point mutations,” eLife, vol. 11. eLife Sciences Publications, 2022.","ama":"Tomanek I, Guet CC. Adaptation dynamics between copynumber and point mutations. eLife. 2022;11. doi:10.7554/ELIFE.82240","apa":"Tomanek, I., & Guet, C. C. (2022). Adaptation dynamics between copynumber and point mutations. ELife. eLife Sciences Publications. https://doi.org/10.7554/ELIFE.82240"},"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.","type":"journal_article","publication":"eLife","_id":"12333","doi":"10.7554/ELIFE.82240","author":[{"id":"3981F020-F248-11E8-B48F-1D18A9856A87","full_name":"Tomanek, Isabella","first_name":"Isabella","last_name":"Tomanek","orcid":"0000-0001-6197-363X"},{"orcid":"0000-0001-6220-2052","last_name":"Guet","full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","pmid":1,"isi":1,"scopus_import":"1","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"}],"volume":11,"file_date_updated":"2023-01-23T08:56:21Z","related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.6974122"}],"record":[{"relation":"research_data","id":"12339","status":"public"}]},"language":[{"iso":"eng"}],"title":"Adaptation dynamics between copynumber and point mutations","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_version":"Published Version","file":[{"date_created":"2023-01-23T08:56:21Z","file_name":"2022_eLife_Tomanek.pdf","relation":"main_file","file_id":"12338","content_type":"application/pdf","access_level":"open_access","file_size":8835954,"checksum":"9321fd5f06ff59d5e2d33daee84b3da1","creator":"dernst","success":1,"date_updated":"2023-01-23T08:56:21Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2050-084X"]},"corr_author":"1","has_accepted_license":"1","year":"2022","status":"public","publisher":"eLife Sciences Publications","date_updated":"2025-03-06T14:03:50Z","publication_status":"published","date_published":"2022-12-22T00:00:00Z","article_type":"original","month":"12","article_number":"e82240","department":[{"_id":"CaGu"}],"article_processing_charge":"No","oa":1},{"year":"2022","status":"public","author":[{"last_name":"Tomanek","orcid":"0000-0001-6197-363X","id":"3981F020-F248-11E8-B48F-1D18A9856A87","full_name":"Tomanek, Isabella","first_name":"Isabella"},{"full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet"}],"corr_author":"1","doi":"10.5061/dryad.rfj6q57ds","_id":"12339","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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. Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose. Dryad, 2022, doi:10.5061/dryad.rfj6q57ds.","apa":"Tomanek, I., & Guet, C. C. (2022). Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. Dryad. https://doi.org/10.5061/dryad.rfj6q57ds","ama":"Tomanek I, Guet CC. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. 2022. doi:10.5061/dryad.rfj6q57ds","ista":"Tomanek I, Guet CC. 2022. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose, Dryad, 10.5061/dryad.rfj6q57ds.","chicago":"Tomanek, Isabella, and Calin C Guet. “Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose.” Dryad, 2022. https://doi.org/10.5061/dryad.rfj6q57ds.","short":"I. Tomanek, C.C. Guet, (2022)."},"oa_version":"Published Version","ddc":["570"],"title":"Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose","related_material":{"record":[{"status":"public","id":"12333","relation":"used_in_publication"}]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.5061/dryad.rfj6q57ds","open_access":"1"}],"department":[{"_id":"CaGu"}],"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"}],"date_created":"2023-01-23T09:00:37Z","date_published":"2022-12-23T00:00:00Z","month":"12","date_updated":"2025-03-06T14:03:50Z","publisher":"Dryad"},{"supervisor":[{"orcid":"0000-0001-6646-5546","last_name":"Wojtan","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2023-01-24T10:49:46Z","abstract":[{"text":"The complex yarn structure of knitted and woven fabrics gives rise to both a mechanical and\r\nvisual complexity. The small-scale interactions of yarns colliding with and pulling on each\r\nother result in drastically different large-scale stretching and bending behavior, introducing\r\nanisotropy, curling, and more. While simulating cloth as individual yarns can reproduce this\r\ncomplexity and match the quality of real fabric, it may be too computationally expensive for\r\nlarge fabrics. On the other hand, continuum-based approaches do not need to discretize the\r\ncloth at a stitch-level, but it is non-trivial to find a material model that would replicate the\r\nlarge-scale behavior of yarn fabrics, and they discard the intricate visual detail. In this thesis,\r\nwe discuss three methods to try and bridge the gap between small-scale and large-scale yarn\r\nmechanics using numerical homogenization: fitting a continuum model to periodic yarn simulations, adding mechanics-aware yarn detail onto thin-shell simulations, and quantitatively\r\nfitting yarn parameters to physical measurements of real fabric.\r\nTo start, we present a method for animating yarn-level cloth effects using a thin-shell solver.\r\nWe first use a large number of periodic yarn-level simulations to build a model of the potential\r\nenergy density of the cloth, and then use it to compute forces in a thin-shell simulator. The\r\nresulting simulations faithfully reproduce expected effects like the stiffening of woven fabrics\r\nand the highly deformable nature and anisotropy of knitted fabrics at a fraction of the cost of\r\nfull yarn-level simulation.\r\nWhile our thin-shell simulations are able to capture large-scale yarn mechanics, they lack\r\nthe rich visual detail of yarn-level simulations. Therefore, we propose a method to animate\r\nyarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware\r\nfashion in real time. Using triangle strains to interpolate precomputed yarn geometry, we are\r\nable to reproduce effects such as knit loops tightening under stretching at negligible cost.\r\nFinally, we introduce a methodology for inverse-modeling of yarn-level mechanics of cloth,\r\nbased on the mechanical response of fabrics in the real world. We compile a database from\r\nphysical tests of several knitted fabrics used in the textile industry spanning diverse physical\r\nproperties like stiffness, nonlinearity, and anisotropy. We then develop a system for approximating these mechanical responses with yarn-level cloth simulation, using homogenized\r\nshell models to speed up computation and adding some small-but-necessary extensions to\r\nyarn-level models used in computer graphics.\r\n","lang":"eng"}],"day":"22","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"8385","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"11736"},{"id":"9818","relation":"part_of_dissertation","status":"public"}]},"title":"Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting","file_date_updated":"2023-02-02T09:39:25Z","ddc":["000","620"],"citation":{"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. Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12103.","ama":"Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. 2022. doi:10.15479/at:ista:12103","apa":"Sperl, G. (2022). Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12103","ista":"Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria.","short":"G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting, Institute of Science and Technology Austria, 2022.","chicago":"Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12103."},"type":"dissertation","_id":"12358","doi":"10.15479/at:ista:12103","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Sperl","first_name":"Georg","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87"}],"page":"138","acknowledged_ssus":[{"_id":"SSU"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"date_updated":"2026-06-18T19:57:47Z","publication_status":"published","date_published":"2022-09-22T00:00:00Z","month":"09","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"oa":1,"oa_version":"Published Version","file":[{"file_id":"12371","title":"Thesis","relation":"main_file","date_created":"2023-01-25T12:04:41Z","file_name":"thesis_gsperl.pdf","date_updated":"2023-02-02T09:29:57Z","description":"This is the main PDF file of the thesis. File size: 105 MB","access_level":"open_access","content_type":"application/pdf","checksum":"083722acbb8115e52e3b0fdec6226769","file_size":104497530,"creator":"cchlebak"},{"access_level":"open_access","file_size":23183710,"checksum":"511f82025e5fcb70bff4731d6896ca07","content_type":"application/pdf","creator":"cchlebak","date_updated":"2023-02-02T09:33:37Z","description":"This version of the thesis uses stronger image compression for a smaller file size of 23MB.","date_created":"2023-02-02T09:33:37Z","file_name":"thesis_gsperl_compressed.pdf","relation":"main_file","title":"Thesis (compressed 23MB)","file_id":"12483"},{"date_updated":"2023-02-02T09:39:25Z","creator":"cchlebak","content_type":"application/x-zip-compressed","file_size":98382247,"checksum":"ed4cb85225eedff761c25bddfc37a2ed","access_level":"open_access","file_id":"12484","relation":"source_file","file_name":"thesis-source.zip","date_created":"2023-02-02T09:39:25Z"}],"alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-020-6"]},"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","corr_author":"1","status":"public","year":"2022","degree_awarded":"PhD"},{"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_version":"Published Version","file":[{"file_id":"12369","file_name":"THESIS_FINAL_FArslan_pdfa.pdf","date_created":"2023-01-25T10:52:46Z","relation":"main_file","date_updated":"2023-01-25T10:52:46Z","creator":"cchlebak","access_level":"open_access","checksum":"e54a3e69b83ebf166544164afd25608e","file_size":14581024,"content_type":"application/pdf","success":1}],"alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-025-1 "]},"OA_place":"publisher","corr_author":"1","has_accepted_license":"1","status":"public","year":"2022","degree_awarded":"PhD","ec_funded":1,"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"NanoFab"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-06-18T19:47:50Z","publication_status":"published","date_published":"2022-09-29T00:00:00Z","month":"09","department":[{"_id":"GradSch"},{"_id":"CaHe"}],"article_processing_charge":"No","oa":1,"ddc":["570"],"citation":{"short":"F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows, Institute of Science and Technology Austria, 2022.","chicago":"Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12153.","ista":"Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical flows. Institute of Science and Technology Austria.","ama":"Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical flows. 2022. doi:10.15479/at:ista:12153","apa":"Arslan, F. N. (2022). Remodeling of E-cadherin-mediated contacts via cortical flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12153","mla":"Arslan, Feyza N. Remodeling of E-Cadherin-Mediated Contacts via Cortical Flows. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12153.","ieee":"F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical flows,” Institute of Science and Technology Austria, 2022."},"type":"dissertation","project":[{"_id":"260F1432-B435-11E9-9278-68D0E5697425","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","call_identifier":"H2020","grant_number":"742573"}],"_id":"12368","doi":"10.15479/at:ista:12153","author":[{"orcid":"0000-0001-5809-9566","last_name":"Arslan","full_name":"Arslan, Feyza N","first_name":"Feyza N","id":"49DA7910-F248-11E8-B48F-1D18A9856A87"}],"page":"113","supervisor":[{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2023-01-25T10:43:24Z","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","file_date_updated":"2023-01-25T10:52:46Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"9350","status":"public"}]},"language":[{"iso":"eng"}],"title":"Remodeling of E-cadherin-mediated contacts via cortical flows"},{"date_published":"2022-12-15T00:00:00Z","month":"12","date_updated":"2026-04-16T08:20:52Z","publication_status":"published","publisher":"Institute of Science and Technology Austria","ec_funded":1,"oa":1,"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"OA_place":"publisher","publication_identifier":{"issn":["2663-337X"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file":[{"file_id":"12391","file_name":"Brooks_Thesis.pdf","date_created":"2023-01-26T10:02:34Z","relation":"main_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},{"date_updated":"2023-01-26T10:02:42Z","content_type":"application/octet-stream","file_size":809842,"access_level":"closed","checksum":"9751869fa5e7981588ad4228f4fd4bd6","creator":"cchlebak","file_id":"12392","date_created":"2023-01-26T10:02:42Z","file_name":"Brooks_Thesis.tex","relation":"source_file"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","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)"},"degree_awarded":"PhD","status":"public","year":"2022","has_accepted_license":"1","corr_author":"1","supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521"}],"title":"Translation-invariant quantum systems with effectively broken symmetry","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","related_material":{"record":[{"id":"9005","relation":"part_of_dissertation","status":"public"}]},"language":[{"iso":"eng"}],"file_date_updated":"2023-01-26T10:02:42Z","day":"15","abstract":[{"lang":"eng","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"}],"date_created":"2023-01-26T10:00:42Z","type":"dissertation","citation":{"ieee":"M. Brooks, “Translation-invariant quantum systems with effectively broken symmetry,” Institute of Science and Technology Austria, 2022.","mla":"Brooks, Morris. Translation-Invariant Quantum Systems with Effectively Broken Symmetry. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12390.","apa":"Brooks, M. (2022). Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12390","ama":"Brooks M. Translation-invariant quantum systems with effectively broken symmetry. 2022. doi:10.15479/at:ista:12390","ista":"Brooks M. 2022. Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria.","chicago":"Brooks, Morris. “Translation-Invariant Quantum Systems with Effectively Broken Symmetry.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12390.","short":"M. Brooks, Translation-Invariant Quantum Systems with Effectively Broken Symmetry, Institute of Science and Technology Austria, 2022."},"ddc":["500"],"author":[{"id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","full_name":"Brooks, Morris","first_name":"Morris","last_name":"Brooks","orcid":"0000-0002-6249-0928"}],"page":"196","doi":"10.15479/at:ista:12390","_id":"12390","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}]},{"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":[{"success":1,"access_level":"open_access","content_type":"application/pdf","checksum":"a2fba257fdefe0e747182be6c0f7c70c","file_size":15551202,"creator":"dernst","date_updated":"2023-01-30T07:15:48Z","relation":"main_file","date_created":"2023-01-30T07:15:48Z","file_name":"2022_ACM_Ishida.pdf","file_id":"12433"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"has_accepted_license":"1","year":"2022","issue":"6","status":"public","publisher":"Association for Computing Machinery","date_published":"2022-12-01T00:00:00Z","article_type":"original","month":"12","date_updated":"2026-04-07T12:02:23Z","publication_status":"published","department":[{"_id":"ChWo"}],"article_number":"241","article_processing_charge":"No","oa":1,"intvolume":" 41","citation":{"chicago":"Ishida, Sadashige, Chris Wojtan, and Albert Chern. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3550454.3555459.","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.","apa":"Ishida, S., Wojtan, C., & Chern, A. (2022). Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3550454.3555459","ama":"Ishida S, Wojtan C, Chern A. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 2022;41(6). doi:10.1145/3550454.3555459","mla":"Ishida, Sadashige, et al. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” ACM Transactions on Graphics, vol. 41, no. 6, 241, Association for Computing Machinery, 2022, doi:10.1145/3550454.3555459.","ieee":"S. Ishida, C. Wojtan, and A. Chern, “Hidden degrees of freedom in implicit vortex filaments,” ACM Transactions on Graphics, vol. 41, no. 6. Association for Computing Machinery, 2022."},"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).","ddc":["000"],"external_id":{"isi":["000891651900061"]},"type":"journal_article","publication":"ACM Transactions on Graphics","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"doi":"10.1145/3550454.3555459","_id":"12431","author":[{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige","first_name":"Sadashige","last_name":"Ishida","orcid":"0000-0002-3121-3100"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","first_name":"Christopher J"},{"full_name":"Chern, Albert","first_name":"Albert","last_name":"Chern"}],"quality_controlled":"1","isi":1,"scopus_import":"1","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","file_date_updated":"2023-01-30T07:15:48Z","volume":41,"title":"Hidden degrees of freedom in implicit vortex filaments","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20551"}]},"language":[{"iso":"eng"}]},{"page":"919-930","author":[{"first_name":"Michael","full_name":"Anastos, Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","last_name":"Anastos"}],"quality_controlled":"1","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"}],"doi":"10.1109/FOCS54457.2022.00091","_id":"12432","type":"conference","publication":"63rd Annual IEEE Symposium on Foundations of Computer Science","citation":{"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.","chicago":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091.","short":"M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.","mla":"Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 63rd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091.","ieee":"M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930.","apa":"Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/FOCS54457.2022.00091","ama":"Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091"},"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","external_id":{"isi":["000909382900084"]},"volume":"2022-October","title":"Solving the Hamilton cycle problem fast on average","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"day":"01","date_created":"2023-01-29T23:00:59Z","isi":1,"scopus_import":"1","status":"public","year":"2022","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9781665455190"],"issn":["0272-5428"]},"oa_version":"None","department":[{"_id":"MaKw"}],"conference":{"start_date":"2022-10-31","name":"FOCS: Foundations of Computer Science","end_date":"2022-11-03","location":"Denver, CO, United States"},"article_processing_charge":"No","date_published":"2022-12-01T00:00:00Z","month":"12","publication_status":"published","date_updated":"2025-07-10T11:50:26Z","ec_funded":1,"publisher":"Institute of Electrical and Electronics Engineers"},{"_id":"12452","quality_controlled":"1","author":[{"last_name":"Rao","full_name":"Rao, Pramod","first_name":"Pramod"},{"last_name":"B R","first_name":"Mallikarjun","full_name":"B R, Mallikarjun"},{"first_name":"Gereon","full_name":"Fox, Gereon","last_name":"Fox"},{"full_name":"Weyrich, Tim","first_name":"Tim","last_name":"Weyrich"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"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","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Tewari, Ayush","first_name":"Ayush","last_name":"Tewari"},{"last_name":"Theobalt","first_name":"Christian","full_name":"Theobalt, Christian"},{"last_name":"Elgharib","full_name":"Elgharib, Mohamed","first_name":"Mohamed"}],"ddc":["000"],"acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784).","citation":{"ieee":"P. Rao et al., “VoRF: Volumetric Relightable Faces,” in 33rd British Machine Vision Conference, London, United Kingdom, 2022.","mla":"Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” 33rd British Machine Vision Conference, 708, British Machine Vision Association and Society for Pattern Recognition, 2022.","ama":"Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: 33rd British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition; 2022.","apa":"Rao, P., B R, M., Fox, G., Weyrich, T., Bickel, B., Seidel, H.-P., … Elgharib, M. (2022). VoRF: Volumetric Relightable Faces. In 33rd British Machine Vision Conference. London, United Kingdom: British Machine Vision Association and Society for Pattern Recognition.","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.","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.","chicago":"Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In 33rd British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition, 2022."},"publication":"33rd British Machine Vision Conference","type":"conference","date_created":"2023-01-30T10:47:06Z","day":"01","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://bmvc2022.mpi-inf.mpg.de/708/","open_access":"1"}],"title":"VoRF: Volumetric Relightable Faces","file_date_updated":"2023-01-30T10:48:37Z","scopus_import":"1","has_accepted_license":"1","status":"public","year":"2022","oa_version":"Published Version","file":[{"title":"VoRF: Volumetric Relightable Faces","file_id":"12453","date_created":"2023-01-30T10:48:18Z","file_name":"vorf_main.pdf","relation":"main_file","date_updated":"2023-01-30T10:48:18Z","checksum":"b60b70bb48700aee709c85a69231821d","content_type":"application/pdf","file_size":5202710,"access_level":"open_access","creator":"bbickel"},{"creator":"bbickel","file_size":37953188,"access_level":"open_access","checksum":"ce5f4ce66eaaa1590ee5df989fca6f61","content_type":"application/pdf","date_updated":"2023-01-30T10:48:29Z","relation":"supplementary_material","file_name":"vorf_supp.pdf","date_created":"2023-01-30T10:48:29Z","file_id":"12454","title":"VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –"},{"date_updated":"2023-01-30T10:48:37Z","checksum":"08aecca434b08fee75ee1efe87943718","access_level":"open_access","content_type":"video/mp4","file_size":57855492,"creator":"bbickel","file_id":"12455","date_created":"2023-01-30T10:48:37Z","file_name":"video.mp4","relation":"supplementary_material"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"BeBi"}],"conference":{"end_date":"2022-11-24","location":"London, United Kingdom","start_date":"2022-11-21","name":"BMVC: British Machine Vision Conference"},"article_number":"708","oa":1,"publisher":"British Machine Vision Association and Society for Pattern Recognition","date_updated":"2023-10-31T08:40:55Z","publication_status":"published","month":"12","date_published":"2022-12-01T00:00:00Z"},{"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":[{"date_updated":"2023-02-02T08:35:52Z","access_level":"open_access","content_type":"application/pdf","file_size":1729997,"checksum":"01411ffa76d3e380a0446baeb89b1ef7","creator":"dernst","success":1,"file_id":"12481","date_created":"2023-02-02T08:35:52Z","file_name":"2022_JourStatisticalMechanics_Mondelli.pdf","relation":"main_file"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["1742-5468"]},"corr_author":"1","has_accepted_license":"1","year":"2022","issue":"11","status":"public","publisher":"IOP Publishing","month":"11","article_type":"original","date_published":"2022-11-24T00:00:00Z","publication_status":"published","date_updated":"2025-04-15T07:50:16Z","article_number":"114003","department":[{"_id":"MaMo"}],"article_processing_charge":"Yes (via OA deal)","oa":1,"intvolume":" 2022","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.","citation":{"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.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2022. https://doi.org/10.1088/1742-5468/ac9828.","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.","ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. 2022;2022(11). doi:10.1088/1742-5468/ac9828","apa":"Mondelli, M., & Venkataramanan, R. (2022). Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ac9828","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2022, no. 11. IOP Publishing, 2022.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2022, no. 11, 114003, IOP Publishing, 2022, doi:10.1088/1742-5468/ac9828."},"external_id":{"isi":["000889589900001"]},"ddc":["510","530"],"type":"journal_article","publication":"Journal of Statistical Mechanics: Theory and Experiment","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"doi":"10.1088/1742-5468/ac9828","_id":"12480","author":[{"first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"last_name":"Venkataramanan","first_name":"Ramji","full_name":"Venkataramanan, Ramji"}],"quality_controlled":"1","isi":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach."}],"day":"24","date_created":"2023-02-02T08:31:57Z","file_date_updated":"2023-02-02T08:35:52Z","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability","Statistical and Nonlinear Physics"],"volume":2022,"title":"Approximate message passing with spectral initialization for generalized linear models","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10598"}]}},{"author":[{"last_name":"Iofinova","orcid":"0000-0002-7778-3221","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","first_name":"Eugenia B","full_name":"Iofinova, Eugenia B"},{"orcid":"0009-0009-5204-7621","last_name":"Konstantinov","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"quality_controlled":"1","project":[{"_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35"}],"_id":"12495","publication":"Transactions on Machine Learning Research","type":"journal_article","arxiv":1,"citation":{"apa":"Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. ML Research Press.","ama":"Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. 2022.","ieee":"E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust fair multisource learning from unreliable training data,” Transactions on Machine Learning Research. ML Research Press, 2022.","mla":"Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research, ML Research Press, 2022.","chicago":"Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research. ML Research Press, 2022.","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."},"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. ","ddc":["000"],"external_id":{"arxiv":["2106.11732"]},"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":[{"relation":"software","url":"https://github.com/ISTAustria-CVML/FLEA","description":"source code"}]},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=XsPopigZXV"}],"day":"22","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"}],"date_created":"2023-02-02T20:29:57Z","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":[{"date_updated":"2023-02-23T10:30:04Z","success":1,"creator":"dernst","content_type":"application/pdf","file_size":1948063,"checksum":"97c8a8470759cab597abb973ca137a3b","access_level":"open_access","file_id":"12673","relation":"main_file","file_name":"2022_TMLR_Iofinova.pdf","date_created":"2023-02-23T10:30:04Z"}],"oa_version":"Published Version","oa":1,"department":[{"_id":"ChLa"}],"article_processing_charge":"No","article_type":"original","month":"12","date_published":"2022-12-22T00:00:00Z","publication_status":"published","date_updated":"2025-12-30T11:04:31Z","acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"ML Research Press"},{"quality_controlled":"1","author":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Lehtinen","full_name":"Lehtinen, Karoliina","first_name":"Karoliina"},{"last_name":"Totzke","full_name":"Totzke, Patrick","first_name":"Patrick"}],"page":"14:1-14:21","doi":"10.4230/LIPIcs.CONCUR.2022.14","_id":"12508","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"publication":"33rd International Conference on Concurrency Theory","type":"conference","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":{"mla":"Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” 33rd International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14.","ieee":"T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in 33rd International Conference on Concurrency Theory, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.","apa":"Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14","ama":"Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14","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.","chicago":"Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In 33rd International Conference on Concurrency Theory, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14.","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."},"ddc":["000"],"intvolume":" 243","title":"History-deterministic timed automata","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"18530"}]},"file_date_updated":"2023-02-06T09:21:09Z","volume":243,"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"}],"day":"06","date_created":"2023-02-05T17:24:23Z","scopus_import":"1","status":"public","year":"2022","has_accepted_license":"1","corr_author":"1","publication_identifier":{"isbn":["9783959772464"],"issn":["1868-8969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2023-02-06T09:21:09Z","file_name":"2022_LIPICs_Henzinger2.pdf","relation":"main_file","file_id":"12520","checksum":"9e97e15628f66b2ad77f535bb0327dee","content_type":"application/pdf","access_level":"open_access","file_size":717940,"creator":"dernst","success":1,"date_updated":"2023-02-06T09:21:09Z"}],"alternative_title":["LIPIcs"],"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":1,"article_processing_charge":"No","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2022-09-13","location":"Warsaw, Poland","end_date":"2022-09-16"},"department":[{"_id":"ToHe"}],"month":"09","date_published":"2022-09-06T00:00:00Z","publication_status":"published","date_updated":"2025-09-08T14:35:16Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1},{"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":[{"success":1,"creator":"dernst","checksum":"1888ec9421622f9526fbec2de035f132","access_level":"open_access","content_type":"application/pdf","file_size":624586,"date_updated":"2023-02-06T09:13:04Z","relation":"main_file","file_name":"2022_LIPICs_Avni.pdf","date_created":"2023-02-06T09:13:04Z","file_id":"12519"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9783959772563"],"issn":["1868-8969"]},"corr_author":"1","has_accepted_license":"1","status":"public","year":"2022","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2022-08-22T00:00:00Z","month":"08","date_updated":"2025-07-10T11:50:27Z","publication_status":"published","conference":{"start_date":"2022-08-22","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2022-08-26","location":"Vienna, Austria"},"department":[{"_id":"ToHe"}],"article_processing_charge":"No","oa":1,"intvolume":" 241","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":{"ama":"Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3","apa":"Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3","ieee":"G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.","mla":"Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” 47th International Symposium on Mathematical Foundations of Computer Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.","short":"G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6.","chicago":"Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3.","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."},"ddc":["000"],"publication":"47th International Symposium on Mathematical Foundations of Computer Science","type":"conference","place":"Dagstuhl, Germany","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"doi":"10.4230/LIPIcs.MFCS.2022.3","_id":"12509","page":"3:1-3:6","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"quality_controlled":"1","scopus_import":"1","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"day":"22","date_created":"2023-02-05T17:26:01Z","file_date_updated":"2023-02-06T09:13:04Z","volume":241,"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","title":"An updated survey of bidding games on graphs","language":[{"iso":"eng"}]},{"issue":"6","status":"public","year":"2022","oa_version":"Preprint","publication_identifier":{"isbn":["978577358350"],"issn":["2159-5399"],"eissn":["2374-3468"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"ToHe"}],"oa":1,"publisher":"Association for the Advancement of Artificial Intelligence","ec_funded":1,"publication_status":"published","date_updated":"2025-04-15T06:26:14Z","article_type":"original","month":"06","date_published":"2022-06-28T00:00:00Z","_id":"12510","doi":"10.1609/aaai.v36i6.20631","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","author":[{"first_name":"Sophie A.","full_name":"Gruenbacher, Sophie A.","last_name":"Gruenbacher"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Smolka","first_name":"Scott A.","full_name":"Smolka, Scott A."},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"page":"6755-6764","external_id":{"arxiv":["2107.08467"]},"citation":{"ieee":"S. A. Gruenbacher et al., “GoTube: Scalable statistical verification of continuous-depth models,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.","mla":"Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631.","apa":"Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., & Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i6.20631","ama":"Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(6):6755-6764. doi:10.1609/aaai.v36i6.20631","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.","chicago":"Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i6.20631.","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."},"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).","intvolume":" 36","arxiv":1,"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","type":"journal_article","date_created":"2023-02-05T17:27:42Z","day":"28","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2107.08467","open_access":"1"}],"title":"GoTube: Scalable statistical verification of continuous-depth models","volume":36,"keyword":["General Medicine"],"scopus_import":"1"}]