[{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2309.09858","open_access":"1"}],"publication_status":"submitted","date_created":"2024-02-08T15:33:39Z","external_id":{"arxiv":["2309.09858"]},"abstract":[{"text":"In this paper, we show that recent advances in video representation learning\r\nand pre-trained vision-language models allow for substantial improvements in\r\nself-supervised video object localization. We propose a method that first\r\nlocalizes objects in videos via a slot attention approach and then assigns text\r\nto the obtained slots. The latter is achieved by an unsupervised way to read\r\nlocalized semantic information from the pre-trained CLIP model. The resulting\r\nvideo object localization is entirely unsupervised apart from the implicit\r\nannotation contained in CLIP, and it is effectively the first unsupervised\r\napproach that yields good results on regular video benchmarks.","lang":"eng"}],"title":"Unsupervised open-vocabulary object localization in videos","_id":"14962","year":"2023","arxiv":1,"department":[{"_id":"FrLo"}],"date_published":"2023-09-18T00:00:00Z","extern":"1","author":[{"full_name":"Fan, Ke","first_name":"Ke","last_name":"Fan"},{"first_name":"Zechen","full_name":"Bai, Zechen","last_name":"Bai"},{"last_name":"Xiao","first_name":"Tianjun","full_name":"Xiao, Tianjun"},{"last_name":"Zietlow","first_name":"Dominik","full_name":"Zietlow, Dominik"},{"last_name":"Horn","first_name":"Max","full_name":"Horn, Max"},{"full_name":"Zhao, Zixu","first_name":"Zixu","last_name":"Zhao"},{"first_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel"},{"first_name":"Mike Zheng","full_name":"Shou, Mike Zheng","last_name":"Shou"},{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco","last_name":"Locatello"},{"last_name":"Schiele","first_name":"Bernt","full_name":"Schiele, Bernt"},{"last_name":"Brox","full_name":"Brox, Thomas","first_name":"Thomas"},{"full_name":"Zhang, Zheng","first_name":"Zheng","last_name":"Zhang"},{"first_name":"Yanwei","full_name":"Fu, Yanwei","last_name":"Fu"},{"full_name":"He, Tong","first_name":"Tong","last_name":"He"}],"article_number":"2309.09858","type":"preprint","oa":1,"article_processing_charge":"No","citation":{"chicago":"Fan, Ke, Zechen Bai, Tianjun Xiao, Dominik Zietlow, Max Horn, Zixu Zhao, Carl-Johann Simon-Gabriel Carl-Johann Simon-Gabriel, et al. “Unsupervised Open-Vocabulary Object Localization in Videos.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.09858\">https://doi.org/10.48550/arXiv.2309.09858</a>.","ieee":"K. Fan <i>et al.</i>, “Unsupervised open-vocabulary object localization in videos,” <i>arXiv</i>. .","apa":"Fan, K., Bai, Z., Xiao, T., Zietlow, D., Horn, M., Zhao, Z., … He, T. (n.d.). Unsupervised open-vocabulary object localization in videos. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.09858\">https://doi.org/10.48550/arXiv.2309.09858</a>","ama":"Fan K, Bai Z, Xiao T, et al. Unsupervised open-vocabulary object localization in videos. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.09858\">10.48550/arXiv.2309.09858</a>","ista":"Fan K, Bai Z, Xiao T, Zietlow D, Horn M, Zhao Z, Carl-Johann Simon-Gabriel C-JS-G, Shou MZ, Locatello F, Schiele B, Brox T, Zhang Z, Fu Y, He T. Unsupervised open-vocabulary object localization in videos. arXiv, 2309.09858.","mla":"Fan, Ke, et al. “Unsupervised Open-Vocabulary Object Localization in Videos.” <i>ArXiv</i>, 2309.09858, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.09858\">10.48550/arXiv.2309.09858</a>.","short":"K. Fan, Z. Bai, T. Xiao, D. Zietlow, M. Horn, Z. Zhao, C.-J.S.-G. Carl-Johann Simon-Gabriel, M.Z. Shou, F. Locatello, B. Schiele, T. Brox, Z. Zhang, Y. Fu, T. He, ArXiv (n.d.)."},"language":[{"iso":"eng"}],"date_updated":"2024-02-12T10:12:22Z","doi":"10.48550/arXiv.2309.09858","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","month":"09","publication":"arXiv","day":"18"},{"oa_version":"Preprint","doi":"10.48550/arXiv.2309.00233","date_updated":"2024-02-12T10:16:21Z","status":"public","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","publication":"arXiv","article_number":"2309.00233","type":"preprint","article_processing_charge":"No","oa":1,"language":[{"iso":"eng"}],"citation":{"short":"Z. Zhao, J. Wang, M. Horn, Y. Ding, T. He, Z. Bai, D. Zietlow, C.-J.S.-G. Carl-Johann Simon-Gabriel, B. Shuai, Z. Tu, T. Brox, B. Schiele, Y. Fu, F. Locatello, Z. Zhang, T. Xiao, ArXiv (n.d.).","mla":"Zhao, Zixu, et al. “Object-Centric Multiple Object Tracking.” <i>ArXiv</i>, 2309.00233, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.00233\">10.48550/arXiv.2309.00233</a>.","ista":"Zhao Z, Wang J, Horn M, Ding Y, He T, Bai Z, Zietlow D, Carl-Johann Simon-Gabriel C-JS-G, Shuai B, Tu Z, Brox T, Schiele B, Fu Y, Locatello F, Zhang Z, Xiao T. Object-centric multiple object tracking. arXiv, 2309.00233.","ama":"Zhao Z, Wang J, Horn M, et al. Object-centric multiple object tracking. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.00233\">10.48550/arXiv.2309.00233</a>","apa":"Zhao, Z., Wang, J., Horn, M., Ding, Y., He, T., Bai, Z., … Xiao, T. (n.d.). Object-centric multiple object tracking. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.00233\">https://doi.org/10.48550/arXiv.2309.00233</a>","ieee":"Z. Zhao <i>et al.</i>, “Object-centric multiple object tracking,” <i>arXiv</i>. .","chicago":"Zhao, Zixu, Jiaze Wang, Max Horn, Yizhuo Ding, Tong He, Zechen Bai, Dominik Zietlow, et al. “Object-Centric Multiple Object Tracking.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.00233\">https://doi.org/10.48550/arXiv.2309.00233</a>."},"arxiv":1,"department":[{"_id":"FrLo"}],"year":"2023","_id":"14963","author":[{"full_name":"Zhao, Zixu","first_name":"Zixu","last_name":"Zhao"},{"first_name":"Jiaze","full_name":"Wang, Jiaze","last_name":"Wang"},{"last_name":"Horn","first_name":"Max","full_name":"Horn, Max"},{"last_name":"Ding","full_name":"Ding, Yizhuo","first_name":"Yizhuo"},{"last_name":"He","first_name":"Tong","full_name":"He, Tong"},{"last_name":"Bai","full_name":"Bai, Zechen","first_name":"Zechen"},{"full_name":"Zietlow, Dominik","first_name":"Dominik","last_name":"Zietlow"},{"last_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"last_name":"Shuai","first_name":"Bing","full_name":"Shuai, Bing"},{"last_name":"Tu","first_name":"Zhuowen","full_name":"Tu, Zhuowen"},{"last_name":"Brox","full_name":"Brox, Thomas","first_name":"Thomas"},{"last_name":"Schiele","first_name":"Bernt","full_name":"Schiele, Bernt"},{"last_name":"Fu","full_name":"Fu, Yanwei","first_name":"Yanwei"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"},{"first_name":"Zheng","full_name":"Zhang, Zheng","last_name":"Zhang"},{"last_name":"Xiao","full_name":"Xiao, Tianjun","first_name":"Tianjun"}],"extern":"1","date_published":"2023-09-01T00:00:00Z","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2309.00233","open_access":"1"}],"publication_status":"submitted","date_created":"2024-02-08T15:34:43Z","external_id":{"arxiv":["2309.00233"]},"title":"Object-centric multiple object tracking","abstract":[{"lang":"eng","text":"Unsupervised object-centric learning methods allow the partitioning of scenes\r\ninto entities without additional localization information and are excellent\r\ncandidates for reducing the annotation burden of multiple-object tracking (MOT)\r\npipelines. Unfortunately, they lack two key properties: objects are often split\r\ninto parts and are not consistently tracked over time. In fact,\r\nstate-of-the-art models achieve pixel-level accuracy and temporal consistency\r\nby relying on supervised object detection with additional ID labels for the\r\nassociation through time. This paper proposes a video object-centric model for\r\nMOT. It consists of an index-merge module that adapts the object-centric slots\r\ninto detection outputs and an object memory module that builds complete object\r\nprototypes to handle occlusions. Benefited from object-centric learning, we\r\nonly require sparse detection labels (0%-6.25%) for object localization and\r\nfeature binding. Relying on our self-supervised\r\nExpectation-Maximization-inspired loss for object association, our approach\r\nrequires no ID labels. Our experiments significantly narrow the gap between the\r\nexisting object-centric model and the fully supervised state-of-the-art and\r\noutperform several unsupervised trackers."}]},{"publication":"Interdisciplinary Materials","day":"01","doi":"10.1002/idm2.12056","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_identifier":{"eissn":["2767-441X"]},"language":[{"iso":"eng"}],"article_type":"original","acknowledgement":"The authors would like to acknowledge the strong supportof microstructure observation from Center for HighPressure Science and Technology Advanced Research(HPSTAR). We acknowledge the financial support fromthe  National  Natural  Science  Foundation  of  China:52172236, the Fundamental Research Funds for theCentral Universities: xtr042021007, Top Young TalentsProgramme of Xi'an Jiaotong University and NationalScience Fund for Distinguished Young Scholars: 51925101.","year":"2023","department":[{"_id":"MaIb"}],"title":"Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"file":[{"relation":"main_file","file_name":"2023_InterdiscMaterials_Liu.pdf","file_size":4675941,"success":1,"content_type":"application/pdf","date_updated":"2024-02-19T09:58:32Z","checksum":"7b5e8210ef1434feb173022c6dbbee0c","creator":"dernst","date_created":"2024-02-19T09:58:32Z","access_level":"open_access","file_id":"15015"}],"date_updated":"2024-02-19T10:01:26Z","oa_version":"Published Version","ddc":["540"],"status":"public","month":"01","article_processing_charge":"Yes","citation":{"chicago":"Liu, Zhengtao, Tao Hong, Liqing Xu, Sining Wang, Xiang Gao, Cheng Chang, Xiangdong Ding, Yu Xiao, and Li‐Dong Zhao. “Lattice Expansion Enables Interstitial Doping to Achieve a High Average ZT in N‐type PbS.” <i>Interdisciplinary Materials</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/idm2.12056\">https://doi.org/10.1002/idm2.12056</a>.","apa":"Liu, Z., Hong, T., Xu, L., Wang, S., Gao, X., Chang, C., … Zhao, L. (2023). Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS. <i>Interdisciplinary Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/idm2.12056\">https://doi.org/10.1002/idm2.12056</a>","ieee":"Z. Liu <i>et al.</i>, “Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS,” <i>Interdisciplinary Materials</i>, vol. 2, no. 1. Wiley, pp. 161–170, 2023.","ama":"Liu Z, Hong T, Xu L, et al. Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS. <i>Interdisciplinary Materials</i>. 2023;2(1):161-170. doi:<a href=\"https://doi.org/10.1002/idm2.12056\">10.1002/idm2.12056</a>","ista":"Liu Z, Hong T, Xu L, Wang S, Gao X, Chang C, Ding X, Xiao Y, Zhao L. 2023. Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS. Interdisciplinary Materials. 2(1), 161–170.","mla":"Liu, Zhengtao, et al. “Lattice Expansion Enables Interstitial Doping to Achieve a High Average ZT in N‐type PbS.” <i>Interdisciplinary Materials</i>, vol. 2, no. 1, Wiley, 2023, pp. 161–70, doi:<a href=\"https://doi.org/10.1002/idm2.12056\">10.1002/idm2.12056</a>.","short":"Z. Liu, T. Hong, L. Xu, S. Wang, X. Gao, C. Chang, X. Ding, Y. Xiao, L. Zhao, Interdisciplinary Materials 2 (2023) 161–170."},"has_accepted_license":"1","publisher":"Wiley","type":"journal_article","intvolume":"         2","date_published":"2023-01-01T00:00:00Z","page":"161-170","volume":2,"author":[{"last_name":"Liu","first_name":"Zhengtao","full_name":"Liu, Zhengtao"},{"first_name":"Tao","full_name":"Hong, Tao","last_name":"Hong"},{"first_name":"Liqing","full_name":"Xu, Liqing","last_name":"Xu"},{"full_name":"Wang, Sining","first_name":"Sining","last_name":"Wang"},{"first_name":"Xiang","full_name":"Gao, Xiang","last_name":"Gao"},{"first_name":"Cheng","full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","orcid":"0000-0002-9515-4277","last_name":"Chang"},{"full_name":"Ding, Xiangdong","first_name":"Xiangdong","last_name":"Ding"},{"last_name":"Xiao","full_name":"Xiao, Yu","first_name":"Yu"},{"last_name":"Zhao","first_name":"Li‐Dong","full_name":"Zhao, Li‐Dong"}],"issue":"1","quality_controlled":"1","_id":"14985","publication_status":"published","date_created":"2024-02-14T12:12:17Z","abstract":[{"lang":"eng","text":"Lead sulfide (PbS) presents large potential in thermoelectric application due to its earth-abundant S element. However, its inferior average ZT (ZTave) value makes PbS less competitive with its analogs PbTe and PbSe. To promote its thermoelectric performance, this study implements strategies of continuous Se alloying and Cu interstitial doping to synergistically tune thermal and electrical transport properties in n-type PbS. First, the lattice parameter of 5.93 Å in PbS is linearly expanded to 6.03 Å in PbS0.5Se0.5 with increasing Se alloying content. This expanded lattice in Se-alloyed PbS not only intensifies phonon scattering but also facilitates the formation of Cu interstitials. Based on the PbS0.6Se0.4 content with the minimal lattice thermal conductivity, Cu interstitials are introduced to improve the electron density, thus boosting the peak power factor, from 3.88 μW cm−1 K−2 in PbS0.6Se0.4 to 20.58 μW cm−1 K−2 in PbS0.6Se0.4−1%Cu. Meanwhile, the lattice thermal conductivity in PbS0.6Se0.4−x%Cu (x = 0–2) is further suppressed due to the strong strain field caused by Cu interstitials. Finally, with the lowered thermal conductivity and high electrical transport properties, a peak ZT ~1.1 and ZTave ~0.82 can be achieved in PbS0.6Se0.4 − 1%Cu at 300–773K, which outperforms previously reported n-type PbS."}],"file_date_updated":"2024-02-19T09:58:32Z"},{"publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","day":"01","date_updated":"2024-02-19T12:11:15Z","doi":"10.14722/ndss.2023.24545","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","month":"03","oa":1,"article_processing_charge":"No","citation":{"chicago":"Malvai, Harjasleen, Eleftherios Kokoris Kogias, Alberto Sonnino, Esha Ghosh, Ercan Oztürk, Kevin Lewi, and Sean Lawlor. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society, 2023. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>.","ieee":"H. Malvai <i>et al.</i>, “Parakeet: Practical key transparency for end-to-end eEncrypted messaging,” in <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, San Diego, CA, United States, 2023.","apa":"Malvai, H., Kokoris Kogias, E., Sonnino, A., Ghosh, E., Oztürk, E., Lewi, K., &#38; Lawlor, S. (2023). Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. San Diego, CA, United States: Internet Society. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>","ama":"Malvai H, Kokoris Kogias E, Sonnino A, et al. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In: <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society; 2023. doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>","ista":"Malvai H, Kokoris Kogias E, Sonnino A, Ghosh E, Oztürk E, Lewi K, Lawlor S. 2023. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. Proceedings of the 2023 Network and Distributed System Security Symposium. NDSS: Network and Distributed Systems Security.","mla":"Malvai, Harjasleen, et al. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, Internet Society, 2023, doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>.","short":"H. Malvai, E. Kokoris Kogias, A. Sonnino, E. Ghosh, E. Oztürk, K. Lewi, S. Lawlor, in:, Proceedings of the 2023 Network and Distributed System Security Symposium, Internet Society, 2023."},"publisher":"Internet Society","publication_identifier":{"isbn":["1891562835"]},"language":[{"iso":"eng"}],"type":"conference","date_published":"2023-03-01T00:00:00Z","conference":{"start_date":"2023-02-27","location":"San Diego, CA, United States","name":"NDSS: Network and Distributed Systems Security","end_date":"2023-03-03"},"author":[{"last_name":"Malvai","full_name":"Malvai, Harjasleen","first_name":"Harjasleen"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"full_name":"Sonnino, Alberto","first_name":"Alberto","last_name":"Sonnino"},{"full_name":"Ghosh, Esha","first_name":"Esha","last_name":"Ghosh"},{"last_name":"Oztürk","first_name":"Ercan","full_name":"Oztürk, Ercan"},{"first_name":"Kevin","full_name":"Lewi, Kevin","last_name":"Lewi"},{"last_name":"Lawlor","first_name":"Sean","full_name":"Lawlor, Sean"}],"quality_controlled":"1","acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","_id":"14989","year":"2023","department":[{"_id":"ElKo"}],"date_created":"2024-02-14T14:20:40Z","publication_status":"published","abstract":[{"lang":"eng","text":"Encryption alone is not enough for secure end-to end encrypted messaging: a server must also honestly serve public keys to users. Key transparency has been presented as an efficient\r\nsolution for detecting (and hence deterring) a server that attempts to dishonestly serve keys. Key transparency involves two major components: (1) a username to public key mapping, stored and cryptographically committed to by the server, and, (2) an outof-band consistency protocol for serving short commitments to users. In the setting of real-world deployments and supporting production scale, new challenges must be considered for both of these components. We enumerate these challenges and provide solutions to address them. In particular, we design and implement a memory-optimized and privacy-preserving verifiable data structure for committing to the username to public key store.\r\nTo make this implementation viable for production, we also integrate support for persistent and distributed storage. We also propose a future-facing solution, termed “compaction”, as\r\na mechanism for mitigating practical issues that arise from dealing with infinitely growing server data structures. Finally, we implement a consensusless solution that achieves the minimum requirements for a service that consistently distributes commitments for a transparency application, providing a much more efficient protocol for distributing small and consistent\r\ncommitments to users. This culminates in our production-grade implementation of a key transparency system (Parakeet) which we have open-sourced, along with a demonstration of feasibility through our benchmarks."}],"title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/081"}]},{"related_material":{"record":[{"relation":"used_in_publication","id":"13139","status":"public"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"18","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","month":"01","date_updated":"2024-02-27T07:19:32Z","doi":"10.5281/ZENODO.7548214","oa_version":"Published Version","citation":{"short":"T. Meggendorfer, (2023).","mla":"Meggendorfer, Tobias. <i>Artefact for: Correct Approximation of Stationary Distributions</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","ama":"Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>","ista":"Meggendorfer T. 2023. Artefact for: Correct Approximation of Stationary Distributions, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","apa":"Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.","chicago":"Meggendorfer, Tobias. “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>."},"has_accepted_license":"1","publisher":"Zenodo","oa":1,"article_processing_charge":"No","type":"research_data_reference","date_published":"2023-01-18T00:00:00Z","author":[{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer"}],"year":"2023","_id":"14990","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"The software artefact to evaluate the approximation of stationary distributions implementation."}],"title":"Artefact for: Correct Approximation of Stationary Distributions","date_created":"2024-02-14T14:27:06Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7548214"}]},{"oa_version":"Published Version","doi":"10.5281/ZENODO.7757041","date_updated":"2024-02-27T07:26:31Z","status":"public","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["550"],"day":"23","related_material":{"record":[{"id":"14654","relation":"used_in_publication","status":"public"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"research_data_reference","ec_funded":1,"article_processing_charge":"No","oa":1,"publisher":"Zenodo","has_accepted_license":"1","citation":{"chicago":"Hwong, Yi-Ling, Maxime Colin, Philipp Aglas, Caroline J Muller, and Steven C. Sherwood. “Data-Assessing Memory in Convection Schemes Using Idealized Tests.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7757041\">https://doi.org/10.5281/ZENODO.7757041</a>.","apa":"Hwong, Y.-L., Colin, M., Aglas, P., Muller, C. J., &#38; Sherwood, S. C. (2023). Data-assessing memory in convection schemes using idealized tests. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7757041\">https://doi.org/10.5281/ZENODO.7757041</a>","ieee":"Y.-L. Hwong, M. Colin, P. Aglas, C. J. Muller, and S. C. Sherwood, “Data-assessing memory in convection schemes using idealized tests.” Zenodo, 2023.","ama":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood SC. Data-assessing memory in convection schemes using idealized tests. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>","ista":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood SC. 2023. Data-assessing memory in convection schemes using idealized tests, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>.","mla":"Hwong, Yi-Ling, et al. <i>Data-Assessing Memory in Convection Schemes Using Idealized Tests</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>.","short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S.C. Sherwood, (2023)."},"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"department":[{"_id":"CaMu"}],"_id":"14991","year":"2023","author":[{"last_name":"Hwong","full_name":"Hwong, Yi-Ling","orcid":"0000-0001-9281-3479","first_name":"Yi-Ling","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22"},{"full_name":"Colin, Maxime","first_name":"Maxime","last_name":"Colin"},{"last_name":"Aglas","id":"02eace56-97fc-11ee-b81a-f0939ca85a77","first_name":"Philipp","full_name":"Aglas, Philipp"},{"first_name":"Caroline J","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller"},{"last_name":"Sherwood","full_name":"Sherwood, Steven C.","first_name":"Steven C."}],"date_published":"2023-06-23T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7757041"}],"date_created":"2024-02-14T14:37:57Z","abstract":[{"text":"This repository contains the data, scripts, WRF codes and files required to reproduce the results of the manuscript \"Assessing Memory in Convection Schemes Using Idealized Tests\" submitted to the Journal of Advances in Modeling Earth Systems (JAMES).","lang":"eng"}],"title":"Data-assessing memory in convection schemes using idealized tests"},{"type":"book_chapter","publisher":"Springer","citation":{"chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “Universal Functionals in Density Functional Theory.” In <i>Density Functional Theory</i>, edited by Eric Cances and Gero Friesecke, 1st ed., 115–82. MAMOMO. Springer, 2023. <a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">https://doi.org/10.1007/978-3-031-22340-2_3</a>.","apa":"Lewin, M., Lieb, E. H., &#38; Seiringer, R. (2023). Universal Functionals in Density Functional Theory. In E. Cances &#38; G. Friesecke (Eds.), <i>Density Functional Theory</i> (1st ed., pp. 115–182). Springer. <a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">https://doi.org/10.1007/978-3-031-22340-2_3</a>","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “Universal Functionals in Density Functional Theory,” in <i>Density Functional Theory</i>, 1st ed., E. Cances and G. Friesecke, Eds. Springer, 2023, pp. 115–182.","ama":"Lewin M, Lieb EH, Seiringer R. Universal Functionals in Density Functional Theory. In: Cances E, Friesecke G, eds. <i>Density Functional Theory</i>. 1st ed. MAMOMO. Springer; 2023:115-182. doi:<a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">10.1007/978-3-031-22340-2_3</a>","ista":"Lewin M, Lieb EH, Seiringer R. 2023.Universal Functionals in Density Functional Theory. In: Density Functional Theory. Mathematics and Molecular Modeling, , 115–182.","short":"M. Lewin, E.H. Lieb, R. Seiringer, in:, E. Cances, G. Friesecke (Eds.), Density Functional Theory, 1st ed., Springer, 2023, pp. 115–182.","mla":"Lewin, Mathieu, et al. “Universal Functionals in Density Functional Theory.” <i>Density Functional Theory</i>, edited by Eric Cances and Gero Friesecke, 1st ed., Springer, 2023, pp. 115–82, doi:<a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">10.1007/978-3-031-22340-2_3</a>."},"article_processing_charge":"No","status":"public","month":"07","oa_version":"Preprint","date_updated":"2024-02-20T08:33:06Z","series_title":"MAMOMO","abstract":[{"lang":"eng","text":"In this chapter we first review the Levy–Lieb functional, which gives the lowest kinetic and interaction energy that can be reached with all possible quantum states having a given density. We discuss two possible convex generalizations of this functional, corresponding to using mixed canonical and grand-canonical states, respectively. We present some recent works about the local density approximation, in which the functionals get replaced by purely local functionals constructed using the uniform electron gas energy per unit volume. We then review the known upper and lower bounds on the Levy–Lieb functionals. We start with the kinetic energy alone, then turn to the classical interaction alone, before we are able to put everything together. A later section is devoted to the Hohenberg–Kohn theorem and the role of many-body unique continuation in its proof."}],"date_created":"2024-02-14T14:44:33Z","external_id":{"arxiv":["1912.10424"]},"publication_status":"published","_id":"14992","quality_controlled":"1","author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"last_name":"Lieb","first_name":"Elliott H.","full_name":"Lieb, Elliott H."},{"full_name":"Seiringer, Robert","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"page":"115-182","date_published":"2023-07-19T00:00:00Z","publication_identifier":{"isbn":["9783031223396"],"issn":["3005-0286"],"eisbn":["9783031223402"]},"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Cances","full_name":"Cances, Eric","first_name":"Eric"},{"last_name":"Friesecke","full_name":"Friesecke, Gero","first_name":"Gero"}],"doi":"10.1007/978-3-031-22340-2_3","day":"19","publication":"Density Functional Theory","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1912.10424"}],"edition":"1","title":"Universal Functionals in Density Functional Theory","alternative_title":["Mathematics and Molecular Modeling"],"department":[{"_id":"RoSe"}],"arxiv":1,"year":"2023"},{"date_updated":"2024-02-28T12:12:00Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","status":"public","publication":"1st Workshop on Machine Learning & Global Health","day":"02","type":"conference","oa":1,"article_processing_charge":"No","citation":{"chicago":"Currin, Christopher, Mercy Nyamewaa Asiedu , Chris Fourie, Benjamin Rosman, Houcemeddine Turki, Atnafu Lambebo Tonja, Jade Abbott, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” In <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview, 2023.","ieee":"C. Currin <i>et al.</i>, “A framework for grassroots research collaboration in machine learning and global health,” in <i>1st Workshop on Machine Learning &#38; Global Health</i>, Kigali, Rwanda, 2023.","apa":"Currin, C., Asiedu , M. N., Fourie, C., Rosman, B., Turki, H., Lambebo Tonja, A., … Machangara, D. (2023). A framework for grassroots research collaboration in machine learning and global health. In <i>1st Workshop on Machine Learning &#38; Global Health</i>. Kigali, Rwanda: OpenReview.","ama":"Currin C, Asiedu  MN, Fourie C, et al. A framework for grassroots research collaboration in machine learning and global health. In: <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview; 2023.","ista":"Currin C, Asiedu  MN, Fourie C, Rosman B, Turki H, Lambebo Tonja A, Abbott J, Ajala M, Adedayo SA, Emezue CC, Machangara D. 2023. A framework for grassroots research collaboration in machine learning and global health. 1st Workshop on Machine Learning &#38; Global Health. ICLR: International Conference on Learning Representations.","short":"C. Currin, M.N. Asiedu , C. Fourie, B. Rosman, H. Turki, A. Lambebo Tonja, J. Abbott, M. Ajala, S.A. Adedayo, C.C. Emezue, D. Machangara, in:, 1st Workshop on Machine Learning &#38; Global Health, OpenReview, 2023.","mla":"Currin, Christopher, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” <i>1st Workshop on Machine Learning &#38; Global Health</i>, OpenReview, 2023."},"publisher":"OpenReview","language":[{"iso":"eng"}],"acknowledgement":"Houcemeddine Turki’s contributions to this final output have been funded through the Adapting\r\nWikidata to support clinical practice using Data Science, Semantic Web and Machine Learning\r\nproject, which is part of the Wikimedia Research Fund maintained by the Wikimedia Foundation in San Francisco, California, United States of America.","quality_controlled":"1","year":"2023","_id":"14993","department":[{"_id":"TiVo"}],"conference":{"start_date":"2023-05-05","location":"Kigali, Rwanda","end_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations"},"date_published":"2023-03-02T00:00:00Z","author":[{"id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","orcid":"0000-0002-4809-5059","full_name":"Currin, Christopher","first_name":"Christopher","last_name":"Currin"},{"first_name":"Mercy Nyamewaa","full_name":"Asiedu , Mercy Nyamewaa","last_name":"Asiedu "},{"full_name":"Fourie, Chris","first_name":"Chris","last_name":"Fourie"},{"last_name":"Rosman","first_name":"Benjamin","full_name":"Rosman, Benjamin"},{"last_name":"Turki","full_name":"Turki, Houcemeddine","first_name":"Houcemeddine"},{"last_name":"Lambebo Tonja","full_name":"Lambebo Tonja, Atnafu","first_name":"Atnafu"},{"last_name":"Abbott","first_name":"Jade","full_name":"Abbott, Jade"},{"last_name":"Ajala","first_name":"Marvellous","full_name":"Ajala, Marvellous"},{"last_name":"Adedayo","full_name":"Adedayo, Sadiq Adewale","first_name":"Sadiq Adewale"},{"first_name":"Chris Chinenye","full_name":"Emezue, Chris Chinenye","last_name":"Emezue"},{"full_name":"Machangara, Daphne","first_name":"Daphne","last_name":"Machangara"}],"main_file_link":[{"url":"https://openreview.net/forum?id=jHY_G91R880","open_access":"1"}],"publication_status":"published","date_created":"2024-02-14T15:11:48Z","title":"A framework for grassroots research collaboration in machine learning and global health","abstract":[{"text":"Traditional top-down approaches for global health have historically failed to achieve social progress (Hoffman et al., 2015; Hoffman & Røttingen, 2015). Recently, however, a more holistic, multi-level approach termed One Health (OH) (Osterhaus et al., 2020) is being adopted. Several sets of challenges have been identified for the implementation of OH (dos S. Ribeiro et al., 2019), including policy and funding, education and training, and multi-actor, multi-domain, and multi-level collaborations. These exist despite the increasing accessibility to\r\nknowledge and digital collaborative research tools through the internet. To address some of these challenges, we propose a general framework for grassroots community-based means of participatory research. Additionally, we present a specific roadmap to create a Machine Learning for Global Health community in Africa. The proposed framework aims to enable any small group of individuals with scarce resources to build and sustain an online community within approximately two years. We provide a discussion on the potential impact of the proposed framework for global health research collaborations.","lang":"eng"}]},{"citation":{"ama":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>","ista":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. 2023. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>.","short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).","mla":"Majumdar, Rupak, et al. <i>A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>.","chicago":"Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7877790\">https://doi.org/10.5281/ZENODO.7877790</a>.","ieee":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties.” Zenodo, 2023.","apa":"Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &#38; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7877790\">https://doi.org/10.5281/ZENODO.7877790</a>"},"publisher":"Zenodo","has_accepted_license":"1","oa":1,"article_processing_charge":"No","type":"research_data_reference","related_material":{"record":[{"status":"public","id":"14758","relation":"used_in_publication"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"28","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","month":"04","doi":"10.5281/ZENODO.7877790","date_updated":"2024-02-27T07:39:51Z","oa_version":"Published Version","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","abstract":[{"text":"This resource contains the artifacts for reproducing the experimental results presented in the paper titled \"A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties\" that has been submitted in CAV 2023.","lang":"eng"}],"date_created":"2024-02-14T15:13:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877790"}],"date_published":"2023-04-28T00:00:00Z","author":[{"full_name":"Majumdar, Rupak","first_name":"Rupak","last_name":"Majumdar"},{"first_name":"Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","last_name":"Mallik"},{"full_name":"Rychlicki, Mateusz","first_name":"Mateusz","last_name":"Rychlicki"},{"last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin","first_name":"Anne-Kathrin"},{"full_name":"Soudjani, Sadegh","first_name":"Sadegh","last_name":"Soudjani"}],"_id":"14994","year":"2023","department":[{"_id":"ToHe"}]},{"article_processing_charge":"No","oa":1,"publisher":"Zenodo","citation":{"ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).","mla":"Koval, Nikita, et al. <i>Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>.","chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7877757\">https://doi.org/10.5281/ZENODO.7877757</a>.","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM.” Zenodo, 2023.","apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7877757\">https://doi.org/10.5281/ZENODO.7877757</a>"},"type":"research_data_reference","day":"28","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14260"}]},"oa_version":"Published Version","date_updated":"2024-02-27T07:46:52Z","doi":"10.5281/ZENODO.7877757","status":"public","month":"04","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-02-14T15:14:13Z","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","abstract":[{"text":"Lincheck is a new practical and user-friendly framework for testing concurrent data structures on the Java Virtual Machine (JVM). It provides a simple and declarative way to write concurrent tests. Instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. \r\nThe artifact presents a collection of Lincheck tests that discover new bugs in popular libraries and implementations from the concurrency literature -- they are listed in Table 1, Section 3. To evaluate the performance of Lincheck analysis, the collection of tests also includes those which check correct data structures and, thus, always succeed. Similarly to Table 2, Section 3, the experiments demonstrate the reasonable time to perform a test. Finally, Lincheck provides user-friendly output with an easy-to-follow trace to reproduce a detected error, significantly simplifying further investigation.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877757"}],"author":[{"last_name":"Koval","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","full_name":"Koval, Nikita","first_name":"Nikita"},{"last_name":"Fedorov","full_name":"Fedorov, Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander"},{"last_name":"Sokolova","full_name":"Sokolova, Maria","first_name":"Maria"},{"first_name":"Dmitry","full_name":"Tsitelov, Dmitry","last_name":"Tsitelov"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"date_published":"2023-04-28T00:00:00Z","department":[{"_id":"DaAl"}],"year":"2023","_id":"14995"},{"oa_version":"Preprint","date_updated":"2025-07-14T09:10:04Z","status":"public","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","publication":"37th Conference on Neural Information Processing Systems","type":"conference","ec_funded":1,"article_processing_charge":"No","oa":1,"language":[{"iso":"eng"}],"citation":{"short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.","mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: <i>37th Conference on Neural Information Processing Systems</i>. ; 2023.","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LO, United States.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LO, United States, 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In <i>37th Conference on Neural Information Processing Systems</i>, 2023."},"quality_controlled":"1","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"arxiv":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"year":"2023","_id":"15023","author":[{"last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"last_name":"Verma","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6","first_name":"Abhinav","full_name":"Verma, Abhinav"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"conference":{"start_date":"2023-12-10","end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems","location":"New Orleans, LO, United States"},"date_published":"2023-12-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.01456"}],"publication_status":"epub_ahead","external_id":{"arxiv":["2312.01456"]},"date_created":"2024-02-25T09:23:24Z","abstract":[{"text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.","lang":"eng"}],"title":"Compositional policy learning in stochastic control systems with formal guarantees"},{"day":"13","related_material":{"record":[{"status":"public","id":"15001","relation":"used_in_publication"}]},"tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa_version":"Published Version","date_updated":"2024-02-26T08:45:55Z","status":"public","month":"12","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa":1,"publisher":"Figshare","has_accepted_license":"1","citation":{"chicago":"Curk, Samo. “Aggregation_data.” Figshare, 2023.","apa":"Curk, S. (2023). aggregation_data. Figshare.","ieee":"S. Curk, “aggregation_data.” Figshare, 2023.","ama":"Curk S. aggregation_data. 2023.","ista":"Curk S. 2023. aggregation_data, Figshare.","short":"S. Curk, (2023).","mla":"Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023."},"type":"research_data_reference","author":[{"orcid":"0000-0001-6160-9766","id":"031eff0d-d481-11ee-8508-cd12a7a86e5b","full_name":"Curk, Samo","first_name":"Samo","last_name":"Curk"}],"date_published":"2023-12-13T00:00:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","department":[{"_id":"AnSa"}],"_id":"15027","year":"2023","date_created":"2024-02-26T08:37:57Z","title":"aggregation_data","abstract":[{"lang":"eng","text":"This data repository underpins the paper, published in PNAS (doi pending) and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777)."}],"main_file_link":[{"open_access":"1","url":"https://figshare.com/s/85798bba4ebc68d822ed"}]},{"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8191722","open_access":"1"}],"date_created":"2024-02-28T07:34:34Z","abstract":[{"text":"This artifact aims to reproduce experiments from the paper Monitoring Hyperproperties With Prefix Transducers accepted at RV'23, and give further pointers to implementation of prefix transducers.\r\nIt has two parts: a pre-compiled docker image and sources that one can use to compile (locally or in docker) the software and run the experiments.","lang":"eng"}],"title":"Monitoring hyperproperties with prefix transducers","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"department":[{"_id":"ToHe"}],"_id":"15035","year":"2023","author":[{"last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","full_name":"Chalupa, Marek"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"date_published":"2023-07-28T00:00:00Z","type":"research_data_reference","ec_funded":1,"article_processing_charge":"No","oa":1,"has_accepted_license":"1","publisher":"Zenodo","citation":{"ama":"Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>","ista":"Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","mla":"Chalupa, Marek, and Thomas A. Henzinger. <i>Monitoring Hyperproperties with Prefix Transducers</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","short":"M. Chalupa, T.A. Henzinger, (2023).","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>.","ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023.","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>"},"oa_version":"Published Version","doi":"10.5281/ZENODO.8191723","date_updated":"2024-02-28T12:33:09Z","month":"07","status":"public","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"28","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"status":"public","id":"14076","relation":"used_in_publication"}]}},{"date_published":"2023-11-10T00:00:00Z","author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach"},{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"year":"2023","_id":"15039","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"arxiv":1,"date_created":"2024-02-28T17:59:32Z","external_id":{"arxiv":["2311.06103"]},"publication_status":"submitted","abstract":[{"lang":"eng","text":"A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives for networks with a small Lipschitz constant. Several recent works have focused on how to construct such Lipschitz networks, typically by imposing constraints on the weight matrices. In this work, we study an orthogonal aspect, namely the role of the activation function. We show that commonly used activation functions, such as MaxMin, as well as all piece-wise linear ones with two segments unnecessarily restrict the class of representable functions, even in the simplest one-dimensional setting. We furthermore introduce the new N-activation function that is provably more expressive than currently popular activation functions. We provide code at this https URL."}],"title":"1-Lipschitz neural networks are more expressive with N-activations","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.06103","open_access":"1"}],"publication":"arXiv","day":"10","doi":"10.48550/ARXIV.2311.06103","date_updated":"2024-03-04T07:02:39Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","status":"public","oa":1,"article_processing_charge":"No","citation":{"mla":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, 2311.06103, doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>.","short":"B. Prach, C. Lampert, ArXiv (n.d.).","ista":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. arXiv, 2311.06103.","ama":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>","apa":"Prach, B., &#38; Lampert, C. (n.d.). 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>","ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. .","chicago":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>."},"language":[{"iso":"eng"}],"article_number":"2311.06103","type":"preprint"},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"oa":1,"article_type":"original","article_number":"131","publication":"The Astrophysical Journal","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.3847/1538-4357/acd118","title":"Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations","year":"2023","department":[{"_id":"LiBu"}],"acknowledgement":"This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the NASA Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. We acknowledge that this research was supported in part by the National Science Foundation under grant No. NSF PHY-1748958. S.M. acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship No. RYC-2015-17697, the grant No. PID2019-107061GB-C66, and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.M. and D.G.R. acknowledge support from the Spanish Ministry of Science and Innovation (MICINN) with the grant No. PID2019-107187GB-I00. Z.R.C. acknowledges support from National Aeronautics and Space Administration via the TESS Guest Investigator Program (grant No. 80NSSC18K18584). The work presented here was partially supported by the NASA grant NNX17AF27G. A.R.G.S. acknowledges the support by FCT through national funds and by FEDER through COMPETE2020 by the following grants: UIDB/04434/2020 and UIDP/04434/2020. A.R.G.S. is supported by FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. R.A.G., L.A., and S.N.B. acknowledge the support from PLATO and GOLF CNES grants. S.N.B. acknowledges support from PLATO ASI-INAF agreement No. 2015-019-R.1-2018.","citation":{"ieee":"S. Mathur <i>et al.</i>, “Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations,” <i>The Astrophysical Journal</i>, vol. 952, no. 2. American Astronomical Society, 2023.","apa":"Mathur, S., Claytor, Z. R., Santos, Â. R. G., García, R. A., Amard, L., Bugnet, L. A., … van Saders, J. (2023). Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>","chicago":"Mathur, Savita, Zachary R. Claytor, Ângela R. G. Santos, Rafael A. García, Louis Amard, Lisa Annabelle Bugnet, Enrico Corsaro, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2023. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>.","short":"S. Mathur, Z.R. Claytor, Â.R.G. Santos, R.A. García, L. Amard, L.A. Bugnet, E. Corsaro, A. Bonanno, S.N. Breton, D. Godoy-Rivera, M.H. Pinsonneault, J. van Saders, The Astrophysical Journal 952 (2023).","mla":"Mathur, Savita, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>, vol. 952, no. 2, 131, American Astronomical Society, 2023, doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>.","ama":"Mathur S, Claytor ZR, Santos ÂRG, et al. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. 2023;952(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>","ista":"Mathur S, Claytor ZR, Santos ÂRG, García RA, Amard L, Bugnet LA, Corsaro E, Bonanno A, Breton SN, Godoy-Rivera D, Pinsonneault MH, van Saders J. 2023. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. 952(2), 131."},"publisher":"American Astronomical Society","has_accepted_license":"1","article_processing_charge":"Yes","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"file":[{"relation":"main_file","date_updated":"2023-08-02T07:42:26Z","content_type":"application/pdf","success":1,"file_size":4192386,"file_name":"2023_AstrophysicalJour_Mathur.pdf","access_level":"open_access","date_created":"2023-08-02T07:42:26Z","checksum":"f12452834d7ed6748dbf5ace18af4723","creator":"dernst","file_id":"13448"}],"ddc":["520"],"isi":1,"month":"08","status":"public","date_updated":"2023-12-13T12:00:15Z","oa_version":"Published Version","file_date_updated":"2023-08-02T07:42:26Z","abstract":[{"lang":"eng","text":"The ages of solar-like stars have been at the center of many studies such as exoplanet characterization or Galactic-archeology. While ages are usually computed from stellar evolution models, relations linking ages to other stellar properties, such as rotation and magnetic activity, have been investigated. With the large catalog of 55,232 rotation periods, Prot, and photometric magnetic activity index, Sph from Kepler data, we have the opportunity to look for such magneto-gyro-chronology relations. Stellar ages are obtained with two stellar evolution codes that include treatment of angular momentum evolution, hence using Prot as input in addition to classical atmospheric parameters. We explore two different ways of predicting stellar ages on three subsamples with spectroscopic observations: solar analogs, late-F and G dwarfs, and K dwarfs. We first perform a Bayesian analysis to derive relations between Sph and ages between 1 and 5 Gyr, and other stellar properties. For late-F and G dwarfs, and K dwarfs, the multivariate regression favors the model with Prot and Sph with median differences of 0.1% and 0.2%, respectively. We also apply Machine Learning techniques with a Random Forest algorithm to predict ages up to 14 Gyr with the same set of input parameters. For late-F, G and K dwarfs together, predicted ages are on average within 5.3% of the model ages and improve to 3.1% when including Prot. These are very promising results for a quick age estimation for solar-like stars with photometric observations, especially with current and future space missions."}],"date_created":"2023-08-01T14:19:16Z","external_id":{"isi":["001034185700001"]},"publication_status":"published","date_published":"2023-08-01T00:00:00Z","intvolume":"       952","author":[{"first_name":"Savita","full_name":"Mathur, Savita","last_name":"Mathur"},{"full_name":"Claytor, Zachary R.","first_name":"Zachary R.","last_name":"Claytor"},{"last_name":"Santos","full_name":"Santos, Ângela R. G.","first_name":"Ângela R. G."},{"full_name":"García, Rafael A.","first_name":"Rafael A.","last_name":"García"},{"full_name":"Amard, Louis","first_name":"Louis","last_name":"Amard"},{"full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","last_name":"Bugnet"},{"first_name":"Enrico","full_name":"Corsaro, Enrico","last_name":"Corsaro"},{"first_name":"Alfio","full_name":"Bonanno, Alfio","last_name":"Bonanno"},{"last_name":"Breton","first_name":"Sylvain N.","full_name":"Breton, Sylvain N."},{"last_name":"Godoy-Rivera","first_name":"Diego","full_name":"Godoy-Rivera, Diego"},{"last_name":"Pinsonneault","full_name":"Pinsonneault, Marc H.","first_name":"Marc H."},{"last_name":"van Saders","full_name":"van Saders, Jennifer","first_name":"Jennifer"}],"volume":952,"_id":"13443","quality_controlled":"1","issue":"2"},{"year":"2023","_id":"13447","department":[{"_id":"LiBu"}],"arxiv":1,"date_published":"2023-07-06T00:00:00Z","author":[{"last_name":"Huber","full_name":"Huber, Daniel","first_name":"Daniel"},{"full_name":"Pinsonneault, Marc","first_name":"Marc","last_name":"Pinsonneault"},{"first_name":"Paul","full_name":"Beck, Paul","last_name":"Beck"},{"last_name":"Bedding","first_name":"Timothy R.","full_name":"Bedding, Timothy R."},{"last_name":"Joss Bland-Hawthorn","full_name":"Joss Bland-Hawthorn, Joss Bland-Hawthorn","first_name":"Joss Bland-Hawthorn"},{"full_name":"Breton, Sylvain N.","first_name":"Sylvain N.","last_name":"Breton"},{"first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet"},{"first_name":"William J.","full_name":"Chaplin, William J.","last_name":"Chaplin"},{"last_name":"Garcia","full_name":"Garcia, Rafael A.","first_name":"Rafael A."},{"first_name":"Samuel K.","full_name":"Grunblatt, Samuel K.","last_name":"Grunblatt"},{"first_name":"Joyce A.","full_name":"Guzik, Joyce A.","last_name":"Guzik"},{"last_name":"Hekker","full_name":"Hekker, Saskia","first_name":"Saskia"},{"first_name":"Steven D.","full_name":"Kawaler, Steven D.","last_name":"Kawaler"},{"last_name":"Mathis","first_name":"Stephane","full_name":"Mathis, Stephane"},{"first_name":"Savita","full_name":"Mathur, Savita","last_name":"Mathur"},{"first_name":"Travis","full_name":"Metcalfe, Travis","last_name":"Metcalfe"},{"first_name":"Benoit","full_name":"Mosser, Benoit","last_name":"Mosser"},{"full_name":"Ness, Melissa K.","first_name":"Melissa K.","last_name":"Ness"},{"first_name":"Anthony L.","full_name":"Piro, Anthony L.","last_name":"Piro"},{"full_name":"Serenelli, Aldo","first_name":"Aldo","last_name":"Serenelli"},{"full_name":"Sharma, Sanjib","first_name":"Sanjib","last_name":"Sharma"},{"first_name":"David R.","full_name":"Soderblom, David R.","last_name":"Soderblom"},{"last_name":"Stassun","full_name":"Stassun, Keivan G.","first_name":"Keivan G."},{"first_name":"Dennis","full_name":"Stello, Dennis","last_name":"Stello"},{"last_name":"Tayar","full_name":"Tayar, Jamie","first_name":"Jamie"},{"last_name":"Belle","first_name":"Gerard T. van","full_name":"Belle, Gerard T. van"},{"last_name":"Zinn","first_name":"Joel C.","full_name":"Zinn, Joel C."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.03237","open_access":"1"}],"title":"Asteroseismology with the Roman galactic bulge time-domain survey","abstract":[{"text":"Asteroseismology has transformed stellar astrophysics. Red giant asteroseismology is a prime example, with oscillation periods and amplitudes that are readily detectable with time-domain space-based telescopes. These oscillations can be used to infer masses, ages and radii for large numbers of stars, providing unique constraints on stellar populations in our galaxy. The cadence, duration, and spatial resolution of the Roman galactic bulge time-domain survey (GBTDS) are well-suited for asteroseismology and will probe an important population not studied by prior missions. We identify photometric precision as a key requirement for realizing the potential of asteroseismology with Roman. A precision of 1 mmag per 15-min cadence or better for saturated stars will enable detections of the populous red clump star population in the Galactic bulge. If the survey efficiency is better than expected, we argue for repeat observations of the same fields to improve photometric precision, or covering additional fields to expand the stellar population reach if the photometric precision for saturated stars is better than 1 mmag. Asteroseismology is relatively insensitive to the timing of the observations during the mission, and the prime red clump targets can be observed in a single 70 day campaign in any given field. Complementary stellar characterization, particularly astrometry tied to the Gaia system, will also dramatically expand the diagnostic power of asteroseismology. We also highlight synergies to Roman GBTDS exoplanet science using transits and microlensing.","lang":"eng"}],"date_created":"2023-08-02T07:30:43Z","publication_status":"submitted","external_id":{"arxiv":["2307.03237"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","status":"public","doi":"10.48550/arXiv.2307.03237","date_updated":"2023-08-02T07:36:00Z","oa_version":"Preprint","publication":"arXiv","day":"06","type":"preprint","article_number":"2307.03237","citation":{"short":"D. Huber, M. Pinsonneault, P. Beck, T.R. Bedding, J.B.-H. Joss Bland-Hawthorn, S.N. Breton, L.A. Bugnet, W.J. Chaplin, R.A. Garcia, S.K. Grunblatt, J.A. Guzik, S. Hekker, S.D. Kawaler, S. Mathis, S. Mathur, T. Metcalfe, B. Mosser, M.K. Ness, A.L. Piro, A. Serenelli, S. Sharma, D.R. Soderblom, K.G. Stassun, D. Stello, J. Tayar, G.T. van Belle, J.C. Zinn, ArXiv (n.d.).","mla":"Huber, Daniel, et al. “Asteroseismology with the Roman Galactic Bulge Time-Domain Survey.” <i>ArXiv</i>, 2307.03237, doi:<a href=\"https://doi.org/10.48550/arXiv.2307.03237\">10.48550/arXiv.2307.03237</a>.","ista":"Huber D, Pinsonneault M, Beck P, Bedding TR, Joss Bland-Hawthorn JB-H, Breton SN, Bugnet LA, Chaplin WJ, Garcia RA, Grunblatt SK, Guzik JA, Hekker S, Kawaler SD, Mathis S, Mathur S, Metcalfe T, Mosser B, Ness MK, Piro AL, Serenelli A, Sharma S, Soderblom DR, Stassun KG, Stello D, Tayar J, Belle GT van, Zinn JC. Asteroseismology with the Roman galactic bulge time-domain survey. arXiv, 2307.03237.","ama":"Huber D, Pinsonneault M, Beck P, et al. Asteroseismology with the Roman galactic bulge time-domain survey. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2307.03237\">10.48550/arXiv.2307.03237</a>","apa":"Huber, D., Pinsonneault, M., Beck, P., Bedding, T. R., Joss Bland-Hawthorn, J. B.-H., Breton, S. N., … Zinn, J. C. (n.d.). Asteroseismology with the Roman galactic bulge time-domain survey. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2307.03237\">https://doi.org/10.48550/arXiv.2307.03237</a>","ieee":"D. Huber <i>et al.</i>, “Asteroseismology with the Roman galactic bulge time-domain survey,” <i>arXiv</i>. .","chicago":"Huber, Daniel, Marc Pinsonneault, Paul Beck, Timothy R. Bedding, Joss Bland-Hawthorn Joss Bland-Hawthorn, Sylvain N. Breton, Lisa Annabelle Bugnet, et al. “Asteroseismology with the Roman Galactic Bulge Time-Domain Survey.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2307.03237\">https://doi.org/10.48550/arXiv.2307.03237</a>."},"language":[{"iso":"eng"}],"oa":1,"article_processing_charge":"No"},{"_id":"13963","issue":"5","quality_controlled":"1","intvolume":"       108","date_published":"2023-08-01T00:00:00Z","author":[{"id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7969-2729","full_name":"Brighi, Pietro","first_name":"Pietro","last_name":"Brighi"},{"last_name":"Ljubotina","first_name":"Marko","full_name":"Ljubotina, Marko","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E"},{"full_name":"Abanin, Dmitry A.","first_name":"Dmitry A.","last_name":"Abanin"},{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym","full_name":"Serbyn, Maksym"}],"volume":108,"scopus_import":"1","file_date_updated":"2023-08-07T09:48:08Z","abstract":[{"lang":"eng","text":"The many-body localization (MBL) proximity effect is an intriguing phenomenon where a thermal bath localizes due to the interaction with a disordered system. The interplay of thermal and nonergodic behavior in these systems gives rise to a rich phase diagram, whose exploration is an active field of research. In this paper, we study a bosonic Hubbard model featuring two particle species representing the bath and the disordered system. Using state-of-the-art numerical techniques, we investigate the dynamics of the model in different regimes, based on which we obtain a tentative phase diagram as a function of coupling strength and bath size. When the bath is composed of a single particle, we observe clear signatures of a transition from an MBL proximity effect to a delocalized phase. Increasing the bath size, however, its thermalizing effect becomes stronger and eventually the whole system delocalizes in the range of moderate interaction strengths studied. In this regime, we characterize particle transport, revealing diffusive behavior of the originally localized bosons."}],"publication_status":"published","date_created":"2023-08-05T18:25:22Z","external_id":{"arxiv":["2303.16876"]},"ddc":["530"],"status":"public","month":"08","date_updated":"2023-08-07T09:51:39Z","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"file":[{"creator":"dernst","checksum":"f763000339b5fd543c14377109920690","date_created":"2023-08-07T09:48:08Z","access_level":"open_access","file_id":"13981","relation":"main_file","file_name":"2023_PhysRevB_Brighi.pdf","file_size":3051398,"success":1,"content_type":"application/pdf","date_updated":"2023-08-07T09:48:08Z"}],"type":"journal_article","citation":{"mla":"Brighi, Pietro, et al. “Many-Body Localization Proximity Effect in a Two-Species Bosonic Hubbard Model.” <i>Physical Review B</i>, vol. 108, no. 5, 054201, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/physrevb.108.054201\">10.1103/physrevb.108.054201</a>.","short":"P. Brighi, M. Ljubotina, D.A. Abanin, M. Serbyn, Physical Review B 108 (2023).","ama":"Brighi P, Ljubotina M, Abanin DA, Serbyn M. Many-body localization proximity effect in a two-species bosonic Hubbard model. <i>Physical Review B</i>. 2023;108(5). doi:<a href=\"https://doi.org/10.1103/physrevb.108.054201\">10.1103/physrevb.108.054201</a>","ista":"Brighi P, Ljubotina M, Abanin DA, Serbyn M. 2023. Many-body localization proximity effect in a two-species bosonic Hubbard model. Physical Review B. 108(5), 054201.","ieee":"P. Brighi, M. Ljubotina, D. A. Abanin, and M. Serbyn, “Many-body localization proximity effect in a two-species bosonic Hubbard model,” <i>Physical Review B</i>, vol. 108, no. 5. American Physical Society, 2023.","apa":"Brighi, P., Ljubotina, M., Abanin, D. A., &#38; Serbyn, M. (2023). Many-body localization proximity effect in a two-species bosonic Hubbard model. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.108.054201\">https://doi.org/10.1103/physrevb.108.054201</a>","chicago":"Brighi, Pietro, Marko Ljubotina, Dmitry A. Abanin, and Maksym Serbyn. “Many-Body Localization Proximity Effect in a Two-Species Bosonic Hubbard Model.” <i>Physical Review B</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/physrevb.108.054201\">https://doi.org/10.1103/physrevb.108.054201</a>."},"publisher":"American Physical Society","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","year":"2023","department":[{"_id":"MaSe"}],"arxiv":1,"project":[{"call_identifier":"H2020","grant_number":"850899","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E"}],"acknowledgement":"We thank A. A. Michailidis and A. Mirlin for insightful discussions. P.B., M.L., and M.S. acknowledge support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899). D.A. was\r\nsupported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 864597) and by the Swiss National Science Foundation. P.B., M.L., and M.S. acknowledge PRACE for awarding us access to Joliot-Curie at GENCI@CEA, France, where the TEBD simulations were performed. The TEBD simulations were performed using the ITensor library [60].","title":"Many-body localization proximity effect in a two-species bosonic Hubbard model","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/physrevb.108.054201","publication":"Physical Review B","day":"01","ec_funded":1,"article_type":"original","article_number":"054201","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"language":[{"iso":"eng"}],"oa":1},{"article_number":"102087","article_type":"original","oa":1,"publication_identifier":{"eissn":["1879-0380"],"issn":["0959-437X"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.gde.2023.102087","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Current Opinion in Genetics and Development","day":"01","title":"Concepts, mechanisms and implications of long-term epigenetic inheritance","year":"2023","department":[{"_id":"DaZi"}],"pmid":1,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","citation":{"chicago":"Hollwey, Elizabeth, Amy Briffa, Martin Howard, and Daniel Zilberman. “Concepts, Mechanisms and Implications of Long-Term Epigenetic Inheritance.” <i>Current Opinion in Genetics and Development</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.gde.2023.102087\">https://doi.org/10.1016/j.gde.2023.102087</a>.","ieee":"E. Hollwey, A. Briffa, M. Howard, and D. Zilberman, “Concepts, mechanisms and implications of long-term epigenetic inheritance,” <i>Current Opinion in Genetics and Development</i>, vol. 81, no. 8. Elsevier, 2023.","apa":"Hollwey, E., Briffa, A., Howard, M., &#38; Zilberman, D. (2023). Concepts, mechanisms and implications of long-term epigenetic inheritance. <i>Current Opinion in Genetics and Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2023.102087\">https://doi.org/10.1016/j.gde.2023.102087</a>","ista":"Hollwey E, Briffa A, Howard M, Zilberman D. 2023. Concepts, mechanisms and implications of long-term epigenetic inheritance. Current Opinion in Genetics and Development. 81(8), 102087.","ama":"Hollwey E, Briffa A, Howard M, Zilberman D. Concepts, mechanisms and implications of long-term epigenetic inheritance. <i>Current Opinion in Genetics and Development</i>. 2023;81(8). doi:<a href=\"https://doi.org/10.1016/j.gde.2023.102087\">10.1016/j.gde.2023.102087</a>","short":"E. Hollwey, A. Briffa, M. Howard, D. Zilberman, Current Opinion in Genetics and Development 81 (2023).","mla":"Hollwey, Elizabeth, et al. “Concepts, Mechanisms and Implications of Long-Term Epigenetic Inheritance.” <i>Current Opinion in Genetics and Development</i>, vol. 81, no. 8, 102087, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.gde.2023.102087\">10.1016/j.gde.2023.102087</a>."},"has_accepted_license":"1","publisher":"Elsevier","date_updated":"2023-12-13T12:05:31Z","oa_version":"Published Version","ddc":["570"],"isi":1,"month":"08","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"file":[{"file_size":2568632,"success":1,"date_updated":"2023-08-07T08:32:26Z","content_type":"application/pdf","file_name":"2023_CurrentOpinionGenetics_Hollwey.pdf","relation":"main_file","file_id":"13980","date_created":"2023-08-07T08:32:26Z","access_level":"open_access","creator":"dernst","checksum":"a294cd9506b80ed6ef218ef44ed32765"}],"scopus_import":"1","external_id":{"isi":["001047020200001"],"pmid":["37441873"]},"date_created":"2023-08-06T22:01:10Z","file_date_updated":"2023-08-07T08:32:26Z","abstract":[{"lang":"eng","text":"Many modes and mechanisms of epigenetic inheritance have been elucidated in eukaryotes. Most of them are relatively short-term, generally not exceeding one or a few organismal generations. However, emerging evidence indicates that one mechanism, cytosine DNA methylation, can mediate epigenetic inheritance over much longer timescales, which are mostly or completely inaccessible in the laboratory. Here we discuss the evidence for, and mechanisms and implications of, such long-term epigenetic inheritance. We argue that compelling evidence supports the long-term epigenetic inheritance of gene body methylation, at least in the model angiosperm Arabidopsis thaliana, and that variation in such methylation can therefore serve as an epigenetic basis for phenotypic variation in natural populations."}],"issue":"8","quality_controlled":"1","_id":"13965","intvolume":"        81","date_published":"2023-08-01T00:00:00Z","author":[{"last_name":"Hollwey","first_name":"Elizabeth","id":"b8c4f54b-e484-11eb-8fdc-a54df64ef6dd","full_name":"Hollwey, Elizabeth"},{"last_name":"Briffa","full_name":"Briffa, Amy","first_name":"Amy"},{"last_name":"Howard","first_name":"Martin","full_name":"Howard, Martin"},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","last_name":"Zilberman"}],"volume":81},{"_id":"13966","issue":"4","quality_controlled":"1","author":[{"first_name":"Giacomo","full_name":"Bighin, Giacomo","orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin"},{"last_name":"Ho","id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Ho, Quoc P","first_name":"Quoc P","orcid":"0000-0001-6889-1418"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"},{"full_name":"Tscherbul, T. V.","first_name":"T. V.","last_name":"Tscherbul"}],"volume":108,"intvolume":"       108","date_published":"2023-07-15T00:00:00Z","scopus_import":"1","abstract":[{"text":"We present a low-scaling diagrammatic Monte Carlo approach to molecular correlation energies. Using combinatorial graph theory to encode many-body Hugenholtz diagrams, we sample the Møller-Plesset (MPn) perturbation series, obtaining accurate correlation energies up to n=5, with quadratic scaling in the number of basis functions. Our technique reduces the computational complexity of the molecular many-fermion correlation problem, opening up the possibility of low-scaling, accurate stochastic computations for a wide class of many-body systems described by Hugenholtz diagrams.","lang":"eng"}],"date_created":"2023-08-06T22:01:10Z","publication_status":"published","external_id":{"arxiv":["2203.12666"]},"status":"public","month":"07","oa_version":"Preprint","date_updated":"2024-08-07T07:16:52Z","type":"journal_article","publisher":"American Physical Society","citation":{"apa":"Bighin, G., Ho, Q. P., Lemeshko, M., &#38; Tscherbul, T. V. (2023). Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.108.045115\">https://doi.org/10.1103/PhysRevB.108.045115</a>","ieee":"G. Bighin, Q. P. Ho, M. Lemeshko, and T. V. Tscherbul, “Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling,” <i>Physical Review B</i>, vol. 108, no. 4. American Physical Society, 2023.","chicago":"Bighin, Giacomo, Quoc P Ho, Mikhail Lemeshko, and T. V. Tscherbul. “Diagrammatic Monte Carlo for Electronic Correlation in Molecules: High-Order Many-Body Perturbation Theory with Low Scaling.” <i>Physical Review B</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevB.108.045115\">https://doi.org/10.1103/PhysRevB.108.045115</a>.","short":"G. Bighin, Q.P. Ho, M. Lemeshko, T.V. Tscherbul, Physical Review B 108 (2023).","mla":"Bighin, Giacomo, et al. “Diagrammatic Monte Carlo for Electronic Correlation in Molecules: High-Order Many-Body Perturbation Theory with Low Scaling.” <i>Physical Review B</i>, vol. 108, no. 4, 045115, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevB.108.045115\">10.1103/PhysRevB.108.045115</a>.","ista":"Bighin G, Ho QP, Lemeshko M, Tscherbul TV. 2023. Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling. Physical Review B. 108(4), 045115.","ama":"Bighin G, Ho QP, Lemeshko M, Tscherbul TV. Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling. <i>Physical Review B</i>. 2023;108(4). doi:<a href=\"https://doi.org/10.1103/PhysRevB.108.045115\">10.1103/PhysRevB.108.045115</a>"},"article_processing_charge":"No","department":[{"_id":"MiLe"},{"_id":"TaHa"}],"arxiv":1,"year":"2023","acknowledgement":"We acknowledge stimulating discussions with Sergey Varganov, Artur Izmaylov, Jacek Kłos, Piotr Żuchowski, Dominika Zgid, Nikolay Prokof'ev, Boris Svistunov, Robert Parrish, and Andreas Heßelmann. G.B. and Q.P.H. acknowledge support from the Austrian Science Fund (FWF) under Projects No. M2641-N27 and No. M2751. M.L. acknowledges support by the FWF under Project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). T.V.T. was supported by the NSF CAREER award No. PHY-2045681. This work is supported by the German Research Foundation (DFG) under Germany's Excellence Strategy EXC2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster). The authors acknowledge support by the state of Baden-Württemberg through bwHPC.","project":[{"call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425","name":"A path-integral approach to composite impurities","grant_number":"M02641"},{"call_identifier":"FWF","name":"Algebro-Geometric Applications of Factorization Homology","_id":"26B96266-B435-11E9-9278-68D0E5697425","grant_number":"M02751"},{"grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2203.12666"}],"title":"Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/PhysRevB.108.045115","day":"15","publication":"Physical Review B","article_type":"original","ec_funded":1,"article_number":"045115","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"language":[{"iso":"eng"}],"oa":1},{"oa_version":"Preprint","date_updated":"2023-12-13T12:06:10Z","month":"07","status":"public","isi":1,"article_processing_charge":"No","publisher":"Institute of Electrical and Electronics Engineers","citation":{"short":"J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2023.","mla":"Kretinsky, Jan, et al. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.” <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, vol. 2023, Institute of Electrical and Electronics Engineers, 2023, doi:<a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">10.1109/LICS56636.2023.10175771</a>.","ama":"Kretinsky J, Meggendorfer T, Weininger M. Stopping criteria for value iteration on stochastic games with quantitative objectives. In: <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Vol 2023. Institute of Electrical and Electronics Engineers; 2023. doi:<a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">10.1109/LICS56636.2023.10175771</a>","ista":"Kretinsky J, Meggendorfer T, Weininger M. 2023. Stopping criteria for value iteration on stochastic games with quantitative objectives. 38th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science vol. 2023.","ieee":"J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Boston, MA, United States, 2023, vol. 2023.","apa":"Kretinsky, J., Meggendorfer, T., &#38; Weininger, M. (2023). Stopping criteria for value iteration on stochastic games with quantitative objectives. In <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (Vol. 2023). Boston, MA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">https://doi.org/10.1109/LICS56636.2023.10175771</a>","chicago":"Kretinsky, Jan, Tobias Meggendorfer, and Maximilian Weininger. “Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives.” In <i>38th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Vol. 2023. Institute of Electrical and Electronics Engineers, 2023. <a href=\"https://doi.org/10.1109/LICS56636.2023.10175771\">https://doi.org/10.1109/LICS56636.2023.10175771</a>."},"type":"conference","volume":2023,"author":[{"first_name":"Jan","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias"},{"last_name":"Weininger","full_name":"Weininger, Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","first_name":"Maximilian"}],"intvolume":"      2023","date_published":"2023-07-01T00:00:00Z","conference":{"start_date":"2023-06-26","location":"Boston, MA, United States","name":"LICS: Symposium on Logic in Computer Science","end_date":"2023-06-29"},"quality_controlled":"1","_id":"13967","date_created":"2023-08-06T22:01:10Z","publication_status":"published","external_id":{"isi":["001036707700042"],"arxiv":["2304.09930"]},"abstract":[{"text":"A classic solution technique for Markov decision processes (MDP) and stochastic games (SG) is value iteration (VI). Due to its good practical performance, this approximative approach is typically preferred over exact techniques, even though no practical bounds on the imprecision of the result could be given until recently. As a consequence, even the most used model checkers could return arbitrarily wrong results. Over the past decade, different works derived stopping criteria, indicating when the precision reaches the desired level, for various settings, in particular MDP with reachability, total reward, and mean payoff, and SG with reachability.In this paper, we provide the first stopping criteria for VI on SG with total reward and mean payoff, yielding the first anytime algorithms in these settings. To this end, we provide the solution in two flavours: First through a reduction to the MDP case and second directly on SG. The former is simpler and automatically utilizes any advances on MDP. The latter allows for more local computations, heading towards better practical efficiency.Our solution unifies the previously mentioned approaches for MDP and SG and their underlying ideas. To achieve this, we isolate objective-specific subroutines as well as identify objective-independent concepts. These structural concepts, while surprisingly simple, form the very essence of the unified solution.","lang":"eng"}],"scopus_import":"1","day":"01","publication":"38th Annual ACM/IEEE Symposium on Logic in Computer Science","doi":"10.1109/LICS56636.2023.10175771","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798350335873"],"issn":["1043-6871"]},"acknowledgement":"This research was funded in part by DFG projects 383882557 “SUV” and 427755713 “GOPro”.","department":[{"_id":"KrCh"}],"arxiv":1,"year":"2023","title":"Stopping criteria for value iteration on stochastic games with quantitative objectives","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2304.09930","open_access":"1"}]}]