[{"date_updated":"2023-02-20T07:19:12Z","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022","page":"9858-9867","oa":1,"year":"2022","publisher":"Association for the Advancement of Artificial Intelligence","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2203.01640","open_access":"1"}],"intvolume":"        36","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"date_created":"2023-02-19T23:00:56Z","scopus_import":"1","external_id":{"arxiv":["2203.01640"]},"date_published":"2022-06-28T00:00:00Z","publication_identifier":{"eissn":["2374-3468"],"isbn":["1577358767"]},"publication_status":"published","status":"public","_id":"12568","title":"Risk-aware stochastic shortest path","author":[{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165"}],"doi":"10.1609/aaai.v36i9.21222","abstract":[{"text":"We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered for SSP, which however is oblivious to the incurred risk. We present an alternative view, instead optimizing conditional value-at-risk (CVaR), an established risk measure. We treat both Markov chains as well as MDP and introduce, through novel insights, two algorithms, based on linear programming and value iteration, respectively. Both algorithms offer precise and provably correct solutions. Evaluation of our prototype implementation shows that risk-aware control is feasible on several moderately sized models.","lang":"eng"}],"issue":"9","arxiv":1,"volume":36,"article_processing_charge":"No","month":"06","citation":{"ista":"Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867.","short":"T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.","ama":"Meggendorfer T. Risk-aware stochastic shortest path. In: <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:<a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">10.1609/aaai.v36i9.21222</a>","ieee":"T. Meggendorfer, “Risk-aware stochastic shortest path,” in <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.","apa":"Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i> (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">https://doi.org/10.1609/aaai.v36i9.21222</a>","mla":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:<a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">10.1609/aaai.v36i9.21222</a>.","chicago":"Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022</i>, 36:9858–67. Association for the Advancement of Artificial Intelligence, 2022. <a href=\"https://doi.org/10.1609/aaai.v36i9.21222\">https://doi.org/10.1609/aaai.v36i9.21222</a>."},"day":"28","oa_version":"Preprint","conference":{"location":"Virtual","start_date":"2022-02-22","end_date":"2022-03-01","name":"Conference on Artificial Intelligence"}},{"language":[{"iso":"eng"}],"type":"preprint","article_processing_charge":"No","has_accepted_license":"1","arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"checksum":"7ab20543fd4393f14fb857ce2e4f03c6","content_type":"application/pdf","access_level":"open_access","date_updated":"2023-02-20T08:21:35Z","success":1,"creator":"chl","file_size":291893,"relation":"main_file","file_name":"2210.06434.pdf","date_created":"2023-02-20T08:21:35Z","file_id":"12661"}],"date_created":"2023-02-20T08:21:50Z","oa_version":"Preprint","external_id":{"arxiv":["2210.06434"]},"date_published":"2022-10-12T00:00:00Z","month":"10","ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2023-02-20T08:21:35Z","day":"12","department":[{"_id":"ChLa"}],"citation":{"mla":"Scott, Jonathan A., et al. “Cross-Client Label Propagation for Transductive Federated Learning.” <i>ArXiv</i>, 2210.06434, doi:<a href=\"https://doi.org/10.48550/arXiv.2210.06434\">10.48550/arXiv.2210.06434</a>.","chicago":"Scott, Jonathan A, Michelle X Yeo, and Christoph Lampert. “Cross-Client Label Propagation for Transductive Federated Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2210.06434\">https://doi.org/10.48550/arXiv.2210.06434</a>.","short":"J.A. Scott, M.X. Yeo, C. Lampert, ArXiv (n.d.).","ista":"Scott JA, Yeo MX, Lampert C. Cross-client Label Propagation for transductive federated learning. arXiv, 2210.06434.","ama":"Scott JA, Yeo MX, Lampert C. Cross-client Label Propagation for transductive federated learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2210.06434\">10.48550/arXiv.2210.06434</a>","ieee":"J. A. Scott, M. X. Yeo, and C. Lampert, “Cross-client Label Propagation for transductive federated learning,” <i>arXiv</i>. .","apa":"Scott, J. A., Yeo, M. X., &#38; Lampert, C. (n.d.). Cross-client Label Propagation for transductive federated learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2210.06434\">https://doi.org/10.48550/arXiv.2210.06434</a>"},"article_number":"2210.06434","publication_status":"submitted","status":"public","date_updated":"2023-02-21T08:20:18Z","publication":"arXiv","doi":"10.48550/arXiv.2210.06434","year":"2022","abstract":[{"text":"We present Cross-Client Label Propagation(XCLP), a new method for transductive federated learning. XCLP estimates a data graph jointly from the data of multiple clients and computes labels for the unlabeled data by propagating label information across the graph. To avoid clients having to share their data with anyone, XCLP employs two cryptographically secure protocols: secure Hamming distance computation and secure summation. We demonstrate two distinct applications of XCLP within federated learning. In the first, we use it in a one-shot way to predict labels for unseen test points. In the second, we use it to repeatedly pseudo-label unlabeled training data in a federated semi-supervised setting. Experiments on both real federated and standard benchmark datasets show that in both applications XCLP achieves higher classification accuracy than alternative approaches.","lang":"eng"}],"_id":"12660","author":[{"full_name":"Scott, Jonathan A","last_name":"Scott","id":"e499926b-f6e0-11ea-865d-9c63db0031e8","first_name":"Jonathan A"},{"last_name":"Yeo","full_name":"Yeo, Michelle X","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert"}],"oa":1,"title":"Cross-client Label Propagation for transductive federated learning"},{"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2208.13499","open_access":"1"}],"arxiv":1,"has_accepted_license":"1","article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"citation":{"short":"P. Súkeník, C. Lampert, ArXiv (n.d.).","ista":"Súkeník P, Lampert C. Generalization in Multi-objective machine learning. arXiv, 2208.13499.","ama":"Súkeník P, Lampert C. Generalization in Multi-objective machine learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2208.13499\">10.48550/arXiv.2208.13499</a>","apa":"Súkeník, P., &#38; Lampert, C. (n.d.). Generalization in Multi-objective machine learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2208.13499\">https://doi.org/10.48550/arXiv.2208.13499</a>","ieee":"P. Súkeník and C. Lampert, “Generalization in Multi-objective machine learning,” <i>arXiv</i>. .","mla":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>ArXiv</i>, 2208.13499, doi:<a href=\"https://doi.org/10.48550/arXiv.2208.13499\">10.48550/arXiv.2208.13499</a>.","chicago":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2208.13499\">https://doi.org/10.48550/arXiv.2208.13499</a>."},"department":[{"_id":"ChLa"}],"day":"29","month":"08","ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2208.13499"]},"date_published":"2022-08-29T00:00:00Z","oa_version":"Preprint","date_created":"2023-02-20T08:23:06Z","publication":"arXiv","date_updated":"2023-02-21T08:24:55Z","publication_status":"submitted","status":"public","article_number":"2208.13499","oa":1,"title":"Generalization in Multi-objective machine learning","author":[{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","first_name":"Peter","full_name":"Súkeník, Peter","last_name":"Súkeník"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"_id":"12662","abstract":[{"text":"Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: we establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: all Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.","lang":"eng"}],"year":"2022","doi":"10.48550/arXiv.2208.13499"},{"volume":64,"article_processing_charge":"No","oa_version":"Published Version","month":"12","pmid":1,"citation":{"mla":"He, Shengbo, and Xiaoqi Feng. “DNA Methylation Dynamics during Germline Development.” <i>Journal of Integrative Plant Biology</i>, vol. 64, no. 12, Wiley, 2022, pp. 2240–51, doi:<a href=\"https://doi.org/10.1111/jipb.13422\">10.1111/jipb.13422</a>.","chicago":"He, Shengbo, and Xiaoqi Feng. “DNA Methylation Dynamics during Germline Development.” <i>Journal of Integrative Plant Biology</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/jipb.13422\">https://doi.org/10.1111/jipb.13422</a>.","ista":"He S, Feng X. 2022. DNA methylation dynamics during germline development. Journal of Integrative Plant Biology. 64(12), 2240–2251.","short":"S. He, X. Feng, Journal of Integrative Plant Biology 64 (2022) 2240–2251.","ama":"He S, Feng X. DNA methylation dynamics during germline development. <i>Journal of Integrative Plant Biology</i>. 2022;64(12):2240-2251. doi:<a href=\"https://doi.org/10.1111/jipb.13422\">10.1111/jipb.13422</a>","apa":"He, S., &#38; Feng, X. (2022). DNA methylation dynamics during germline development. <i>Journal of Integrative Plant Biology</i>. Wiley. <a href=\"https://doi.org/10.1111/jipb.13422\">https://doi.org/10.1111/jipb.13422</a>","ieee":"S. He and X. Feng, “DNA methylation dynamics during germline development,” <i>Journal of Integrative Plant Biology</i>, vol. 64, no. 12. Wiley, pp. 2240–2251, 2022."},"day":"07","publication_status":"published","status":"public","publication_identifier":{"issn":["1672-9072"],"eissn":["1744-7909"]},"doi":"10.1111/jipb.13422","abstract":[{"text":"DNA methylation plays essential homeostatic functions in eukaryotic genomes. In animals, DNA methylation is also developmentally regulated and, in turn, regulates development. In the past two decades, huge research effort has endorsed the understanding that DNA methylation plays a similar role in plant development, especially during sexual reproduction. The power of whole-genome sequencing and cell isolation techniques, as well as bioinformatics tools, have enabled recent studies to reveal dynamic changes in DNA methylation during germline development. Furthermore, the combination of these technological advances with genetics, developmental biology and cell biology tools has revealed functional methylation reprogramming events that control gene and transposon activities in flowering plant germlines. In this review, we discuss the major advances in our knowledge of DNA methylation dynamics during male and female germline development in flowering plants.","lang":"eng"}],"issue":"12","_id":"12670","title":"DNA methylation dynamics during germline development","author":[{"first_name":"Shengbo","last_name":"He","full_name":"He, Shengbo"},{"orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publisher":"Wiley","main_file_link":[{"url":"https://doi.org/10.1111/jipb.13422","open_access":"1"}],"intvolume":"        64","date_created":"2023-02-23T09:15:57Z","scopus_import":"1","date_published":"2022-12-07T00:00:00Z","extern":"1","external_id":{"pmid":["36478632"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"XiFe"}],"page":"2240-2251","article_type":"review","date_updated":"2023-05-08T10:59:00Z","publication":"Journal of Integrative Plant Biology","keyword":["Plant Science","General Biochemistry","Genetics and Molecular Biology","Biochemistry"],"year":"2022","oa":1},{"issue":"7936","abstract":[{"lang":"eng","text":"Sperm chromatin is typically transformed by protamines into a compact and transcriptionally inactive state1,2. Sperm cells of flowering plants lack protamines, yet they have small, transcriptionally active nuclei with chromatin condensed through an unknown mechanism3,4. Here we show that a histone variant, H2B.8, mediates sperm chromatin and nuclear condensation in Arabidopsis thaliana. Loss of H2B.8 causes enlarged sperm nuclei with dispersed chromatin, whereas ectopic expression in somatic cells produces smaller nuclei with aggregated chromatin. This result demonstrates that H2B.8 is sufficient for chromatin condensation. H2B.8 aggregates transcriptionally inactive AT-rich chromatin into phase-separated condensates, which facilitates nuclear compaction without reducing transcription. Reciprocal crosses show that mutation of h2b.8 reduces male transmission, which suggests that H2B.8-mediated sperm compaction is important for fertility. Altogether, our results reveal a new mechanism of nuclear compaction through global aggregation of unexpressed chromatin. We propose that H2B.8 is an evolutionary innovation of flowering plants that achieves nuclear condensation compatible with active transcription."}],"doi":"10.1038/s41586-022-05386-6","author":[{"last_name":"Buttress","full_name":"Buttress, Toby","first_name":"Toby"},{"first_name":"Shengbo","full_name":"He, Shengbo","last_name":"He"},{"first_name":"Liang","full_name":"Wang, Liang","last_name":"Wang"},{"last_name":"Zhou","full_name":"Zhou, Shaoli","first_name":"Shaoli"},{"first_name":"Gerhard","full_name":"Saalbach, Gerhard","last_name":"Saalbach"},{"last_name":"Vickers","full_name":"Vickers, Martin","first_name":"Martin"},{"full_name":"Li, Guohong","last_name":"Li","first_name":"Guohong"},{"last_name":"Li","full_name":"Li, Pilong","first_name":"Pilong"},{"full_name":"Feng, Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi","orcid":"0000-0002-4008-1234"}],"title":"Histone H2B.8 compacts flowering plant sperm through chromatin phase separation","_id":"12671","publication_status":"published","status":"public","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"oa_version":"Published Version","day":"17","citation":{"apa":"Buttress, T., He, S., Wang, L., Zhou, S., Saalbach, G., Vickers, M., … Feng, X. (2022). Histone H2B.8 compacts flowering plant sperm through chromatin phase separation. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-022-05386-6\">https://doi.org/10.1038/s41586-022-05386-6</a>","ieee":"T. Buttress <i>et al.</i>, “Histone H2B.8 compacts flowering plant sperm through chromatin phase separation,” <i>Nature</i>, vol. 611, no. 7936. Springer Nature, pp. 614–622, 2022.","ama":"Buttress T, He S, Wang L, et al. Histone H2B.8 compacts flowering plant sperm through chromatin phase separation. <i>Nature</i>. 2022;611(7936):614-622. doi:<a href=\"https://doi.org/10.1038/s41586-022-05386-6\">10.1038/s41586-022-05386-6</a>","ista":"Buttress T, He S, Wang L, Zhou S, Saalbach G, Vickers M, Li G, Li P, Feng X. 2022. Histone H2B.8 compacts flowering plant sperm through chromatin phase separation. Nature. 611(7936), 614–622.","short":"T. Buttress, S. He, L. Wang, S. Zhou, G. Saalbach, M. Vickers, G. Li, P. Li, X. Feng, Nature 611 (2022) 614–622.","mla":"Buttress, Toby, et al. “Histone H2B.8 Compacts Flowering Plant Sperm through Chromatin Phase Separation.” <i>Nature</i>, vol. 611, no. 7936, Springer Nature, 2022, pp. 614–22, doi:<a href=\"https://doi.org/10.1038/s41586-022-05386-6\">10.1038/s41586-022-05386-6</a>.","chicago":"Buttress, Toby, Shengbo He, Liang Wang, Shaoli Zhou, Gerhard Saalbach, Martin Vickers, Guohong Li, Pilong Li, and Xiaoqi Feng. “Histone H2B.8 Compacts Flowering Plant Sperm through Chromatin Phase Separation.” <i>Nature</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41586-022-05386-6\">https://doi.org/10.1038/s41586-022-05386-6</a>."},"pmid":1,"month":"11","article_processing_charge":"No","volume":611,"year":"2022","oa":1,"article_type":"original","page":"614-622","publication":"Nature","date_updated":"2023-05-08T10:59:22Z","extern":"1","external_id":{"pmid":["36323776"]},"date_published":"2022-11-17T00:00:00Z","scopus_import":"1","date_created":"2023-02-23T09:17:05Z","department":[{"_id":"XiFe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       611","main_file_link":[{"url":"https://doi.org/10.1038/s41586-022-05386-6","open_access":"1"}],"publisher":"Springer Nature"},{"language":[{"iso":"eng"}],"type":"preprint","article_processing_charge":"No","arxiv":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2209.14368"}],"external_id":{"arxiv":["2209.14368"]},"date_published":"2022-09-28T00:00:00Z","date_created":"2023-02-24T12:21:40Z","oa_version":"Preprint","day":"28","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, 2209.14368, doi:<a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">10.48550/ARXIV.2209.14368</a>.","chicago":"Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">https://doi.org/10.48550/ARXIV.2209.14368</a>.","apa":"Chatterjee, K., Mohammadi, M., &#38; Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">https://doi.org/10.48550/ARXIV.2209.14368</a>","ieee":"K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” <i>arXiv</i>. .","short":"K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).","ista":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368.","ama":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">10.48550/ARXIV.2209.14368</a>"},"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","publication_status":"submitted","status":"public","ec_funded":1,"article_number":"2209.14368","publication":"arXiv","date_updated":"2025-07-14T09:09:51Z","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"year":"2022","abstract":[{"lang":"eng","text":"In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal."}],"doi":"10.48550/ARXIV.2209.14368","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Mohammadi","full_name":"Mohammadi, Mona","first_name":"Mona","id":"4363614d-b686-11ed-a7d5-ac9e4a24bc2e"},{"orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","first_name":"Raimundo J"}],"title":"Repeated prophet inequality with near-optimal bounds","oa":1,"_id":"12677"},{"acknowledgement":"The authors warmly thank Amos Nevo for having presented the authors to each other during\r\na beautiful conference in Goa in February 2016, where the idea of this paper was born. The\r\nfirst author thanks the IHES for two post-doctoral years when most of this paper was discussed,\r\nand the Topology team in Orsay for financial support at the final stage. The first author was\r\nsupported by the EPRSC EP/P026710/1 grant. Finally, we warmly thank the referee for many\r\nvery helpful comments that have improved the readability of this paper.","publication_status":"published","status":"public","publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"doi":"10.5802/JTNB.1222","abstract":[{"lang":"eng","text":"Given a place  ω  of a global function field  K  over a finite field, with associated affine function ring  Rω  and completion  Kω , the aim of this paper is to give an effective joint equidistribution result for renormalized primitive lattice points  (a,b)∈Rω2  in the plane  Kω2 , and for renormalized solutions to the gcd equation  ax+by=1 . The main tools are techniques of Goronik and Nevo for counting lattice points in well-rounded families of subsets. This gives a sharper analog in positive characteristic of a result of Nevo and the first author for the equidistribution of the primitive lattice points in  \\ZZ2 ."}],"issue":"3","_id":"12684","title":"Effective equidistribution of lattice points in positive characteristic","author":[{"full_name":"Horesh, Tal","last_name":"Horesh","id":"C8B7BF48-8D81-11E9-BCA9-F536E6697425","first_name":"Tal"},{"full_name":"Paulin, Frédéric","last_name":"Paulin","first_name":"Frédéric"}],"article_processing_charge":"No","volume":34,"has_accepted_license":"1","file":[{"file_name":"2023_JourTheorieNombreBordeaux_Horesh.pdf","creator":"dernst","file_size":870468,"relation":"main_file","access_level":"open_access","checksum":"08f28fded270251f568f610cf5166d69","content_type":"application/pdf","success":1,"date_updated":"2023-02-27T09:10:13Z","file_id":"12689","date_created":"2023-02-27T09:10:13Z"}],"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"arxiv":1,"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nd/4.0/","ddc":["510"],"file_date_updated":"2023-02-27T09:10:13Z","month":"01","citation":{"chicago":"Horesh, Tal, and Frédéric Paulin. “Effective Equidistribution of Lattice Points in Positive Characteristic.” <i>Journal de Theorie Des Nombres de Bordeaux</i>. Centre Mersenne, 2022. <a href=\"https://doi.org/10.5802/JTNB.1222\">https://doi.org/10.5802/JTNB.1222</a>.","mla":"Horesh, Tal, and Frédéric Paulin. “Effective Equidistribution of Lattice Points in Positive Characteristic.” <i>Journal de Theorie Des Nombres de Bordeaux</i>, vol. 34, no. 3, Centre Mersenne, 2022, pp. 679–703, doi:<a href=\"https://doi.org/10.5802/JTNB.1222\">10.5802/JTNB.1222</a>.","ieee":"T. Horesh and F. Paulin, “Effective equidistribution of lattice points in positive characteristic,” <i>Journal de Theorie des Nombres de Bordeaux</i>, vol. 34, no. 3. Centre Mersenne, pp. 679–703, 2022.","apa":"Horesh, T., &#38; Paulin, F. (2022). Effective equidistribution of lattice points in positive characteristic. <i>Journal de Theorie Des Nombres de Bordeaux</i>. Centre Mersenne. <a href=\"https://doi.org/10.5802/JTNB.1222\">https://doi.org/10.5802/JTNB.1222</a>","short":"T. Horesh, F. Paulin, Journal de Theorie Des Nombres de Bordeaux 34 (2022) 679–703.","ama":"Horesh T, Paulin F. Effective equidistribution of lattice points in positive characteristic. <i>Journal de Theorie des Nombres de Bordeaux</i>. 2022;34(3):679-703. doi:<a href=\"https://doi.org/10.5802/JTNB.1222\">10.5802/JTNB.1222</a>","ista":"Horesh T, Paulin F. 2022. Effective equidistribution of lattice points in positive characteristic. Journal de Theorie des Nombres de Bordeaux. 34(3), 679–703."},"day":"27","page":"679-703","article_type":"original","date_updated":"2023-08-04T10:41:40Z","publication":"Journal de Theorie des Nombres de Bordeaux","year":"2022","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"publisher":"Centre Mersenne","intvolume":"        34","date_created":"2023-02-26T23:01:02Z","scopus_import":"1","date_published":"2022-01-27T00:00:00Z","external_id":{"isi":["000926504300003"],"arxiv":["2001.01534"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TiBr"}]},{"date_updated":"2023-09-20T10:46:29Z","publication":"arXiv","article_number":"2210.15607","related_material":{"record":[{"id":"12732","status":"public","relation":"dissertation_contains"},{"id":"14334","status":"public","relation":"later_version"}]},"status":"public","publication_status":"submitted","_id":"12750","title":"Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models","oa":1,"author":[{"id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","first_name":"Pietro","full_name":"Brighi, Pietro","last_name":"Brighi","orcid":"0000-0002-7969-2729"},{"id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","full_name":"Ljubotina, Marko","last_name":"Ljubotina","orcid":"0000-0003-0038-7068"},{"orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym"}],"doi":"10.48550/arXiv.2210.15607","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."}],"year":"2022","arxiv":1,"tmp":{"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","short":"CC BY-NC-SA (4.0)"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.15607"}],"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","citation":{"ista":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. arXiv, 2210.15607.","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>","short":"P. Brighi, M. Ljubotina, M. Serbyn, ArXiv (n.d.).","ieee":"P. Brighi, M. Ljubotina, and M. Serbyn, “Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models,” <i>arXiv</i>. .","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>","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>.","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>."},"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"day":"07","date_created":"2023-03-23T14:33:13Z","oa_version":"Preprint","date_published":"2022-11-07T00:00:00Z","external_id":{"arxiv":["2210.15607"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"scopus_import":"1","date_created":"2023-03-28T08:09:32Z","external_id":{"arxiv":["2008.04824"]},"date_published":"2022-09-15T00:00:00Z","intvolume":"       243","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","oa":1,"year":"2022","alternative_title":["LIPIcs"],"date_updated":"2023-09-26T10:43:30Z","publication":"33rd International Conference on Concurrency Theory ","article_number":"11","month":"09","file_date_updated":"2023-09-26T10:43:15Z","ddc":["000"],"day":"15","citation":{"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>.","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>.","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.","short":"K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","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>","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.","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>"},"conference":{"start_date":"2022-09-13","location":"Warsaw, Poland","end_date":"2022-09-16","name":"CONCUR: Conference on Concurrency Theory"},"oa_version":"Published Version","file":[{"date_created":"2023-09-26T10:43:15Z","file_id":"14372","file_size":960036,"creator":"dernst","relation":"main_file","file_name":"2022_LIPIcS_Grover.pdf","checksum":"e282e43d3ae0ba6e067b72f4583e13c0","content_type":"application/pdf","access_level":"open_access","date_updated":"2023-09-26T10:43:15Z","success":1}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"article_processing_charge":"No","volume":243,"has_accepted_license":"1","_id":"12775","author":[{"full_name":"Grover, Kush","last_name":"Grover","first_name":"Kush"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Weininger","full_name":"Weininger, Maimilian","first_name":"Maimilian"}],"title":"Anytime guarantees for reachability in uncountable Markov decision processes","doi":"10.4230/LIPIcs.CONCUR.2022.11","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"}],"publication_identifier":{"issn":["1868-8969"]},"publication_status":"published","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)","status":"public"},{"date_published":"2022-08-24T00:00:00Z","date_created":"2023-03-28T09:21:09Z","department":[{"_id":"TiBr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"State University of New York","intvolume":"        28","year":"2022","oa":1,"page":"1193 - 1229","article_type":"original","publication":"New York Journal of Mathematics","date_updated":"2023-10-18T07:59:13Z","oa_version":"Published Version","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.","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.","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.","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.","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.","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.","short":"T.D. Browning, New York Journal of Mathematics 28 (2022) 1193–1229."},"day":"24","month":"08","ddc":["510"],"file_date_updated":"2023-03-30T07:09:35Z","has_accepted_license":"1","volume":28,"article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"2022_NYJM_Browning.pdf","relation":"main_file","creator":"dernst","file_size":897267,"success":1,"date_updated":"2023-03-30T07:09:35Z","access_level":"open_access","content_type":"application/pdf","checksum":"c01e8291794a1bdb7416aa103cb68ef8","file_id":"12778","date_created":"2023-03-30T07:09:35Z"}],"abstract":[{"lang":"eng","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."}],"title":"Revisiting the Manin–Peyre conjecture for the split del Pezzo surface of degree 5","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","full_name":"Browning, Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177"}],"_id":"12776","publication_status":"published","status":"public","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.","publication_identifier":{"issn":["1076-9803"]},"project":[{"grant_number":"P32428","_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","name":"New frontiers of the Manin conjecture","call_identifier":"FWF"}]},{"title":"CGX: Adaptive system support for communication-efficient deep learning","author":[{"last_name":"Markov","full_name":"Markov, Ilia","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"full_name":"Ramezanikebrya, Hamidreza","last_name":"Ramezanikebrya","first_name":"Hamidreza"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"_id":"12780","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"}],"doi":"10.1145/3528535.3565248","publication_identifier":{"isbn":["9781450393409"]},"publication_status":"published","acknowledgement":"The authors sincerely thank Nikoli Dryden, Tal Ben-Nun, Torsten Hoefler and Bapi Chatterjee for useful discussions throughout the development of this project.","status":"public","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>.","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>.","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.","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.","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>","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.","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>"},"day":"01","file_date_updated":"2023-04-03T06:17:58Z","ddc":["000"],"month":"11","oa_version":"Published Version","conference":{"end_date":"2022-11-11","start_date":"2022-11-07","location":"Quebec, QC, Canada","name":"Middleware: International Middleware Conference"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"file":[{"file_size":1514169,"creator":"dernst","relation":"main_file","file_name":"2022_ACMMiddleware_Markov.pdf","checksum":"1a397746235f245da5468819247ff663","content_type":"application/pdf","access_level":"open_access","date_updated":"2023-04-03T06:17:58Z","success":1,"date_created":"2023-04-03T06:17:58Z","file_id":"12795"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","oa":1,"year":"2022","publication":"Proceedings of the 23rd ACM/IFIP International Middleware Conference","date_updated":"2023-04-03T06:21:04Z","page":"241-254","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2111.08617"]},"date_published":"2022-11-01T00:00:00Z","date_created":"2023-03-31T06:17:00Z","publisher":"Association for Computing Machinery","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}]},{"oa_version":"Preprint","month":"08","day":"29","citation":{"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>.","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>","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.","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.","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>"},"volume":321,"article_processing_charge":"No","arxiv":1,"doi":"10.2140/pjm.2022.321.193","issue":"1","abstract":[{"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.","lang":"eng"}],"_id":"12793","author":[{"full_name":"Yu, Hongjie","last_name":"Yu","id":"3D7DD9BE-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjie","orcid":"0000-0001-5128-7126"}],"title":" A coarse geometric expansion of a variant of Arthur's truncated traces and some applications","ec_funded":1,"status":"public","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.","publication_status":"published","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0030-8730"],"eissn":["1945-5844"]},"scopus_import":"1","date_created":"2023-04-02T22:01:11Z","date_published":"2022-08-29T00:00:00Z","external_id":{"isi":["000954466300006"],"arxiv":["2109.10245"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TaHa"}],"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2109.10245"}],"intvolume":"       321","publisher":"Mathematical Sciences Publishers","keyword":["Arthur–Selberg trace formula","cuspidal automorphic representations","global function fields"],"year":"2022","oa":1,"article_type":"original","page":"193-237","date_updated":"2023-08-04T10:42:38Z","publication":"Pacific Journal of Mathematics"},{"_id":"12860","oa":1,"title":"Towards differential relational privacy and its use in question answering","author":[{"first_name":"Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa","last_name":"Bombari","full_name":"Bombari, Simone"},{"first_name":"Alessandro","full_name":"Achille, Alessandro","last_name":"Achille"},{"full_name":"Wang, Zijian","last_name":"Wang","first_name":"Zijian"},{"full_name":"Wang, Yu-Xiang","last_name":"Wang","first_name":"Yu-Xiang"},{"full_name":"Xie, Yusheng","last_name":"Xie","first_name":"Yusheng"},{"full_name":"Singh, Kunwar Yashraj","last_name":"Singh","first_name":"Kunwar Yashraj"},{"first_name":"Srikar","full_name":"Appalaraju, Srikar","last_name":"Appalaraju"},{"full_name":"Mahadevan, Vijay","last_name":"Mahadevan","first_name":"Vijay"},{"first_name":"Stefano","last_name":"Soatto","full_name":"Soatto, Stefano"}],"doi":"10.48550/arXiv.2203.16701","abstract":[{"lang":"eng","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."}],"year":"2022","date_updated":"2023-04-25T07:34:49Z","publication":"arXiv","article_number":"2203.16701","publication_status":"submitted","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","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>.","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>.","ieee":"S. Bombari <i>et al.</i>, “Towards differential relational privacy and its use in question answering,” <i>arXiv</i>. .","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>","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>","short":"S. Bombari, A. Achille, Z. Wang, Y.-X. Wang, Y. Xie, K.Y. Singh, S. Appalaraju, V. Mahadevan, S. Soatto, ArXiv (n.d.)."},"department":[{"_id":"GradSch"},{"_id":"MaMo"}],"day":"30","date_created":"2023-04-23T16:11:48Z","oa_version":"Preprint","date_published":"2022-03-30T00:00:00Z","external_id":{"arxiv":["2203.16701"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2203.16701"}],"arxiv":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"type":"preprint"},{"day":"02","citation":{"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.","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.","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>","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>","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.","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>.","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>."},"month":"06","ddc":["000"],"file_date_updated":"2023-05-05T09:06:00Z","conference":{"name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2022-06-02","location":"Grundlsee, Austria","start_date":"2022-05-31"},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2023-05-05T09:06:00Z","file_id":"12895","relation":"main_file","creator":"schloegl","file_size":7180531,"file_name":"BOOKLET_ASHPC22.pdf","date_updated":"2023-05-05T09:06:00Z","success":1,"checksum":"e3f8c240b85422ce2190e7b203cc2563","content_type":"application/pdf","access_level":"open_access"}],"has_accepted_license":"1","article_processing_charge":"No","author":[{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois"},{"full_name":"Hornoiu, Andrei","last_name":"Hornoiu","id":"77129392-B450-11EA-8745-D4653DDC885E","first_name":"Andrei"},{"last_name":"Elefante","full_name":"Elefante, Stefano","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87"},{"id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","full_name":"Stadlbauer, Stephan","last_name":"Stadlbauer"}],"title":"Where is the sweet spot? A procurement story of general purpose compute nodes","_id":"12894","doi":"10.25365/phaidra.337","publication_identifier":{"isbn":["978-3-200-08499-5"]},"status":"public","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","publication_status":"published","department":[{"_id":"ScienComp"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2022-06-02T00:00:00Z","date_created":"2023-05-05T09:13:42Z","publisher":"EuroCC Austria c/o Universität Wien","type":"conference_abstract","language":[{"iso":"eng"}],"oa":1,"year":"2022","publication":"ASHPC22 - Austrian-Slovenian HPC Meeting 2022","date_updated":"2023-05-16T07:42:56Z","page":"7"},{"publisher":"Springer Nature","intvolume":"        23","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"SiHi"},{"_id":"CaHe"},{"_id":"EdHa"},{"_id":"EM-Fac"},{"_id":"Bio"},{"_id":"MiSi"}],"date_created":"2021-08-06T09:09:11Z","scopus_import":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"PreCl"},{"_id":"LifeSc"}],"date_published":"2022-07-11T00:00:00Z","external_id":{"isi":["000822975900002"]},"date_updated":"2023-08-02T06:53:07Z","publication":"Nature Immunology","page":"1246-1255","article_type":"original","oa":1,"year":"2022","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"relation":"main_file","creator":"dernst","file_size":11475325,"file_name":"2022_NatureImmunology_Assen.pdf","checksum":"628e7b49809f22c75b428842efe70c68","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-07-25T07:11:32Z","success":1,"date_created":"2022-07-25T07:11:32Z","file_id":"11642"}],"volume":23,"article_processing_charge":"No","has_accepted_license":"1","ddc":["570"],"file_date_updated":"2022-07-25T07:11:32Z","month":"07","citation":{"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.","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.","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>","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>","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.","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>.","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>."},"day":"11","oa_version":"Published Version","project":[{"name":"Cellular navigation along spatial gradients","call_identifier":"H2020","grant_number":"724373","_id":"25FE9508-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"eissn":["1529-2916"],"issn":["1529-2908"]},"ec_funded":1,"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.","publication_status":"published","status":"public","_id":"9794","title":"Multitier mechanics control stromal adaptations in swelling lymph nodes","author":[{"orcid":"0000-0003-3470-6119","last_name":"Assen","full_name":"Assen, Frank P","first_name":"Frank P","id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jun","full_name":"Abe, Jun","last_name":"Abe"},{"orcid":"0000-0002-6625-3348","full_name":"Hons, Miroslav","last_name":"Hons","id":"4167FE56-F248-11E8-B48F-1D18A9856A87","first_name":"Miroslav"},{"full_name":"Hauschild, Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0001-9843-3522"},{"last_name":"Shamipour","full_name":"Shamipour, Shayan","first_name":"Shayan","id":"40B34FE2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-9735-5315","last_name":"Kaufmann","full_name":"Kaufmann, Walter","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-9732-3815","first_name":"Tommaso","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","full_name":"Costanzo, Tommaso"},{"full_name":"Krens, Gabriel","last_name":"Krens","id":"2B819732-F248-11E8-B48F-1D18A9856A87","first_name":"Gabriel","orcid":"0000-0003-4761-5996"},{"full_name":"Brown, Markus","last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus"},{"last_name":"Ludewig","full_name":"Ludewig, Burkhard","first_name":"Burkhard"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"},{"last_name":"Weninger","full_name":"Weninger, Wolfgang","first_name":"Wolfgang"},{"full_name":"Hannezo, Edouard B","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","orcid":"0000-0001-6005-1561"},{"first_name":"Sanjiv A.","full_name":"Luther, Sanjiv A.","last_name":"Luther"},{"first_name":"Jens V.","last_name":"Stein","full_name":"Stein, Jens V."},{"full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-4561-241X"}],"doi":"10.1038/s41590-022-01257-4","abstract":[{"lang":"eng","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."}]},{"oa_version":"None","day":"01","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>","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.","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>","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.","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>.","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>."},"pmid":1,"month":"02","volume":530,"article_processing_charge":"No","issue":"2","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."}],"doi":"10.1002/cne.25229","author":[{"first_name":"Rosana","last_name":"Reyes‐Pinto","full_name":"Reyes‐Pinto, Rosana"},{"first_name":"José L.","last_name":"Ferrán","full_name":"Ferrán, José L."},{"last_name":"Vega Zuniga","full_name":"Vega Zuniga, Tomas A","first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Cristian","last_name":"González‐Cabrera","full_name":"González‐Cabrera, Cristian"},{"last_name":"Luksch","full_name":"Luksch, Harald","first_name":"Harald"},{"first_name":"Jorge","last_name":"Mpodozis","full_name":"Mpodozis, Jorge"},{"first_name":"Luis","last_name":"Puelles","full_name":"Puelles, 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","_id":"9955","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.","publication_status":"published","status":"public","publication_identifier":{"issn":["0021-9967"],"eissn":["1096-9861"]},"external_id":{"pmid":["34363623"],"isi":["000686420000001"]},"date_published":"2022-02-01T00:00:00Z","scopus_import":"1","date_created":"2021-08-23T08:40:59Z","department":[{"_id":"MaJö"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","intvolume":"       530","publisher":"Wiley","year":"2022","article_type":"original","page":"553-573","publication":"Journal of Comparative Neurology","date_updated":"2023-08-11T10:58:17Z"},{"article_type":"original","page":"709-764","date_updated":"2023-08-02T06:53:51Z","publication":"Journal of the London Mathematical Society","year":"2022","oa":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","isi":1,"intvolume":"       105","publisher":"Wiley","scopus_import":"1","date_created":"2021-08-31T12:51:40Z","date_published":"2022-03-01T00:00:00Z","external_id":{"isi":["000755205700001"],"arxiv":["1811.05376"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TaHa"}],"ec_funded":1,"publication_status":"published","status":"public","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.","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"publication_identifier":{"eissn":["1469-7750"]},"doi":"10.1112/jlms.12506","issue":"2","abstract":[{"lang":"eng","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."}],"_id":"9977","author":[{"full_name":"Mistegaard, William","last_name":"Mistegaard","id":"41B03CD0-62AE-11E9-84EF-0718E6697425","first_name":"William"},{"last_name":"Andersen","full_name":"Andersen, Jørgen Ellegaard","first_name":"Jørgen Ellegaard"}],"title":"Resurgence analysis of quantum invariants of Seifert fibered homology spheres","volume":105,"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_id":"10917","date_created":"2022-03-24T11:42:25Z","file_name":"2022_JourLondonMathSoc_Andersen.pdf","relation":"main_file","creator":"dernst","file_size":649130,"success":1,"date_updated":"2022-03-24T11:42:25Z","access_level":"open_access","checksum":"9c72327d39f34f1a6eaa98fa4b8493f2","content_type":"application/pdf"}],"arxiv":1,"oa_version":"Published Version","month":"03","ddc":["510"],"file_date_updated":"2022-03-24T11:42:25Z","day":"01","citation":{"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>.","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>.","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>","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.","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>"}},{"conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual"},"oa_version":"Published Version","ddc":["000"],"month":"05","file_date_updated":"2022-01-26T07:41:16Z","day":"28","citation":{"short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, 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.","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.","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.","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.","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.","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."},"article_processing_charge":"No","volume":35,"has_accepted_license":"1","file":[{"file_id":"10684","date_created":"2022-01-26T07:41:16Z","access_level":"open_access","content_type":"application/pdf","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","success":1,"date_updated":"2022-01-26T07:41:16Z","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","file_size":137235,"creator":"mlechner","relation":"main_file"}],"arxiv":1,"issue":"5A","abstract":[{"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.","lang":"eng"}],"_id":"10665","author":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699"}],"title":"Scalable verification of quantized neural networks","ec_funded":1,"publication_status":"published","status":"public","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","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978-1-57735-866-4"]},"scopus_import":"1","date_created":"2022-01-25T15:15:02Z","external_id":{"arxiv":["2012.08185"]},"date_published":"2021-05-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"intvolume":"        35","publisher":"AAAI Press","year":"2021","alternative_title":["Technical Tracks"],"oa":1,"page":"3787-3795","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"date_updated":"2025-07-14T09:10:11Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"doi":"10.1109/ICRA48506.2021.9561036","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"title":"Adversarial training is not ready for robot learning","_id":"10666","publication_status":"published","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).","status":"public","publication_identifier":{"eisbn":["978-1-7281-9077-8"],"issn":["1050-4729"],"isbn":["978-1-7281-9078-5"],"eissn":["2577-087X"]},"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2021-06-05","start_date":"2021-05-30","location":"Xi'an, China"},"oa_version":"None","citation":{"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>","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.","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.","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>","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.","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>.","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>."},"ddc":["000"],"has_accepted_license":"1","article_processing_charge":"No","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"arxiv":1,"year":"2021","oa":1,"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"page":"4140-4147","publication":"2021 IEEE International Conference on Robotics and Automation","date_updated":"2023-08-17T06:58:38Z","date_published":"2021-01-01T00:00:00Z","external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"date_created":"2022-01-25T15:44:54Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","series_title":"ICRA","main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}]},{"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"10682","date_created":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","relation":"main_file","file_size":452492,"creator":"mlechner","success":1,"date_updated":"2022-01-26T07:39:59Z","access_level":"open_access","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"arxiv":1,"oa_version":"Published Version","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","location":"Virtual","start_date":"2021-12-06"},"month":"12","file_date_updated":"2022-01-26T07:39:59Z","ddc":["000"],"citation":{"ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","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>","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","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, .","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>","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>.","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>."},"day":"01","ec_funded":1,"publication_status":"published","status":"public","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.","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"doi":"10.48550/arXiv.2111.03165","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"}],"_id":"10667","title":"Infinite time horizon safety of Bayesian neural networks","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"date_created":"2022-01-25T15:45:58Z","date_published":"2021-12-01T00:00:00Z","external_id":{"arxiv":["2111.03165"]},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"date_updated":"2025-07-14T09:10:12Z","publication":"35th Conference on Neural Information Processing Systems","alternative_title":[" Advances in Neural Information Processing Systems"],"year":"2021","oa":1}]