[{"abstract":[{"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.","lang":"eng"}],"date_created":"2024-02-08T15:34:43Z","publication":"arXiv","date_updated":"2024-02-12T10:16:21Z","type":"preprint","extern":"1","_id":"14963","external_id":{"arxiv":["2309.00233"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Object-centric multiple object tracking","author":[{"first_name":"Zixu","full_name":"Zhao, Zixu","last_name":"Zhao"},{"full_name":"Wang, Jiaze","last_name":"Wang","first_name":"Jiaze"},{"full_name":"Horn, Max","last_name":"Horn","first_name":"Max"},{"last_name":"Ding","full_name":"Ding, Yizhuo","first_name":"Yizhuo"},{"first_name":"Tong","last_name":"He","full_name":"He, Tong"},{"last_name":"Bai","full_name":"Bai, Zechen","first_name":"Zechen"},{"first_name":"Dominik","full_name":"Zietlow, Dominik","last_name":"Zietlow"},{"first_name":"Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel"},{"first_name":"Bing","full_name":"Shuai, Bing","last_name":"Shuai"},{"full_name":"Tu, Zhuowen","last_name":"Tu","first_name":"Zhuowen"},{"first_name":"Thomas","full_name":"Brox, Thomas","last_name":"Brox"},{"first_name":"Bernt","last_name":"Schiele","full_name":"Schiele, Bernt"},{"full_name":"Fu, Yanwei","last_name":"Fu","first_name":"Yanwei"},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","last_name":"Locatello"},{"last_name":"Zhang","full_name":"Zhang, Zheng","first_name":"Zheng"},{"full_name":"Xiao, Tianjun","last_name":"Xiao","first_name":"Tianjun"}],"oa":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2309.00233"}],"status":"public","citation":{"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.","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.).","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>.","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>.","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>","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>","ieee":"Z. Zhao <i>et al.</i>, “Object-centric multiple object tracking,” <i>arXiv</i>. ."},"article_number":"2309.00233","year":"2023","month":"09","date_published":"2023-09-01T00:00:00Z","day":"01","doi":"10.48550/arXiv.2309.00233","publication_status":"submitted","department":[{"_id":"FrLo"}],"arxiv":1,"article_processing_charge":"No","oa_version":"Preprint","language":[{"iso":"eng"}]},{"oa_version":"Published Version","department":[{"_id":"FrLo"}],"day":"25","month":"05","citation":{"chicago":"Ficek, Joanna, Kjong-Van Lehmann, Francesco Locatello, Gunnar  Raetsch, and Stefan Stark. “Methods of Determining Correspondences between Biological Properties of Cells,” 2023.","mla":"Ficek, Joanna, et al. <i>Methods of Determining Correspondences between Biological Properties of Cells</i>. 2023.","short":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, S. Stark, (2023).","ista":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. 2023. Methods of determining correspondences between biological properties of cells.","ieee":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, and S. Stark, “Methods of determining correspondences between biological properties of cells.” 2023.","ama":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. Methods of determining correspondences between biological properties of cells. 2023.","apa":"Ficek, J., Lehmann, K.-V., Locatello, F., Raetsch, G., &#38; Stark, S. (2023). Methods of determining correspondences between biological properties of cells."},"file":[{"file_name":"Patent_FrLo_US20230162818A1.pdf","date_created":"2024-02-08T15:41:51Z","file_id":"14966","file_size":2893462,"creator":"ptazenko","date_updated":"2024-02-08T15:41:51Z","success":1,"access_level":"open_access","relation":"main_file","checksum":"55ed444b176b48e4fb4d609ea895de36","content_type":"application/pdf"}],"status":"public","application_number":"PCT/EP2021/060318","oa":1,"has_accepted_license":"1","title":"Methods of determining correspondences between biological properties of cells","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","OA_place":"repository","type":"patent","date_updated":"2025-01-29T10:53:48Z","file_date_updated":"2024-02-08T15:41:51Z","date_created":"2024-02-08T15:52:21Z","abstract":[{"lang":"eng","text":"A method of determining a correspondence between a first biological property of a cell and one or more further biological properties of cells is provided. The first biological property and the further biological properties are determined by different analysis techniques and each are contained in a respective one of a plurality of sets of biological properties. The method includes the steps of: converting the plurality of sets of biological properties into corresponding representations in a representation format which is invariant to the technologies used to derive the biological properties; determining, in said representation format, a representation from each of the converted sets of further biological properties which most closely matches the first representation of the first biological property; and re-converting the determined representations from the representation format back to the biological properties associated with the determined representations and thereby determining a correspondence between the first biological property and each of the further biological properties."}],"page":"9","article_processing_charge":"No","date_published":"2023-05-25T00:00:00Z","year":"2023","ipn":"US20230162818A1","application_date":"2021-04-21","ddc":["540"],"ipc":"C12Q1/68 ; G06V10/82 ; G06V20/69 ; G16B40/30","author":[{"first_name":"Joanna","full_name":"Ficek, Joanna","last_name":"Ficek"},{"last_name":"Lehmann","full_name":"Lehmann, Kjong-Van","first_name":"Kjong-Van"},{"orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Raetsch, Gunnar ","last_name":"Raetsch","first_name":"Gunnar "},{"full_name":"Stark, Stefan","last_name":"Stark","first_name":"Stefan"}],"_id":"14965","extern":"1","applicant":["ETH Zürich"],"publication_date":"2023-05-25"},{"quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","article_processing_charge":"No","publication_status":"submitted","department":[{"_id":"FrLo"}],"day":"01","month":"05","date_published":"2023-05-01T00:00:00Z","year":"2023","ddc":["000"],"file":[{"checksum":"105ff58e55de866ce76967f3a95e82f7","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"ptazenko","file_size":215629,"date_updated":"2024-02-08T16:03:08Z","file_name":"CLeaR23_roundtable_discussion.pdf","date_created":"2024-02-08T16:03:08Z","file_id":"14975"}],"citation":{"mla":"Zhang, Cheng, et al. “Causality in the Time of LLMs: Round Table Discussion Results of CLeaR 2023.” <i>2nd Conference on Causal Learning and Reasoning</i>.","short":"C. Zhang, D. Janzing, M. van der Schaar, F. Locatello, P. Spirtes, K. Zhang, B. Schölkopf, C. Uhler, in:, 2nd Conference on Causal Learning and Reasoning, n.d.","chicago":"Zhang, Cheng, Dominik Janzing, Mihaela  van der Schaar, Francesco Locatello, Peter Spirtes, Kun Zhang, Bernhard Schölkopf, and Caroline Uhler. “Causality in the Time of LLMs: Round Table Discussion Results of CLeaR 2023.” In <i>2nd Conference on Causal Learning and Reasoning</i>, n.d.","ista":"Zhang C, Janzing D, van der Schaar M, Locatello F, Spirtes P, Zhang K, Schölkopf B, Uhler C. Causality in the time of LLMs: Round table discussion results of CLeaR 2023. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning.","ieee":"C. Zhang <i>et al.</i>, “Causality in the time of LLMs: Round table discussion results of CLeaR 2023,” in <i>2nd Conference on Causal Learning and Reasoning</i>, Tübingen, Germany.","apa":"Zhang, C., Janzing, D., van der Schaar, M., Locatello, F., Spirtes, P., Zhang, K., … Uhler, C. (n.d.). Causality in the time of LLMs: Round table discussion results of CLeaR 2023. In <i>2nd Conference on Causal Learning and Reasoning</i>. Tübingen, Germany.","ama":"Zhang C, Janzing D, van der Schaar M, et al. Causality in the time of LLMs: Round table discussion results of CLeaR 2023. In: <i>2nd Conference on Causal Learning and Reasoning</i>."},"status":"public","has_accepted_license":"1","oa":1,"author":[{"first_name":"Cheng","full_name":"Zhang, Cheng","last_name":"Zhang"},{"full_name":"Janzing, Dominik","last_name":"Janzing","first_name":"Dominik"},{"last_name":"van der Schaar","full_name":"van der Schaar, Mihaela ","first_name":"Mihaela "},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"full_name":"Spirtes, Peter","last_name":"Spirtes","first_name":"Peter"},{"last_name":"Zhang","full_name":"Zhang, Kun","first_name":"Kun"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"},{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","orcid":"0000-0002-7008-0216","first_name":"Caroline"}],"conference":{"start_date":"2023-04-11","name":"CLeaR: Conference on Causal Learning and Reasoning","end_date":"2023-04-14","location":"Tübingen, Germany"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Causality in the time of LLMs: Round table discussion results of CLeaR 2023","extern":"1","_id":"14974","type":"conference","date_updated":"2025-08-05T11:19:37Z","file_date_updated":"2024-02-08T16:03:08Z","publication":"2nd Conference on Causal Learning and Reasoning","date_created":"2024-02-08T16:03:18Z","abstract":[{"lang":"eng","text":"The field of machine learning and AI has witnessed remarkable breakthroughs with the emergence of LLMs, which have also sparked a lively debate in the causal community. As researchers in this field, we are interested in exploring how LLMs relate to causality research, and how we can leverage the technology to advance it. In the second conference of Causal Learning and Reasoning (CLeaR), 2023, we held a round table discussion to gather and integrate the diverse perspectives of the CLeaR community on this topic.\r\nThere is a general consensus that LLMs are not yet capable of causal reasoning at the current\r\nstage but has a lot of potential with public available information by CLeaR 2023. Enhancing causal machine learning is vital not only for its own sake but also to help LLMs improve their performance, especially regarding trustworthiness. In this document, we present both the summary and the raw outcome of the round table discussion. We acknowledge that with the progress of both fields, the opportunities and impact may rapidly change. We will repeat the same exercise in CLeaR 2024 to document the evolution."}]},{"_id":"14985","issue":"1","author":[{"first_name":"Zhengtao","full_name":"Liu, Zhengtao","last_name":"Liu"},{"last_name":"Hong","full_name":"Hong, Tao","first_name":"Tao"},{"last_name":"Xu","full_name":"Xu, Liqing","first_name":"Liqing"},{"first_name":"Sining","full_name":"Wang, Sining","last_name":"Wang"},{"last_name":"Gao","full_name":"Gao, Xiang","first_name":"Xiang"},{"orcid":"0000-0002-9515-4277","first_name":"Cheng","last_name":"Chang","full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"full_name":"Ding, Xiangdong","last_name":"Ding","first_name":"Xiangdong"},{"full_name":"Xiao, Yu","last_name":"Xiao","first_name":"Yu"},{"first_name":"Li‐Dong","full_name":"Zhao, Li‐Dong","last_name":"Zhao"}],"intvolume":"         2","volume":2,"date_published":"2023-01-01T00:00:00Z","article_processing_charge":"Yes","page":"161-170","publisher":"Wiley","ddc":["540"],"year":"2023","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS","has_accepted_license":"1","oa":1,"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."}],"date_created":"2024-02-14T12:12:17Z","publication":"Interdisciplinary Materials","publication_identifier":{"eissn":["2767-441X"]},"file_date_updated":"2024-02-19T09:58:32Z","type":"journal_article","date_updated":"2024-02-19T10:01:26Z","month":"01","department":[{"_id":"MaIb"}],"publication_status":"published","day":"01","doi":"10.1002/idm2.12056","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"content_type":"application/pdf","relation":"main_file","checksum":"7b5e8210ef1434feb173022c6dbbee0c","success":1,"access_level":"open_access","date_updated":"2024-02-19T09:58:32Z","file_size":4675941,"creator":"dernst","date_created":"2024-02-19T09:58:32Z","file_id":"15015","file_name":"2023_InterdiscMaterials_Liu.pdf"}],"citation":{"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.","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>","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>","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.","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>.","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."},"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."},{"language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","article_processing_charge":"No","publication_status":"published","department":[{"_id":"ElKo"}],"doi":"10.14722/ndss.2023.24545","day":"01","date_published":"2023-03-01T00:00:00Z","month":"03","scopus_import":"1","acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","year":"2023","ddc":["000"],"citation":{"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.","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.","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>.","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>.","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>","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."},"main_file_link":[{"url":"https://eprint.iacr.org/2023/081","open_access":"1"}],"status":"public","publisher":"Internet Society","oa":1,"author":[{"first_name":"Harjasleen","last_name":"Malvai","full_name":"Malvai, Harjasleen"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","orcid":"0000-0002-8827-3382","first_name":"Eleftherios"},{"last_name":"Sonnino","full_name":"Sonnino, Alberto","first_name":"Alberto"},{"full_name":"Ghosh, Esha","last_name":"Ghosh","first_name":"Esha"},{"last_name":"Oztürk","full_name":"Oztürk, Ercan","first_name":"Ercan"},{"full_name":"Lewi, Kevin","last_name":"Lewi","first_name":"Kevin"},{"first_name":"Sean","last_name":"Lawlor","full_name":"Lawlor, Sean"}],"conference":{"end_date":"2023-03-03","location":"San Diego, CA, United States","start_date":"2023-02-27","name":"NDSS: Network and Distributed Systems Security"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","_id":"14989","type":"conference","date_updated":"2026-06-18T17:41:59Z","date_created":"2024-02-14T14:20:40Z","publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","publication_identifier":{"isbn":["1891562835"]},"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."}]},{"article_processing_charge":"No","oa_version":"Published Version","related_material":{"record":[{"relation":"used_in_publication","id":"13139","status":"public"}]},"month":"01","corr_author":"1","date_published":"2023-01-18T00:00:00Z","department":[{"_id":"KrCh"}],"doi":"10.5281/ZENODO.7548214","day":"18","year":"2023","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"status":"public","publisher":"Zenodo","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ddc":["000"],"citation":{"ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.","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>","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>","short":"T. Meggendorfer, (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>.","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>.","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>."},"author":[{"orcid":"0000-0002-1712-2165","first_name":"Tobias","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer"}],"oa":1,"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Artefact for: Correct Approximation of Stationary Distributions","_id":"14990","type":"research_data_reference","date_updated":"2025-09-09T12:28:12Z","abstract":[{"text":"The software artefact to evaluate the approximation of stationary distributions implementation.","lang":"eng"}],"date_created":"2024-02-14T14:27:06Z"},{"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"}],"date_created":"2024-02-14T14:37:57Z","type":"research_data_reference","date_updated":"2025-09-09T13:35:40Z","title":"Data-assessing memory in convection schemes using idealized tests","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14991","author":[{"first_name":"Yi-Ling","orcid":"0000-0001-9281-3479","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","full_name":"Hwong, Yi-Ling","last_name":"Hwong"},{"first_name":"Maxime","full_name":"Colin, Maxime","last_name":"Colin"},{"id":"02eace56-97fc-11ee-b81a-f0939ca85a77","full_name":"Aglas, Philipp","last_name":"Aglas","first_name":"Philipp"},{"full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","orcid":"0000-0001-5836-5350","first_name":"Caroline J"},{"full_name":"Sherwood, Steven C.","last_name":"Sherwood","first_name":"Steven C."}],"has_accepted_license":"1","oa":1,"status":"public","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7757041","open_access":"1"}],"publisher":"Zenodo","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ddc":["550"],"citation":{"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>.","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>.","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).","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>","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."},"year":"2023","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14654"}]},"month":"06","date_published":"2023-06-23T00:00:00Z","corr_author":"1","department":[{"_id":"CaMu"}],"day":"23","ec_funded":1,"doi":"10.5281/ZENODO.7757041","article_processing_charge":"No","oa_version":"Published Version"},{"publisher":"Springer","year":"2023","date_published":"2023-07-19T00:00:00Z","editor":[{"first_name":"Eric","last_name":"Cances","full_name":"Cances, Eric"},{"last_name":"Friesecke","full_name":"Friesecke, Gero","first_name":"Gero"}],"page":"115-182","edition":"1","article_processing_charge":"No","_id":"14992","external_id":{"arxiv":["1912.10424"]},"alternative_title":["Mathematics and Molecular Modeling"],"author":[{"first_name":"Mathieu","full_name":"Lewin, Mathieu","last_name":"Lewin"},{"full_name":"Lieb, Elliott H.","last_name":"Lieb","first_name":"Elliott H."},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"citation":{"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>","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>","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>.","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>.","ista":"Lewin M, Lieb EH, Seiringer R. 2023.Universal Functionals in Density Functional Theory. In: Density Functional Theory. Mathematics and Molecular Modeling, , 115–182."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1912.10424","open_access":"1"}],"status":"public","doi":"10.1007/978-3-031-22340-2_3","day":"19","department":[{"_id":"RoSe"}],"publication_status":"published","month":"07","oa_version":"Preprint","quality_controlled":"1","language":[{"iso":"eng"}],"arxiv":1,"publication_identifier":{"isbn":["9783031223396"],"eisbn":["9783031223402"],"issn":["3005-0286"]},"date_created":"2024-02-14T14:44:33Z","publication":"Density Functional Theory","abstract":[{"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.","lang":"eng"}],"series_title":"MAMOMO","date_updated":"2024-02-20T08:33:06Z","type":"book_chapter","title":"Universal Functionals in Density Functional Theory","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"date_published":"2023-03-02T00:00:00Z","month":"03","department":[{"_id":"TiVo"}],"publication_status":"published","day":"02","article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","status":"public","main_file_link":[{"url":"https://openreview.net/forum?id=jHY_G91R880","open_access":"1"}],"publisher":"OpenReview","ddc":["000"],"citation":{"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.","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.","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.","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.","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.","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.","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."},"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.","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A framework for grassroots research collaboration in machine learning and global health","_id":"14993","author":[{"orcid":"0000-0002-4809-5059","first_name":"Christopher","last_name":"Currin","full_name":"Currin, Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9"},{"last_name":"Asiedu ","full_name":"Asiedu , Mercy Nyamewaa","first_name":"Mercy Nyamewaa"},{"first_name":"Chris","full_name":"Fourie, Chris","last_name":"Fourie"},{"first_name":"Benjamin","full_name":"Rosman, Benjamin","last_name":"Rosman"},{"full_name":"Turki, Houcemeddine","last_name":"Turki","first_name":"Houcemeddine"},{"last_name":"Lambebo Tonja","full_name":"Lambebo Tonja, Atnafu","first_name":"Atnafu"},{"full_name":"Abbott, Jade","last_name":"Abbott","first_name":"Jade"},{"full_name":"Ajala, Marvellous","last_name":"Ajala","first_name":"Marvellous"},{"full_name":"Adedayo, Sadiq Adewale","last_name":"Adedayo","first_name":"Sadiq Adewale"},{"last_name":"Emezue","full_name":"Emezue, Chris Chinenye","first_name":"Chris Chinenye"},{"last_name":"Machangara","full_name":"Machangara, Daphne","first_name":"Daphne"}],"conference":{"end_date":"2023-05-05","location":"Kigali, Rwanda","start_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations"},"oa":1,"abstract":[{"lang":"eng","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."}],"publication":"1st Workshop on Machine Learning & Global Health","date_created":"2024-02-14T15:11:48Z","type":"conference","date_updated":"2026-06-18T17:42:25Z"},{"article_processing_charge":"No","oa_version":"Published Version","date_published":"2023-04-28T00:00:00Z","month":"04","corr_author":"1","related_material":{"record":[{"status":"public","id":"14758","relation":"used_in_publication"}]},"day":"28","doi":"10.5281/ZENODO.7877790","department":[{"_id":"ToHe"}],"year":"2023","publisher":"Zenodo","status":"public","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7877790","open_access":"1"}],"citation":{"short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).","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>.","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>.","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>.","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>","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>"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ddc":["000"],"author":[{"first_name":"Rupak","full_name":"Majumdar, Rupak","last_name":"Majumdar"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","last_name":"Mallik","first_name":"Kaushik","orcid":"0000-0001-9864-7475"},{"last_name":"Rychlicki","full_name":"Rychlicki, Mateusz","first_name":"Mateusz"},{"first_name":"Anne-Kathrin","full_name":"Schmuck, Anne-Kathrin","last_name":"Schmuck"},{"first_name":"Sadegh","last_name":"Soudjani","full_name":"Soudjani, Sadegh"}],"oa":1,"has_accepted_license":"1","_id":"14994","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-09T14:16:48Z","type":"research_data_reference","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"},{"_id":"14995","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","oa":1,"author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","full_name":"Koval, Nikita","last_name":"Koval","first_name":"Nikita"},{"first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6"},{"first_name":"Maria","last_name":"Sokolova","full_name":"Sokolova, Maria"},{"full_name":"Tsitelov, Dmitry","last_name":"Tsitelov","first_name":"Dmitry"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"date_created":"2024-02-14T15:14:13Z","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"}],"date_updated":"2025-09-09T12:51:51Z","type":"research_data_reference","day":"28","doi":"10.5281/ZENODO.7877757","department":[{"_id":"DaAl"}],"month":"04","date_published":"2023-04-28T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","id":"14260","status":"public"}]},"oa_version":"Published Version","article_processing_charge":"No","citation":{"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>.","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>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).","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>.","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>","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>"},"ddc":["000"],"publisher":"Zenodo","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877757"}],"year":"2023"},{"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","file":[{"date_updated":"2024-07-22T11:45:17Z","creator":"dernst","file_size":562008,"date_created":"2024-07-22T11:45:17Z","file_id":"17309","file_name":"2023_NeurIPS_Zikelic.pdf","content_type":"application/pdf","checksum":"739c6d72506b778302d4e708723bf12c","relation":"main_file","access_level":"open_access","success":1}],"citation":{"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.","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.","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.","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.","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.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 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, NeurIPS, ."},"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","arxiv":1,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","day":"15","ec_funded":1,"month":"12","corr_author":"1","type":"conference","date_updated":"2025-04-14T07:52:48Z","file_date_updated":"2024-07-22T11:45:17Z","date_created":"2024-02-25T09:23:24Z","publication":"37th Conference on Neural Information Processing Systems","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"}],"has_accepted_license":"1","oa":1,"conference":{"location":"New Orleans, LO, United States","end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Compositional policy learning in stochastic control systems with formal guarantees","year":"2023","ddc":["000"],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"article_processing_charge":"No","date_published":"2023-12-15T00:00:00Z","author":[{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","orcid":"0000-0002-4681-1699","first_name":"Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Verma, Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6","last_name":"Verma","first_name":"Abhinav"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"alternative_title":["NeurIPS"],"external_id":{"arxiv":["2312.01456"]},"_id":"15023"},{"oa_version":"Published Version","article_processing_charge":"No","department":[{"_id":"AnSa"}],"day":"13","related_material":{"record":[{"relation":"used_in_publication","id":"15001","status":"public"}]},"month":"12","date_published":"2023-12-13T00:00:00Z","corr_author":"1","year":"2023","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"ddc":["570"],"citation":{"mla":"Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023.","short":"S. Curk, (2023).","chicago":"Curk, Samo. “Aggregation_data.” Figshare, 2023.","ista":"Curk S. 2023. aggregation_data, Figshare.","ieee":"S. Curk, “aggregation_data.” Figshare, 2023.","apa":"Curk, S. (2023). aggregation_data. Figshare.","ama":"Curk S. aggregation_data. 2023."},"main_file_link":[{"url":"https://figshare.com/s/85798bba4ebc68d822ed","open_access":"1"}],"status":"public","publisher":"Figshare","oa":1,"has_accepted_license":"1","author":[{"orcid":"0000-0001-6160-9766","first_name":"Samo","last_name":"Curk","full_name":"Curk, Samo","id":"031eff0d-d481-11ee-8508-cd12a7a86e5b"}],"title":"aggregation_data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"gold","_id":"15027","OA_place":"publisher","type":"research_data_reference","date_updated":"2025-09-04T12:03:11Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","date_created":"2024-02-26T08:37:57Z","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)."}]},{"article_processing_charge":"No","oa_version":"Published Version","related_material":{"record":[{"id":"14076","relation":"used_in_publication","status":"public"}]},"date_published":"2023-07-28T00:00:00Z","month":"07","corr_author":"1","department":[{"_id":"ToHe"}],"doi":"10.5281/ZENODO.8191723","day":"28","ec_funded":1,"year":"2023","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8191722","open_access":"1"}],"status":"public","publisher":"Zenodo","ddc":["000"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"citation":{"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>","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>","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>.","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>.","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>."},"author":[{"full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"has_accepted_license":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Monitoring hyperproperties with prefix transducers","_id":"15035","type":"research_data_reference","date_updated":"2025-04-14T09:42:55Z","abstract":[{"lang":"eng","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."}],"date_created":"2024-02-28T07:34:34Z"},{"oa":1,"author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach","first_name":"Bernd"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"external_id":{"arxiv":["2311.06103"]},"_id":"15039","title":"1-Lipschitz neural networks are more expressive with N-activations","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","OA_place":"repository","date_updated":"2026-04-07T11:49:51Z","type":"preprint","date_created":"2024-02-28T17:59:32Z","publication":"arXiv","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","doi":"10.48550/ARXIV.2311.06103","day":"10","publication_status":"draft","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_published":"2023-11-10T00:00:00Z","month":"11","corr_author":"1","related_material":{"record":[{"status":"public","id":"19759","relation":"dissertation_contains"}]},"article_number":"2311.06103","year":"2023","citation":{"ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. .","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>","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>","short":"B. Prach, C. Lampert, ArXiv (n.d.).","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>.","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>.","ista":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. arXiv, 2311.06103."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.06103","open_access":"1"}]},{"date_published":"2023-02-01T00:00:00Z","page":"565-575","article_processing_charge":"Yes","ddc":["510"],"publisher":"Academie des Sciences","year":"2023","_id":"15173","external_id":{"isi":["001167671400009"],"arxiv":["2112.03788"]},"issue":"G2","isi":1,"author":[{"first_name":"Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan"},{"full_name":"Sah, Ashwin","last_name":"Sah","first_name":"Ashwin"},{"first_name":"Mehtaab","full_name":"Sawhney, Mehtaab","last_name":"Sawhney"}],"intvolume":"       361","volume":361,"day":"01","doi":"10.5802/crmath.423","publication_status":"published","department":[{"_id":"MaKw"}],"month":"02","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","arxiv":1,"file":[{"date_updated":"2024-03-25T07:21:52Z","creator":"dernst","file_size":598097,"date_created":"2024-03-25T07:21:52Z","file_id":"15174","file_name":"2023_ComptesRendusMath_Kwan.pdf","content_type":"application/pdf","checksum":"d1d0e0a854a79ae95fb66d75d9117a68","relation":"main_file","access_level":"open_access","success":1}],"citation":{"ieee":"M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” <i>Comptes Rendus Mathematique</i>, vol. 361, no. G2. Academie des Sciences, pp. 565–575, 2023.","ama":"Kwan MA, Sah A, Sawhney M. Enumerating matroids and linear spaces. <i>Comptes Rendus Mathematique</i>. 2023;361(G2):565-575. doi:<a href=\"https://doi.org/10.5802/crmath.423\">10.5802/crmath.423</a>","apa":"Kwan, M. A., Sah, A., &#38; Sawhney, M. (2023). Enumerating matroids and linear spaces. <i>Comptes Rendus Mathematique</i>. Academie des Sciences. <a href=\"https://doi.org/10.5802/crmath.423\">https://doi.org/10.5802/crmath.423</a>","short":"M.A. Kwan, A. Sah, M. Sawhney, Comptes Rendus Mathematique 361 (2023) 565–575.","mla":"Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.” <i>Comptes Rendus Mathematique</i>, vol. 361, no. G2, Academie des Sciences, 2023, pp. 565–75, doi:<a href=\"https://doi.org/10.5802/crmath.423\">10.5802/crmath.423</a>.","chicago":"Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.” <i>Comptes Rendus Mathematique</i>. Academie des Sciences, 2023. <a href=\"https://doi.org/10.5802/crmath.423\">https://doi.org/10.5802/crmath.423</a>.","ista":"Kwan MA, Sah A, Sawhney M. 2023. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 361(G2), 565–575."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","scopus_import":"1","acknowledgement":"Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302. Sah was supported by the PD Soros Fellowship.\r\nWe thank Michael Simkin for helpful comments on the manuscript. We thank Zach Hunter for\r\nseveral corrections.","title":"Enumerating matroids and linear spaces","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","has_accepted_license":"1","oa":1,"publication_identifier":{"issn":["1631-073X"],"eissn":["1778-3569"]},"publication":"Comptes Rendus Mathematique","date_created":"2024-03-24T23:01:00Z","abstract":[{"lang":"eng","text":"We show that the number of linear spaces on a set of n points and the number of rank-3 matroids on a ground set of size n are both of the form (cn+o(n))n2/6, where c=e3√/2−3(1+3–√)/2. This is the final piece of the puzzle for enumerating fixed-rank matroids at this level of accuracy: the numbers of rank-1 and rank-2 matroids on a ground set of size n have exact representations in terms of well-known combinatorial functions, and it was recently proved by van der Hofstad, Pendavingh, and van der Pol that for constant r≥4 there are (e1−rn+o(n))nr−1/r! rank-r matroids on a ground set of size n. In our proof, we introduce a new approach for bounding the number of clique decompositions of a complete graph, using quasirandomness instead of the so-called entropy method that is common in this area."}],"date_updated":"2025-09-09T14:26:32Z","type":"journal_article","file_date_updated":"2024-03-25T07:21:52Z"},{"publisher":"ACM","project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"ddc":["005","531"],"year":"2023","date_published":"2023-08-01T00:00:00Z","article_processing_charge":"No","_id":"15292","author":[{"last_name":"Chen","full_name":"Chen, Yi-Lu","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","first_name":"Yi-Lu"},{"first_name":"Mickaël","last_name":"Ly","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","orcid":"0000-0001-6646-5546","first_name":"Christopher J"}],"status":"public","citation":{"ista":"Chen Y-L, Ly M, Wojtan C. 2023. Unified treatment of contact, friction and shock-propagation in rigid body animation, ACM,p.","short":"Y.-L. Chen, M. Ly, C. Wojtan, Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation, ACM, 2023.","mla":"Chen, Yi-Lu, et al. “Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation.” <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>.","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. <i>Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation</i>. <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>.","apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2023). <i>Unified treatment of contact, friction and shock-propagation in rigid body animation</i>. <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>","ama":"Chen Y-L, Ly M, Wojtan C. <i>Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, <i>Unified treatment of contact, friction and shock-propagation in rigid body animation</i>. ACM, 2023."},"file":[{"success":1,"access_level":"open_access","relation":"main_file","checksum":"88bdef929ca262ee0eefae0bbc649139","content_type":"video/mp4","file_name":"video.mp4","file_id":"15293","date_created":"2024-04-03T14:58:24Z","file_size":58770929,"creator":"yichen","date_updated":"2024-04-03T14:58:24Z"},{"creator":"yichen","file_size":3951968,"date_updated":"2024-04-03T14:58:23Z","file_name":"frictionPoster_clean.pdf","date_created":"2024-04-03T14:58:23Z","file_id":"15294","checksum":"c06881ba847da365a74ac09c953eaffd","relation":"main_file","content_type":"application/pdf","access_level":"open_access","success":1}],"acknowledgement":"We thank the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing, and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA)","corr_author":"1","month":"08","related_material":{"record":[{"status":"public","relation":"other","id":"14748"}]},"doi":"10.1145/3606037.3606836","day":"01","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication_status":"published","language":[{"iso":"eng"}],"oa_version":"None","abstract":[{"text":"We present a rigid body animation technique which prevents solids from interpenetrating, dissipates energy through friction, and propagates shocks through contacts. We employ the Alternating Direction Method of Multipliers (ADMM) to couple non-smooth Coulomb friction with impact propagation, allowing efficient and accurate non-smooth dynamics along with a correct transmission of impacts through assemblies of rigid bodies. We further extend our method to model adhesion, dynamic friction and lubricated contact.","lang":"eng"}],"publication":"Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation","date_created":"2024-04-03T14:57:23Z","file_date_updated":"2024-04-03T14:58:24Z","date_updated":"2025-04-14T12:58:27Z","type":"conference_poster","title":"Unified treatment of contact, friction and shock-propagation in rigid body animation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"SCA: Symposium on Computer Animation","start_date":"2023-08-04","location":"Los Angeles, CA, United States","end_date":"2023-08-06"},"has_accepted_license":"1","oa":1},{"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413"}],"ddc":["000"],"year":"2023","date_published":"2023-12-15T00:00:00Z","article_processing_charge":"Yes","intvolume":"        36","volume":36,"_id":"15363","external_id":{"arxiv":["2305.17581"]},"alternative_title":["NeurIPS"],"author":[{"last_name":"Safaryan","full_name":"Safaryan, Mher","id":"dd546b39-0804-11ed-9c55-ef075c39778d","first_name":"Mher"},{"full_name":"Peste, Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","last_name":"Peste","first_name":"Elena-Alexandra"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"status":"public","citation":{"ista":"Safaryan M, Krumes A, Alistarh D-A. 2023. Knowledge distillation performs partial variance reduction. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 36.","mla":"Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.” <i>36th Conference on Neural Information Processing Systems</i>, vol. 36, 2023.","short":"M. Safaryan, A. Krumes, D.-A. Alistarh, in:, 36th Conference on Neural Information Processing Systems, 2023.","chicago":"Safaryan, Mher, Alexandra Krumes, and Dan-Adrian Alistarh. “Knowledge Distillation Performs Partial Variance Reduction.” In <i>36th Conference on Neural Information Processing Systems</i>, Vol. 36, 2023.","ama":"Safaryan M, Krumes A, Alistarh D-A. Knowledge distillation performs partial variance reduction. In: <i>36th Conference on Neural Information Processing Systems</i>. Vol 36. ; 2023.","apa":"Safaryan, M., Krumes, A., &#38; Alistarh, D.-A. (2023). Knowledge distillation performs partial variance reduction. In <i>36th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States.","ieee":"M. Safaryan, A. Krumes, and D.-A. Alistarh, “Knowledge distillation performs partial variance reduction,” in <i>36th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36."},"file":[{"file_id":"15417","date_created":"2024-05-22T08:08:08Z","file_name":"2023_Neurips_Safaryan.pdf","date_updated":"2024-05-22T08:08:08Z","creator":"dernst","file_size":672571,"access_level":"open_access","success":1,"content_type":"application/pdf","checksum":"288c5148a85abf24ad5e22a6b1183655","relation":"main_file"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"acknowledgement":"MS has received funding from the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No 101034413.","scopus_import":"1","corr_author":"1","month":"12","day":"15","ec_funded":1,"department":[{"_id":"DaAl"}],"publication_status":"published","arxiv":1,"quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Knowledge distillation is a popular approach for enhancing the performance of \"student\" models, with lower representational capacity, by taking advantage of more powerful \"teacher\" models. Despite its apparent simplicity, the underlying mechanics behind knowledge distillation (KD) are not yet fully understood. In this work, we shed new light on the inner workings of this method, by examining it from an optimization perspective. Specifically, we show that, in the context of linear and deep linear models, KD can be interpreted as a novel type of stochastic variance reduction mechanism. We provide a detailed convergence analysis of the resulting dynamics, which hold under standard assumptions for both strongly-convex and non-convex losses, showing that KD acts as a form of \\emph{partial variance reduction}, which can reduce the stochastic gradient noise, but may not eliminate it completely, depending on the properties of the teacher'' model. Our analysis puts further emphasis on the need for careful parametrization of KD, in particular w.r.t. the weighting of the distillation loss, and is validated empirically on both linear models and deep neural networks."}],"publication_identifier":{"issn":["1049-5258"]},"date_created":"2024-05-05T22:01:04Z","publication":"36th Conference on Neural Information Processing Systems","file_date_updated":"2024-05-22T08:08:08Z","date_updated":"2025-04-14T07:54:55Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Knowledge distillation performs partial variance reduction","conference":{"location":"New Orleans, LA, United States","end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10"},"oa":1,"has_accepted_license":"1"},{"title":"Simple, scalable and effective clustering via one-dimensional projections","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2023-12-16","location":"New Orleans, LA, United States","start_date":"2023-12-10","name":"NeurIPS: Neural Information Processing Systems"},"oa":1,"has_accepted_license":"1","abstract":[{"text":"Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and k-means++ can make Ω(ndk) time when clustering n points in a d-dimensional space (represented by an n×d matrix X) into k clusters. On massive datasets with moderate to large k, the multiplicative \r\nk factor can become very expensive. We introduce a simple randomized clustering algorithm that provably runs in expected time O(nnz(X)+nlogn) for arbitrary k. Here nnz(X) is the total number of non-zero entries in the input dataset X, which is upper bounded by nd and can be significantly smaller for sparse datasets. We prove that our algorithm achieves approximation ratio ˜O(k4) on any input dataset for the k-means objective, and our experiments show that the quality of the clusters found by our algorithm is usually much better than this worst-case bound. We use our algorithm for k-means clustering and for coreset construction; our experiments show that it gives a new tradeoff between running time and cluster quality compared to previous state-of-the-art methods for these tasks. Our theoretical analysis is based on novel results of independent interest. We show that the approximation ratio achieved after a random one-dimensional projection can be lifted to the original points and that k-means++ seeding can be implemented in expected time O(nlogn) in one dimension.","lang":"eng"}],"date_created":"2024-05-05T22:01:05Z","publication":"37th Conference on Neural Information Processing Systems","publication_identifier":{"issn":["1049-5258"]},"file_date_updated":"2024-05-22T07:34:00Z","type":"conference","date_updated":"2025-04-14T13:50:49Z","month":"12","department":[{"_id":"MoHe"}],"publication_status":"published","ec_funded":1,"day":"15","arxiv":1,"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"content_type":"application/pdf","checksum":"d169a147a2adf55878e0a99e36a9d468","relation":"main_file","access_level":"open_access","success":1,"date_updated":"2024-05-22T07:34:00Z","creator":"dernst","file_size":1445159,"date_created":"2024-05-22T07:34:00Z","file_id":"15416","file_name":"2023_Neurips_Charikar.pdf"}],"citation":{"mla":"Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” <i>37th Conference on Neural Information Processing Systems</i>, vol. 36, 2023.","short":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference on Neural Information Processing Systems, 2023.","chicago":"Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” In <i>37th Conference on Neural Information Processing Systems</i>, Vol. 36, 2023.","ista":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable and effective clustering via one-dimensional projections. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 36.","ieee":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, and E. Waingarten, “Simple, scalable and effective clustering via one-dimensional projections,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36.","apa":"Charikar, M., Hu, L., Henzinger, M., Vötsch, M., &#38; Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In <i>37th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States.","ama":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and effective clustering via one-dimensional projections. In: <i>37th Conference on Neural Information Processing Systems</i>. Vol 36. ; 2023."},"acknowledgement":"Moses Charikar was supported by a Simons Investigator award. Lunjia Hu was supported by Moses Charikar’s and Omer Reingold’s Simons Investigators awards, Omer Reingold’s NSF Award IIS-1908774, and the Simons Foundation Collaboration on the Theory of Algorithmic Fairness. Part of this work was done while Erik Waingarten was a postdoc at Stanford University, supported by an NSF postdoctoral fellowship and by Moses Charikar’s Simons\r\nInvestigator Award. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data\r\nStructures (MoDynStruct)” and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","scopus_import":"1","alternative_title":["NeurIPS"],"external_id":{"arxiv":["2310.16752"]},"_id":"15364","author":[{"full_name":"Charikar, Moses","last_name":"Charikar","first_name":"Moses"},{"last_name":"Hu","full_name":"Hu, Lunjia","first_name":"Lunjia"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Vötsch, Maximilian","last_name":"Vötsch","first_name":"Maximilian"},{"first_name":"Erik","last_name":"Waingarten","full_name":"Waingarten, Erik"}],"intvolume":"        36","volume":36,"date_published":"2023-12-15T00:00:00Z","article_processing_charge":"Yes","project":[{"name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Efficient algorithms"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"ddc":["000"],"year":"2023"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases","article_type":"original","oa":1,"publication":"Probability and Mathematical Physics","date_created":"2024-05-29T06:12:54Z","publication_identifier":{"issn":["2690-0998"],"eissn":["2690-1005"]},"abstract":[{"lang":"eng","text":"We verify Bogoliubov's approximation for translation invariant Bose gases in the mean field regime, i.e. we prove that the ground state energy EN is given by EN=NeH+infσ(H)+oN→∞(1), where N is the number of particles, eH is the minimal Hartree energy and H is the Bogoliubov Hamiltonian. As an intermediate result we show the existence of approximate ground states ΨN, i.e. states satisfying ⟨HN⟩ΨN=EN+oN→∞(1), exhibiting complete Bose--Einstein condensation with respect to one of the Hartree minimizers."}],"type":"journal_article","date_updated":"2025-04-14T07:26:59Z","publication_status":"published","department":[{"_id":"RoSe"}],"day":"21","doi":"10.2140/pmp.2022.3.939","ec_funded":1,"month":"02","corr_author":"1","quality_controlled":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","arxiv":1,"citation":{"ista":"Brooks M, Seiringer R. 2023. Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases. Probability and Mathematical Physics. 3(4), 939–1000.","mla":"Brooks, Morris, and Robert Seiringer. “Validity of Bogoliubov’s Approximation Fortranslation-Invariant Bose Gases.” <i>Probability and Mathematical Physics</i>, vol. 3, no. 4, Mathematical Sciences Publishers, 2023, pp. 939–1000, doi:<a href=\"https://doi.org/10.2140/pmp.2022.3.939\">10.2140/pmp.2022.3.939</a>.","short":"M. Brooks, R. Seiringer, Probability and Mathematical Physics 3 (2023) 939–1000.","chicago":"Brooks, Morris, and Robert Seiringer. “Validity of Bogoliubov’s Approximation Fortranslation-Invariant Bose Gases.” <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers, 2023. <a href=\"https://doi.org/10.2140/pmp.2022.3.939\">https://doi.org/10.2140/pmp.2022.3.939</a>.","apa":"Brooks, M., &#38; Seiringer, R. (2023). Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2022.3.939\">https://doi.org/10.2140/pmp.2022.3.939</a>","ama":"Brooks M, Seiringer R. Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases. <i>Probability and Mathematical Physics</i>. 2023;3(4):939-1000. doi:<a href=\"https://doi.org/10.2140/pmp.2022.3.939\">10.2140/pmp.2022.3.939</a>","ieee":"M. Brooks and R. Seiringer, “Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases,” <i>Probability and Mathematical Physics</i>, vol. 3, no. 4. Mathematical Sciences Publishers, pp. 939–1000, 2023."},"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.13864"}],"scopus_import":"1","acknowledgement":"We are grateful to Rupert Frank for helpful discussions at an early stage of this project.\r\nFunding from the European Union’s Horizon 2020 research and innovation programme\r\nunder the ERC grant agreement No 694227 is acknowledged.","external_id":{"arxiv":["2111.13864"]},"_id":"17074","issue":"4","author":[{"id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","full_name":"Brooks, Morris","last_name":"Brooks","first_name":"Morris","orcid":"0000-0002-6249-0928"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"intvolume":"         3","volume":3,"date_published":"2023-02-21T00:00:00Z","page":"939-1000","article_processing_charge":"No","project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"publisher":"Mathematical Sciences Publishers","year":"2023"}]