[{"day":"01","date_updated":"2023-09-06T15:21:48Z","type":"conference","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"page":"12481-12512","date_published":"2019-06-01T00:00:00Z","external_id":{"isi":["000684034307036"],"arxiv":["1810.07766"]},"arxiv":1,"publication_identifier":{"isbn":["9781510886988"]},"scopus_import":"1","year":"2019","quality_controlled":"1","author":[{"first_name":"Chen","last_name":"Yu","full_name":"Yu, Chen"},{"first_name":"Hanlin","last_name":"Tang","full_name":"Tang, Hanlin"},{"full_name":"Renggli, Cedric","last_name":"Renggli","first_name":"Cedric"},{"full_name":"Kassing, Simon","first_name":"Simon","last_name":"Kassing"},{"full_name":"Singla, Ankit","first_name":"Ankit","last_name":"Singla"},{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Zhang, Ce","last_name":"Zhang","first_name":"Ce"},{"last_name":"Liu","first_name":"Ji","full_name":"Liu, Ji"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.07766"}],"citation":{"mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” <i>36th International Conference on Machine Learning, ICML 2019</i>, vol. 2019–June, IMLS, 2019, pp. 12481–512.","apa":"Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., … Liu, J. (2019). Distributed learning over unreliable networks. In <i>36th International Conference on Machine Learning, ICML 2019</i> (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.","ieee":"C. Yu <i>et al.</i>, “Distributed learning over unreliable networks,” in <i>36th International Conference on Machine Learning, ICML 2019</i>, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.","ama":"Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: <i>36th International Conference on Machine Learning, ICML 2019</i>. Vol 2019-June. IMLS; 2019:12481-12512.","ista":"Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu J. 2019. Distributed learning over unreliable networks. 36th International Conference on Machine Learning, ICML 2019. ICML: International Conference on Machine Learning vol. 2019–June, 12481–12512.","chicago":"Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In <i>36th International Conference on Machine Learning, ICML 2019</i>, 2019–June:12481–512. IMLS, 2019.","short":"C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512."},"publication_status":"published","abstract":[{"lang":"eng","text":"Most of today's distributed machine learning systems assume reliable networks: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: Can we design machine learning systems that are tolerant to network unreliability during training? With this motivation, we focus on a theoretical problem of independent interest-given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability p of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of parameter servers. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable."}],"oa":1,"_id":"7437","title":"Distributed learning over unreliable networks","publication":"36th International Conference on Machine Learning, ICML 2019","publisher":"IMLS","volume":"2019-June","status":"public","date_created":"2020-02-02T23:01:06Z","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2019-06-15","start_date":"2019-06-10","location":"Long Beach, CA, United States"},"month":"06","isi":1},{"article_number":"150","status":"public","date_created":"2020-02-05T09:57:57Z","month":"06","isi":1,"intvolume":"         3","article_type":"original","publisher":"Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften","file_date_updated":"2020-07-14T12:47:58Z","volume":3,"publication_status":"published","abstract":[{"lang":"eng","text":"We prove that the observable telegraph signal accompanying the bistability in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings model is the finite-size precursor of what in the thermodynamic limit is a genuine first-order phase transition. We construct a finite-size scaling of the system parameters to a well-defined thermodynamic limit, in which the system remains the same microscopic system, but the telegraph signal becomes macroscopic both in its timescale and intensity. The existence of such a finite-size scaling completes and justifies the classification of the photon-blockade-breakdown effect as a first-order dissipative quantum phase transition."}],"ddc":["530"],"oa":1,"_id":"7451","publication":"Quantum","title":"Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition","year":"2019","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"first_name":"A.","last_name":"Vukics","full_name":"Vukics, A."},{"last_name":"Dombi","first_name":"A.","full_name":"Dombi, A."},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","first_name":"Johannes M","last_name":"Fink"},{"full_name":"Domokos, P.","first_name":"P.","last_name":"Domokos"}],"quality_controlled":"1","citation":{"ieee":"A. Vukics, A. Dombi, J. M. Fink, and P. Domokos, “Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition,” <i>Quantum</i>, vol. 3. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019.","ama":"Vukics A, Dombi A, Fink JM, Domokos P. Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. <i>Quantum</i>. 2019;3. doi:<a href=\"https://doi.org/10.22331/q-2019-06-03-150\">10.22331/q-2019-06-03-150</a>","ista":"Vukics A, Dombi A, Fink JM, Domokos P. 2019. Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. Quantum. 3, 150.","chicago":"Vukics, A., A. Dombi, Johannes M Fink, and P. Domokos. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019. <a href=\"https://doi.org/10.22331/q-2019-06-03-150\">https://doi.org/10.22331/q-2019-06-03-150</a>.","short":"A. Vukics, A. Dombi, J.M. Fink, P. Domokos, Quantum 3 (2019).","mla":"Vukics, A., et al. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” <i>Quantum</i>, vol. 3, 150, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019, doi:<a href=\"https://doi.org/10.22331/q-2019-06-03-150\">10.22331/q-2019-06-03-150</a>.","apa":"Vukics, A., Dombi, A., Fink, J. M., &#38; Domokos, P. (2019). Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. <a href=\"https://doi.org/10.22331/q-2019-06-03-150\">https://doi.org/10.22331/q-2019-06-03-150</a>"},"arxiv":1,"publication_identifier":{"issn":["2521-327X"]},"date_published":"2019-06-03T00:00:00Z","file":[{"file_id":"7483","date_updated":"2020-07-14T12:47:58Z","access_level":"open_access","file_name":"2019_Quantum_Vukics.pdf","checksum":"26b9ba8f0155d183f1ee55295934a17f","date_created":"2020-02-11T09:25:23Z","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_size":5805248}],"external_id":{"arxiv":["1809.09737"],"isi":["000469987500004"]},"doi":"10.22331/q-2019-06-03-150","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"JoFi"}],"day":"03","type":"journal_article","date_updated":"2023-09-07T14:57:39Z","oa_version":"Published Version","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"date_updated":"2022-09-06T08:25:52Z","series_title":"LNCS","type":"book_chapter","oa_version":"Published Version","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-91908-9_22","department":[{"_id":"ToHe"}],"date_published":"2019-10-05T00:00:00Z","page":"452-477","alternative_title":["Lecture Notes in Computer Science"],"publication_identifier":{"eissn":["0302-9743"],"isbn":["9783319919072"],"eisbn":["9783319919089"],"issn":["1611-3349"]},"scopus_import":"1","year":"2019","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-319-91908-9_22"}],"citation":{"short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>.","ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477.","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in <i>Computing and Software Science</i>, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. <i>Computing and Software Science</i>. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &#38; Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &#38; G. Woeginger (Eds.), <i>Computing and Software Science</i> (Vol. 10000, pp. 452–477). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>"},"author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","first_name":"Mirco","last_name":"Giacobbe"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Larsen, Kim G.","first_name":"Kim G.","last_name":"Larsen"},{"first_name":"Marius","last_name":"Mikučionis","full_name":"Mikučionis, Marius"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"publication_status":"published","abstract":[{"text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement.","lang":"eng"}],"title":"Continuous-time models for system design and analysis","publication":"Computing and Software Science","oa":1,"_id":"7453","publisher":"Springer Nature","editor":[{"first_name":"Bernhard","last_name":"Steffen","full_name":"Steffen, Bernhard"},{"last_name":"Woeginger","first_name":"Gerhard","full_name":"Woeginger, Gerhard"}],"volume":10000,"date_created":"2020-02-05T10:51:44Z","month":"10","status":"public","intvolume":"     10000"},{"external_id":{"arxiv":["1806.05049"],"isi":["000542649304076"]},"date_published":"2019-06-01T00:00:00Z","scopus_import":"1","publication_identifier":{"isbn":["9781728132938"],"issn":["10636919"]},"arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","oa_version":"Preprint","date_updated":"2023-09-07T14:54:24Z","type":"conference","day":"01","ec_funded":1,"department":[{"_id":"VlKo"}],"doi":"10.1109/CVPR.2019.01140","language":[{"iso":"eng"}],"volume":"2019-June","publisher":"IEEE","isi":1,"conference":{"end_date":"2019-06-20","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2019-06-15","location":"Long Beach, CA, United States"},"month":"06","date_created":"2020-02-09T23:00:52Z","status":"public","article_number":"11138-11147","citation":{"chicago":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Vol. 2019–June. IEEE, 2019. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>.","short":"P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019.","ista":"Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2019–June, 11138–11147.","ama":"Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>. Vol 2019-June. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>","ieee":"P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Long Beach, CA, United States, 2019, vol. 2019–June.","apa":"Swoboda, P., &#38; Kolmogorov, V. (2019). Map inference via block-coordinate Frank-Wolfe algorithm. In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i> (Vol. 2019–June). Long Beach, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>","mla":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, vol. 2019–June, 11138–11147, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05049"}],"author":[{"first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov"}],"quality_controlled":"1","year":"2019","publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","title":"Map inference via block-coordinate Frank-Wolfe algorithm","_id":"7468","oa":1,"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"abstract":[{"text":"We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems.","lang":"eng"}],"publication_status":"published"},{"date_published":"2019-10-01T00:00:00Z","file":[{"file_id":"7480","date_updated":"2020-07-14T12:47:59Z","checksum":"7b77fb5c2d27c4c37a7612ba46a66117","file_name":"main.pdf","access_level":"open_access","relation":"main_file","date_created":"2020-02-11T09:06:39Z","content_type":"application/pdf","creator":"bphuong","file_size":735768}],"external_id":{"isi":["000531438101047"]},"page":"1355-1364","publication_identifier":{"issn":["15505499"],"isbn":["9781728148038"]},"scopus_import":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-08T11:11:12Z","type":"conference","oa_version":"Submitted Version","day":"01","ec_funded":1,"doi":"10.1109/ICCV.2019.00144","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"has_accepted_license":"1","volume":"2019-October","file_date_updated":"2020-07-14T12:47:59Z","publisher":"IEEE","isi":1,"date_created":"2020-02-11T09:06:57Z","month":"10","conference":{"start_date":"2019-10-27","location":"Seoul, Korea","end_date":"2019-11-02","name":"ICCV: International Conference on Computer Vision"},"status":"public","citation":{"ama":"Phuong M, Lampert C. Distillation-based training for multi-exit architectures. In: <i>IEEE International Conference on Computer Vision</i>. Vol 2019-October. IEEE; 2019:1355-1364. doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>","ieee":"M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,” in <i>IEEE International Conference on Computer Vision</i>, Seoul, Korea, 2019, vol. 2019–October, pp. 1355–1364.","short":"M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision, IEEE, 2019, pp. 1355–1364.","chicago":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” In <i>IEEE International Conference on Computer Vision</i>, 2019–October:1355–64. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>.","ista":"Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures. IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision vol. 2019–October, 1355–1364.","mla":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” <i>IEEE International Conference on Computer Vision</i>, vol. 2019–October, IEEE, 2019, pp. 1355–64, doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>.","apa":"Phuong, M., &#38; Lampert, C. (2019). Distillation-based training for multi-exit architectures. In <i>IEEE International Conference on Computer Vision</i> (Vol. 2019–October, pp. 1355–1364). Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>"},"quality_controlled":"1","author":[{"last_name":"Bui Thi Mai","first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"year":"2019","publication":"IEEE International Conference on Computer Vision","title":"Distillation-based training for multi-exit architectures","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9418"}]},"ddc":["000"],"oa":1,"_id":"7479","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Multi-exit architectures, in which a stack of processing layers is interleaved with early output layers, allow the processing of a test example to stop early and thus save computation time and/or energy.  In this work, we propose a new training procedure for multi-exit architectures based on the principle of knowledge distillation. The method encourage searly exits to mimic later, more accurate exits, by matching their output probabilities.\r\nExperiments  on  CIFAR100  and  ImageNet  show  that distillation-based training significantly improves the accuracy of early exits while maintaining state-of-the-art accuracy  for  late  ones.   The  method  is  particularly  beneficial when  training  data  is  limited  and  it  allows  a  straightforward extension to semi-supervised learning,i.e. making use of unlabeled data at training time. Moreover, it takes only afew lines to implement and incurs almost no computational overhead at training time, and none at all at test time."}]},{"abstract":[{"lang":"eng","text":"Social insects (i.e., ants, termites and the social bees and wasps) protect their colonies from disease using a combination of individual immunity and collectively performed defenses, termed social immunity. The first line of social immune defense is sanitary care, which is performed by colony members to protect their pathogen-exposed nestmates from developing an infection. If sanitary care fails and an infection becomes established, a second line of social immune defense is deployed to stop disease transmission within the colony and to protect the valuable queens, which together with the males are the reproductive individuals of the colony. Insect colonies are separated into these reproductive individuals and the sterile worker force, forming a superorganismal reproductive unit reminiscent of the differentiated germline and soma in a multicellular organism. Ultimately, the social immune response preserves the germline of the superorganism insect colony and increases overall fitness of the colony in case of disease. "}],"publication_status":"published","department":[{"_id":"SyCr"}],"_id":"7513","language":[{"iso":"eng"}],"doi":"10.1016/B978-0-12-809633-8.90721-0","edition":"2","title":"Social immunity","publication":"Encyclopedia of Animal Behavior","year":"2019","day":"06","oa_version":"None","type":"book_chapter","date_updated":"2023-09-08T11:12:04Z","author":[{"first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"},{"last_name":"Kutzer","first_name":"Megan","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8696-6978","full_name":"Kutzer, Megan"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","article_processing_charge":"No","citation":{"apa":"Cremer, S., &#38; Kutzer, M. (2019). Social immunity. In J. Choe (Ed.), <i>Encyclopedia of Animal Behavior</i> (2nd ed., pp. 747–755). Elsevier. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>","mla":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., Elsevier, 2019, pp. 747–55, doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>.","chicago":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” In <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., 747–55. Elsevier, 2019. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>.","short":"S. Cremer, M. Kutzer, in:, J. Choe (Ed.), Encyclopedia of Animal Behavior, 2nd ed., Elsevier, 2019, pp. 747–755.","ista":"Cremer S, Kutzer M. 2019.Social immunity. In: Encyclopedia of Animal Behavior. , 747–755.","ieee":"S. Cremer and M. Kutzer, “Social immunity,” in <i>Encyclopedia of Animal Behavior</i>, 2nd ed., J. Choe, Ed. Elsevier, 2019, pp. 747–755.","ama":"Cremer S, Kutzer M. Social immunity. In: Choe J, ed. <i>Encyclopedia of Animal Behavior</i>. 2nd ed. Elsevier; 2019:747-755. doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>"},"status":"public","month":"02","date_created":"2020-02-23T23:00:36Z","scopus_import":"1","isi":1,"publication_identifier":{"eisbn":["9780128132524"],"isbn":["9780128132517"]},"editor":[{"full_name":"Choe, Jae","last_name":"Choe","first_name":"Jae"}],"publisher":"Elsevier","page":"747-755","external_id":{"isi":["000248989500026"]},"date_published":"2019-02-06T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","last_name":"Deuchert","first_name":"Andreas"},{"first_name":"Simon","last_name":"Mayer","id":"30C4630A-F248-11E8-B48F-1D18A9856A87","full_name":"Mayer, Simon"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.03372"}],"citation":{"short":"A. Deuchert, S. Mayer, R. Seiringer, ArXiv:1910.03372 (n.d.).","chicago":"Deuchert, Andreas, Simon Mayer, and Robert Seiringer. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” <i>ArXiv:1910.03372</i>. ArXiv, n.d.","ista":"Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. arXiv:1910.03372, .","ama":"Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. <i>arXiv:191003372</i>.","ieee":"A. Deuchert, S. Mayer, and R. Seiringer, “The free energy of the two-dimensional dilute Bose gas. I. Lower bound,” <i>arXiv:1910.03372</i>. ArXiv.","mla":"Deuchert, Andreas, et al. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” <i>ArXiv:1910.03372</i>, ArXiv.","apa":"Deuchert, A., Mayer, S., &#38; Seiringer, R. (n.d.). The free energy of the two-dimensional dilute Bose gas. I. Lower bound. <i>arXiv:1910.03372</i>. ArXiv."},"day":"08","year":"2019","date_updated":"2023-09-07T13:12:41Z","type":"preprint","oa_version":"Preprint","oa":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"7790"},{"status":"public","relation":"dissertation_contains","id":"7514"}]},"department":[{"_id":"RoSe"}],"_id":"7524","publication":"arXiv:1910.03372","ec_funded":1,"title":"The free energy of the two-dimensional dilute Bose gas. I. Lower bound","publication_status":"draft","abstract":[{"lang":"eng","text":"We prove a lower bound for the free energy (per unit volume) of the two-dimensional Bose gas in the thermodynamic limit. We show that the free energy at density $\\rho$ and inverse temperature $\\beta$ differs from the one of the non-interacting system by the correction term $4 \\pi \\rho^2 |\\ln a^2 \\rho|^{-1} (2 - [1 - \\beta_{\\mathrm{c}}/\\beta]_+^2)$. Here $a$ is the scattering length of the interaction potential, $[\\cdot]_+ = \\max\\{ 0, \\cdot \\}$ and $\\beta_{\\mathrm{c}}$ is the inverse Berezinskii--Kosterlitz--Thouless critical temperature for superfluidity. The result is valid in the dilute limit\r\n$a^2\\rho \\ll 1$ and if $\\beta \\rho \\gtrsim 1$."}],"project":[{"grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"page":"61","date_published":"2019-10-08T00:00:00Z","publisher":"ArXiv","scopus_import":1,"status":"public","date_created":"2020-02-26T08:46:40Z","month":"10"},{"arxiv":1,"publication_identifier":{"issn":["1049-5258"]},"page":"927-938","external_id":{"arxiv":["1909.02253"],"isi":["000534424300084"]},"date_published":"2019-12-01T00:00:00Z","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"ec_funded":1,"day":"01","oa_version":"Published Version","date_updated":"2023-09-08T11:13:52Z","type":"conference","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","month":"12","conference":{"end_date":"2019-12-14","name":"NIPS: Conference on Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2019-12-08"},"date_created":"2020-02-28T10:03:24Z","isi":1,"intvolume":"        32","publisher":"Neural Information Processing Systems Foundation","volume":32,"abstract":[{"text":"We present a novel class of convolutional neural networks (CNNs) for set functions,i.e., data indexed with the powerset of a finite set. The convolutions are derivedas linear, shift-equivariant functions for various notions of shifts on set functions.The framework is fundamentally different from graph convolutions based on theLaplacian, as it provides not one but several basic shifts, one for each element inthe ground set. Prototypical experiments with several set function classificationtasks on synthetic datasets and on datasets derived from real-world hypergraphsdemonstrate the potential of our new powerset CNNs.","lang":"eng"}],"publication_status":"published","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"_id":"7542","oa":1,"title":"Powerset convolutional neural networks","year":"2019","author":[{"full_name":"Wendler, Chris","first_name":"Chris","last_name":"Wendler"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Püschel, Markus","last_name":"Püschel","first_name":"Markus"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://papers.nips.cc/paper/8379-powerset-convolutional-neural-networks"}],"citation":{"ieee":"C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938.","ama":"Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.","ista":"Wendler C, Alistarh D-A, Püschel M. 2019. Powerset convolutional neural networks. NIPS: Conference on Neural Information Processing Systems vol. 32, 927–938.","chicago":"Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019.","short":"C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.","mla":"Wendler, Chris, et al. <i>Powerset Convolutional Neural Networks</i>. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.","apa":"Wendler, C., Alistarh, D.-A., &#38; Püschel, M. (2019). Powerset convolutional neural networks (Vol. 32, pp. 927–938). Presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation."}},{"arxiv":1,"publication_identifier":{"issn":["1343-4373"]},"page":"425-447","external_id":{"arxiv":["1910.10050"]},"date_published":"2019-10-22T00:00:00Z","acknowledgement":"This work is supported by Vienna Science and Technology Fund (WWTF) through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and I 2375.","department":[{"_id":"JaMa"}],"language":[{"iso":"eng"}],"day":"22","oa_version":"Preprint","type":"journal_article","date_updated":"2022-06-17T07:52:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","status":"public","month":"10","date_created":"2020-02-28T10:54:41Z","intvolume":"        28","article_type":"original","publisher":"Gakko Tosho","issue":"2","volume":28,"abstract":[{"lang":"eng","text":"We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. "}],"publication_status":"published","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"_id":"7550","oa":1,"publication":"Advances in Mathematical Sciences and Applications","title":"Penalization via global functionals of optimal-control problems for dissipative evolution","year":"2019","author":[{"last_name":"Portinale","first_name":"Lorenzo","full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ulisse","last_name":"Stefanelli","full_name":"Stefanelli, Ulisse"}],"quality_controlled":"1","citation":{"short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447.","chicago":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” <i>Advances in Mathematical Sciences and Applications</i>. Gakko Tosho, 2019.","ista":"Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 28(2), 425–447.","ieee":"L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control problems for dissipative evolution,” <i>Advances in Mathematical Sciences and Applications</i>, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.","ama":"Portinale L, Stefanelli U. Penalization via global functionals of optimal-control problems for dissipative evolution. <i>Advances in Mathematical Sciences and Applications</i>. 2019;28(2):425-447.","mla":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” <i>Advances in Mathematical Sciences and Applications</i>, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.","apa":"Portinale, L., &#38; Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. <i>Advances in Mathematical Sciences and Applications</i>. Gakko Tosho."},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1910.10050","open_access":"1"}]},{"date_created":"2020-02-28T10:57:08Z","arxiv":1,"month":"12","status":"public","publisher":"ArXiv","date_published":"2019-12-18T00:00:00Z","external_id":{"arxiv":["1912.08579"]},"page":"5","project":[{"name":"Biophysics of information processing in gene regulation","grant_number":"P28844-B27","call_identifier":"FWF","_id":"254E9036-B435-11E9-9278-68D0E5697425"}],"publication_status":"submitted","abstract":[{"text":"There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. ","lang":"eng"}],"publication":"arXiv:1912.08579","title":"Action at a distance in transcriptional regulation","oa":1,"language":[{"iso":"eng"}],"_id":"7552","department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T08:14:09Z","type":"preprint","oa_version":"Preprint","day":"18","year":"2019","citation":{"apa":"Bialek, W., Gregor, T., &#38; Tkačik, G. (n.d.). Action at a distance in transcriptional regulation. <i>arXiv:1912.08579</i>. ArXiv.","mla":"Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.” <i>ArXiv:1912.08579</i>, ArXiv.","ieee":"W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional regulation,” <i>arXiv:1912.08579</i>. ArXiv.","ama":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. <i>arXiv:191208579</i>.","ista":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:1912.08579, .","short":"W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).","chicago":"Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance in Transcriptional Regulation.” <i>ArXiv:1912.08579</i>. ArXiv, n.d."},"main_file_link":[{"url":"https://arxiv.org/abs/1912.08579","open_access":"1"}],"author":[{"full_name":"Bialek, William","last_name":"Bialek","first_name":"William"},{"first_name":"Thomas","last_name":"Gregor","full_name":"Gregor, Thomas"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","first_name":"Gašper","last_name":"Tkačik"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No"},{"volume":61,"publisher":"EasyChair Publications","file_date_updated":"2020-07-14T12:48:00Z","intvolume":"        61","status":"public","date_created":"2020-03-08T23:00:49Z","month":"05","conference":{"start_date":"2019-04-15","location":"Montreal, Canada","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15"},"quality_controlled":"1","author":[{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"first_name":"Luis","last_name":"Benet","full_name":"Benet, Luis"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"last_name":"Chen","first_name":"Xin","full_name":"Chen, Xin"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"full_name":"Geretti, Luca","last_name":"Geretti","first_name":"Luca"},{"full_name":"Kochdumper, Niklas","first_name":"Niklas","last_name":"Kochdumper"},{"full_name":"Sanders, David P.","last_name":"Sanders","first_name":"David P."},{"orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian"}],"citation":{"mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair Publications; 2019:41-61. doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>","ieee":"F. Immler <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 41–61.","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair Publications, 2019, pp. 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 61:41–61. EasyChair Publications, 2019. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>."},"year":"2019","ddc":["000"],"oa":1,"_id":"7576","publication":"EPiC Series in Computing","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","publication_status":"published","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"page":"41-61","date_published":"2019-05-25T00:00:00Z","file":[{"relation":"main_file","date_created":"2020-03-24T07:36:36Z","creator":"dernst","content_type":"application/pdf","file_size":1934830,"date_updated":"2020-07-14T12:48:00Z","file_id":"7617","checksum":"9138977a06fcd6a95976eb4bca875f0c","file_name":"2019_ARCH19_Immler.pdf","access_level":"open_access"}],"publication_identifier":{"eissn":["23987340"]},"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"25","date_updated":"2021-01-12T08:14:17Z","type":"conference","oa_version":"Published Version","language":[{"iso":"eng"}],"doi":"10.29007/m75b","has_accepted_license":"1","department":[{"_id":"ToHe"}]},{"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound."}],"publication":"IEEE Information Theory Workshop, ITW 2019","title":"A tight upper bound on mutual information","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"15020"}]},"oa":1,"_id":"7606","year":"2019","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.01475"}],"citation":{"apa":"Hledik, M., Sokolowski, T. R., &#38; Tkačik, G. (2019). A tight upper bound on mutual information. In <i>IEEE Information Theory Workshop, ITW 2019</i>. Visby, Sweden: IEEE. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>","mla":"Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” <i>IEEE Information Theory Workshop, ITW 2019</i>, 8989292, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>.","ista":"Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information. IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.","short":"M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019.","chicago":"Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>.","ieee":"M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in <i>IEEE Information Theory Workshop, ITW 2019</i>, Visby, Sweden, 2019.","ama":"Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>"},"author":[{"full_name":"Hledik, Michal","id":"4171253A-F248-11E8-B48F-1D18A9856A87","last_name":"Hledik","first_name":"Michal"},{"first_name":"Thomas R","last_name":"Sokolowski","full_name":"Sokolowski, Thomas R","orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","last_name":"Tkačik"}],"quality_controlled":"1","date_created":"2020-03-22T23:00:47Z","month":"08","conference":{"start_date":"2019-08-25","location":"Visby, Sweden","end_date":"2019-08-28","name":"Information Theory Workshop"},"article_number":"8989292","status":"public","isi":1,"publisher":"IEEE","ec_funded":1,"doi":"10.1109/ITW44776.2019.8989292","language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"date_updated":"2025-06-30T13:21:05Z","type":"conference","oa_version":"Preprint","day":"01","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","arxiv":1,"publication_identifier":{"isbn":["9781538669006"]},"scopus_import":"1","date_published":"2019-08-01T00:00:00Z","external_id":{"arxiv":["1812.01475"],"isi":["000540384500015"]}},{"external_id":{"isi":["000554591600090"]},"date_published":"2019-10-01T00:00:00Z","publisher":"IEEE","scopus_import":"1","isi":1,"publication_identifier":{"isbn":["9781728150239"]},"month":"10","conference":{"location":"Seoul, South Korea","start_date":"2019-10-27","name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28"},"date_created":"2020-04-05T22:00:50Z","status":"public","article_number":"748-752","citation":{"mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 748–752, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>.","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., &#38; Blaschko, M. B. (2019). Function norms for neural networks. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019.","ista":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>."},"quality_controlled":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Amal","last_name":"Rannen-Triki","full_name":"Rannen-Triki, Amal"},{"full_name":"Berman, Maxim","last_name":"Berman","first_name":"Maxim"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"full_name":"Blaschko, Matthew B.","first_name":"Matthew B.","last_name":"Blaschko"}],"oa_version":"None","type":"conference","date_updated":"2023-09-08T11:19:12Z","year":"2019","day":"01","title":"Function norms for neural networks","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","_id":"7639","department":[{"_id":"VlKo"}],"doi":"10.1109/ICCVW.2019.00097","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) have become increasingly important due to their excellent empirical performance on a wide range of problems. However, regularization is generally achieved by indirect means, largely due to the complex set of functions defined by a network and the difficulty in measuring function complexity. There exists no method in the literature for additive regularization based on a norm of the function, as is classically considered in statistical learning theory. In this work, we study the tractability of function norms for deep neural networks with ReLU activations. We provide, to the best of our knowledge, the first proof in the literature of the NP-hardness of computing function norms of DNNs of 3 or more layers. We also highlight a fundamental difference between shallow and deep networks. In the light on these results, we propose a new regularization strategy based on approximate function norms, and show its efficiency on a segmentation task with a DNN."}],"publication_status":"published"},{"external_id":{"arxiv":["1807.02136"],"isi":["000554591601098"]},"date_published":"2019-10-01T00:00:00Z","scopus_import":"1","publication_identifier":{"isbn":["9781728150239"]},"arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","oa_version":"Preprint","date_updated":"2023-09-08T11:18:37Z","type":"conference","day":"01","ec_funded":1,"department":[{"_id":"ChLa"}],"language":[{"iso":"eng"}],"doi":"10.1109/ICCVW.2019.00217","publisher":"IEEE","isi":1,"conference":{"end_date":"2019-10-28","name":"ICCVW: International Conference on Computer Vision Workshop","start_date":"2019-10-27","location":"Seoul, South Korea"},"month":"10","date_created":"2020-04-05T22:00:51Z","status":"public","article_number":"1749-1753","citation":{"ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019.","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>.","ista":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual relationships using box attention. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 1749–1753.","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 1749–1753, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., &#38; Ferrari, V. (2019). Detecting visual relationships using box attention. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.02136"}],"author":[{"last_name":"Kolesnikov","first_name":"Alexander","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kuznetsova, Alina","last_name":"Kuznetsova","first_name":"Alina"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"}],"quality_controlled":"1","year":"2019","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","title":"Detecting visual relationships using box attention","_id":"7640","oa":1,"project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding"}],"abstract":[{"lang":"eng","text":"We propose a new model for detecting visual relationships, such as \"person riding motorcycle\" or \"bottle on table\". This task is an important step towards comprehensive structured mage understanding, going beyond detecting individual objects. Our main novelty is a Box Attention mechanism that allows to model pairwise interactions between objects using standard object detection pipelines. The resulting model is conceptually clean, expressive and relies on well-justified training and prediction procedures. Moreover, unlike previously proposed approaches, our model does not introduce any additional complex components or hyperparameters on top of those already required by the underlying detection model. We conduct an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating strong quantitative and qualitative results."}],"publication_status":"published"},{"abstract":[{"text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex.  The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete.  We present some partial results:\r\n1.  An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2.  Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3.  Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2.\r\n3.  A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars.  In this version, tokens and  vertices  have  colours,  and  colours  have  weights.   The  goal  is  to  get  every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved.","lang":"eng"}],"publication_status":"submitted","title":"Token swapping on trees","publication":"arXiv","department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"_id":"7950","oa":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"7944"},{"id":"12833","relation":"later_version","status":"public"}]},"oa_version":"Preprint","type":"preprint","date_updated":"2024-01-04T12:42:08Z","year":"2019","day":"16","citation":{"mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” <i>ArXiv</i>, 1903.06981.","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. <i>arXiv</i>.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.).","chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” <i>ArXiv</i>, n.d.","ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. <i>arXiv</i>.","ieee":"A. Biniaz <i>et al.</i>, “Token swapping on trees,” <i>arXiv</i>. ."},"main_file_link":[{"url":"https://arxiv.org/abs/1903.06981","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ahmad","last_name":"Biniaz","full_name":"Biniaz, Ahmad"},{"full_name":"Jain, Kshitij","last_name":"Jain","first_name":"Kshitij"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana"},{"first_name":"Tillmann","last_name":"Miltzow","full_name":"Miltzow, Tillmann"},{"first_name":"Debajyoti","last_name":"Mondal","full_name":"Mondal, Debajyoti"},{"first_name":"Anurag Murty","last_name":"Naredla","full_name":"Naredla, Anurag Murty"},{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"full_name":"Turcotte, Alexi","last_name":"Turcotte","first_name":"Alexi"}],"article_processing_charge":"No","arxiv":1,"month":"03","date_created":"2020-06-08T12:25:25Z","status":"public","article_number":"1903.06981","external_id":{"arxiv":["1903.06981"]},"date_published":"2019-03-16T00:00:00Z"},{"issue":"2","volume":39,"file_date_updated":"2020-10-02T09:33:28Z","article_type":"original","publisher":"Society for Neuroscience","intvolume":"        39","isi":1,"publist_id":"8048","month":"01","date_created":"2018-12-11T11:44:07Z","status":"public","citation":{"apa":"Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E., Fanto, M., &#38; Giangrande, A. (2019). The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">https://doi.org/10.1523/JNEUROSCI.1059-18.2018</a>","mla":"Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” <i>Journal of Neuroscience</i>, vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">10.1523/JNEUROSCI.1059-18.2018</a>.","ama":"Trébuchet G, Cattenoz PB, Zsámboki J, et al. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. <i>Journal of Neuroscience</i>. 2019;39(2):238-255. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">10.1523/JNEUROSCI.1059-18.2018</a>","ieee":"G. Trébuchet <i>et al.</i>, “The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate,” <i>Journal of Neuroscience</i>, vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019.","short":"G. Trébuchet, P.B. Cattenoz, J. Zsámboki, D. Mazaud, D.E. Siekhaus, M. Fanto, A. Giangrande, Journal of Neuroscience 39 (2019) 238–255.","chicago":"Trébuchet, Guillaume, Pierre B Cattenoz, János Zsámboki, David Mazaud, Daria E Siekhaus, Manolis Fanto, and Angela Giangrande. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2019. <a href=\"https://doi.org/10.1523/JNEUROSCI.1059-18.2018\">https://doi.org/10.1523/JNEUROSCI.1059-18.2018</a>.","ista":"Trébuchet G, Cattenoz PB, Zsámboki J, Mazaud D, Siekhaus DE, Fanto M, Giangrande A. 2019. The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. 39(2), 238–255."},"quality_controlled":"1","author":[{"full_name":"Trébuchet, Guillaume","first_name":"Guillaume","last_name":"Trébuchet"},{"full_name":"Cattenoz, Pierre B","first_name":"Pierre B","last_name":"Cattenoz"},{"full_name":"Zsámboki, János","first_name":"János","last_name":"Zsámboki"},{"last_name":"Mazaud","first_name":"David","full_name":"Mazaud, David"},{"full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","last_name":"Siekhaus"},{"full_name":"Fanto, Manolis","first_name":"Manolis","last_name":"Fanto"},{"full_name":"Giangrande, Angela","last_name":"Giangrande","first_name":"Angela"}],"year":"2019","pmid":1,"publication":"Journal of Neuroscience","title":"The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate","_id":"8","ddc":["570"],"oa":1,"project":[{"name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077","_id":"2536F660-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"abstract":[{"lang":"eng","text":"Despite their different origins, Drosophila glia and hemocytes are related cell populations that provide an immune function. Drosophila hemocytes patrol the body cavity and act as macrophages outside the nervous system whereas glia originate from the neuroepithelium and provide the scavenger population of the nervous system. Drosophila glia are hence the functional orthologs of vertebrate microglia, even though the latter are cells of immune origin that subsequently move into the brain during development. Interestingly, the Drosophila immune cells within (glia) and outside the nervous system (hemocytes) require the same transcription factor Glide/Gcm for their development. This raises the issue of how do glia specifically differentiate in the nervous system and hemocytes in the procephalic mesoderm. The Repo homeodomain transcription factor and pan-glial direct target of Glide/Gcm is known to ensure glial terminal differentiation. Here we show that Repo also takes center stage in the process that discriminates between glia and hemocytes. First, Repo expression is repressed in the hemocyte anlagen by mesoderm-specific factors. Second, Repo ectopic activation in the procephalic mesoderm is sufficient to repress the expression of hemocyte-specific genes. Third, the lack of Repo triggers the expression of hemocyte markers in glia. Thus, a complex network of tissue-specific cues biases the potential of Glide/Gcm. These data allow us to revise the concept of fate determinants and help us understand the bases of cell specification. Both sexes were analyzed.SIGNIFICANCE STATEMENTDistinct cell types often require the same pioneer transcription factor, raising the issue of how does one factor trigger different fates. In Drosophila, glia and hemocytes provide a scavenger activity within and outside the nervous system, respectively. While they both require the Glide/Gcm transcription factor, glia originate from the ectoderm, hemocytes from the mesoderm. Here we show that tissue-specific factors inhibit the gliogenic potential of Glide/Gcm in the mesoderm by repressing the expression of the homeodomain protein Repo, a major glial-specific target of Glide/Gcm. Repo expression in turn inhibits the expression of hemocyte-specific genes in the nervous system. These cell-specific networks secure the establishment of the glial fate only in the nervous system and allow cell diversification."}],"publication_status":"published","external_id":{"pmid":["30504274"],"isi":["000455189900006"]},"file":[{"access_level":"open_access","checksum":"8f6925eb4cd1e8747d8ea25929c68de6","file_name":"2019_JournNeuroscience_Trebuchet.pdf","file_id":"8596","date_updated":"2020-10-02T09:33:28Z","success":1,"file_size":9455414,"creator":"dernst","content_type":"application/pdf","date_created":"2020-10-02T09:33:28Z","relation":"main_file"}],"date_published":"2019-01-09T00:00:00Z","page":"238-255","scopus_import":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","type":"journal_article","date_updated":"2023-09-19T10:10:55Z","day":"09","ec_funded":1,"department":[{"_id":"DaSi"}],"has_accepted_license":"1","doi":"10.1523/JNEUROSCI.1059-18.2018","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by INSERM, CNRS, UDS, Ligue Régionale contre le Cancer, Hôpital de Strasbourg, Association pour la Recherche sur le Cancer (ARC) and Agence Nationale de la Recherche (ANR) grants. P.B.C. was funded by the ANR and by the ARSEP (Fondation pour l'Aide à la Recherche sur la Sclérose en Plaques), and G.T. by governmental and ARC fellowships. This work was also supported by grants from the Ataxia UK (2491) and the NC3R (NC/L000199/1) awarded to M.F. The Institut de Génétique et de Biologie Moléculaire et Cellulaire was also supported by a French state fund through the ANR labex. D.E.S. was funded by Marie Curie Grant CIG 334077/IRTIM. We thank B. Altenhein, K. Brückner, M. Crozatier, L. Waltzer, M. Logan, E. Kurant, R. Reuter, E. Kurucz, J.L Dimarcq, J. Hoffmann, C. Goodman, the DHSB, and the BDSC for reagents and flies. We also thank all of the laboratory members for comments on the manuscript; C. Diebold, C. Delaporte, M. Pezze, the fly, and imaging and antibody facilities for technical assistance; and D. Dembele for help with statistics. In addition, we thank Alison Brewer for help with Luciferase assays."},{"project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"abstract":[{"lang":"eng","text":"We consider an interacting, dilute Bose gas trapped in a harmonic potential at a positive temperature. The system is analyzed in a combination of a thermodynamic and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap. We prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the GP energy functional. We also prove Bose–Einstein condensation in the following sense: The one-particle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the GP minimizer."}],"publication_status":"published","title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","publication":"Communications in Mathematical Physics","_id":"80","ddc":["530"],"oa":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2019","citation":{"short":"A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 368 (2019) 723–776.","chicago":"Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” <i>Communications in Mathematical Physics</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00220-018-3239-0\">https://doi.org/10.1007/s00220-018-3239-0</a>.","ista":"Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 368(2), 723–776.","ieee":"A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in a dilute, trapped gas at positive temperature,” <i>Communications in Mathematical Physics</i>, vol. 368, no. 2. Springer, pp. 723–776, 2019.","ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. <i>Communications in Mathematical Physics</i>. 2019;368(2):723-776. doi:<a href=\"https://doi.org/10.1007/s00220-018-3239-0\">10.1007/s00220-018-3239-0</a>","apa":"Deuchert, A., Seiringer, R., &#38; Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-018-3239-0\">https://doi.org/10.1007/s00220-018-3239-0</a>","mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” <i>Communications in Mathematical Physics</i>, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:<a href=\"https://doi.org/10.1007/s00220-018-3239-0\">10.1007/s00220-018-3239-0</a>."},"quality_controlled":"1","author":[{"id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746","first_name":"Andreas","last_name":"Deuchert"},{"first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"}],"month":"06","date_created":"2018-12-11T11:44:31Z","status":"public","intvolume":"       368","isi":1,"publist_id":"7974","file_date_updated":"2020-07-14T12:48:07Z","article_type":"original","publisher":"Springer","issue":"2","volume":368,"ec_funded":1,"has_accepted_license":"1","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00220-018-3239-0","oa_version":"Published Version","type":"journal_article","date_updated":"2023-08-24T14:27:51Z","day":"01","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","external_id":{"isi":["000467796800007"]},"file":[{"file_size":893902,"content_type":"application/pdf","creator":"dernst","relation":"main_file","date_created":"2018-12-17T10:34:06Z","checksum":"c7e9880b43ac726712c1365e9f2f73a6","file_name":"2018_CommunMathPhys_Deuchert.pdf","access_level":"open_access","file_id":"5688","date_updated":"2020-07-14T12:48:07Z"}],"date_published":"2019-06-01T00:00:00Z","page":"723-776"},{"acknowledgement":"D.B. is especially grateful to Patrik Ferrari for suggesting simplifications in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models of Section 2.\r\n","ec_funded":1,"language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:17:18Z","type":"conference","oa_version":"Preprint","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","arxiv":1,"scopus_import":"1","date_published":"2019-07-01T00:00:00Z","external_id":{"arxiv":["1902.08750"]},"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"},{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","abstract":[{"text":"We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices.","lang":"eng"}],"publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","title":"New edge asymptotics of skew Young diagrams via free boundaries","oa":1,"_id":"8175","year":"2019","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.08750"}],"citation":{"apa":"Betea, D., Bouttier, J., Nejjar, P., &#38; Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>, 34, Formal Power Series and Algebraic Combinatorics, 2019.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and Algebraic Combinatorics, 2019.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Formal Power Series and Algebraic Combinatorics, 2019.","ista":"Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew Young diagrams via free boundaries. Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics, 34.","ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and Algebraic Combinatorics; 2019.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in <i>Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>, Ljubljana, Slovenia, 2019."},"author":[{"last_name":"Betea","first_name":"Dan","full_name":"Betea, Dan"},{"full_name":"Bouttier, Jérémie","last_name":"Bouttier","first_name":"Jérémie"},{"first_name":"Peter","last_name":"Nejjar","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter"},{"first_name":"Mirjana","last_name":"Vuletíc","full_name":"Vuletíc, Mirjana"}],"quality_controlled":"1","date_created":"2020-07-26T22:01:04Z","month":"07","conference":{"start_date":"2019-07-01","location":"Ljubljana, Slovenia","end_date":"2019-07-05","name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics"},"status":"public","article_number":"34","publisher":"Formal Power Series and Algebraic Combinatorics"},{"main_file_link":[{"url":"https://arxiv.org/abs/1910.12628","open_access":"1"}],"citation":{"short":"S. Avvakumov, S. Kudrya, ArXiv (n.d.).","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>ArXiv</i>. arXiv, n.d.","ista":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv, 1910.12628.","ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. <i>arXiv</i>.","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” <i>arXiv</i>. arXiv.","apa":"Avvakumov, S., &#38; Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. <i>arXiv</i>. arXiv.","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” <i>ArXiv</i>, 1910.12628, arXiv."},"author":[{"first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey"},{"id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67","full_name":"Kudrya, Sergey","last_name":"Kudrya","first_name":"Sergey"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"preprint","date_updated":"2023-09-07T13:12:17Z","oa_version":"Preprint","day":"28","year":"2019","title":"Vanishing of all equivariant obstructions and the mapping degree","publication":"arXiv","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"11446"},{"id":"8156","relation":"dissertation_contains","status":"public"}]},"oa":1,"_id":"8182","department":[{"_id":"UlWa"}],"project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312"}],"publication_status":"submitted","abstract":[{"text":"Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in {\\mathbb R}\\}$.\r\n  Previously, the special cases of this statement for certain $X$ were usually proved using the equivartiant obstruction theory. Such calculations are difficult and may become infeasible past the first (primary) obstruction. We\r\ntake a different approach which allows us to prove the vanishing of all obstructions simultaneously. The essential step in the proof is classifying the possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$ of $(n-1)$-simplex to itself.  Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result  applying it to one such question, a specific instance of envy-free division problem.","lang":"eng"}],"date_published":"2019-10-28T00:00:00Z","external_id":{"arxiv":["1910.12628"]},"publisher":"arXiv","date_created":"2020-07-30T10:45:08Z","arxiv":1,"month":"10","status":"public","article_number":"1910.12628"},{"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","last_name":"Avvakumov"},{"last_name":"Karasev","first_name":"R.","full_name":"Karasev, R."},{"full_name":"Skopenkov, A.","last_name":"Skopenkov","first_name":"A."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.08731"}],"citation":{"apa":"Avvakumov, S., Karasev, R., &#38; Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. <i>arXiv</i>. arXiv.","mla":"Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” <i>ArXiv</i>, 1908.08731, arXiv.","chicago":"Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” <i>ArXiv</i>. arXiv, n.d.","short":"S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).","ista":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731.","ieee":"S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” <i>arXiv</i>. arXiv.","ama":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. <i>arXiv</i>."},"year":"2019","day":"23","oa_version":"Preprint","date_updated":"2023-09-08T11:20:02Z","type":"preprint","_id":"8184","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"oa":1,"related_material":{"record":[{"id":"8156","relation":"dissertation_contains","status":"public"}]},"title":"Stronger counterexamples to the topological Tverberg conjecture","publication":"arXiv","abstract":[{"lang":"eng","text":"Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample to the topological Tverberg conjecture asserts that if r is not a prime power and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional counterexamples by taking k-fold join power of lower-dimensional ones. We improve this further (for d large compared to r): If r is not a prime power and N := (d+ 1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the r-fold van Kampen–Flores conjecture we also produce counterexamples which are stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner theorem on construction of almost r-embeddings from equivariant maps, and of the Ozaydin theorem on existence of equivariant maps. "}],"publication_status":"submitted","project":[{"name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"We would like to thank F. Frick for helpful discussions","external_id":{"arxiv":["1908.08731"],"isi":["000986519600004"]},"date_published":"2019-08-23T00:00:00Z","publisher":"arXiv","isi":1,"article_number":"1908.08731","status":"public","month":"08","arxiv":1,"date_created":"2020-07-30T10:45:34Z"}]