[{"date_updated":"2023-09-20T10:46:29Z","author":[{"full_name":"Brighi, Pietro","last_name":"Brighi","orcid":"0000-0002-7969-2729","first_name":"Pietro","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ljubotina","orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","full_name":"Ljubotina, Marko"},{"last_name":"Serbyn","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","full_name":"Serbyn, Maksym"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models","date_published":"2022-11-07T00:00:00Z","month":"11","article_number":"2210.15607","language":[{"iso":"eng"}],"year":"2022","article_processing_charge":"No","external_id":{"arxiv":["2210.15607"]},"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","_id":"12750","tmp":{"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)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"date_created":"2023-03-23T14:33:13Z","day":"07","status":"public","citation":{"chicago":"Brighi, Pietro, Marko Ljubotina, and Maksym Serbyn. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2210.15607\">https://doi.org/10.48550/arXiv.2210.15607</a>.","ama":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2210.15607\">10.48550/arXiv.2210.15607</a>","ieee":"P. Brighi, M. Ljubotina, and M. Serbyn, “Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models,” <i>arXiv</i>. .","ista":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. arXiv, 2210.15607.","short":"P. Brighi, M. Ljubotina, M. Serbyn, ArXiv (n.d.).","mla":"Brighi, Pietro, et al. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” <i>ArXiv</i>, 2210.15607, doi:<a href=\"https://doi.org/10.48550/arXiv.2210.15607\">10.48550/arXiv.2210.15607</a>.","apa":"Brighi, P., Ljubotina, M., &#38; Serbyn, M. (n.d.). Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2210.15607\">https://doi.org/10.48550/arXiv.2210.15607</a>"},"arxiv":1,"abstract":[{"lang":"eng","text":"Quantum kinetically constrained models have recently attracted significant attention due to their anomalous dynamics and thermalization. In this work, we introduce a hitherto unexplored family of kinetically constrained models featuring a conserved particle number and strong inversion-symmetry breaking due to facilitated hopping. We demonstrate that these models provide a generic example of so-called quantum Hilbert space fragmentation, that is manifested in disconnected sectors in the Hilbert space that are not apparent in the computational basis. Quantum Hilbert space fragmentation leads to an exponential in system size number of eigenstates with exactly zero entanglement entropy across several bipartite cuts. These eigenstates can be probed dynamically using quenches from simple initial product states. In addition, we study the particle spreading under unitary dynamics launched from the domain wall state, and find faster than diffusive dynamics at high particle densities, that crosses over into logarithmically slow relaxation at smaller densities. Using a classically simulable cellular automaton, we reproduce the logarithmic dynamics observed in the quantum case. Our work suggests that particle conserving constrained models with inversion symmetry breaking realize so far unexplored universality classes of dynamics and invite their further theoretical and experimental studies."}],"type":"preprint","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"12732"},{"id":"14334","status":"public","relation":"later_version"}]},"oa_version":"Preprint","publication":"arXiv","publication_status":"submitted","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.15607"}],"doi":"10.48550/arXiv.2210.15607"},{"department":[{"_id":"KrCh"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","file":[{"date_updated":"2023-09-26T10:43:15Z","date_created":"2023-09-26T10:43:15Z","success":1,"file_name":"2022_LIPIcS_Grover.pdf","access_level":"open_access","relation":"main_file","checksum":"e282e43d3ae0ba6e067b72f4583e13c0","content_type":"application/pdf","file_id":"14372","file_size":960036,"creator":"dernst"}],"title":"Anytime guarantees for reachability in uncountable Markov decision processes","author":[{"full_name":"Grover, Kush","first_name":"Kush","last_name":"Grover"},{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"full_name":"Weininger, Maimilian","last_name":"Weininger","first_name":"Maimilian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"conference","file_date_updated":"2023-09-26T10:43:15Z","arxiv":1,"abstract":[{"text":"We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a sequence of approximations converging to the true value in the limit, our aim is to obtain an algorithm with guarantees on the precision of the approximation.\r\nAs this problem is undecidable in general, assumptions on the MDP are necessary. Our main contribution is to identify sufficient assumptions that are as weak as possible, thus approaching the \"boundary\" of which systems can be correctly and reliably analyzed. To this end, we also argue why each of our assumptions is necessary for algorithms based on processing finitely many observations.\r\nWe present two solution variants. The first one provides converging lower bounds under weaker assumptions than typical ones from previous works concerned with guarantees. The second one then utilizes stronger assumptions to additionally provide converging upper bounds. Altogether, we obtain an anytime algorithm, i.e. yielding a sequence of approximants with known and iteratively improving precision, converging to the true value in the limit. Besides, due to the generality of our assumptions, our algorithms are very general templates, readily allowing for various heuristics from literature in contrast to, e.g., a specific discretization algorithm. Our theoretical contribution thus paves the way for future practical improvements without sacrificing correctness guarantees.","lang":"eng"}],"scopus_import":"1","publication_identifier":{"issn":["1868-8969"]},"citation":{"apa":"Grover, K., Kretinsky, J., Meggendorfer, T., &#38; Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In <i>33rd International Conference on Concurrency Theory </i> (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.11</a>","mla":"Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” <i>33rd International Conference on Concurrency Theory </i>, vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">10.4230/LIPIcs.CONCUR.2022.11</a>.","ieee":"K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in <i>33rd International Conference on Concurrency Theory </i>, Warsaw, Poland, 2022, vol. 243.","short":"K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ista":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. 2022. Anytime guarantees for reachability in uncountable Markov decision processes. 33rd International Conference on Concurrency Theory . CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 11.","ama":"Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: <i>33rd International Conference on Concurrency Theory </i>. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">10.4230/LIPIcs.CONCUR.2022.11</a>","chicago":"Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.” In <i>33rd International Conference on Concurrency Theory </i>, Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.11</a>."},"quality_controlled":"1","_id":"12775","license":"https://creativecommons.org/licenses/by/4.0/","conference":{"location":"Warsaw, Poland","name":"CONCUR: Conference on Concurrency Theory","end_date":"2022-09-16","start_date":"2022-09-13"},"external_id":{"arxiv":["2008.04824"]},"year":"2022","article_number":"11","acknowledgement":"Kush Grover: The author has been supported by the DFG research training group GRK\r\n2428 ConVeY.\r\nMaximilian Weininger: The author has been partially supported by DFG projects 383882557\r\nStatistical Unbounded Verification (SUV) and 427755713 Group-By Objectives in Probabilistic\r\nVerification (GOPro)","intvolume":"       243","month":"09","date_published":"2022-09-15T00:00:00Z","alternative_title":["LIPIcs"],"oa":1,"date_updated":"2023-09-26T10:43:30Z","doi":"10.4230/LIPIcs.CONCUR.2022.11","publication":"33rd International Conference on Concurrency Theory ","oa_version":"Published Version","volume":243,"day":"15","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_created":"2023-03-28T08:09:32Z"},{"type":"journal_article","file_date_updated":"2023-03-30T07:09:35Z","abstract":[{"text":"An improved asymptotic formula is established for the number of rational points of bounded height on the split smooth del Pezzo surface of degree 5. The proof uses the five conic bundle structures on the surface.","lang":"eng"}],"publication_identifier":{"issn":["1076-9803"]},"citation":{"mla":"Browning, Timothy D. “Revisiting the Manin–Peyre Conjecture for the Split Del Pezzo Surface of Degree 5.” <i>New York Journal of Mathematics</i>, vol. 28, State University of New York, 2022, pp. 1193–229.","apa":"Browning, T. D. (2022). Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree 5. <i>New York Journal of Mathematics</i>. State University of New York.","chicago":"Browning, Timothy D. “Revisiting the Manin–Peyre Conjecture for the Split Del Pezzo Surface of Degree 5.” <i>New York Journal of Mathematics</i>. State University of New York, 2022.","ama":"Browning TD. Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree 5. <i>New York Journal of Mathematics</i>. 2022;28:1193-1229.","ista":"Browning TD. 2022. Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree 5. New York Journal of Mathematics. 28, 1193–1229.","short":"T.D. Browning, New York Journal of Mathematics 28 (2022) 1193–1229.","ieee":"T. D. Browning, “Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree 5,” <i>New York Journal of Mathematics</i>, vol. 28. State University of New York, pp. 1193–1229, 2022."},"quality_controlled":"1","_id":"12776","publication_status":"published","project":[{"call_identifier":"FWF","grant_number":"P32428","name":"New frontiers of the Manin conjecture","_id":"26AEDAB2-B435-11E9-9278-68D0E5697425"}],"publisher":"State University of New York","has_accepted_license":"1","file":[{"date_updated":"2023-03-30T07:09:35Z","date_created":"2023-03-30T07:09:35Z","file_name":"2022_NYJM_Browning.pdf","success":1,"checksum":"c01e8291794a1bdb7416aa103cb68ef8","relation":"main_file","access_level":"open_access","creator":"dernst","file_size":897267,"content_type":"application/pdf","file_id":"12778"}],"title":"Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree 5","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"TiBr"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"volume":28,"status":"public","day":"24","date_created":"2023-03-28T09:21:09Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"publication":"New York Journal of Mathematics","oa_version":"Published Version","acknowledgement":"This work was begun while the author was participating in the programme on \"Diophantine equations\" at the Hausdorff Research Institute for Mathematics in Bonn in 2009. The hospitality and financial support of the institute is gratefully acknowledged. The idea of using conic bundles to study the split del Pezzo surface of degree 5 was explained to the author by Professor Salberger. The author is very grateful to him for his input into this project and also to Shuntaro Yamagishi for many useful comments on an earlier version of this manuscript. While working on this paper the author was supported by FWF grant P32428-N35.","intvolume":"        28","month":"08","date_published":"2022-08-24T00:00:00Z","oa":1,"date_updated":"2023-10-18T07:59:13Z","page":"1193 - 1229","year":"2022"},{"publication_status":"published","_id":"12780","quality_controlled":"1","citation":{"chicago":"Markov, Ilia, Hamidreza Ramezanikebrya, and Dan-Adrian Alistarh. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” In <i>Proceedings of the 23rd ACM/IFIP International Middleware Conference</i>, 241–54. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3528535.3565248\">https://doi.org/10.1145/3528535.3565248</a>.","ieee":"I. Markov, H. Ramezanikebrya, and D.-A. Alistarh, “CGX: Adaptive system support for communication-efficient deep learning,” in <i>Proceedings of the 23rd ACM/IFIP International Middleware Conference</i>, Quebec, QC, Canada, 2022, pp. 241–254.","ista":"Markov I, Ramezanikebrya H, Alistarh D-A. 2022. CGX: Adaptive system support for communication-efficient deep learning. Proceedings of the 23rd ACM/IFIP International Middleware Conference. Middleware: International Middleware Conference, 241–254.","short":"I. Markov, H. Ramezanikebrya, D.-A. Alistarh, in:, Proceedings of the 23rd ACM/IFIP International Middleware Conference, Association for Computing Machinery, 2022, pp. 241–254.","ama":"Markov I, Ramezanikebrya H, Alistarh D-A. CGX: Adaptive system support for communication-efficient deep learning. In: <i>Proceedings of the 23rd ACM/IFIP International Middleware Conference</i>. Association for Computing Machinery; 2022:241-254. doi:<a href=\"https://doi.org/10.1145/3528535.3565248\">10.1145/3528535.3565248</a>","mla":"Markov, Ilia, et al. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” <i>Proceedings of the 23rd ACM/IFIP International Middleware Conference</i>, Association for Computing Machinery, 2022, pp. 241–54, doi:<a href=\"https://doi.org/10.1145/3528535.3565248\">10.1145/3528535.3565248</a>.","apa":"Markov, I., Ramezanikebrya, H., &#38; Alistarh, D.-A. (2022). CGX: Adaptive system support for communication-efficient deep learning. In <i>Proceedings of the 23rd ACM/IFIP International Middleware Conference</i> (pp. 241–254). Quebec, QC, Canada: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3528535.3565248\">https://doi.org/10.1145/3528535.3565248</a>"},"publication_identifier":{"isbn":["9781450393409"]},"arxiv":1,"abstract":[{"text":"The ability to scale out training workloads has been one of the key performance enablers of deep learning. The main scaling approach is data-parallel GPU-based training, which has been boosted by hardware and software support for highly efficient point-to-point communication, and in particular via hardware bandwidth over-provisioning. Overprovisioning comes at a cost: there is an order of magnitude price difference between \"cloud-grade\" servers with such support, relative to their popular \"consumer-grade\" counterparts, although single server-grade and consumer-grade GPUs can have similar computational envelopes.\r\n\r\nIn this paper, we show that the costly hardware overprovisioning approach can be supplanted via algorithmic and system design, and propose a framework called CGX, which provides efficient software support for compressed communication in ML applications, for both multi-GPU single-node training, as well as larger-scale multi-node training. CGX is based on two technical advances: At the system level, it relies on a re-developed communication stack for ML frameworks, which provides flexible, highly-efficient support for compressed communication. At the application level, it provides seamless, parameter-free integration with popular frameworks, so that end-users do not have to modify training recipes, nor significant training code. This is complemented by a layer-wise adaptive compression technique which dynamically balances compression gains with accuracy preservation. CGX integrates with popular ML frameworks, providing up to 3X speedups for multi-GPU nodes based on commodity hardware, and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy.","lang":"eng"}],"file_date_updated":"2023-04-03T06:17:58Z","type":"conference","language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"CGX: Adaptive system support for communication-efficient deep learning","author":[{"full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia","last_name":"Markov"},{"first_name":"Hamidreza","last_name":"Ramezanikebrya","full_name":"Ramezanikebrya, Hamidreza"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"file":[{"relation":"main_file","checksum":"1a397746235f245da5468819247ff663","access_level":"open_access","content_type":"application/pdf","file_id":"12795","creator":"dernst","file_size":1514169,"date_created":"2023-04-03T06:17:58Z","date_updated":"2023-04-03T06:17:58Z","success":1,"file_name":"2022_ACMMiddleware_Markov.pdf"}],"has_accepted_license":"1","publisher":"Association for Computing Machinery","oa_version":"Published Version","publication":"Proceedings of the 23rd ACM/IFIP International Middleware Conference","doi":"10.1145/3528535.3565248","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2023-03-31T06:17:00Z","ddc":["000"],"day":"01","status":"public","year":"2022","external_id":{"arxiv":["2111.08617"]},"page":"241-254","conference":{"location":"Quebec, QC, Canada","end_date":"2022-11-11","start_date":"2022-11-07","name":"Middleware: International Middleware Conference"},"date_updated":"2023-04-03T06:21:04Z","oa":1,"date_published":"2022-11-01T00:00:00Z","month":"11","acknowledgement":"The authors sincerely thank Nikoli Dryden, Tal Ben-Nun, Torsten Hoefler and Bapi Chatterjee for useful discussions throughout the development of this project."},{"isi":1,"ec_funded":1,"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2109.10245"}],"doi":"10.2140/pjm.2022.321.193","publication":"Pacific Journal of Mathematics","date_created":"2023-04-02T22:01:11Z","status":"public","day":"29","volume":321,"year":"2022","page":"193-237","external_id":{"arxiv":["2109.10245"],"isi":["000954466300006"]},"date_updated":"2023-08-04T10:42:38Z","keyword":["Arthur–Selberg trace formula","cuspidal automorphic representations","global function fields"],"issue":"1","oa":1,"month":"08","intvolume":"       321","date_published":"2022-08-29T00:00:00Z","acknowledgement":"I’d like to thank Prof. Chaudouard for introducing me to this area. I’d like to thank Prof. Harris for asking me the question that makes Section 10 possible. I’m grateful for the support of Prof. Hausel and IST Austria. The author was funded by an ISTplus fellowship: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"publication_status":"published","_id":"12793","quality_controlled":"1","citation":{"chicago":"Yu, Hongjie. “ A Coarse Geometric Expansion of a Variant of Arthur’s Truncated Traces and Some Applications.” <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers, 2022. <a href=\"https://doi.org/10.2140/pjm.2022.321.193\">https://doi.org/10.2140/pjm.2022.321.193</a>.","ama":"Yu H.  A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications. <i>Pacific Journal of Mathematics</i>. 2022;321(1):193-237. doi:<a href=\"https://doi.org/10.2140/pjm.2022.321.193\">10.2140/pjm.2022.321.193</a>","ieee":"H. Yu, “ A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications,” <i>Pacific Journal of Mathematics</i>, vol. 321, no. 1. Mathematical Sciences Publishers, pp. 193–237, 2022.","ista":"Yu H. 2022.  A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications. Pacific Journal of Mathematics. 321(1), 193–237.","short":"H. Yu, Pacific Journal of Mathematics 321 (2022) 193–237.","mla":"Yu, Hongjie. “ A Coarse Geometric Expansion of a Variant of Arthur’s Truncated Traces and Some Applications.” <i>Pacific Journal of Mathematics</i>, vol. 321, no. 1, Mathematical Sciences Publishers, 2022, pp. 193–237, doi:<a href=\"https://doi.org/10.2140/pjm.2022.321.193\">10.2140/pjm.2022.321.193</a>.","apa":"Yu, H. (2022).  A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications. <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pjm.2022.321.193\">https://doi.org/10.2140/pjm.2022.321.193</a>"},"publication_identifier":{"eissn":["1945-5844"],"issn":["0030-8730"]},"type":"journal_article","arxiv":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"Let F be a global function field with constant field Fq. Let G be a reductive group over Fq. We establish a variant of Arthur's truncated kernel for G and for its Lie algebra which generalizes Arthur's original construction. We establish a coarse geometric expansion for our variant truncation.\r\nAs applications, we consider some existence and uniqueness problems of some cuspidal automorphic representations for the functions field of the projective line P1Fq with two points of ramifications."}],"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"TaHa"}],"title":" A coarse geometric expansion of a variant of Arthur's truncated traces and some applications","author":[{"full_name":"Yu, Hongjie","id":"3D7DD9BE-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjie","orcid":"0000-0001-5128-7126","last_name":"Yu"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Mathematical Sciences Publishers"},{"month":"03","date_published":"2022-03-30T00:00:00Z","article_number":"2203.16701","date_updated":"2023-04-25T07:34:49Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Towards differential relational privacy and its use in question answering","author":[{"full_name":"Bombari, Simone","last_name":"Bombari","id":"ca726dda-de17-11ea-bc14-f9da834f63aa","first_name":"Simone"},{"first_name":"Alessandro","last_name":"Achille","full_name":"Achille, Alessandro"},{"first_name":"Zijian","last_name":"Wang","full_name":"Wang, Zijian"},{"full_name":"Wang, Yu-Xiang","first_name":"Yu-Xiang","last_name":"Wang"},{"first_name":"Yusheng","last_name":"Xie","full_name":"Xie, Yusheng"},{"full_name":"Singh, Kunwar Yashraj","first_name":"Kunwar Yashraj","last_name":"Singh"},{"first_name":"Srikar","last_name":"Appalaraju","full_name":"Appalaraju, Srikar"},{"full_name":"Mahadevan, Vijay","first_name":"Vijay","last_name":"Mahadevan"},{"full_name":"Soatto, Stefano","first_name":"Stefano","last_name":"Soatto"}],"external_id":{"arxiv":["2203.16701"]},"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"language":[{"iso":"eng"}],"year":"2022","citation":{"mla":"Bombari, Simone, et al. “Towards Differential Relational Privacy and Its Use in Question Answering.” <i>ArXiv</i>, 2203.16701, doi:<a href=\"https://doi.org/10.48550/arXiv.2203.16701\">10.48550/arXiv.2203.16701</a>.","apa":"Bombari, S., Achille, A., Wang, Z., Wang, Y.-X., Xie, Y., Singh, K. Y., … Soatto, S. (n.d.). Towards differential relational privacy and its use in question answering. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2203.16701\">https://doi.org/10.48550/arXiv.2203.16701</a>","chicago":"Bombari, Simone, Alessandro Achille, Zijian Wang, Yu-Xiang Wang, Yusheng Xie, Kunwar Yashraj Singh, Srikar Appalaraju, Vijay Mahadevan, and Stefano Soatto. “Towards Differential Relational Privacy and Its Use in Question Answering.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2203.16701\">https://doi.org/10.48550/arXiv.2203.16701</a>.","short":"S. Bombari, A. Achille, Z. Wang, Y.-X. Wang, Y. Xie, K.Y. Singh, S. Appalaraju, V. Mahadevan, S. Soatto, ArXiv (n.d.).","ieee":"S. Bombari <i>et al.</i>, “Towards differential relational privacy and its use in question answering,” <i>arXiv</i>. .","ista":"Bombari S, Achille A, Wang Z, Wang Y-X, Xie Y, Singh KY, Appalaraju S, Mahadevan V, Soatto S. Towards differential relational privacy and its use in question answering. arXiv, 2203.16701.","ama":"Bombari S, Achille A, Wang Z, et al. Towards differential relational privacy and its use in question answering. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2203.16701\">10.48550/arXiv.2203.16701</a>"},"type":"preprint","abstract":[{"text":"Memorization of the relation between entities in a dataset can lead to privacy issues when using a trained model for question answering. We introduce Relational Memorization (RM) to understand, quantify and control this phenomenon. While bounding general memorization can have detrimental effects on the performance of a trained model, bounding RM does not prevent effective learning. The difference is most pronounced when the data distribution is long-tailed, with many queries having only few training examples: Impeding general memorization prevents effective learning, while impeding only relational memorization still allows learning general properties of the underlying concepts. We formalize the notion of Relational Privacy (RP) and, inspired by Differential Privacy (DP), we provide a possible definition of Differential Relational Privacy (DrP). These notions can be used to describe and compute bounds on the amount of RM in a trained model. We illustrate Relational Privacy concepts in experiments with large-scale models for Question Answering.","lang":"eng"}],"arxiv":1,"_id":"12860","date_created":"2023-04-23T16:11:48Z","day":"30","status":"public","doi":"10.48550/arXiv.2203.16701","publication_status":"submitted","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2203.16701","open_access":"1"}],"publication":"arXiv","oa_version":"Preprint"},{"citation":{"mla":"Schlögl, Alois, et al. “Where Is the Sweet Spot? A Procurement Story of General Purpose Compute Nodes.” <i>ASHPC22 - Austrian-Slovenian HPC Meeting 2022</i>, EuroCC Austria c/o Universität Wien, 2022, p. 7, doi:<a href=\"https://doi.org/10.25365/phaidra.337\">10.25365/phaidra.337</a>.","apa":"Schlögl, A., Hornoiu, A., Elefante, S., &#38; Stadlbauer, S. (2022). Where is the sweet spot? A procurement story of general purpose compute nodes. In <i>ASHPC22 - Austrian-Slovenian HPC Meeting 2022</i> (p. 7). Grundlsee, Austria: EuroCC Austria c/o Universität Wien. <a href=\"https://doi.org/10.25365/phaidra.337\">https://doi.org/10.25365/phaidra.337</a>","chicago":"Schlögl, Alois, Andrei Hornoiu, Stefano Elefante, and Stephan Stadlbauer. “Where Is the Sweet Spot? A Procurement Story of General Purpose Compute Nodes.” In <i>ASHPC22 - Austrian-Slovenian HPC Meeting 2022</i>, 7. EuroCC Austria c/o Universität Wien, 2022. <a href=\"https://doi.org/10.25365/phaidra.337\">https://doi.org/10.25365/phaidra.337</a>.","ama":"Schlögl A, Hornoiu A, Elefante S, Stadlbauer S. Where is the sweet spot? A procurement story of general purpose compute nodes. In: <i>ASHPC22 - Austrian-Slovenian HPC Meeting 2022</i>. EuroCC Austria c/o Universität Wien; 2022:7. doi:<a href=\"https://doi.org/10.25365/phaidra.337\">10.25365/phaidra.337</a>","short":"A. Schlögl, A. Hornoiu, S. Elefante, S. Stadlbauer, in:, ASHPC22 - Austrian-Slovenian HPC Meeting 2022, EuroCC Austria c/o Universität Wien, 2022, p. 7.","ieee":"A. Schlögl, A. Hornoiu, S. Elefante, and S. Stadlbauer, “Where is the sweet spot? A procurement story of general purpose compute nodes,” in <i>ASHPC22 - Austrian-Slovenian HPC Meeting 2022</i>, Grundlsee, Austria, 2022, p. 7.","ista":"Schlögl A, Hornoiu A, Elefante S, Stadlbauer S. 2022. Where is the sweet spot? A procurement story of general purpose compute nodes. ASHPC22 - Austrian-Slovenian HPC Meeting 2022. ASHPC: Austrian-Slovenian HPC Meeting, 7."},"publication_identifier":{"isbn":["978-3-200-08499-5"]},"file_date_updated":"2023-05-05T09:06:00Z","type":"conference_abstract","_id":"12894","publication_status":"published","has_accepted_license":"1","publisher":"EuroCC Austria c/o Universität Wien","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Where is the sweet spot? A procurement story of general purpose compute nodes","author":[{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl","full_name":"Schlögl, Alois"},{"id":"77129392-B450-11EA-8745-D4653DDC885E","first_name":"Andrei","last_name":"Hornoiu","full_name":"Hornoiu, Andrei"},{"full_name":"Elefante, Stefano","last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano"},{"full_name":"Stadlbauer, Stephan","last_name":"Stadlbauer","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan"}],"file":[{"file_name":"BOOKLET_ASHPC22.pdf","success":1,"date_created":"2023-05-05T09:06:00Z","date_updated":"2023-05-05T09:06:00Z","creator":"schloegl","file_size":7180531,"file_id":"12895","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"e3f8c240b85422ce2190e7b203cc2563"}],"article_processing_charge":"No","department":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2023-05-05T09:13:42Z","ddc":["000"],"status":"public","day":"02","publication":"ASHPC22 - Austrian-Slovenian HPC Meeting 2022","doi":"10.25365/phaidra.337","oa_version":"Published Version","date_published":"2022-06-02T00:00:00Z","month":"06","acknowledgement":"The abstracts in this booklet are licenced under a CC BY 4.0 licence (https://creativecommons.org/licenses/by/4.0/legalcode), except Markus Wallerberger’s contribution at page 21, licenced under a CC BY-SA 4.0 licence (https://creativecommons.org/licenses/by-sa/4.0/legalcode).\r\n","date_updated":"2023-05-16T07:42:56Z","oa":1,"page":"7","conference":{"name":"ASHPC: Austrian-Slovenian HPC Meeting","start_date":"2022-05-31","end_date":"2022-06-02","location":"Grundlsee, Austria"},"year":"2022"},{"_id":"9794","quality_controlled":"1","publication_identifier":{"issn":["1529-2908"],"eissn":["1529-2916"]},"citation":{"chicago":"Assen, Frank P, Jun Abe, Miroslav Hons, Robert Hauschild, Shayan Shamipour, Walter Kaufmann, Tommaso Costanzo, et al. “Multitier Mechanics Control Stromal Adaptations in Swelling Lymph Nodes.” <i>Nature Immunology</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41590-022-01257-4\">https://doi.org/10.1038/s41590-022-01257-4</a>.","short":"F.P. Assen, J. Abe, M. Hons, R. Hauschild, S. Shamipour, W. Kaufmann, T. Costanzo, G. Krens, M. Brown, B. Ludewig, S. Hippenmeyer, C.-P.J. Heisenberg, W. Weninger, E.B. Hannezo, S.A. Luther, J.V. Stein, M.K. Sixt, Nature Immunology 23 (2022) 1246–1255.","ieee":"F. P. Assen <i>et al.</i>, “Multitier mechanics control stromal adaptations in swelling lymph nodes,” <i>Nature Immunology</i>, vol. 23. Springer Nature, pp. 1246–1255, 2022.","ista":"Assen FP, Abe J, Hons M, Hauschild R, Shamipour S, Kaufmann W, Costanzo T, Krens G, Brown M, Ludewig B, Hippenmeyer S, Heisenberg C-PJ, Weninger W, Hannezo EB, Luther SA, Stein JV, Sixt MK. 2022. Multitier mechanics control stromal adaptations in swelling lymph nodes. Nature Immunology. 23, 1246–1255.","ama":"Assen FP, Abe J, Hons M, et al. Multitier mechanics control stromal adaptations in swelling lymph nodes. <i>Nature Immunology</i>. 2022;23:1246-1255. doi:<a href=\"https://doi.org/10.1038/s41590-022-01257-4\">10.1038/s41590-022-01257-4</a>","mla":"Assen, Frank P., et al. “Multitier Mechanics Control Stromal Adaptations in Swelling Lymph Nodes.” <i>Nature Immunology</i>, vol. 23, Springer Nature, 2022, pp. 1246–55, doi:<a href=\"https://doi.org/10.1038/s41590-022-01257-4\">10.1038/s41590-022-01257-4</a>.","apa":"Assen, F. P., Abe, J., Hons, M., Hauschild, R., Shamipour, S., Kaufmann, W., … Sixt, M. K. (2022). Multitier mechanics control stromal adaptations in swelling lymph nodes. <i>Nature Immunology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41590-022-01257-4\">https://doi.org/10.1038/s41590-022-01257-4</a>"},"type":"journal_article","file_date_updated":"2022-07-25T07:11:32Z","abstract":[{"text":"Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular cells that form dedicated niches for immune cell interaction and capsular fibroblasts that build a shell around the organ. Immunological challenge causes LNs to increase more than tenfold in size within a few days. Here, we characterized the biomechanics of LN swelling on the cellular and organ scale. We identified lymphocyte trapping by influx and proliferation as drivers of an outward pressure force, causing fibroblastic reticular cells of the T-zone (TRCs) and their associated conduits to stretch. After an initial phase of relaxation, TRCs sensed the resulting strain through cell matrix adhesions, which coordinated local growth and remodeling of the stromal network. While the expanded TRC network readopted its typical configuration, a massive fibrotic reaction of the organ capsule set in and countered further organ expansion. Thus, different fibroblast populations mechanically control LN swelling in a multitier fashion.","lang":"eng"}],"scopus_import":"1","project":[{"grant_number":"724373","call_identifier":"H2020","name":"Cellular navigation along spatial gradients","_id":"25FE9508-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","checksum":"628e7b49809f22c75b428842efe70c68","file_size":11475325,"creator":"dernst","file_id":"11642","content_type":"application/pdf","date_updated":"2022-07-25T07:11:32Z","date_created":"2022-07-25T07:11:32Z","file_name":"2022_NatureImmunology_Assen.pdf","success":1}],"author":[{"full_name":"Assen, Frank P","id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","first_name":"Frank P","last_name":"Assen","orcid":"0000-0003-3470-6119"},{"full_name":"Abe, Jun","last_name":"Abe","first_name":"Jun"},{"full_name":"Hons, Miroslav","last_name":"Hons","orcid":"0000-0002-6625-3348","id":"4167FE56-F248-11E8-B48F-1D18A9856A87","first_name":"Miroslav"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Hauschild","orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert"},{"last_name":"Shamipour","first_name":"Shayan","id":"40B34FE2-F248-11E8-B48F-1D18A9856A87","full_name":"Shamipour, Shayan"},{"full_name":"Kaufmann, Walter","last_name":"Kaufmann","orcid":"0000-0001-9735-5315","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"id":"D93824F4-D9BA-11E9-BB12-F207E6697425","first_name":"Tommaso","orcid":"0000-0001-9732-3815","last_name":"Costanzo","full_name":"Costanzo, Tommaso"},{"full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996","last_name":"Krens","first_name":"Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brown, Markus","last_name":"Brown","first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ludewig, Burkhard","first_name":"Burkhard","last_name":"Ludewig"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J"},{"full_name":"Weninger, Wolfgang","last_name":"Weninger","first_name":"Wolfgang"},{"full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","last_name":"Hannezo","orcid":"0000-0001-6005-1561"},{"first_name":"Sanjiv A.","last_name":"Luther","full_name":"Luther, Sanjiv A."},{"last_name":"Stein","first_name":"Jens V.","full_name":"Stein, Jens V."},{"full_name":"Sixt, Michael K","orcid":"0000-0002-4561-241X","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Multitier mechanics control stromal adaptations in swelling lymph nodes","has_accepted_license":"1","publisher":"Springer Nature","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"SiHi"},{"_id":"CaHe"},{"_id":"EdHa"},{"_id":"EM-Fac"},{"_id":"Bio"},{"_id":"MiSi"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2021-08-06T09:09:11Z","ddc":["570"],"status":"public","day":"11","volume":23,"isi":1,"oa_version":"Published Version","ec_funded":1,"doi":"10.1038/s41590-022-01257-4","publication":"Nature Immunology","date_updated":"2023-08-02T06:53:07Z","oa":1,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"PreCl"},{"_id":"LifeSc"}],"month":"07","intvolume":"        23","date_published":"2022-07-11T00:00:00Z","acknowledgement":"This research was supported by the Scientific Service Units of IST Austria through resources provided by the Imaging and Optics, Electron Microscopy, Preclinical and Life Science Facilities. We thank C. Moussion for providing anti-PNAd antibody and D. Critchley for Talin1-floxed mice, and E. Papusheva for providing a custom 3D channel alignment script. This work was supported by a European Research Council grant ERC-CoG-72437 to M.S. M.H. was supported by Czech Sciencundation GACR 20-24603Y and Charles University PRIMUS/20/MED/013.","year":"2022","page":"1246-1255","external_id":{"isi":["000822975900002"]}},{"page":"553-573","external_id":{"pmid":["34363623"],"isi":["000686420000001"]},"year":"2022","intvolume":"       530","month":"02","date_published":"2022-02-01T00:00:00Z","acknowledgement":"This work was supported by FONDECYT grants 1151432 and 1210169 to Gonzalo J. Marín. FONDECYT grant 1210069 to Jorge Mpodozis. Spanish Ministry of Science, Innovation and Universities (MCIU), State Research Agency (AEI) and European Regional Development Fund (FEDER), PGC2018-098229-B-100 to José L Ferrán. Spanish Ministry of Economy and Competitiveness Excellency Grant BFU2014-57516P (with European Community FEDER support), and a Seneca Foundation (Autonomous Community of Murcia) Excellency Research contract, ref: 19904/ GERM/15; project name: Genoarchitectonic Brain Development and Applications to Neurodegenerative Diseases and Cancer (5672 Fundación Séneca) to Luis Puelles. The authors gratefully acknowledge the valuable editorial help provided by Sara Fernández-Collemann. The authors also thank Elisa Sentis and Solano Henríquez for expert technical help.","date_updated":"2023-08-11T10:58:17Z","issue":"2","doi":"10.1002/cne.25229","publication":"Journal of Comparative Neurology","isi":1,"oa_version":"None","pmid":1,"volume":530,"date_created":"2021-08-23T08:40:59Z","status":"public","day":"01","article_processing_charge":"No","department":[{"_id":"MaJö"}],"language":[{"iso":"eng"}],"article_type":"original","publisher":"Wiley","author":[{"full_name":"Reyes‐Pinto, Rosana","last_name":"Reyes‐Pinto","first_name":"Rosana"},{"full_name":"Ferrán, José L.","first_name":"José L.","last_name":"Ferrán"},{"first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","last_name":"Vega Zuniga","full_name":"Vega Zuniga, Tomas A"},{"last_name":"González‐Cabrera","first_name":"Cristian","full_name":"González‐Cabrera, Cristian"},{"first_name":"Harald","last_name":"Luksch","full_name":"Luksch, Harald"},{"last_name":"Mpodozis","first_name":"Jorge","full_name":"Mpodozis, Jorge"},{"full_name":"Puelles, Luis","last_name":"Puelles","first_name":"Luis"},{"full_name":"Marín, Gonzalo J.","last_name":"Marín","first_name":"Gonzalo J."}],"title":"Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","publication_identifier":{"issn":["0021-9967"],"eissn":["1096-9861"]},"citation":{"apa":"Reyes‐Pinto, R., Ferrán, J. L., Vega Zuniga, T. A., González‐Cabrera, C., Luksch, H., Mpodozis, J., … Marín, G. J. (2022). Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum. <i>Journal of Comparative Neurology</i>. Wiley. <a href=\"https://doi.org/10.1002/cne.25229\">https://doi.org/10.1002/cne.25229</a>","mla":"Reyes‐Pinto, Rosana, et al. “Change in the Neurochemical Signature and Morphological Development of the Parvocellular Isthmic Projection to the Avian Tectum.” <i>Journal of Comparative Neurology</i>, vol. 530, no. 2, Wiley, 2022, pp. 553–73, doi:<a href=\"https://doi.org/10.1002/cne.25229\">10.1002/cne.25229</a>.","ieee":"R. Reyes‐Pinto <i>et al.</i>, “Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum,” <i>Journal of Comparative Neurology</i>, vol. 530, no. 2. Wiley, pp. 553–573, 2022.","short":"R. Reyes‐Pinto, J.L. Ferrán, T.A. Vega Zuniga, C. González‐Cabrera, H. Luksch, J. Mpodozis, L. Puelles, G.J. Marín, Journal of Comparative Neurology 530 (2022) 553–573.","ista":"Reyes‐Pinto R, Ferrán JL, Vega Zuniga TA, González‐Cabrera C, Luksch H, Mpodozis J, Puelles L, Marín GJ. 2022. Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum. Journal of Comparative Neurology. 530(2), 553–573.","ama":"Reyes‐Pinto R, Ferrán JL, Vega Zuniga TA, et al. Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum. <i>Journal of Comparative Neurology</i>. 2022;530(2):553-573. doi:<a href=\"https://doi.org/10.1002/cne.25229\">10.1002/cne.25229</a>","chicago":"Reyes‐Pinto, Rosana, José L. Ferrán, Tomas A Vega Zuniga, Cristian González‐Cabrera, Harald Luksch, Jorge Mpodozis, Luis Puelles, and Gonzalo J. Marín. “Change in the Neurochemical Signature and Morphological Development of the Parvocellular Isthmic Projection to the Avian Tectum.” <i>Journal of Comparative Neurology</i>. Wiley, 2022. <a href=\"https://doi.org/10.1002/cne.25229\">https://doi.org/10.1002/cne.25229</a>."},"type":"journal_article","abstract":[{"lang":"eng","text":"Neurons can change their classical neurotransmitters during ontogeny, sometimes going through stages of dual release. Here, we explored the development of the neurotransmitter identity of neurons of the avian nucleus isthmi parvocellularis (Ipc), whose axon terminals are retinotopically arranged in the optic tectum (TeO) and exert a focal gating effect upon the ascending transmission of retinal inputs. Although cholinergic and glutamatergic markers are both found in Ipc neurons and terminals of adult pigeons and chicks, the mRNA expression of the vesicular acetylcholine transporter, VAChT, is weak or absent. To explore how the Ipc neurotransmitter identity is established during ontogeny, we analyzed the expression of mRNAs coding for cholinergic (ChAT, VAChT, and CHT) and glutamatergic (VGluT2 and VGluT3) markers in chick embryos at different developmental stages. We found that between E12 and E18, Ipc neurons expressed all cholinergic mRNAs and also VGluT2 mRNA; however, from E16 through posthatch stages, VAChT mRNA expression was specifically diminished. Our ex vivo deposits of tracer crystals and intracellular filling experiments revealed that Ipc axons exhibit a mature paintbrush morphology late in development, experiencing marked morphological transformations during the period of presumptive dual vesicular transmitter release. Additionally, although ChAT protein immunoassays increasingly label the growing Ipc axon, this labeling was consistently restricted to sparse portions of the terminal branches. Combined, these results suggest that the synthesis of glutamate and acetylcholine, and their vesicular release, is complexly linked to the developmental processes of branching, growing and remodeling of these unique axons."}],"scopus_import":"1","_id":"9955","quality_controlled":"1"},{"_id":"9977","quality_controlled":"1","citation":{"chicago":"Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of Quantum Invariants of Seifert Fibered Homology Spheres.” <i>Journal of the London Mathematical Society</i>. Wiley, 2022. <a href=\"https://doi.org/10.1112/jlms.12506\">https://doi.org/10.1112/jlms.12506</a>.","ista":"Mistegaard W, Andersen JE. 2022. Resurgence analysis of quantum invariants of Seifert fibered homology spheres. Journal of the London Mathematical Society. 105(2), 709–764.","short":"W. Mistegaard, J.E. Andersen, Journal of the London Mathematical Society 105 (2022) 709–764.","ieee":"W. Mistegaard and J. E. Andersen, “Resurgence analysis of quantum invariants of Seifert fibered homology spheres,” <i>Journal of the London Mathematical Society</i>, vol. 105, no. 2. Wiley, pp. 709–764, 2022.","ama":"Mistegaard W, Andersen JE. Resurgence analysis of quantum invariants of Seifert fibered homology spheres. <i>Journal of the London Mathematical Society</i>. 2022;105(2):709-764. doi:<a href=\"https://doi.org/10.1112/jlms.12506\">10.1112/jlms.12506</a>","mla":"Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of Quantum Invariants of Seifert Fibered Homology Spheres.” <i>Journal of the London Mathematical Society</i>, vol. 105, no. 2, Wiley, 2022, pp. 709–64, doi:<a href=\"https://doi.org/10.1112/jlms.12506\">10.1112/jlms.12506</a>.","apa":"Mistegaard, W., &#38; Andersen, J. E. (2022). Resurgence analysis of quantum invariants of Seifert fibered homology spheres. <i>Journal of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/jlms.12506\">https://doi.org/10.1112/jlms.12506</a>"},"publication_identifier":{"eissn":["1469-7750"]},"file_date_updated":"2022-03-24T11:42:25Z","type":"journal_article","arxiv":1,"scopus_import":"1","abstract":[{"text":"For a Seifert fibered homology sphere X we show that the q-series invariant Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki series Z0(X). We show that for every even k ∈ N there exists a full asymptotic expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit Zˆ0(X; e 2πi/k) exists and is equal to the\r\nWRT quantum invariant τk(X). We show that the poles of the Borel transform of Z0(X) coincide with the classical complex Chern-Simons values, which we further show classifies the corresponding components of the moduli space of flat SL(2, C)-connections.","lang":"eng"}],"project":[{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","checksum":"9c72327d39f34f1a6eaa98fa4b8493f2","content_type":"application/pdf","file_id":"10917","creator":"dernst","file_size":649130,"date_created":"2022-03-24T11:42:25Z","date_updated":"2022-03-24T11:42:25Z","success":1,"file_name":"2022_JourLondonMathSoc_Andersen.pdf"}],"title":"Resurgence analysis of quantum invariants of Seifert fibered homology spheres","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Mistegaard, William","last_name":"Mistegaard","id":"41B03CD0-62AE-11E9-84EF-0718E6697425","first_name":"William"},{"full_name":"Andersen, Jørgen Ellegaard","first_name":"Jørgen Ellegaard","last_name":"Andersen"}],"has_accepted_license":"1","publisher":"Wiley","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"TaHa"}],"date_created":"2021-08-31T12:51:40Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"day":"01","status":"public","volume":105,"isi":1,"oa_version":"Published Version","ec_funded":1,"doi":"10.1112/jlms.12506","publication":"Journal of the London Mathematical Society","date_updated":"2023-08-02T06:53:51Z","issue":"2","oa":1,"month":"03","intvolume":"       105","date_published":"2022-03-01T00:00:00Z","acknowledgement":"We warmly thank S. Gukov for valuable discussions on the GPPV invariant ̂Z𝑎(𝑀3; 𝑞). The first\r\nauthor was supported in part by the center of excellence grant ‘Center for Quantum Geometry\r\nof Moduli Spaces’ from the Danish National Research Foundation (DNRF95) and by the ERCSynergy\r\ngrant ‘ReNewQuantum’. The second author received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement no. 754411.","year":"2022","page":"709-764","external_id":{"isi":["000755205700001"],"arxiv":["1811.05376"]}},{"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Scalable verification of quantized neural networks","author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"file":[{"access_level":"open_access","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","relation":"main_file","file_size":137235,"creator":"mlechner","file_id":"10684","content_type":"application/pdf","date_updated":"2022-01-26T07:41:16Z","date_created":"2022-01-26T07:41:16Z","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","success":1}],"publisher":"AAAI Press","has_accepted_license":"1","publication_status":"published","project":[{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"quality_controlled":"1","_id":"10665","arxiv":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}],"type":"conference","file_date_updated":"2022-01-26T07:41:16Z","citation":{"ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95."},"publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"year":"2021","conference":{"end_date":"2021-02-09","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual"},"external_id":{"arxiv":["2012.08185"]},"page":"3787-3795","oa":1,"issue":"5A","date_updated":"2025-07-14T09:10:11Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","date_published":"2021-05-28T00:00:00Z","alternative_title":["Technical Tracks"],"month":"05","intvolume":"        35","ec_funded":1,"oa_version":"Published Version","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"day":"28","status":"public","date_created":"2022-01-25T15:15:02Z","ddc":["000"],"volume":35},{"year":"2021","series_title":"ICRA","external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"page":"4140-4147","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","conference":{"start_date":"2021-05-30","end_date":"2021-06-05","name":"ICRA: International Conference on Robotics and Automation","location":"Xi'an, China"},"date_updated":"2023-08-17T06:58:38Z","oa":1,"date_published":"2021-01-01T00:00:00Z","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"isi":1,"oa_version":"None","main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}],"doi":"10.1109/ICRA48506.2021.9561036","publication":"2021 IEEE International Conference on Robotics and Automation","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"date_created":"2022-01-25T15:44:54Z","ddc":["000"],"status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"title":"Adversarial training is not ready for robot learning","has_accepted_license":"1","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"publication_status":"published","_id":"10666","quality_controlled":"1","publication_identifier":{"isbn":["978-1-7281-9078-5"],"eisbn":["978-1-7281-9077-8"],"eissn":["2577-087X"],"issn":["1050-4729"]},"citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>"},"type":"conference","abstract":[{"text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.","lang":"eng"}],"arxiv":1},{"date_updated":"2025-07-14T09:10:12Z","oa":1,"month":"12","alternative_title":[" Advances in Neural Information Processing Systems"],"date_published":"2021-12-01T00:00:00Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2021","external_id":{"arxiv":["2111.03165"]},"conference":{"end_date":"2021-12-10","start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual"},"ddc":["000"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"date_created":"2022-01-25T15:45:58Z","day":"01","status":"public","related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"oa_version":"Published Version","ec_funded":1,"doi":"10.48550/arXiv.2111.03165","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"publication":"35th Conference on Neural Information Processing Systems","file":[{"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","relation":"main_file","access_level":"open_access","file_id":"10682","content_type":"application/pdf","file_size":452492,"creator":"mlechner","date_created":"2022-01-26T07:39:59Z","date_updated":"2022-01-26T07:39:59Z","success":1,"file_name":"infinite_time_horizon_safety_o.pdf"}],"author":[{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"full_name":"Žikelić, Ðorđe","first_name":"Ðorđe","last_name":"Žikelić"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"title":"Infinite time horizon safety of Bayesian neural networks","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"_id":"10667","quality_controlled":"1","citation":{"mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021."},"type":"conference","file_date_updated":"2022-01-26T07:39:59Z","arxiv":1,"abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}],"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"publication_status":"published"},{"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"full_name":"Babaiee, Zahra","last_name":"Babaiee","first_name":"Zahra"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"title":"On-off center-surround receptive fields for accurate and robust image classification","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"10681","content_type":"application/pdf","creator":"mlechner","file_size":4246561,"relation":"main_file","checksum":"d30eae62561bb517d9f978437d7677db","access_level":"open_access","success":1,"file_name":"babaiee21a.pdf","date_updated":"2022-01-26T07:38:32Z","date_created":"2022-01-26T07:38:32Z"}],"publisher":"ML Research Press","has_accepted_license":"1","publication_status":"published","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"quality_controlled":"1","_id":"10668","abstract":[{"lang":"eng","text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines."}],"file_date_updated":"2022-01-26T07:38:32Z","type":"conference","publication_identifier":{"issn":["2640-3498"]},"citation":{"chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press."},"year":"2021","conference":{"location":"Virtual","start_date":"2021-07-18","end_date":"2021-07-24","name":"ML: Machine Learning"},"page":"478-489","oa":1,"date_updated":"2022-05-04T15:02:27Z","acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","alternative_title":["PMLR"],"date_published":"2021-07-01T00:00:00Z","intvolume":"       139","month":"07","oa_version":"Published Version","publication":"Proceedings of the 38th International Conference on Machine Learning","main_file_link":[{"url":"https://proceedings.mlr.press/v139/babaiee21a","open_access":"1"}],"status":"public","day":"01","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"date_created":"2022-01-25T15:46:33Z","ddc":["000"],"volume":139},{"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file":[{"file_name":"17372-Article Text-20866-1-2-20210518.pdf","success":1,"date_updated":"2022-01-26T07:38:08Z","date_created":"2022-01-26T07:38:08Z","creator":"mlechner","file_size":286906,"content_type":"application/pdf","file_id":"10680","access_level":"open_access","checksum":"468d07041e282a1d46ffdae92f709630","relation":"main_file"}],"title":"On the verification of neural ODEs with stochastic guarantees","author":[{"first_name":"Sophie","last_name":"Grunbacher","full_name":"Grunbacher, Sophie"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Cyranka, Jacek","last_name":"Cyranka","first_name":"Jacek"},{"last_name":"Smolka","first_name":"Scott A","full_name":"Smolka, Scott A"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"AAAI Press","project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"publication_status":"published","_id":"10669","quality_controlled":"1","publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"citation":{"chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021.","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535.","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press."},"file_date_updated":"2022-01-26T07:38:08Z","type":"conference","arxiv":1,"abstract":[{"text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR.","lang":"eng"}],"year":"2021","external_id":{"arxiv":["2012.08863"]},"page":"11525-11535","conference":{"location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02","end_date":"2021-02-09"},"date_updated":"2022-05-24T06:33:14Z","issue":"13","oa":1,"month":"05","intvolume":"        35","alternative_title":["Technical Tracks"],"date_published":"2021-05-28T00:00:00Z","acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","ddc":["000"],"date_created":"2022-01-25T15:47:20Z","status":"public","day":"28","volume":35},{"has_accepted_license":"1","file":[{"checksum":"be81f0ade174a8c9b2d4fe09590b2021","relation":"main_file","access_level":"open_access","file_size":6841228,"creator":"mlechner","content_type":"application/pdf","file_id":"10679","date_updated":"2022-01-26T07:37:24Z","date_created":"2022-01-26T07:37:24Z","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","success":1}],"title":"Causal navigation by continuous-time neural networks","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Vorbach, Charles J","last_name":"Vorbach","first_name":"Charles J"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"citation":{"short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 2021.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021.","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021."},"file_date_updated":"2022-01-26T07:37:24Z","type":"conference","abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"arxiv":1,"_id":"10670","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}],"publication_status":"published","month":"12","alternative_title":[" Advances in Neural Information Processing Systems"],"date_published":"2021-12-01T00:00:00Z","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","date_updated":"2022-01-26T14:33:31Z","oa":1,"external_id":{"arxiv":["2106.08314"]},"conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","start_date":"2021-12-06","location":"Virtual"},"year":"2021","ddc":["000"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"date_created":"2022-01-25T15:47:50Z","status":"public","day":"01","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"publication":"35th Conference on Neural Information Processing Systems","oa_version":"Published Version"},{"volume":35,"status":"public","day":"28","ddc":["000"],"date_created":"2022-01-25T15:48:36Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"oa_version":"Published Version","acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","date_published":"2021-05-28T00:00:00Z","alternative_title":["Technical Tracks"],"month":"05","intvolume":"        35","oa":1,"issue":"9","date_updated":"2022-05-24T06:36:54Z","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual"},"page":"7657-7666","external_id":{"arxiv":["2006.04439"]},"year":"2021","abstract":[{"lang":"eng","text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs."}],"arxiv":1,"file_date_updated":"2022-01-26T07:36:03Z","type":"conference","publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"citation":{"ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66."},"quality_controlled":"1","_id":"10671","publication_status":"published","project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"publisher":"AAAI Press","has_accepted_license":"1","author":[{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"title":"Liquid time-constant networks","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","success":1,"date_updated":"2022-01-26T07:36:03Z","date_created":"2022-01-26T07:36:03Z","file_size":4302669,"creator":"mlechner","file_id":"10678","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"0f06995fba06dbcfa7ed965fc66027ff"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","language":[{"iso":"eng"}]},{"volume":17,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2022-01-25T16:32:13Z","ddc":["510"],"status":"public","day":"03","doi":"10.23638/LMCS-17(1:10)2021","publication":"Logical Methods in Computer Science","isi":1,"oa_version":"Published Version","intvolume":"        17","month":"02","date_published":"2021-02-03T00:00:00Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n","date_updated":"2023-08-17T06:56:42Z","keyword":["computer science","computer science and game theory","logic in computer science"],"issue":"1","oa":1,"page":"10:1-10:23","external_id":{"isi":["000658724600010"],"arxiv":["1905.03588"]},"year":"2021","publication_identifier":{"eissn":["1860-5974"]},"citation":{"chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2021. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>.","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>"},"type":"journal_article","file_date_updated":"2022-01-26T08:04:50Z","scopus_import":"1","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets.","lang":"eng"}],"arxiv":1,"_id":"10674","quality_controlled":"1","project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","grant_number":"M02369"},{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"publication_status":"published","has_accepted_license":"1","publisher":"International Federation for Computational Logic","file":[{"date_created":"2022-01-26T08:04:50Z","date_updated":"2022-01-26T08:04:50Z","success":1,"file_name":"2021_LMCS_AGHAJOHAR.pdf","relation":"main_file","access_level":"open_access","checksum":"b35586a50ed1ca8f44767de116d18d81","file_id":"10690","content_type":"application/pdf","creator":"alisjak","file_size":819878}],"author":[{"first_name":"Milad","last_name":"Aghajohari","full_name":"Aghajohari, Milad"},{"last_name":"Avni","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Determinacy in discrete-bidding infinite-duration games","article_processing_charge":"No","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"article_type":"original"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"The Civl verifier","author":[{"orcid":"0000-0001-7745-9117","last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"file":[{"date_updated":"2022-01-26T08:04:29Z","date_created":"2022-01-26T08:04:29Z","file_name":"2021_FCAD2021_Kragl.pdf","success":1,"relation":"main_file","access_level":"open_access","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","file_size":390555,"creator":"cchlebak","file_id":"10689","content_type":"application/pdf"}],"publisher":"TU Wien Academic Press","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"article_processing_charge":"No","quality_controlled":"1","_id":"10688","editor":[{"last_name":"Ruzica","first_name":"Piskac","full_name":"Ruzica, Piskac"},{"full_name":"Whalen, Michael W.","last_name":"Whalen","first_name":"Michael W."}],"abstract":[{"lang":"eng","text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier."}],"type":"conference","file_date_updated":"2022-01-26T08:04:29Z","publication_identifier":{"isbn":["978-3-85448-046-4"]},"citation":{"apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>.","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"publication_status":"published","project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"oa":1,"date_updated":"2022-01-26T08:20:41Z","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","alternative_title":["Conference Series"],"date_published":"2021-10-01T00:00:00Z","month":"10","intvolume":"         2","year":"2021","conference":{"location":"Virtual","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2021-10-20","end_date":"2021-10-22"},"page":"143–152","day":"01","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2022-01-26T08:01:30Z","ddc":["000"],"volume":2,"oa_version":"Published Version","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","doi":"10.34727/2021/isbn.978-3-85448-046-4_23"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Infinite-duration all-pay bidding games","author":[{"full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"publisher":"Society for Industrial and Applied Mathematics","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","_id":"10694","editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}],"quality_controlled":"1","publication_identifier":{"isbn":["978-1-61197-646-5"]},"citation":{"chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>"},"arxiv":1,"scopus_import":"1","abstract":[{"text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.","lang":"eng"}],"type":"conference","year":"2021","page":"617-636","external_id":{"arxiv":["2005.06636"]},"conference":{"location":"Virtual","name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10","end_date":"2021-01-13"},"date_updated":"2025-07-14T09:10:12Z","oa":1,"date_published":"2021-01-01T00:00:00Z","month":"01","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","ec_funded":1,"oa_version":"Preprint","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","doi":"10.1137/1.9781611976465.38","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"date_created":"2022-01-27T12:11:23Z","status":"public","day":"01"}]