[{"date_updated":"2022-11-08T17:34:36Z","publisher":"International Joint Conferences on Artificial Intelligence Organization","date_created":"2022-11-08T16:53:31Z","author":[{"last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983","first_name":"Gleb"},{"last_name":"Dziubiński","full_name":"Dziubiński, Marcin","first_name":"Marcin"}],"title":"Fair, Individually Rational and Cheap Adjustment","main_file_link":[{"url":"https://www.ijcai.org/proceedings/2022/64"}],"doi":"10.24963/ijcai.2022/64","conference":{"start_date":"2022-07-23","name":"THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE","location":"Vienna","end_date":"2022-07-29"},"publication_status":"published","year":"2022","citation":{"ieee":"G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,” in <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, Vienna, 2022, doi: <a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","chicago":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” In <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt. International Joint Conferences on Artificial Intelligence Organization, 2022. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>.","ama":"Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2022. doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>","apa":"Polevoy, G., &#38; Dziubiński, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>","mla":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","bibtex":"@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational and Cheap Adjustment}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>}, booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt, Luc}, year={2022} }","short":"G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2022."},"_id":"34040","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["adjustment","strictly dominant","fairness","individually rational","transfer","tax","subsidy"],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","abstract":[{"text":"<jats:p>Consider the practical goal of making a desired action profile played,\r\n\r\nwhen the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications include motivating people\r\n\r\nto choose the closest school, the closest subway station, or to coordinate\r\n\r\non a communication protocol or an investment strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly. The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we also prove that our adjustment minimises \r\n\r\nthe general transfer among all such adjustments, counting the total subsidising and taxation.</jats:p>","lang":"eng"}],"editor":[{"first_name":"Luc","full_name":"De Raedt, Luc","last_name":"De Raedt"}],"status":"public"},{"status":"public","editor":[{"full_name":"Berenbrink, Petra","last_name":"Berenbrink","first_name":"Petra"},{"first_name":"Benjamin","last_name":"Monmege","full_name":"Monmege, Benjamin"}],"type":"conference","publication":"39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)","language":[{"iso":"eng"}],"user_id":"88252","series_title":"LIPIcs","department":[{"_id":"63"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"33085","citation":{"chicago":"Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>.","ieee":"L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality Constrained Scheduling in Online Models,” in <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, 2022, vol. 219, p. 28:1–28:15, doi: <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","ama":"Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>. Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>","mla":"Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","bibtex":"@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs}, title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>}, booktitle={39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink, Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs} }","short":"L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.","apa":"Epstein, L., Lassota, A., Levin, A., Maack, M., &#38; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink &#38; B. Monmege (Eds.), <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i> (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>"},"intvolume":"       219","page":"28:1–28:15","year":"2022","doi":"10.4230/LIPIcs.STACS.2022.28","title":"Cardinality Constrained Scheduling in Online Models","date_created":"2022-08-23T08:10:36Z","author":[{"first_name":"Leah","full_name":"Epstein, Leah","last_name":"Epstein"},{"last_name":"Lassota","full_name":"Lassota, Alexandra","first_name":"Alexandra"},{"first_name":"Asaf","last_name":"Levin","full_name":"Levin, Asaf"},{"first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten","id":"88252"},{"last_name":"Rohwedder","full_name":"Rohwedder, Lars","first_name":"Lars"}],"volume":219,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-08T16:34:32Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"600"}],"user_id":"82920","_id":"33004","status":"public","publication":"Proceedings of the 29th International Conference on Computational Linguistics","type":"conference","title":"\"Mama Always Had a Way of Explaining Things So I Could Understand\": A Dialogue Corpus for Learning How to Explain","author":[{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Milad","last_name":"Alshomary","id":"73059","full_name":"Alshomary, Milad"}],"date_created":"2022-08-18T10:00:46Z","date_updated":"2022-11-10T09:06:39Z","page":"344 - 354","citation":{"mla":"Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.” <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 2022, pp. 344–54.","short":"H. Wachsmuth, M. Alshomary, in: Proceedings of the 29th International Conference on Computational Linguistics, 2022, pp. 344–354.","bibtex":"@inproceedings{Wachsmuth_Alshomary_2022, title={“Mama Always Had a Way of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain}, booktitle={Proceedings of the 29th International Conference on Computational Linguistics}, author={Wachsmuth, Henning and Alshomary, Milad}, year={2022}, pages={344–354} }","apa":"Wachsmuth, H., &#38; Alshomary, M. (2022). “Mama Always Had a Way of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain. <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 344–354.","ama":"Wachsmuth H, Alshomary M. “Mama Always Had a Way of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain. In: <i>Proceedings of the 29th International Conference on Computational Linguistics</i>. ; 2022:344-354.","chicago":"Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.” In <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 344–54, 2022.","ieee":"H. Wachsmuth and M. Alshomary, “‘Mama Always Had a Way of Explaining Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain,” in <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 2022, pp. 344–354."},"year":"2022"},{"date_created":"2022-11-10T08:39:38Z","author":[{"full_name":"Lauscher, Anne","last_name":"Lauscher","first_name":"Anne"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"first_name":"Iryna","full_name":"Gurevych, Iryna","last_name":"Gurevych"},{"first_name":"Goran","full_name":"Glavaš, Goran","last_name":"Glavaš"}],"date_updated":"2022-11-10T08:39:48Z","title":"On the Role of Knowledge in  Computational Argumentation","citation":{"bibtex":"@article{Lauscher_Wachsmuth_Gurevych_Glavaš_2022, title={On the Role of Knowledge in  Computational Argumentation}, journal={Transactions of the Association for Computational Linguistics}, author={Lauscher, Anne and Wachsmuth, Henning and Gurevych, Iryna and Glavaš, Goran}, year={2022} }","short":"A. Lauscher, H. Wachsmuth, I. Gurevych, G. Glavaš, Transactions of the Association for Computational Linguistics (2022).","mla":"Lauscher, Anne, et al. “On the Role of Knowledge in  Computational Argumentation.” <i>Transactions of the Association for Computational Linguistics</i>, 2022.","apa":"Lauscher, A., Wachsmuth, H., Gurevych, I., &#38; Glavaš, G. (2022). On the Role of Knowledge in  Computational Argumentation. <i>Transactions of the Association for Computational Linguistics</i>.","ama":"Lauscher A, Wachsmuth H, Gurevych I, Glavaš G. On the Role of Knowledge in  Computational Argumentation. <i>Transactions of the Association for Computational Linguistics</i>. Published online 2022.","chicago":"Lauscher, Anne, Henning Wachsmuth, Iryna Gurevych, and Goran Glavaš. “On the Role of Knowledge in  Computational Argumentation.” <i>Transactions of the Association for Computational Linguistics</i>, 2022.","ieee":"A. Lauscher, H. Wachsmuth, I. Gurevych, and G. Glavaš, “On the Role of Knowledge in  Computational Argumentation,” <i>Transactions of the Association for Computational Linguistics</i>, 2022."},"year":"2022","user_id":"82920","department":[{"_id":"600"}],"_id":"34049","language":[{"iso":"eng"}],"type":"journal_article","publication":"Transactions of the Association for Computational Linguistics","status":"public"},{"publication":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics","type":"conference","status":"public","department":[{"_id":"600"}],"user_id":"82920","_id":"22157","language":[{"iso":"eng"}],"page":"4459 - 4471","citation":{"apa":"Kiesel, J., Alshomary, M., Handke, N., Cai, X., Wachsmuth, H., &#38; Stein, B. (2022). Identifying the Human Values behind Arguments. <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 4459–4471.","bibtex":"@inproceedings{Kiesel_Alshomary_Handke_Cai_Wachsmuth_Stein_2022, title={Identifying the Human Values behind Arguments}, booktitle={Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics}, author={Kiesel, Johannes and Alshomary, Milad and Handke, Nicolas and Cai, Xiaoni and Wachsmuth, Henning and Stein, Benno}, year={2022}, pages={4459–4471} }","short":"J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, B. Stein, in: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics, 2022, pp. 4459–4471.","mla":"Kiesel, Johannes, et al. “Identifying the Human Values behind Arguments.” <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 2022, pp. 4459–71.","ama":"Kiesel J, Alshomary M, Handke N, Cai X, Wachsmuth H, Stein B. Identifying the Human Values behind Arguments. In: <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>. ; 2022:4459-4471.","chicago":"Kiesel, Johannes, Milad Alshomary, Nicolas Handke, Xiaoni Cai, Henning Wachsmuth, and Benno Stein. “Identifying the Human Values behind Arguments.” In <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 4459–71, 2022.","ieee":"J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, and B. Stein, “Identifying the Human Values behind Arguments,” in <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 2022, pp. 4459–4471."},"year":"2022","author":[{"full_name":"Kiesel, Johannes","last_name":"Kiesel","first_name":"Johannes"},{"first_name":"Milad","last_name":"Alshomary","full_name":"Alshomary, Milad","id":"73059"},{"first_name":"Nicolas","last_name":"Handke","full_name":"Handke, Nicolas"},{"last_name":"Cai","full_name":"Cai, Xiaoni","first_name":"Xiaoni"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"},{"last_name":"Stein","full_name":"Stein, Benno","first_name":"Benno"}],"date_created":"2021-05-11T23:15:42Z","date_updated":"2022-11-10T09:09:27Z","title":"Identifying the Human Values behind Arguments"},{"title":"Domain-specific Language for Condition Monitoring Software Development","doi":"10.1109/etfa52439.2022.9921730","publisher":"IEEE","date_updated":"2022-11-10T14:30:42Z","date_created":"2022-11-10T14:30:16Z","author":[{"last_name":"Pasic","full_name":"Pasic, Faruk","first_name":"Faruk"},{"first_name":"Matthias","full_name":"Becker, Matthias","last_name":"Becker"}],"year":"2022","citation":{"ieee":"F. Pasic and M. Becker, “Domain-specific Language for Condition Monitoring Software Development,” 2022, doi: <a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>.","chicago":"Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition Monitoring Software Development.” In <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">https://doi.org/10.1109/etfa52439.2022.9921730</a>.","ama":"Pasic F, Becker M. Domain-specific Language for Condition Monitoring Software Development. In: <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>","bibtex":"@inproceedings{Pasic_Becker_2022, title={Domain-specific Language for Condition Monitoring Software Development}, DOI={<a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>}, booktitle={2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)}, publisher={IEEE}, author={Pasic, Faruk and Becker, Matthias}, year={2022} }","short":"F. Pasic, M. Becker, in: 2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA), IEEE, 2022.","mla":"Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition Monitoring Software Development.” <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>.","apa":"Pasic, F., &#38; Becker, M. (2022). Domain-specific Language for Condition Monitoring Software Development. <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. <a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">https://doi.org/10.1109/etfa52439.2022.9921730</a>"},"publication_status":"published","_id":"34057","department":[{"_id":"241"},{"_id":"76"}],"user_id":"49576","status":"public","publication":"2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)","type":"conference"},{"extern":"1","language":[{"iso":"eng"}],"_id":"34047","external_id":{"arxiv":["2211.03634"]},"department":[{"_id":"600"}],"user_id":"84035","abstract":[{"text":"News articles both shape and reflect public opinion across the political\r\nspectrum. Analyzing them for social bias can thus provide valuable insights,\r\nsuch as prevailing stereotypes in society and the media, which are often\r\nadopted by NLP models trained on respective data. Recent work has relied on\r\nword embedding bias measures, such as WEAT. However, several representation\r\nissues of embeddings can harm the measures' accuracy, including low-resource\r\nsettings and token frequency differences. In this work, we study what kind of\r\nembedding algorithm serves best to accurately measure types of social bias\r\nknown to exist in US online news articles. To cover the whole spectrum of\r\npolitical bias in the US, we collect 500k articles and review psychology\r\nliterature with respect to expected social bias. We then quantify social bias\r\nusing WEAT along with embedding algorithms that account for the aforementioned\r\nissues. We compare how models trained with the algorithms on news articles\r\nrepresent the expected social bias. Our results suggest that the standard way\r\nto quantify bias does not align well with knowledge from psychology. While the\r\nproposed algorithms reduce the~gap, they still do not fully match the\r\nliterature.","lang":"eng"}],"status":"public","publication":"Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)","type":"conference","title":"No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media","conference":{"end_date":"2022-12-11","location":"Abu Dhabi","name":"The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)","start_date":"2022-12-07"},"publisher":"Association for Computational Linguistics","date_updated":"2022-11-11T12:49:47Z","author":[{"first_name":"Maximilian","full_name":"Spliethöver, Maximilian","last_name":"Spliethöver"},{"full_name":"Keiff, Maximilian","last_name":"Keiff","first_name":"Maximilian"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"date_created":"2022-11-10T08:28:53Z","year":"2022","citation":{"ieee":"M. Spliethöver, M. Keiff, and H. Wachsmuth, “No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media,” presented at the The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi, 2022.","chicago":"Spliethöver, Maximilian, Maximilian Keiff, and Henning Wachsmuth. “No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media.” In <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>. Association for Computational Linguistics, 2022.","ama":"Spliethöver M, Keiff M, Wachsmuth H. No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media. In: <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>. Association for Computational Linguistics; 2022.","apa":"Spliethöver, M., Keiff, M., &#38; Wachsmuth, H. (2022). No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media. <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>. The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Abu Dhabi.","bibtex":"@inproceedings{Spliethöver_Keiff_Wachsmuth_2022, title={No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media}, booktitle={Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)}, publisher={Association for Computational Linguistics}, author={Spliethöver, Maximilian and Keiff, Maximilian and Wachsmuth, Henning}, year={2022} }","short":"M. Spliethöver, M. Keiff, H. Wachsmuth, in: Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022), Association for Computational Linguistics, 2022.","mla":"Spliethöver, Maximilian, et al. “No Word Embedding Model Is Perfect: Evaluating the Representation  Accuracy for Social Bias in the Media.” <i>Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)</i>, Association for Computational Linguistics, 2022."}},{"doi":"10.1007/978-3-030-99739-7_43","title":"Overview of Touché 2022: Argument Retrieval","author":[{"last_name":"Bondarenko","full_name":"Bondarenko, Alexander","first_name":"Alexander"},{"last_name":"Fröbe","full_name":"Fröbe, Maik","first_name":"Maik"},{"last_name":"Kiesel","full_name":"Kiesel, Johannes","first_name":"Johannes"},{"full_name":"Syed, Shahbaz","last_name":"Syed","first_name":"Shahbaz"},{"last_name":"Gurcke","full_name":"Gurcke, Timon","first_name":"Timon"},{"full_name":"Beloucif, Meriem","last_name":"Beloucif","first_name":"Meriem"},{"first_name":"Alexander","last_name":"Panchenko","full_name":"Panchenko, Alexander"},{"first_name":"Chris","full_name":"Biemann, Chris","last_name":"Biemann"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"last_name":"Potthast","full_name":"Potthast, Martin","first_name":"Martin"},{"full_name":"Hagen, Matthias","last_name":"Hagen","first_name":"Matthias"}],"date_created":"2022-11-14T13:47:51Z","publisher":"Springer International Publishing","date_updated":"2022-11-14T13:48:38Z","citation":{"ama":"Bondarenko A, Fröbe M, Kiesel J, et al. Overview of Touché 2022: Argument Retrieval. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">10.1007/978-3-030-99739-7_43</a>","ieee":"A. Bondarenko <i>et al.</i>, “Overview of Touché 2022: Argument Retrieval,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2022.","chicago":"Bondarenko, Alexander, Maik Fröbe, Johannes Kiesel, Shahbaz Syed, Timon Gurcke, Meriem Beloucif, Alexander Panchenko, et al. “Overview of Touché 2022: Argument Retrieval.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">https://doi.org/10.1007/978-3-030-99739-7_43</a>.","apa":"Bondarenko, A., Fröbe, M., Kiesel, J., Syed, S., Gurcke, T., Beloucif, M., Panchenko, A., Biemann, C., Stein, B., Wachsmuth, H., Potthast, M., &#38; Hagen, M. (2022). Overview of Touché 2022: Argument Retrieval. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">https://doi.org/10.1007/978-3-030-99739-7_43</a>","bibtex":"@inbook{Bondarenko_Fröbe_Kiesel_Syed_Gurcke_Beloucif_Panchenko_Biemann_Stein_Wachsmuth_et al._2022, place={Cham}, title={Overview of Touché 2022: Argument Retrieval}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">10.1007/978-3-030-99739-7_43</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Bondarenko, Alexander and Fröbe, Maik and Kiesel, Johannes and Syed, Shahbaz and Gurcke, Timon and Beloucif, Meriem and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and et al.}, year={2022} }","short":"A. Bondarenko, M. Fröbe, J. Kiesel, S. Syed, T. Gurcke, M. Beloucif, A. Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2022.","mla":"Bondarenko, Alexander, et al. “Overview of Touché 2022: Argument Retrieval.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-99739-7_43\">10.1007/978-3-030-99739-7_43</a>."},"place":"Cham","year":"2022","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030997380","9783030997397"]},"alternative_title":["Extended Abstract"],"user_id":"52174","department":[{"_id":"600"}],"_id":"34077","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"type":"conference","editor":[{"last_name":"Ouldridge","full_name":"Ouldridge, Thomas E.","first_name":"Thomas E."},{"first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J.","last_name":"Wickham"}],"status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"32602","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"place":"Dagstuhl, Germany","citation":{"short":"A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","bibtex":"@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>","chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 8:1–8:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>"},"intvolume":"       238","page":"8:1–8:22","date_updated":"2022-11-17T14:18:24Z","author":[{"first_name":"Andreas","id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel","id":"3902"}],"volume":238,"doi":"10.4230/LIPIcs.DNA.28.8","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","language":[{"iso":"eng"}],"year":"2022","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:32:19Z","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model"},{"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:42:43Z","title":"Fault-Tolerant Shape Formation in the Amoebot Model","year":"2022","language":[{"iso":"eng"}],"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","date_updated":"2022-11-17T14:17:09Z","author":[{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Daniel","id":"3902","full_name":"Warner, Daniel","last_name":"Warner"}],"volume":238,"doi":"10.4230/LIPIcs.DNA.28.9","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"place":"Dagstuhl, Germany","citation":{"mla":"Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant Shape Formation in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>.","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 9:1–9:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","ama":"Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>"},"page":"9:1–9:22","intvolume":"       238","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"32603","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"type":"conference","editor":[{"first_name":"Thomas E.","last_name":"Ouldridge","full_name":"Ouldridge, Thomas E."},{"last_name":"Wickham","full_name":"Wickham, Shelley F. J.","first_name":"Shelley F. J."}],"status":"public"},{"has_accepted_license":"1","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. In: <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. ; 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” In <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at the 58th Allerton Conference on Communication, Control, and Computing, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. 58th Allerton Conference on Communication, Control, and Computing.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}, booktitle={Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference on Communication, Control, and Computing, 2022."},"year":"2022","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-08-15T09:59:17Z","date_updated":"2022-11-18T09:31:19Z","conference":{"name":"58th Allerton Conference on Communication, Control, and Computing"},"title":"Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law","type":"conference","publication":"Proceedings of the 58th Allerton Conference on Communication, Control, and Computing","status":"public","abstract":[{"text":"The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\\Delta(n)$ is reset to one; otherwise, $\\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\\Delta(n)$ is itself $\\alpha$-mixing from which we conclude a strong law of large numbers for $\\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times.","lang":"eng"}],"user_id":"477","department":[{"_id":"75"}],"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"32811","language":[{"iso":"eng"}],"ddc":["000"]},{"ddc":["006"],"language":[{"iso":"eng"}],"file_date_updated":"2022-08-31T07:10:13Z","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze","_id":"24"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"30793","user_id":"477","department":[{"_id":"75"}],"file":[{"date_updated":"2022-08-31T07:10:13Z","creator":"aredder","date_created":"2022-08-31T07:10:13Z","file_size":298926,"access_level":"closed","file_id":"33237","file_name":"ICCART2022.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","title":"Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication","doi":"10.5220/0010845400003116","date_updated":"2022-11-18T09:32:14Z","publisher":"SCITEPRESS - Science and Technology Publications","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688"},{"full_name":"Ramaswamy, Arunselvan","id":"66937","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","first_name":"Arunselvan"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2022-04-06T07:18:36Z","year":"2022","citation":{"ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication,” 2022, doi: <a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications, 2022. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>.","ama":"Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. In: <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications; 2022. doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>","mla":"Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>, SCITEPRESS - Science and Technology Publications, 2022, doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>}, booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology Publications, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>"},"publication_status":"published","has_accepted_license":"1"},{"type":"preprint","publication":"arXiv:2201.11343","status":"public","abstract":[{"text":"Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate with each other, over time, in order to minimize/maximize a global\r\nobjective. In the presence of unreliable communication networks, the\r\nAge-of-Information (AoI), which measures the freshness of data received, may be\r\nlarge and hence hinder algorithmic convergence. In this paper, we study the\r\nconvergence of general distributed gradient-based optimization algorithms in\r\nthe presence of communication that neither happens periodically nor at\r\nstochastically independent points in time. We show that convergence is\r\nguaranteed provided the random variables associated with the AoI processes are\r\nstochastically dominated by a random variable with finite first moment. This\r\nimproves on previous requirements of boundedness of more than the first moment.\r\nWe then introduce stochastically strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically dominated by a\r\nrandom variable with finite $p$-th moment. In combination with our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges in the presence of AoI, if $\\alpha(n)$ is summable.","lang":"eng"}],"user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"external_id":{"arxiv":["2201.11343"]},"_id":"30790","language":[{"iso":"eng"}],"citation":{"chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>. 2022.","ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published online 2022.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>."},"year":"2022","author":[{"orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","id":"52265","full_name":"Redder, Adrian","first_name":"Adrian"},{"first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-04-06T06:53:38Z","date_updated":"2022-11-18T09:33:01Z","title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication"},{"language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"477","_id":"32855","project":[{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"}],"status":"public","publication":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","type":"conference","doi":"10.1109/ipdpsw55747.2022.00029","conference":{"name":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","start_date":"2022-05-30","end_date":"2022-06-03","location":" Lyon, France"},"title":"ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support","date_created":"2022-08-16T09:58:34Z","author":[{"orcid":"0000-0003-3789-6034","last_name":"Clausing","full_name":"Clausing, Lennart","id":"74287","first_name":"Lennart"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"publisher":"IEEE","date_updated":"2022-11-18T09:36:00Z","page":"120-127","citation":{"apa":"Clausing, L., &#38; Platzner, M. (2022). ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–127. <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>","bibtex":"@inproceedings{Clausing_Platzner_2022, title={ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>}, booktitle={2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, publisher={IEEE}, author={Clausing, Lennart and Platzner, Marco}, year={2022}, pages={120–127} }","short":"L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127.","mla":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, IEEE, 2022, pp. 120–27, doi:<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>.","ieee":"L. Clausing and M. Platzner, “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support,” in <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>,  Lyon, France, 2022, pp. 120–127, doi: <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>.","chicago":"Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support.” In <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–27. IEEE, 2022. <a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>.","ama":"Clausing L, Platzner M. ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support. In: <i>2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. IEEE; 2022:120-127. doi:<a href=\"https://doi.org/10.1109/ipdpsw55747.2022.00029\">10.1109/ipdpsw55747.2022.00029</a>"},"year":"2022","publication_identifier":{"eisbn":["978-1-6654-9747-3"]},"publication_status":"published"},{"language":[{"iso":"eng"}],"department":[{"_id":"75"}],"user_id":"477","_id":"30791","external_id":{"arxiv":["2201.00570"]},"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"status":"public","abstract":[{"lang":"eng","text":"We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous action spaces: the actor-critic paradigm. In the setting considered\r\nherein, each agent observes a part of the global state space in order to take\r\nlocal actions, for which it receives local rewards. For every agent, DDPG\r\ntrains a local actor (policy) and a local critic (Q-function). The analysis\r\nshows that multi-agent DDPG using neural networks to approximate the local\r\npolicies and critics converge to limits with the following properties: The\r\ncritic limits minimize the average squared Bellman loss; the actor limits\r\nparameterize a policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a\r\nprobability distribution over the global state-action space. It captures the\r\nasymptotics of all local training processes. Finally, we extend the analysis to\r\na fully decentralized setting where agents communicate over a wireless network\r\nprone to delays and losses; a typical scenario in, e.g., robotic applications."}],"publication":"arXiv:2201.00570","type":"preprint","title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","author":[{"first_name":"Adrian","id":"52265","full_name":"Redder, Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688"},{"first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","id":"66937","full_name":"Ramaswamy, Arunselvan"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2022-04-06T06:53:52Z","date_updated":"2022-11-18T09:33:42Z","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. <i>arXiv:220100570</i>. Published online 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","mla":"Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>."},"year":"2022"},{"status":"public","publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"77"}],"user_id":"477","_id":"32590","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"page":"162-173","citation":{"mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–73, doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","apa":"Richter, C., &#38; Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–173. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>. ; 2022:162-173. doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–73, 2022. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>.","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–173, doi: <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>."},"year":"2022","doi":"10.1109/ICST53961.2022.00027","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","date_created":"2022-08-08T07:40:04Z","author":[{"first_name":"Cedric","full_name":"Richter, Cedric","id":"50003","last_name":"Richter"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2022-11-18T09:45:40Z"},{"date_updated":"2022-11-18T09:45:05Z","date_created":"2022-08-08T07:42:19Z","author":[{"id":"50003","full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"title":"TSSB-3M: Mining single statement bugs at massive scale","doi":"10.1145/3524842.3528505","year":"2022","citation":{"apa":"Richter, C., &#38; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–422. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–22, doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–22, 2022. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>.","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–422, doi: <a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>. ; 2022:418-422. doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>"},"page":"418-422","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"_id":"32591","user_id":"477","department":[{"_id":"77"}],"language":[{"iso":"eng"}],"type":"conference","publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","status":"public"},{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"_id":"32398","user_id":"477","department":[{"_id":"64"},{"_id":"7"}],"status":"public","type":"bachelorsthesis","title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","date_updated":"2022-11-18T09:38:04Z","date_created":"2022-07-20T09:36:39Z","author":[{"first_name":"Hanna","full_name":"Siek, Hanna","last_name":"Siek"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"year":"2022","citation":{"chicago":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.","ieee":"H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 2022.","mla":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>."}},{"language":[{"iso":"eng"}],"extern":"1","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901: SFB 901"}],"_id":"31485","status":"public","type":"mastersthesis","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","author":[{"first_name":"Paul","id":"64594","full_name":"Kramer, Paul","last_name":"Kramer"}],"date_created":"2022-05-28T08:07:40Z","date_updated":"2022-11-18T09:40:28Z","citation":{"apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","ieee":"P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022.","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022."},"year":"2022"},{"publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","type":"conference","status":"public","abstract":[{"lang":"eng","text":"The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds"}],"department":[{"_id":"34"}],"user_id":"477","_id":"31806","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"language":[{"iso":"eng"}],"keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"ddc":["000"],"citation":{"ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. ; 2022. doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>","ieee":"K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi: <a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022. <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022.","mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022, doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>}, booktitle={Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }","apa":"Dreßler, K., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>"},"year":"2022","date_created":"2022-06-08T08:47:33Z","author":[{"first_name":"Kevin","last_name":"Dreßler","id":"78256","full_name":"Dreßler, Kevin"},{"last_name":"Sherif","id":"67234","full_name":"Sherif, Mohamed","first_name":"Mohamed"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"date_updated":"2022-11-18T10:11:38Z","doi":"10.1145/3511095.3531287","conference":{"end_date":"2022-07-01","location":"Barcelona (Spain)","name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media","start_date":"2022-06-28"},"title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning"}]