[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present a unified framework for studying the identifiability of\r\nrepresentations learned from simultaneously observed views, such as different\r\ndata modalities. We allow a partially observed setting in which each view\r\nconstitutes a nonlinear mixture of a subset of underlying latent variables,\r\nwhich can be causally related. We prove that the information shared across all\r\nsubsets of any number of views can be learned up to a smooth bijection using\r\ncontrastive learning and a single encoder per view. We also provide graphical\r\ncriteria indicating which latent variables can be identified through a simple\r\nset of rules, which we refer to as identifiability algebra. Our general\r\nframework and theoretical results unify and extend several previous works on\r\nmulti-view nonlinear ICA, disentanglement, and causal representation learning.\r\nWe experimentally validate our claims on numerical, image, and multi-modal data\r\nsets. Further, we demonstrate that the performance of prior methods is\r\nrecovered in different special cases of our setup. Overall, we find that access\r\nto multiple partial views enables us to identify a more fine-grained\r\nrepresentation, under the generally milder assumption of partial observability.","lang":"eng"}],"article_processing_charge":"No","publication_status":"submitted","type":"preprint","external_id":{"arxiv":["2311.04056"]},"arxiv":1,"article_number":"2311.04056","language":[{"iso":"eng"}],"publication":"arXiv","day":"07","title":"Multi-view causal representation learning with partial observability","date_published":"2023-11-07T00:00:00Z","oa":1,"_id":"14946","year":"2023","doi":"10.48550/arXiv.2311.04056","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.04056","open_access":"1"}],"status":"public","department":[{"_id":"FrLo"}],"oa_version":"Preprint","date_created":"2024-02-07T14:28:34Z","date_updated":"2024-02-12T08:07:33Z","citation":{"chicago":"Yao, Dingling, Danru Xu, Sébastien Lachapelle, Sara Magliacane, Perouz Taslakian, Georg Martius, Julius von Kügelgen, and Francesco Locatello. “Multi-View Causal Representation Learning with Partial Observability.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2311.04056\">https://doi.org/10.48550/arXiv.2311.04056</a>.","ieee":"D. Yao <i>et al.</i>, “Multi-view causal representation learning with partial observability,” <i>arXiv</i>. .","short":"D. Yao, D. Xu, S. Lachapelle, S. Magliacane, P. Taslakian, G. Martius, J. von Kügelgen, F. Locatello, ArXiv (n.d.).","mla":"Yao, Dingling, et al. “Multi-View Causal Representation Learning with Partial Observability.” <i>ArXiv</i>, 2311.04056, doi:<a href=\"https://doi.org/10.48550/arXiv.2311.04056\">10.48550/arXiv.2311.04056</a>.","apa":"Yao, D., Xu, D., Lachapelle, S., Magliacane, S., Taslakian, P., Martius, G., … Locatello, F. (n.d.). Multi-view causal representation learning with partial observability. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2311.04056\">https://doi.org/10.48550/arXiv.2311.04056</a>","ama":"Yao D, Xu D, Lachapelle S, et al. Multi-view causal representation learning with partial observability. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2311.04056\">10.48550/arXiv.2311.04056</a>","ista":"Yao D, Xu D, Lachapelle S, Magliacane S, Taslakian P, Martius G, Kügelgen J von, Locatello F. Multi-view causal representation learning with partial observability. arXiv, 2311.04056."},"acknowledgement":"This work was initiated at the Second Bellairs Workshop on Causality held at the Bellairs Research Institute, January 6–13, 2022; we thank all workshop participants for providing a stimulating research environment. Further, we thank Cian Eastwood, Luigi Gresele, Stefano Soatto, Marco Bagatella, and A. René Geist for helpful discussion. GM is a member of the Machine Learning Cluster of Excellence, EXC number 2064/1 – Project number 390727645. JvK and GM acknowledge support from the German Federal Ministry of Education and Research (BMBF) through the Tübingen AI Center (FKZ: 01IS18039B). The research of DX and SM was supported by the Air Force Office of Scientific Research under award number FA8655-22-1-7155. Any opinions, findings, and conclusions or recommendations expressed in\r\nthis material are those of the author(s) and do not necessarily reflect the views of the United States Air Force. We also thank SURF for the support in using the Dutch National Supercomputer Snellius. DY was supported by an Amazon fellowship and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). Work done outside of Amazon. SL was supported by an IVADO excellence PhD scholarship and by Samsung Electronics Co., Ldt.","author":[{"id":"d3e02e50-48a8-11ee-8f62-c108061797fa","first_name":"Dingling","full_name":"Yao, Dingling","last_name":"Yao"},{"full_name":"Xu, Danru","last_name":"Xu","first_name":"Danru"},{"first_name":"Sébastien","full_name":"Lachapelle, Sébastien","last_name":"Lachapelle"},{"first_name":"Sara","full_name":"Magliacane, Sara","last_name":"Magliacane"},{"full_name":"Taslakian, Perouz","last_name":"Taslakian","first_name":"Perouz"},{"last_name":"Martius","full_name":"Martius, Georg","first_name":"Georg"},{"first_name":"Julius von","last_name":"Kügelgen","full_name":"Kügelgen, Julius von"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"}],"month":"11"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.09437"}],"doi":"10.48550/arXiv.2307.09437","_id":"14948","year":"2023","author":[{"first_name":"Avinash","full_name":"Kori, Avinash","last_name":"Kori"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683"},{"full_name":"Ribeiro, Fabio De Sousa","last_name":"Ribeiro","first_name":"Fabio De Sousa"},{"first_name":"Francesca","last_name":"Toni","full_name":"Toni, Francesca"},{"first_name":"Ben","last_name":"Glocker","full_name":"Glocker, Ben"}],"month":"07","citation":{"apa":"Kori, A., Locatello, F., Ribeiro, F. D. S., Toni, F., &#38; Glocker, B. (n.d.). Grounded object centric learning. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2307.09437\">https://doi.org/10.48550/arXiv.2307.09437</a>","ama":"Kori A, Locatello F, Ribeiro FDS, Toni F, Glocker B. Grounded object centric learning. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2307.09437\">10.48550/arXiv.2307.09437</a>","ista":"Kori A, Locatello F, Ribeiro FDS, Toni F, Glocker B. Grounded object centric learning. arXiv, 2307.09437.","chicago":"Kori, Avinash, Francesco Locatello, Fabio De Sousa Ribeiro, Francesca Toni, and Ben Glocker. “Grounded Object Centric Learning.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2307.09437\">https://doi.org/10.48550/arXiv.2307.09437</a>.","ieee":"A. Kori, F. Locatello, F. D. S. Ribeiro, F. Toni, and B. Glocker, “Grounded object centric learning,” <i>arXiv</i>. .","mla":"Kori, Avinash, et al. “Grounded Object Centric Learning.” <i>ArXiv</i>, 2307.09437, doi:<a href=\"https://doi.org/10.48550/arXiv.2307.09437\">10.48550/arXiv.2307.09437</a>.","short":"A. Kori, F. Locatello, F.D.S. Ribeiro, F. Toni, B. Glocker, ArXiv (n.d.)."},"acknowledgement":"This work was supported by supported by UKRI (grant agreement no. EP/S023356/1), in the UKRI\r\nCentre for Doctoral Training in Safe and Trusted AI via A. Kori.","department":[{"_id":"FrLo"}],"oa_version":"Preprint","date_updated":"2024-02-12T08:13:12Z","date_created":"2024-02-07T14:47:04Z","status":"public","arxiv":1,"article_number":"2307.09437","publication_status":"submitted","type":"preprint","external_id":{"arxiv":["2307.09437"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"The extraction of modular object-centric representations for downstream tasks\r\nis an emerging area of research. Learning grounded representations of objects\r\nthat are guaranteed to be stable and invariant promises robust performance\r\nacross different tasks and environments. Slot Attention (SA) learns\r\nobject-centric representations by assigning objects to \\textit{slots}, but\r\npresupposes a \\textit{single} distribution from which all slots are randomly\r\ninitialised. This results in an inability to learn \\textit{specialized} slots\r\nwhich bind to specific object types and remain invariant to identity-preserving\r\nchanges in object appearance. To address this, we present\r\n\\emph{\\textsc{Co}nditional \\textsc{S}lot \\textsc{A}ttention} (\\textsc{CoSA})\r\nusing a novel concept of \\emph{Grounded Slot Dictionary} (GSD) inspired by\r\nvector quantization. Our proposed GSD comprises (i) canonical object-level\r\nproperty vectors and (ii) parametric Gaussian distributions, which define a\r\nprior over the slots. We demonstrate the benefits of our method in multiple\r\ndownstream tasks such as scene generation, composition, and task adaptation,\r\nwhilst remaining competitive with SA in popular object discovery benchmarks.","lang":"eng"}],"oa":1,"day":"18","date_published":"2023-07-18T00:00:00Z","title":"Grounded object centric learning","language":[{"iso":"eng"}],"publication":"arXiv"},{"oa":1,"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2024-02-07T14:57:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Many approaches have been proposed to use diffusion models to augment training datasets for downstream tasks, such as classification. However, diffusion models are themselves trained on large datasets, often with noisy annotations, and it remains an open question to which extent these models contribute to downstream classification performance. In particular, it remains unclear if they generalize enough to improve over directly using the additional data of their pre-training process for augmentation. We systematically evaluate a range of existing methods to generate images from diffusion models and study new extensions to assess their benefit for data augmentation. Personalizing diffusion models towards the target data outperforms simpler prompting strategies. However, using the pre-training data of the diffusion model alone, via a simple nearest-neighbor retrieval procedure, leads to even stronger downstream performance. Our study explores the potential of diffusion models in generating new training data, and surprisingly finds that these sophisticated models are not yet able to beat a simple and strong image retrieval baseline on simple downstream vision tasks.","lang":"eng"}],"article_processing_charge":"No","author":[{"full_name":"Burg, Max","last_name":"Burg","first_name":"Max"},{"full_name":"Wenzel, Florian","last_name":"Wenzel","first_name":"Florian"},{"full_name":"Zietlow, Dominik","last_name":"Zietlow","first_name":"Dominik"},{"last_name":"Horn","full_name":"Horn, Max","first_name":"Max"},{"last_name":"Makansi","full_name":"Makansi, Osama","first_name":"Osama"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","full_name":"Locatello, Francesco"},{"first_name":"Chris","full_name":"Russell, Chris","last_name":"Russell"}],"status":"public","oa_version":"Published Version","publication_identifier":{"eissn":["2835-8856"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2023","publication":"Journal of Machine Learning Research","day":"10","title":"Image retrieval outperforms diffusion models on data augmentation","date_published":"2023-12-10T00:00:00Z","has_accepted_license":"1","alternative_title":["TMLR"],"publisher":"ML Research Press","quality_controlled":"1","type":"journal_article","publication_status":"published","citation":{"chicago":"Burg, Max, Florian Wenzel, Dominik Zietlow, Max Horn, Osama Makansi, Francesco Locatello, and Chris Russell. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.” <i>Journal of Machine Learning Research</i>. ML Research Press, 2023.","mla":"Burg, Max, et al. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.” <i>Journal of Machine Learning Research</i>, ML Research Press, 2023.","short":"M. Burg, F. Wenzel, D. Zietlow, M. Horn, O. Makansi, F. Locatello, C. Russell, Journal of Machine Learning Research (2023).","ieee":"M. Burg <i>et al.</i>, “Image retrieval outperforms diffusion models on data augmentation,” <i>Journal of Machine Learning Research</i>. ML Research Press, 2023.","ama":"Burg M, Wenzel F, Zietlow D, et al. Image retrieval outperforms diffusion models on data augmentation. <i>Journal of Machine Learning Research</i>. 2023.","apa":"Burg, M., Wenzel, F., Zietlow, D., Horn, M., Makansi, O., Locatello, F., &#38; Russell, C. (2023). Image retrieval outperforms diffusion models on data augmentation. <i>Journal of Machine Learning Research</i>. ML Research Press.","ista":"Burg M, Wenzel F, Zietlow D, Horn M, Makansi O, Locatello F, Russell C. 2023. Image retrieval outperforms diffusion models on data augmentation. Journal of Machine Learning Research."},"acknowledgement":"The authors would like to thank Varad Gunjal and Vishaal Udandarao. MFB thanks the International Max Planck Research School for Intelligent Systems (IMPRS-IS).","article_type":"original","month":"12","department":[{"_id":"FrLo"}],"date_created":"2024-02-07T14:57:39Z","date_updated":"2024-02-12T08:30:21Z","file":[{"file_id":"14950","checksum":"af87ddea7908923426365347b9c87ba7","relation":"main_file","access_level":"open_access","date_created":"2024-02-07T14:57:32Z","date_updated":"2024-02-07T14:57:32Z","content_type":"application/pdf","creator":"ptazenko","file_name":"Burg_et_al_2023_Image_retrieval_outperforms.pdf","file_size":27325153}],"main_file_link":[{"url":"https://openreview.net/forum?id=xflYdGZMpv","open_access":"1"}],"_id":"14949"},{"oa":1,"date_published":"2023-11-01T00:00:00Z","title":"Latent space translation via semantic alignment","day":"01","publication":"arXiv","language":[{"iso":"eng"}],"arxiv":1,"article_number":"2311.00664","external_id":{"arxiv":["2311.00664"]},"publication_status":"submitted","type":"preprint","abstract":[{"lang":"eng","text":"While different neural models often exhibit latent spaces that are alike when exposed to semantically related data, this intrinsic similarity is not always immediately discernible. Towards a better understanding of this phenomenon, our work shows how representations learned from these neural modules can be translated between different pre-trained networks via simpler transformations than previously thought. An advantage of this approach is the ability to\r\nestimate these transformations using standard, well-understood algebraic procedures that have closed-form solutions. Our method directly estimates a transformation between two given latent spaces, thereby enabling effective stitching of encoders and decoders without additional training. We extensively validate the adaptability of this translation procedure in different\r\nexperimental settings: across various trainings, domains, architectures (e.g., ResNet, CNN, ViT), and in multiple downstream tasks (classification, reconstruction). Notably, we show how it is possible to zero-shot stitch text encoders and vision decoders, or vice-versa, yielding surprisingly good classification performance in this multimodal setting."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","author":[{"first_name":"Valentino","full_name":"Maiorca, Valentino","last_name":"Maiorca"},{"first_name":"Luca","full_name":"Moschella, Luca","last_name":"Moschella"},{"full_name":"Norelli, Antonio","last_name":"Norelli","first_name":"Antonio"},{"full_name":"Fumero, Marco","last_name":"Fumero","first_name":"Marco"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683"},{"first_name":"Emanuele","full_name":"Rodolà, Emanuele","last_name":"Rodolà"}],"acknowledgement":"This work is supported by the ERC grant no.802554 (SPECGEO), PRIN 2020 project no.2020TA3K9N (LEGO.AI), and PNRR MUR project PE0000013-FAIR. Francesco\r\nLocatello did not contribute to this work at Amazon.","citation":{"ista":"Maiorca V, Moschella L, Norelli A, Fumero M, Locatello F, Rodolà E. Latent space translation via semantic alignment. arXiv, 2311.00664.","ama":"Maiorca V, Moschella L, Norelli A, Fumero M, Locatello F, Rodolà E. Latent space translation via semantic alignment. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2311.00664\">10.48550/arXiv.2311.00664</a>","apa":"Maiorca, V., Moschella, L., Norelli, A., Fumero, M., Locatello, F., &#38; Rodolà, E. (n.d.). Latent space translation via semantic alignment. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2311.00664\">https://doi.org/10.48550/arXiv.2311.00664</a>","short":"V. Maiorca, L. Moschella, A. Norelli, M. Fumero, F. Locatello, E. Rodolà, ArXiv (n.d.).","mla":"Maiorca, Valentino, et al. “Latent Space Translation via Semantic Alignment.” <i>ArXiv</i>, 2311.00664, doi:<a href=\"https://doi.org/10.48550/arXiv.2311.00664\">10.48550/arXiv.2311.00664</a>.","ieee":"V. Maiorca, L. Moschella, A. Norelli, M. Fumero, F. Locatello, and E. Rodolà, “Latent space translation via semantic alignment,” <i>arXiv</i>. .","chicago":"Maiorca, Valentino, Luca Moschella, Antonio Norelli, Marco Fumero, Francesco Locatello, and Emanuele Rodolà. “Latent Space Translation via Semantic Alignment.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2311.00664\">https://doi.org/10.48550/arXiv.2311.00664</a>."},"date_updated":"2024-02-12T09:40:23Z","date_created":"2024-02-07T15:08:55Z","department":[{"_id":"FrLo"}],"oa_version":"Preprint","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.00664","open_access":"1"}],"doi":"10.48550/arXiv.2311.00664","_id":"14952","year":"2023"},{"year":"2023","_id":"14953","doi":"10.48550/arXiv.2310.18123","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.18123"}],"status":"public","date_created":"2024-02-07T15:11:11Z","date_updated":"2024-02-12T09:45:58Z","department":[{"_id":"FrLo"}],"oa_version":"Preprint","acknowledgement":"We are thankful to the reviewers for providing constructive feedback and Kun Zhang and Dominik Janzing for helpful discussion on the special case of deterministic children. This work was supported by Hasler Foundation Program: Hasler Responsible AI (project number 21043). This work was supported by the Swiss National Science Foundation (SNSF) under grant number 200021_205011. Francesco Locatello did not contribute to this work at Amazon. ","citation":{"ista":"Zhu Z, Locatello F, Cevher V. Sample complexity bounds for score-matching: Causal discovery and generative modeling. arXiv, 2310.18123.","apa":"Zhu, Z., Locatello, F., &#38; Cevher, V. (n.d.). Sample complexity bounds for score-matching: Causal discovery and generative modeling. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.18123\">https://doi.org/10.48550/arXiv.2310.18123</a>","ama":"Zhu Z, Locatello F, Cevher V. Sample complexity bounds for score-matching: Causal discovery and generative modeling. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.18123\">10.48550/arXiv.2310.18123</a>","ieee":"Z. Zhu, F. Locatello, and V. Cevher, “Sample complexity bounds for score-matching: Causal discovery and generative modeling,” <i>arXiv</i>. .","short":"Z. Zhu, F. Locatello, V. Cevher, ArXiv (n.d.).","mla":"Zhu, Zhenyu, et al. “Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling.” <i>ArXiv</i>, 2310.18123, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.18123\">10.48550/arXiv.2310.18123</a>.","chicago":"Zhu, Zhenyu, Francesco Locatello, and Volkan Cevher. “Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.18123\">https://doi.org/10.48550/arXiv.2310.18123</a>."},"month":"10","author":[{"first_name":"Zhenyu","full_name":"Zhu, Zhenyu","last_name":"Zhu"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"full_name":"Cevher, Volkan","last_name":"Cevher","first_name":"Volkan"}],"abstract":[{"text":"This paper provides statistical sample complexity bounds for score-matching and its applications in causal discovery. We demonstrate that accurate estimation of the score function is achievable by training a standard deep ReLU neural network using stochastic gradient descent. We establish bounds on the error rate of recovering causal relationships using the score-matching-based causal discovery method of Rolland et al. [2022], assuming a sufficiently good estimation of the score function. Finally, we analyze the upper bound of score-matching estimation within the score-based generative modeling, which has been applied for causal discovery but is also of independent interest within the domain of generative models.","lang":"eng"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2310.18123"]},"publication_status":"submitted","type":"preprint","arxiv":1,"article_number":"2310.18123","publication":"arXiv","language":[{"iso":"eng"}],"date_published":"2023-10-27T00:00:00Z","title":"Sample complexity bounds for score-matching: Causal discovery and generative modeling","day":"27","oa":1},{"day":"20","date_published":"2023-10-20T00:00:00Z","title":"Assumption violations in causal discovery and the robustness of score matching","language":[{"iso":"eng"}],"publication":"arXiv","oa":1,"publication_status":"submitted","type":"preprint","external_id":{"arxiv":["2310.13387"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"When domain knowledge is limited and experimentation is restricted by ethical, financial, or time constraints, practitioners turn to observational causal discovery methods to recover the causal structure, exploiting the statistical properties of their data. Because causal discovery without further assumptions is an ill-posed problem, each algorithm comes with its own set of\r\nusually untestable assumptions, some of which are hard to meet in real datasets. Motivated by these considerations, this paper extensively benchmarks the empirical performance of recent causal discovery methods on observational i.i.d. data generated under different background conditions, allowing for violations of the critical assumptions required by each selected approach. Our experimental findings show that score matching-based methods demonstrate\r\nsurprising performance in the false positive and false negative rate of the inferred graph in these challenging scenarios, and we provide theoretical insights into their performance. This work is also the first effort to benchmark the stability of causal discovery algorithms with respect to the values of their hyperparameters. Finally, we hope this paper will set a new standard for the evaluation of causal discovery methods and can serve as an accessible entry point for practitioners interested in the field, highlighting the empirical implications of different algorithm choices.","lang":"eng"}],"article_processing_charge":"No","article_number":"2310.13387","arxiv":1,"department":[{"_id":"FrLo"}],"oa_version":"Preprint","date_updated":"2024-02-12T09:51:15Z","date_created":"2024-02-07T15:11:56Z","status":"public","author":[{"last_name":"Montagna","full_name":"Montagna, Francesco","first_name":"Francesco"},{"first_name":"Atalanti A.","last_name":"Mastakouri","full_name":"Mastakouri, Atalanti A."},{"last_name":"Eulig","full_name":"Eulig, Elias","first_name":"Elias"},{"full_name":"Noceti, Nicoletta","last_name":"Noceti","first_name":"Nicoletta"},{"first_name":"Lorenzo","full_name":"Rosasco, Lorenzo","last_name":"Rosasco"},{"last_name":"Janzing","full_name":"Janzing, Dominik","first_name":"Dominik"},{"full_name":"Aragam, Bryon","last_name":"Aragam","first_name":"Bryon"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683"}],"month":"10","citation":{"ista":"Montagna F, Mastakouri AA, Eulig E, Noceti N, Rosasco L, Janzing D, Aragam B, Locatello F. Assumption violations in causal discovery and the robustness of score matching. arXiv, 2310.13387.","ama":"Montagna F, Mastakouri AA, Eulig E, et al. Assumption violations in causal discovery and the robustness of score matching. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.13387\">10.48550/arXiv.2310.13387</a>","apa":"Montagna, F., Mastakouri, A. A., Eulig, E., Noceti, N., Rosasco, L., Janzing, D., … Locatello, F. (n.d.). Assumption violations in causal discovery and the robustness of score matching. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.13387\">https://doi.org/10.48550/arXiv.2310.13387</a>","mla":"Montagna, Francesco, et al. “Assumption Violations in Causal Discovery and the Robustness of Score Matching.” <i>ArXiv</i>, 2310.13387, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.13387\">10.48550/arXiv.2310.13387</a>.","short":"F. Montagna, A.A. Mastakouri, E. Eulig, N. Noceti, L. Rosasco, D. Janzing, B. Aragam, F. Locatello, ArXiv (n.d.).","ieee":"F. Montagna <i>et al.</i>, “Assumption violations in causal discovery and the robustness of score matching,” <i>arXiv</i>. .","chicago":"Montagna, Francesco, Atalanti A. Mastakouri, Elias Eulig, Nicoletta Noceti, Lorenzo Rosasco, Dominik Janzing, Bryon Aragam, and Francesco Locatello. “Assumption Violations in Causal Discovery and the Robustness of Score Matching.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.13387\">https://doi.org/10.48550/arXiv.2310.13387</a>."},"acknowledgement":"We thank Kun Zhang and Carl-Johann Simon-Gabriel for the insightful discussions. This work\r\nhas been supported by AFOSR, grant n. FA8655-20-1-7035. FM is supported by Programma\r\nOperativo Nazionale ricerca e innovazione 2014-2020. FM partially contributed to this work during an internship at Amazon Web Services with FL. FL partially contributed while at AWS.","year":"2023","_id":"14954","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.13387","open_access":"1"}],"doi":"10.48550/arXiv.2310.13387"},{"author":[{"full_name":"Xu, Danru","last_name":"Xu","first_name":"Danru"},{"first_name":"Dingling","id":"d3e02e50-48a8-11ee-8f62-c108061797fa","full_name":"Yao, Dingling","last_name":"Yao"},{"first_name":"Sebastien","full_name":"Lachapelle, Sebastien","last_name":"Lachapelle"},{"first_name":"Perouz","full_name":"Taslakian, Perouz","last_name":"Taslakian"},{"last_name":"von Kügelgen","full_name":"von Kügelgen, Julius","first_name":"Julius"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","last_name":"Locatello","full_name":"Locatello, Francesco"},{"last_name":"Magliacane","full_name":"Magliacane, Sara","first_name":"Sara"}],"status":"public","oa_version":"Published Version","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2023","oa":1,"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2024-02-13T08:50:53Z","article_number":"54","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Causal representation learning (CRL) aims at identifying high-level causal variables from low-level data, e.g. images. Current methods usually assume that all causal variables are captured in the high-dimensional observations. In this work, we focus on learning causal representations from data under partial observability, i.e., when some of the causal variables are not observed in the measurements, and the set of masked variables changes across the different samples. We introduce some initial theoretical results for identifying causal variables under partial observability by exploiting a sparsity regularizer, focusing in particular on the linear and piecewise linear mixing function case. We provide a theorem that allows us to identify the causal variables up to permutation and element-wise linear transformations in the linear case and a lemma that allows us to identify causal variables up to linear transformation in the piecewise case. Finally, we provide a conjecture that would allow us to identify the causal variables up to permutation and element-wise linear transformations also in the piecewise linear case. We test the theorem and conjecture on simulated data, showing the effectiveness of our method."}],"citation":{"ama":"Xu D, Yao D, Lachapelle S, et al. A sparsity principle for partially observable causal representation learning. In: <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. OpenReview; 2023.","apa":"Xu, D., Yao, D., Lachapelle, S., Taslakian, P., von Kügelgen, J., Locatello, F., &#38; Magliacane, S. (2023). A sparsity principle for partially observable causal representation learning. In <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. New Orleans, LA, United States: OpenReview.","ista":"Xu D, Yao D, Lachapelle S, Taslakian P, von Kügelgen J, Locatello F, Magliacane S. 2023. A sparsity principle for partially observable causal representation learning. Causal Representation Learning Workshop at NeurIPS 2023. CRL: Causal Representation Learning Workshop at NeurIPS, 54.","chicago":"Xu, Danru, Dingling Yao, Sebastien Lachapelle, Perouz Taslakian, Julius von Kügelgen, Francesco Locatello, and Sara Magliacane. “A Sparsity Principle for Partially Observable Causal Representation Learning.” In <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. OpenReview, 2023.","mla":"Xu, Danru, et al. “A Sparsity Principle for Partially Observable Causal Representation Learning.” <i>Causal Representation Learning Workshop at NeurIPS 2023</i>, 54, OpenReview, 2023.","short":"D. Xu, D. Yao, S. Lachapelle, P. Taslakian, J. von Kügelgen, F. Locatello, S. Magliacane, in:, Causal Representation Learning Workshop at NeurIPS 2023, OpenReview, 2023.","ieee":"D. Xu <i>et al.</i>, “A sparsity principle for partially observable causal representation learning,” in <i>Causal Representation Learning Workshop at NeurIPS 2023</i>, New Orleans, LA, United States, 2023."},"acknowledgement":"This work was initiated at the Second Bellairs Workshop on Causality held at the Bellairs Research Institute, January 6–13, 2022; we thank all workshop participants for providing a stimulating research environment. The research of DX and SM was supported by the Air Force Office of Scientific Research under award number FA8655-22-1-7155. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the United States Air Force. We also thank SURF for the support in using the Dutch National Supercomputer Snellius. DY was supported by an Amazon fellowship and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). Work done outside of Amazon. SL was supported by an IVADO excellence PhD scholarship and by Samsung Electronics Co., Ldt. JvK acknowledges support from the German Federal Ministry of Education and Research (BMBF)\r\nthrough the Tübingen AI Center (FKZ: 01IS18039B).\r\n","month":"12","department":[{"_id":"FrLo"}],"date_created":"2024-02-07T15:17:51Z","date_updated":"2024-02-13T08:59:27Z","file":[{"content_type":"application/pdf","file_id":"14982","checksum":"484efc27bda75ed6666044989695d9b6","date_created":"2024-02-13T08:50:53Z","date_updated":"2024-02-13T08:50:53Z","relation":"main_file","access_level":"open_access","success":1,"file_size":552357,"file_name":"2023_CRL_Xu.pdf","creator":"dernst"}],"main_file_link":[{"url":"https://openreview.net/forum?id=Whr6uobelR","open_access":"1"}],"conference":{"start_date":"2023-12-15","location":"New Orleans, LA, United States","name":"CRL: Causal Representation Learning Workshop at NeurIPS","end_date":"2023-12-15"},"_id":"14958","publication":"Causal Representation Learning Workshop at NeurIPS 2023","day":"05","title":"A sparsity principle for partially observable causal representation learning","date_published":"2023-12-05T00:00:00Z","has_accepted_license":"1","publisher":"OpenReview","publication_status":"published","type":"conference","quality_controlled":"1"},{"oa":1,"day":"22","title":"Shortcuts for causal discovery of nonlinear models by score matching","date_published":"2023-10-22T00:00:00Z","language":[{"iso":"eng"}],"publication":"arXiv","article_number":"2310.14246","arxiv":1,"publication_status":"submitted","type":"preprint","external_id":{"arxiv":["2310.14246"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"The use of simulated data in the field of causal discovery is ubiquitous due to the scarcity of annotated real data. Recently, Reisach et al., 2021 highlighted the emergence of patterns in simulated linear data, which displays increasing marginal variance in the casual direction. As an ablation in their experiments, Montagna et al., 2023 found that similar patterns may emerge in\r\nnonlinear models for the variance of the score vector $\\nabla \\log p_{\\mathbf{X}}$, and introduced the ScoreSort algorithm. In this work, we formally define and characterize this score-sortability pattern of nonlinear additive noise models. We find that it defines a class of identifiable (bivariate) causal models overlapping with nonlinear additive noise models. We\r\ntheoretically demonstrate the advantages of ScoreSort in terms of statistical efficiency compared to prior state-of-the-art score matching-based methods and empirically show the score-sortability of the most common synthetic benchmarks in the literature. Our findings remark (1) the lack of diversity in the data as an important limitation in the evaluation of nonlinear causal discovery approaches, (2) the importance of thoroughly testing different settings within a problem class, and (3) the importance of analyzing statistical properties in\r\ncausal discovery, where research is often limited to defining identifiability conditions of the model. ","lang":"eng"}],"author":[{"first_name":"Francesco","last_name":"Montagna","full_name":"Montagna, Francesco"},{"first_name":"Nicoletta","last_name":"Noceti","full_name":"Noceti, Nicoletta"},{"first_name":"Lorenzo","last_name":"Rosasco","full_name":"Rosasco, Lorenzo"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"}],"month":"10","citation":{"chicago":"Montagna, Francesco, Nicoletta Noceti, Lorenzo Rosasco, and Francesco Locatello. “Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.14246\">https://doi.org/10.48550/arXiv.2310.14246</a>.","short":"F. Montagna, N. Noceti, L. Rosasco, F. Locatello, ArXiv (n.d.).","mla":"Montagna, Francesco, et al. “Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” <i>ArXiv</i>, 2310.14246, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.14246\">10.48550/arXiv.2310.14246</a>.","ieee":"F. Montagna, N. Noceti, L. Rosasco, and F. Locatello, “Shortcuts for causal discovery of nonlinear models by score matching,” <i>arXiv</i>. .","ama":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.14246\">10.48550/arXiv.2310.14246</a>","apa":"Montagna, F., Noceti, N., Rosasco, L., &#38; Locatello, F. (n.d.). Shortcuts for causal discovery of nonlinear models by score matching. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.14246\">https://doi.org/10.48550/arXiv.2310.14246</a>","ista":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. arXiv, 2310.14246."},"department":[{"_id":"FrLo"}],"oa_version":"Preprint","date_created":"2024-02-08T15:31:46Z","date_updated":"2024-02-12T10:03:33Z","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.14246","open_access":"1"}],"doi":"10.48550/arXiv.2310.14246","year":"2023","_id":"14961"},{"language":[{"iso":"eng"}],"oa":1,"ddc":["540"],"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."}],"article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-02-19T09:58:32Z","status":"public","oa_version":"Published Version","page":"161-170","author":[{"last_name":"Liu","full_name":"Liu, Zhengtao","first_name":"Zhengtao"},{"last_name":"Hong","full_name":"Hong, Tao","first_name":"Tao"},{"first_name":"Liqing","last_name":"Xu","full_name":"Xu, Liqing"},{"first_name":"Sining","full_name":"Wang, Sining","last_name":"Wang"},{"last_name":"Gao","full_name":"Gao, Xiang","first_name":"Xiang"},{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","first_name":"Cheng","orcid":"0000-0002-9515-4277","last_name":"Chang","full_name":"Chang, Cheng"},{"first_name":"Xiangdong","last_name":"Ding","full_name":"Ding, Xiangdong"},{"last_name":"Xiao","full_name":"Xiao, Yu","first_name":"Yu"},{"first_name":"Li‐Dong","last_name":"Zhao","full_name":"Zhao, Li‐Dong"}],"year":"2023","publication_identifier":{"eissn":["2767-441X"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Interdisciplinary Materials","title":"Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS","date_published":"2023-01-01T00:00:00Z","day":"01","publisher":"Wiley","quality_controlled":"1","publication_status":"published","type":"journal_article","has_accepted_license":"1","intvolume":"         2","date_updated":"2024-02-19T10:01:26Z","date_created":"2024-02-14T12:12:17Z","department":[{"_id":"MaIb"}],"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.","citation":{"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.","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>","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>","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.","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>.","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.","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>."},"month":"01","article_type":"original","_id":"14985","issue":"1","doi":"10.1002/idm2.12056","volume":2,"file":[{"file_size":4675941,"file_name":"2023_InterdiscMaterials_Liu.pdf","creator":"dernst","content_type":"application/pdf","file_id":"15015","checksum":"7b5e8210ef1434feb173022c6dbbee0c","date_created":"2024-02-19T09:58:32Z","date_updated":"2024-02-19T09:58:32Z","access_level":"open_access","relation":"main_file","success":1}]},{"oa":1,"publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","language":[{"iso":"eng"}],"title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","date_published":"2023-03-01T00:00:00Z","day":"01","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"publisher":"Internet Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publication_status":"published","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.","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.","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.","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>."},"month":"03","author":[{"first_name":"Harjasleen","last_name":"Malvai","full_name":"Malvai, Harjasleen"},{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"},{"first_name":"Alberto","full_name":"Sonnino, Alberto","last_name":"Sonnino"},{"last_name":"Ghosh","full_name":"Ghosh, Esha","first_name":"Esha"},{"first_name":"Ercan","full_name":"Oztürk, Ercan","last_name":"Oztürk"},{"first_name":"Kevin","last_name":"Lewi","full_name":"Lewi, Kevin"},{"first_name":"Sean","full_name":"Lawlor, Sean","last_name":"Lawlor"}],"status":"public","date_updated":"2024-02-19T12:11:15Z","date_created":"2024-02-14T14:20:40Z","department":[{"_id":"ElKo"}],"oa_version":"Published Version","publication_identifier":{"isbn":["1891562835"]},"doi":"10.14722/ndss.2023.24545","main_file_link":[{"url":"https://eprint.iacr.org/2023/081","open_access":"1"}],"_id":"14989","year":"2023","conference":{"end_date":"2023-03-03","name":"NDSS: Network and Distributed Systems Security","start_date":"2023-02-27","location":"San Diego, CA, United States"}},{"doi":"10.5281/ZENODO.7548214","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"year":"2023","_id":"14990","related_material":{"record":[{"id":"13139","relation":"used_in_publication","status":"public"}]},"citation":{"ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 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>.","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>.","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>","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>"},"month":"01","author":[{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"status":"public","date_created":"2024-02-14T14:27:06Z","date_updated":"2024-02-27T07:19:32Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","has_accepted_license":"1","article_processing_charge":"No","abstract":[{"text":"The software artefact to evaluate the approximation of stationary distributions implementation.","lang":"eng"}],"publisher":"Zenodo","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data_reference","oa":1,"ddc":["000"],"title":"Artefact for: Correct Approximation of Stationary Distributions","date_published":"2023-01-18T00:00:00Z","day":"18"},{"ec_funded":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7757041","open_access":"1"}],"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"doi":"10.5281/ZENODO.7757041","_id":"14991","year":"2023","month":"06","author":[{"id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","first_name":"Yi-Ling","orcid":"0000-0001-9281-3479","last_name":"Hwong","full_name":"Hwong, Yi-Ling"},{"full_name":"Colin, Maxime","last_name":"Colin","first_name":"Maxime"},{"first_name":"Philipp","id":"02eace56-97fc-11ee-b81a-f0939ca85a77","last_name":"Aglas","full_name":"Aglas, Philipp"},{"first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","last_name":"Muller","orcid":"0000-0001-5836-5350"},{"first_name":"Steven C.","last_name":"Sherwood","full_name":"Sherwood, Steven C."}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"14654"}]},"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>.","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>","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>","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.","short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S.C. Sherwood, (2023).","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>.","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>."},"date_updated":"2024-02-27T07:26:31Z","date_created":"2024-02-14T14:37:57Z","oa_version":"Published Version","department":[{"_id":"CaMu"}],"status":"public","has_accepted_license":"1","type":"research_data_reference","abstract":[{"lang":"eng","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)."}],"article_processing_charge":"No","publisher":"Zenodo","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["550"],"oa":1,"date_published":"2023-06-23T00:00:00Z","title":"Data-assessing memory in convection schemes using idealized tests","day":"23"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1912.10424","open_access":"1"}],"doi":"10.1007/978-3-031-22340-2_3","_id":"14992","month":"07","citation":{"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>.","short":"M. Lewin, E.H. Lieb, R. Seiringer, in:, E. Cances, G. Friesecke (Eds.), Density Functional Theory, 1st ed., Springer, 2023, pp. 115–182.","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.","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.","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>"},"department":[{"_id":"RoSe"}],"date_updated":"2024-02-20T08:33:06Z","date_created":"2024-02-14T14:44:33Z","arxiv":1,"alternative_title":["Mathematics and Molecular Modeling"],"quality_controlled":"1","publication_status":"published","type":"book_chapter","publisher":"Springer","day":"19","title":"Universal Functionals in Density Functional Theory","date_published":"2023-07-19T00:00:00Z","publication":"Density Functional Theory","publication_identifier":{"issn":["3005-0286"],"isbn":["9783031223396"],"eisbn":["9783031223402"]},"year":"2023","author":[{"last_name":"Lewin","full_name":"Lewin, Mathieu","first_name":"Mathieu"},{"full_name":"Lieb, Elliott H.","last_name":"Lieb","first_name":"Elliott H."},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer"}],"page":"115-182","editor":[{"first_name":"Eric","last_name":"Cances","full_name":"Cances, Eric"},{"last_name":"Friesecke","full_name":"Friesecke, Gero","first_name":"Gero"}],"oa_version":"Preprint","series_title":"MAMOMO","status":"public","external_id":{"arxiv":["1912.10424"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","edition":"1","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"}],"oa":1,"language":[{"iso":"eng"}]},{"year":"2023","_id":"14993","conference":{"end_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations","location":"Kigali, Rwanda","start_date":"2023-05-05"},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=jHY_G91R880"}],"status":"public","date_created":"2024-02-14T15:11:48Z","date_updated":"2024-02-28T12:12:00Z","oa_version":"Published Version","department":[{"_id":"TiVo"}],"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.","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.","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.","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.","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.","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."},"month":"03","author":[{"last_name":"Currin","full_name":"Currin, Christopher","orcid":"0000-0002-4809-5059","first_name":"Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9"},{"first_name":"Mercy Nyamewaa","last_name":"Asiedu ","full_name":"Asiedu , Mercy Nyamewaa"},{"last_name":"Fourie","full_name":"Fourie, Chris","first_name":"Chris"},{"last_name":"Rosman","full_name":"Rosman, Benjamin","first_name":"Benjamin"},{"first_name":"Houcemeddine","full_name":"Turki, Houcemeddine","last_name":"Turki"},{"first_name":"Atnafu","last_name":"Lambebo Tonja","full_name":"Lambebo Tonja, Atnafu"},{"first_name":"Jade","last_name":"Abbott","full_name":"Abbott, Jade"},{"full_name":"Ajala, Marvellous","last_name":"Ajala","first_name":"Marvellous"},{"full_name":"Adedayo, Sadiq Adewale","last_name":"Adedayo","first_name":"Sadiq Adewale"},{"full_name":"Emezue, Chris Chinenye","last_name":"Emezue","first_name":"Chris Chinenye"},{"first_name":"Daphne","full_name":"Machangara, Daphne","last_name":"Machangara"}],"article_processing_charge":"No","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."}],"publisher":"OpenReview","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"conference","quality_controlled":"1","publication":"1st Workshop on Machine Learning & Global Health","language":[{"iso":"eng"}],"date_published":"2023-03-02T00:00:00Z","title":"A framework for grassroots research collaboration in machine learning and global health","day":"02","oa":1},{"ddc":["000"],"oa":1,"day":"28","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","date_published":"2023-04-28T00:00:00Z","has_accepted_license":"1","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Zenodo","article_processing_charge":"No","abstract":[{"lang":"eng","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."}],"author":[{"first_name":"Rupak","full_name":"Majumdar, Rupak","last_name":"Majumdar"},{"orcid":"0000-0001-9864-7475","last_name":"Mallik","full_name":"Mallik, Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik"},{"first_name":"Mateusz","full_name":"Rychlicki, Mateusz","last_name":"Rychlicki"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"},{"last_name":"Soudjani","full_name":"Soudjani, Sadegh","first_name":"Sadegh"}],"month":"04","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>","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>","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>.","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>.","short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).","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."},"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"14758"}]},"oa_version":"Published Version","department":[{"_id":"ToHe"}],"date_created":"2024-02-14T15:13:00Z","date_updated":"2024-02-27T07:39:51Z","status":"public","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877790"}],"doi":"10.5281/ZENODO.7877790","_id":"14994","year":"2023"},{"doi":"10.5281/ZENODO.7877757","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7877757","open_access":"1"}],"year":"2023","_id":"14995","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14260"}]},"citation":{"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.","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).","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>.","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>.","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>"},"month":"04","author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval"},{"last_name":"Fedorov","full_name":"Fedorov, Alexander","first_name":"Alexander","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6"},{"first_name":"Maria","full_name":"Sokolova, Maria","last_name":"Sokolova"},{"first_name":"Dmitry","full_name":"Tsitelov, Dmitry","last_name":"Tsitelov"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"status":"public","date_created":"2024-02-14T15:14:13Z","date_updated":"2024-02-27T07:46:52Z","oa_version":"Published Version","department":[{"_id":"DaAl"}],"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"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Zenodo","type":"research_data_reference","oa":1,"ddc":["000"],"date_published":"2023-04-28T00:00:00Z","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","day":"28"},{"status":"public","oa_version":"Preprint","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2024-02-25T09:23:24Z","date_updated":"2025-07-14T09:10:04Z","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.","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.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 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.","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.","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."},"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","author":[{"last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6","first_name":"Abhinav","last_name":"Verma","full_name":"Verma, Abhinav"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"month":"12","conference":{"end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10","location":"New Orleans, LO, United States"},"year":"2023","_id":"15023","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"ec_funded":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.01456","open_access":"1"}],"language":[{"iso":"eng"}],"publication":"37th Conference on Neural Information Processing Systems","day":"15","title":"Compositional policy learning in stochastic control systems with formal guarantees","date_published":"2023-12-15T00:00:00Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","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"}],"type":"conference","quality_controlled":"1","publication_status":"epub_ahead","external_id":{"arxiv":["2312.01456"]},"arxiv":1},{"day":"13","license":"https://creativecommons.org/publicdomain/zero/1.0/","date_published":"2023-12-13T00:00:00Z","title":"aggregation_data","ddc":["570"],"oa":1,"type":"research_data_reference","publisher":"Figshare","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"This data repository underpins the paper, published in PNAS (doi pending) and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).","lang":"eng"}],"has_accepted_license":"1","oa_version":"Published Version","department":[{"_id":"AnSa"}],"date_created":"2024-02-26T08:37:57Z","date_updated":"2024-02-26T08:45:55Z","status":"public","author":[{"last_name":"Curk","full_name":"Curk, Samo","orcid":"0000-0001-6160-9766","id":"031eff0d-d481-11ee-8508-cd12a7a86e5b","first_name":"Samo"}],"month":"12","citation":{"ista":"Curk S. 2023. aggregation_data, Figshare.","apa":"Curk, S. (2023). aggregation_data. Figshare.","ama":"Curk S. aggregation_data. 2023.","ieee":"S. Curk, “aggregation_data.” Figshare, 2023.","mla":"Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023.","short":"S. Curk, (2023).","chicago":"Curk, Samo. “Aggregation_data.” Figshare, 2023."},"related_material":{"record":[{"id":"15001","status":"public","relation":"used_in_publication"}]},"_id":"15027","year":"2023","tmp":{"image":"/images/cc_0.png","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"main_file_link":[{"url":"https://figshare.com/s/85798bba4ebc68d822ed","open_access":"1"}]},{"date_created":"2024-02-28T07:34:34Z","date_updated":"2024-02-28T12:33:09Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","status":"public","month":"07","author":[{"first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"related_material":{"record":[{"id":"14076","status":"public","relation":"used_in_publication"}]},"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>","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>","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>.","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>.","short":"M. Chalupa, T.A. Henzinger, (2023).","ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023."},"year":"2023","_id":"15035","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8191722","open_access":"1"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"doi":"10.5281/ZENODO.8191723","title":"Monitoring hyperproperties with prefix transducers","date_published":"2023-07-28T00:00:00Z","day":"28","ddc":["000"],"oa":1,"type":"research_data_reference","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."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Zenodo","has_accepted_license":"1"},{"author":[{"full_name":"Prach, Bernd","last_name":"Prach","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph"}],"month":"11","citation":{"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>","ista":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. arXiv, 2311.06103.","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>.","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>.","ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. ."},"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"oa_version":"Preprint","date_created":"2024-02-28T17:59:32Z","date_updated":"2024-03-04T07:02:39Z","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.06103"}],"doi":"10.48550/ARXIV.2311.06103","year":"2023","_id":"15039","oa":1,"day":"10","title":"1-Lipschitz neural networks are more expressive with N-activations","date_published":"2023-11-10T00:00:00Z","publication":"arXiv","language":[{"iso":"eng"}],"arxiv":1,"article_number":"2311.06103","publication_status":"submitted","type":"preprint","external_id":{"arxiv":["2311.06103"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"article_processing_charge":"No"}]