[{"publication_identifier":{"eissn":["23987340"]},"scopus_import":1,"doi":"10.29007/m75b","article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2020-07-14T12:48:00Z","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."}],"citation":{"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 EPiC Series in Computing, 61:41–61. EasyChair Publications, 2019. https://doi.org/10.29007/m75b.","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.","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 EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. https://doi.org/10.29007/m75b","mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:10.29007/m75b.","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.","ieee":"F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 41–61.","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 61. EasyChair Publications; 2019:41-61. doi:10.29007/m75b"},"year":"2019","file":[{"date_updated":"2020-07-14T12:48:00Z","file_size":1934830,"date_created":"2020-03-24T07:36:36Z","relation":"main_file","access_level":"open_access","file_name":"2019_ARCH19_Immler.pdf","checksum":"9138977a06fcd6a95976eb4bca875f0c","content_type":"application/pdf","creator":"dernst","file_id":"7617"}],"date_created":"2020-03-08T23:00:49Z","_id":"7576","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Immler","first_name":"Fabian","full_name":"Immler, Fabian"},{"full_name":"Althoff, Matthias","first_name":"Matthias","last_name":"Althoff"},{"last_name":"Benet","first_name":"Luis","full_name":"Benet, Luis"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"full_name":"Chen, Xin","last_name":"Chen","first_name":"Xin"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"last_name":"Geretti","first_name":"Luca","full_name":"Geretti, Luca"},{"full_name":"Kochdumper, Niklas","first_name":"Niklas","last_name":"Kochdumper"},{"first_name":"David P.","last_name":"Sanders","full_name":"Sanders, David P."},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"}],"volume":61,"oa":1,"intvolume":" 61","date_updated":"2021-01-12T08:14:17Z","publication":"EPiC Series in Computing","department":[{"_id":"ToHe"}],"day":"25","page":"41-61","quality_controlled":"1","has_accepted_license":"1","publisher":"EasyChair Publications","type":"conference","date_published":"2019-05-25T00:00:00Z","ddc":["000"],"language":[{"iso":"eng"}],"status":"public","month":"05"},{"year":"2019","article_number":"8989292","citation":{"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.","ieee":"M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in IEEE Information Theory Workshop, ITW 2019, Visby, Sweden, 2019.","ama":"Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: IEEE Information Theory Workshop, ITW 2019. IEEE; 2019. doi:10.1109/ITW44776.2019.8989292","mla":"Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” IEEE Information Theory Workshop, ITW 2019, 8989292, IEEE, 2019, doi:10.1109/ITW44776.2019.8989292.","apa":"Hledik, M., Sokolowski, T. R., & Tkačik, G. (2019). A tight upper bound on mutual information. In IEEE Information Theory Workshop, ITW 2019. Visby, Sweden: IEEE. https://doi.org/10.1109/ITW44776.2019.8989292","chicago":"Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In IEEE Information Theory Workshop, ITW 2019. IEEE, 2019. https://doi.org/10.1109/ITW44776.2019.8989292.","short":"M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019."},"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."}],"conference":{"start_date":"2019-08-25","end_date":"2019-08-28","location":"Visby, Sweden","name":"Information Theory Workshop"},"_id":"7606","date_created":"2020-03-22T23:00:47Z","doi":"10.1109/ITW44776.2019.8989292","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.01475"}],"scopus_import":"1","publication_identifier":{"isbn":["9781538669006"]},"title":"A tight upper bound on mutual information","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","arxiv":1,"department":[{"_id":"GaTk"}],"publication":"IEEE Information Theory Workshop, ITW 2019","date_updated":"2025-06-30T13:21:05Z","ec_funded":1,"author":[{"full_name":"Hledik, Michal","id":"4171253A-F248-11E8-B48F-1D18A9856A87","last_name":"Hledik","first_name":"Michal"},{"full_name":"Sokolowski, Thomas R","id":"3E999752-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1287-3779","last_name":"Sokolowski","first_name":"Thomas R"},{"full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"15020","status":"public","relation":"dissertation_contains"}]},"oa":1,"project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"day":"01","quality_controlled":"1","language":[{"iso":"eng"}],"month":"08","isi":1,"status":"public","publisher":"IEEE","date_published":"2019-08-01T00:00:00Z","external_id":{"isi":["000540384500015"],"arxiv":["1812.01475"]},"type":"conference"},{"publisher":"IEEE","author":[{"last_name":"Rannen-Triki","first_name":"Amal","full_name":"Rannen-Triki, Amal"},{"full_name":"Berman, Maxim","last_name":"Berman","first_name":"Maxim"},{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Blaschko, Matthew B.","first_name":"Matthew B.","last_name":"Blaschko"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2019-10-01T00:00:00Z","external_id":{"isi":["000554591600090"]},"type":"conference","language":[{"iso":"eng"}],"month":"10","isi":1,"department":[{"_id":"VlKo"}],"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","status":"public","date_updated":"2023-09-08T11:19:12Z","doi":"10.1109/ICCVW.2019.00097","scopus_import":"1","day":"01","publication_identifier":{"isbn":["9781728150239"]},"publication_status":"published","quality_controlled":"1","title":"Function norms for neural networks","oa_version":"None","article_processing_charge":"No","year":"2019","article_number":"748-752","citation":{"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.","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00097","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., & Blaschko, M. B. (2019). Function norms for neural networks. In Proceedings of the 2019 International Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00097","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00097.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” Proceedings of the 2019 International Conference on Computer Vision Workshop, 748–752, IEEE, 2019, doi:10.1109/ICCVW.2019.00097."},"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."}],"conference":{"start_date":"2019-10-27","name":"ICCVW: International Conference on Computer Vision Workshop","location":"Seoul, South Korea","end_date":"2019-10-28"},"_id":"7639","date_created":"2020-04-05T22:00:50Z"},{"author":[{"last_name":"Kolesnikov","first_name":"Alexander","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alina","last_name":"Kuznetsova","full_name":"Kuznetsova, Alina"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert"},{"first_name":"Vittorio","last_name":"Ferrari","full_name":"Ferrari, Vittorio"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"arxiv":1,"department":[{"_id":"ChLa"}],"ec_funded":1,"date_updated":"2023-09-08T11:18:37Z","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1807.02136","open_access":"1"}],"doi":"10.1109/ICCVW.2019.00217","publication_identifier":{"isbn":["9781728150239"]},"publication_status":"published","title":"Detecting visual relationships using box attention","article_processing_charge":"No","oa_version":"Preprint","citation":{"ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00217","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.","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019.","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019. https://doi.org/10.1109/ICCVW.2019.00217.","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., & Ferrari, V. (2019). Detecting visual relationships using box attention. In Proceedings of the 2019 International Conference on Computer Vision Workshop. Seoul, South Korea: IEEE. https://doi.org/10.1109/ICCVW.2019.00217","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” Proceedings of the 2019 International Conference on Computer Vision Workshop, 1749–1753, IEEE, 2019, doi:10.1109/ICCVW.2019.00217."},"year":"2019","article_number":"1749-1753","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."}],"conference":{"end_date":"2019-10-28","location":"Seoul, South Korea","name":"ICCVW: International Conference on Computer Vision Workshop","start_date":"2019-10-27"},"date_created":"2020-04-05T22:00:51Z","_id":"7640","publisher":"IEEE","type":"conference","external_id":{"isi":["000554591601098"],"arxiv":["1807.02136"]},"date_published":"2019-10-01T00:00:00Z","language":[{"iso":"eng"}],"isi":1,"month":"10","status":"public","day":"01","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding"}]},{"oa":1,"related_material":{"record":[{"id":"7944","relation":"dissertation_contains","status":"public"},{"id":"12833","status":"public","relation":"later_version"}]},"external_id":{"arxiv":["1903.06981"]},"date_published":"2019-03-16T00:00:00Z","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Biniaz, Ahmad","first_name":"Ahmad","last_name":"Biniaz"},{"full_name":"Jain, Kshitij","first_name":"Kshitij","last_name":"Jain"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","last_name":"Masárová","first_name":"Zuzana"},{"last_name":"Miltzow","first_name":"Tillmann","full_name":"Miltzow, Tillmann"},{"first_name":"Debajyoti","last_name":"Mondal","full_name":"Mondal, Debajyoti"},{"last_name":"Naredla","first_name":"Anurag Murty","full_name":"Naredla, Anurag Murty"},{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"full_name":"Turcotte, Alexi","first_name":"Alexi","last_name":"Turcotte"}],"status":"public","publication":"arXiv","date_updated":"2024-01-04T12:42:08Z","month":"03","department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"arxiv":1,"oa_version":"Preprint","article_processing_charge":"No","title":"Token swapping on trees","publication_status":"submitted","day":"16","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.06981"}],"_id":"7950","date_created":"2020-06-08T12:25:25Z","abstract":[{"lang":"eng","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."}],"article_number":"1903.06981","year":"2019","citation":{"ieee":"A. Biniaz et al., “Token swapping on trees,” arXiv. .","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. arXiv.","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.","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.” ArXiv, n.d.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.).","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. arXiv."}},{"volume":39,"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Guillaume","last_name":"Trébuchet","full_name":"Trébuchet, Guillaume"},{"full_name":"Cattenoz, Pierre B","first_name":"Pierre B","last_name":"Cattenoz"},{"full_name":"Zsámboki, János","last_name":"Zsámboki","first_name":"János"},{"full_name":"Mazaud, David","last_name":"Mazaud","first_name":"David"},{"first_name":"Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E"},{"full_name":"Fanto, Manolis","last_name":"Fanto","first_name":"Manolis"},{"full_name":"Giangrande, Angela","last_name":"Giangrande","first_name":"Angela"}],"date_updated":"2023-09-19T10:10:55Z","ec_funded":1,"publication":"Journal of Neuroscience","department":[{"_id":"DaSi"}],"intvolume":" 39","article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2020-10-02T09:33:28Z","title":"The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate","publication_status":"published","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.","article_type":"original","scopus_import":"1","doi":"10.1523/JNEUROSCI.1059-18.2018","file":[{"file_id":"8596","creator":"dernst","content_type":"application/pdf","checksum":"8f6925eb4cd1e8747d8ea25929c68de6","success":1,"access_level":"open_access","file_name":"2019_JournNeuroscience_Trebuchet.pdf","relation":"main_file","file_size":9455414,"date_created":"2020-10-02T09:33:28Z","date_updated":"2020-10-02T09:33:28Z"}],"date_created":"2018-12-11T11:44:07Z","_id":"8","abstract":[{"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.","lang":"eng"}],"citation":{"apa":"Trébuchet, G., Cattenoz, P. B., Zsámboki, J., Mazaud, D., Siekhaus, D. E., Fanto, M., & Giangrande, A. (2019). The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1059-18.2018","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.” Journal of Neuroscience. Society for Neuroscience, 2019. https://doi.org/10.1523/JNEUROSCI.1059-18.2018.","mla":"Trébuchet, Guillaume, et al. “The Repo Homeodomain Transcription Factor Suppresses Hematopoiesis in Drosophila and Preserves the Glial Fate.” Journal of Neuroscience, vol. 39, no. 2, Society for Neuroscience, 2019, pp. 238–55, doi:10.1523/JNEUROSCI.1059-18.2018.","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. Journal of Neuroscience. 2019;39(2):238-255. doi:10.1523/JNEUROSCI.1059-18.2018","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.","ieee":"G. Trébuchet et al., “The Repo homeodomain transcription factor suppresses hematopoiesis in Drosophila and preserves the glial fate,” Journal of Neuroscience, vol. 39, no. 2. Society for Neuroscience, pp. 238–255, 2019."},"year":"2019","type":"journal_article","external_id":{"isi":["000455189900006"],"pmid":["30504274"]},"date_published":"2019-01-09T00:00:00Z","pmid":1,"publisher":"Society for Neuroscience","publist_id":"8048","status":"public","isi":1,"month":"01","ddc":["570"],"language":[{"iso":"eng"}],"quality_controlled":"1","day":"09","page":"238-255","project":[{"name":"Investigating the role of transporters in invasive migration through junctions","_id":"2536F660-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"334077"}],"has_accepted_license":"1","issue":"2"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Andreas","last_name":"Deuchert","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"oa":1,"volume":368,"intvolume":" 368","publication":"Communications in Mathematical Physics","date_updated":"2023-08-24T14:27:51Z","ec_funded":1,"department":[{"_id":"RoSe"}],"article_type":"original","doi":"10.1007/s00220-018-3239-0","scopus_import":"1","file_date_updated":"2020-07-14T12:48:07Z","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","publication_status":"published","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."}],"year":"2019","citation":{"ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 2019;368(2):723-776. doi:10.1007/s00220-018-3239-0","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,” Communications in Mathematical Physics, vol. 368, no. 2. Springer, pp. 723–776, 2019.","mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:10.1007/s00220-018-3239-0.","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.” Communications in Mathematical Physics. Springer, 2019. https://doi.org/10.1007/s00220-018-3239-0.","apa":"Deuchert, A., Seiringer, R., & Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-018-3239-0"},"_id":"80","file":[{"checksum":"c7e9880b43ac726712c1365e9f2f73a6","creator":"dernst","file_id":"5688","content_type":"application/pdf","date_updated":"2020-07-14T12:48:07Z","relation":"main_file","file_size":893902,"date_created":"2018-12-17T10:34:06Z","file_name":"2018_CommunMathPhys_Deuchert.pdf","access_level":"open_access"}],"date_created":"2018-12-11T11:44:31Z","publisher":"Springer","date_published":"2019-06-01T00:00:00Z","external_id":{"isi":["000467796800007"]},"type":"journal_article","language":[{"iso":"eng"}],"ddc":["530"],"status":"public","publist_id":"7974","month":"06","isi":1,"day":"01","page":"723-776","quality_controlled":"1","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"issue":"2"},{"language":[{"iso":"eng"}],"month":"07","status":"public","publisher":"Formal Power Series and Algebraic Combinatorics","type":"conference","external_id":{"arxiv":["1902.08750"]},"date_published":"2019-07-01T00:00:00Z","project":[{"call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"day":"01","quality_controlled":"1","arxiv":1,"department":[{"_id":"LaEr"}],"ec_funded":1,"date_updated":"2021-01-12T08:17:18Z","publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","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"},{"id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter","first_name":"Peter","last_name":"Nejjar"},{"last_name":"Vuletíc","first_name":"Mirjana","full_name":"Vuletíc, Mirjana"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"citation":{"ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana, Slovenia, 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: Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics; 2019.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, 34, 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.","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics, 2019."},"year":"2019","article_number":"34","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"}],"conference":{"start_date":"2019-07-01","end_date":"2019-07-05","name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics","location":"Ljubljana, Slovenia"},"date_created":"2020-07-26T22:01:04Z","_id":"8175","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.08750"}],"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","publication_status":"published","title":"New edge asymptotics of skew Young diagrams via free boundaries","article_processing_charge":"No","oa_version":"Preprint"},{"month":"10","department":[{"_id":"UlWa"}],"publication":"arXiv","status":"public","date_updated":"2023-09-07T13:12:17Z","arxiv":1,"language":[{"iso":"eng"}],"external_id":{"arxiv":["1910.12628"]},"date_published":"2019-10-28T00:00:00Z","type":"preprint","related_material":{"record":[{"id":"11446","status":"public","relation":"later_version"},{"id":"8156","relation":"dissertation_contains","status":"public"}]},"oa":1,"publisher":"arXiv","author":[{"full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey"},{"last_name":"Kudrya","first_name":"Sergey","full_name":"Kudrya, Sergey","id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8182","project":[{"grant_number":"P31312","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory"}],"date_created":"2020-07-30T10:45:08Z","article_number":"1910.12628","year":"2019","citation":{"apa":"Avvakumov, S., & Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. arXiv. arXiv.","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv. arXiv, n.d.","short":"S. Avvakumov, S. Kudrya, ArXiv (n.d.).","mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, 1910.12628, arXiv.","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” arXiv. arXiv.","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. arXiv."},"abstract":[{"lang":"eng","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."}],"publication_status":"submitted","title":"Vanishing of all equivariant obstructions and the mapping degree","oa_version":"Preprint","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1910.12628","open_access":"1"}],"day":"28"},{"day":"23","acknowledgement":"We would like to thank F. Frick for helpful discussions","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.08731"}],"oa_version":"Preprint","article_processing_charge":"No","title":"Stronger counterexamples to the topological Tverberg conjecture","publication_status":"submitted","abstract":[{"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. ","lang":"eng"}],"article_number":"1908.08731","year":"2019","citation":{"mla":"Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, arXiv.","short":"S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).","chicago":"Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv. arXiv, n.d.","apa":"Avvakumov, S., Karasev, R., & Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. arXiv.","ama":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv.","ieee":"S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” arXiv. arXiv.","ista":"Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv, 1908.08731."},"_id":"8184","project":[{"name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","call_identifier":"FWF"}],"date_created":"2020-07-30T10:45:34Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"arXiv","author":[{"full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey"},{"last_name":"Karasev","first_name":"R.","full_name":"Karasev, R."},{"full_name":"Skopenkov, A.","first_name":"A.","last_name":"Skopenkov"}],"oa":1,"related_material":{"record":[{"id":"8156","relation":"dissertation_contains","status":"public"}]},"external_id":{"isi":["000986519600004"],"arxiv":["1908.08731"]},"date_published":"2019-08-23T00:00:00Z","type":"preprint","language":[{"iso":"eng"}],"arxiv":1,"status":"public","publication":"arXiv","date_updated":"2023-09-08T11:20:02Z","month":"08","department":[{"_id":"UlWa"}],"isi":1},{"project":[{"grant_number":"P31312","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-07-30T10:45:51Z","_id":"8185","citation":{"chicago":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1907.11183.","short":"S. Avvakumov, R. Karasev, ArXiv (n.d.).","apa":"Avvakumov, S., & Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv. https://doi.org/10.48550/arXiv.1907.11183","mla":"Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, 1907.11183, doi:10.48550/arXiv.1907.11183.","ista":"Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183.","ieee":"S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” arXiv. .","ama":"Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv. doi:10.48550/arXiv.1907.11183"},"article_number":"1907.11183","year":"2019","abstract":[{"text":"In this paper we study envy-free division problems. The classical approach to some of such problems, used by David Gale, reduces to considering continuous maps of a simplex to itself and finding sufficient conditions when this map hits the center of the simplex. The mere continuity is not sufficient for such a conclusion, the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and the Gale theorem) is a certain boundary condition.\r\n We follow Erel Segal-Halevi, Fr\\'ed\\'eric Meunier, and Shira Zerbib, and replace the boundary condition by another assumption, which has the economic meaning of possibility for a player to prefer an empty part in the segment\r\npartition problem. We solve the problem positively when $n$, the number of players that divide the segment, is a prime power, and we provide counterexamples for every $n$ which is not a prime power. We also provide counterexamples relevant to a wider class of fair or envy-free partition problems when $n$ is odd and not a prime power.","lang":"eng"}],"title":"Envy-free division using mapping degree","publication_status":"submitted","article_processing_charge":"No","oa_version":"Preprint","doi":"10.48550/arXiv.1907.11183","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1907.11183"}],"day":"25","department":[{"_id":"UlWa"}],"month":"07","date_updated":"2023-09-07T13:12:17Z","publication":"arXiv","status":"public","language":[{"iso":"eng"}],"arxiv":1,"type":"preprint","date_published":"2019-07-25T00:00:00Z","external_id":{"arxiv":["1907.11183"]},"related_material":{"link":[{"relation":"later_version","url":"https://doi.org/10.1112/mtk.12059"}],"record":[{"status":"public","relation":"dissertation_contains","id":"8156"}]},"oa":1,"author":[{"last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Karasev, Roman","first_name":"Roman","last_name":"Karasev"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publist_id":"7770","status":"public","isi":1,"month":"01","language":[{"iso":"eng"}],"type":"journal_article","external_id":{"isi":["000449108500010"],"arxiv":["1408.1587"]},"date_published":"2019-01-05T00:00:00Z","publisher":"Elsevier","issue":"1","quality_controlled":"1","day":"05","page":"257 - 311","date_updated":"2023-09-08T13:25:35Z","publication":"Journal of Differential Equations","department":[{"_id":"JuFi"}],"intvolume":" 266","arxiv":1,"volume":266,"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L"},{"last_name":"Kneuss","first_name":"Olivier","full_name":"Kneuss, Olivier"}],"date_created":"2018-12-11T11:44:54Z","_id":"151","abstract":[{"lang":"eng","text":"We construct planar bi-Sobolev mappings whose local volume distortion is bounded from below by a given function f∈Lp with p>1. More precisely, for any 1<q<(p+1)/2 we construct W1,q-bi-Sobolev maps with identity boundary conditions; for f∈L∞, we provide bi-Lipschitz maps. The basic building block of our construction are bi-Lipschitz maps which stretch a given compact subset of the unit square by a given factor while preserving the boundary. The construction of these stretching maps relies on a slight strengthening of the celebrated covering result of Alberti, Csörnyei, and Preiss for measurable planar sets in the case of compact sets. We apply our result to a model functional in nonlinear elasticity, the integrand of which features fast blowup as the Jacobian determinant of the deformation becomes small. For such functionals, the derivation of the equilibrium equations for minimizers requires an additional regularization of test functions, which our maps provide."}],"citation":{"short":"J.L. Fischer, O. Kneuss, Journal of Differential Equations 266 (2019) 257–311.","apa":"Fischer, J. L., & Kneuss, O. (2019). Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity. Journal of Differential Equations. Elsevier. https://doi.org/10.1016/j.jde.2018.07.045","chicago":"Fischer, Julian L, and Olivier Kneuss. “Bi-Sobolev Solutions to the Prescribed Jacobian Inequality in the Plane with L p Data and Applications to Nonlinear Elasticity.” Journal of Differential Equations. Elsevier, 2019. https://doi.org/10.1016/j.jde.2018.07.045.","mla":"Fischer, Julian L., and Olivier Kneuss. “Bi-Sobolev Solutions to the Prescribed Jacobian Inequality in the Plane with L p Data and Applications to Nonlinear Elasticity.” Journal of Differential Equations, vol. 266, no. 1, Elsevier, 2019, pp. 257–311, doi:10.1016/j.jde.2018.07.045.","ieee":"J. L. Fischer and O. Kneuss, “Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity,” Journal of Differential Equations, vol. 266, no. 1. Elsevier, pp. 257–311, 2019.","ista":"Fischer JL, Kneuss O. 2019. Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity. Journal of Differential Equations. 266(1), 257–311.","ama":"Fischer JL, Kneuss O. Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity. Journal of Differential Equations. 2019;266(1):257-311. doi:10.1016/j.jde.2018.07.045"},"year":"2019","article_processing_charge":"No","oa_version":"Preprint","publication_status":"published","title":"Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity","scopus_import":"1","doi":"10.1016/j.jde.2018.07.045","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.1587"}]},{"type":"journal_article","date_published":"2019-04-15T00:00:00Z","external_id":{"arxiv":["1705.01999"],"isi":["000464034200019"]},"publisher":"American Mathematical Society","isi":1,"month":"04","publist_id":"7746","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","page":"5757-5785","day":"15","issue":"8","volume":371,"oa":1,"author":[{"last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"full_name":"Loughran, Daniel","last_name":"Loughran","first_name":"Daniel"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TiBr"}],"date_updated":"2023-08-24T14:34:56Z","publication":"Transactions of the American Mathematical Society","arxiv":1,"intvolume":" 371","publication_status":"published","title":"Sieving rational points on varieties","article_processing_charge":"No","oa_version":"Preprint","scopus_import":"1","doi":"10.1090/tran/7514","main_file_link":[{"url":"https://arxiv.org/abs/1705.01999","open_access":"1"}],"publication_identifier":{"issn":["00029947"],"eissn":["10886850"]},"date_created":"2018-12-11T11:45:01Z","_id":"175","citation":{"apa":"Browning, T. D., & Loughran, D. (2019). Sieving rational points on varieties. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7514","chicago":"Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.” Transactions of the American Mathematical Society. American Mathematical Society, 2019. https://doi.org/10.1090/tran/7514.","short":"T.D. Browning, D. Loughran, Transactions of the American Mathematical Society 371 (2019) 5757–5785.","mla":"Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.” Transactions of the American Mathematical Society, vol. 371, no. 8, American Mathematical Society, 2019, pp. 5757–85, doi:10.1090/tran/7514.","ama":"Browning TD, Loughran D. Sieving rational points on varieties. Transactions of the American Mathematical Society. 2019;371(8):5757-5785. doi:10.1090/tran/7514","ista":"Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions of the American Mathematical Society. 371(8), 5757–5785.","ieee":"T. D. Browning and D. Loughran, “Sieving rational points on varieties,” Transactions of the American Mathematical Society, vol. 371, no. 8. American Mathematical Society, pp. 5757–5785, 2019."},"year":"2019","abstract":[{"text":"An upper bound sieve for rational points on suitable varieties isdeveloped, together with applications tocounting rational points in thin sets,to local solubility in families, and to the notion of “friable” rational pointswith respect to divisors. In the special case of quadrics, sharper estimates areobtained by developing a version of the Selberg sieve for rational points.","lang":"eng"}]},{"date_created":"2018-12-11T11:45:08Z","_id":"196","abstract":[{"lang":"eng","text":"The abelian sandpile serves as a model to study self-organized criticality, a phenomenon occurring in biological, physical and social processes. The identity of the abelian group is a fractal composed of self-similar patches, and its limit is subject of extensive collaborative research. Here, we analyze the evolution of the sandpile identity under harmonic fields of different orders. We show that this evolution corresponds to periodic cycles through the abelian group characterized by the smooth transformation and apparent conservation of the patches constituting the identity. The dynamics induced by second and third order harmonics resemble smooth stretchings, respectively translations, of the identity, while the ones induced by fourth order harmonics resemble magnifications and rotations. Starting with order three, the dynamics pass through extended regions of seemingly random configurations which spontaneously reassemble into accentuated patterns. We show that the space of harmonic functions projects to the extended analogue of the sandpile group, thus providing a set of universal coordinates identifying configurations between different domains. Since the original sandpile group is a subgroup of the extended one, this directly implies that it admits a natural renormalization. Furthermore, we show that the harmonic fields can be induced by simple Markov processes, and that the corresponding stochastic dynamics show remarkable robustness over hundreds of periods. Finally, we encode information into seemingly random configurations, and decode this information with an algorithm requiring minimal prior knowledge. Our results suggest that harmonic fields might split the sandpile group into sub-sets showing different critical coefficients, and that it might be possible to extend the fractal structure of the identity beyond the boundaries of its domain. "}],"citation":{"ama":"Lang M, Shkolnikov M. Harmonic dynamics of the Abelian sandpile. Proceedings of the National Academy of Sciences. 2019;116(8):2821-2830. doi:10.1073/pnas.1812015116","ista":"Lang M, Shkolnikov M. 2019. Harmonic dynamics of the Abelian sandpile. Proceedings of the National Academy of Sciences. 116(8), 2821–2830.","ieee":"M. Lang and M. Shkolnikov, “Harmonic dynamics of the Abelian sandpile,” Proceedings of the National Academy of Sciences, vol. 116, no. 8. National Academy of Sciences, pp. 2821–2830, 2019.","apa":"Lang, M., & Shkolnikov, M. (2019). Harmonic dynamics of the Abelian sandpile. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1812015116","short":"M. Lang, M. Shkolnikov, Proceedings of the National Academy of Sciences 116 (2019) 2821–2830.","chicago":"Lang, Moritz, and Mikhail Shkolnikov. “Harmonic Dynamics of the Abelian Sandpile.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1812015116.","mla":"Lang, Moritz, and Mikhail Shkolnikov. “Harmonic Dynamics of the Abelian Sandpile.” Proceedings of the National Academy of Sciences, vol. 116, no. 8, National Academy of Sciences, 2019, pp. 2821–30, doi:10.1073/pnas.1812015116."},"year":"2019","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"Harmonic dynamics of the Abelian sandpile","acknowledgement":"M.L. is grateful to the members of the C Guet and G Tkacik groups for valuable comments and support. M.S. is grateful to Nikita Kalinin for inspiring communications.\r\n","publication_identifier":{"eissn":["1091-6490"]},"article_type":"original","scopus_import":"1","doi":"10.1073/pnas.1812015116","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1812015116","open_access":"1"}],"date_updated":"2023-09-11T14:09:34Z","publication":"Proceedings of the National Academy of Sciences","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"TaHa"}],"intvolume":" 116","arxiv":1,"volume":116,"oa":1,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/famous-sandpile-model-shown-to-move-like-a-traveling-sand-dune/","relation":"press_release","description":"News on IST Webpage"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Lang, Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","last_name":"Lang","first_name":"Moritz"},{"full_name":"Shkolnikov, Mikhail","id":"35084A62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4310-178X","last_name":"Shkolnikov","first_name":"Mikhail"}],"issue":"8","quality_controlled":"1","day":"19","page":"2821-2830","status":"public","isi":1,"month":"02","language":[{"iso":"eng"}],"type":"journal_article","date_published":"2019-02-19T00:00:00Z","external_id":{"pmid":[" 30728300"],"arxiv":["1806.10823"],"isi":["000459074400013"]},"pmid":1,"publisher":"National Academy of Sciences"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"has_accepted_license":"1","issue":"1","quality_controlled":"1","day":"01","page":"133-138","publist_id":"7785","status":"public","isi":1,"month":"02","ddc":["570"],"language":[{"iso":"eng"}],"type":"journal_article","external_id":{"isi":["000456958800017"]},"date_published":"2019-02-01T00:00:00Z","publisher":"Springer","date_created":"2018-12-11T11:44:50Z","file":[{"file_name":"2019_CurrentGenetics_Nikolic.pdf","access_level":"open_access","file_size":776399,"date_updated":"2020-07-14T12:44:47Z","date_created":"2019-02-06T07:50:58Z","relation":"main_file","creator":"dernst","file_id":"5930","content_type":"application/pdf","checksum":"6779708b0b632a1a6ed28c56f5161142"}],"_id":"138","abstract":[{"text":"Autoregulation is the direct modulation of gene expression by the product of the corresponding gene. Autoregulation of bacterial gene expression has been mostly studied at the transcriptional level, when a protein acts as the cognate transcriptional repressor. A recent study investigating dynamics of the bacterial toxin–antitoxin MazEF system has shown how autoregulation at both the transcriptional and post-transcriptional levels affects the heterogeneity of Escherichia coli populations. Toxin–antitoxin systems hold a crucial but still elusive part in bacterial response to stress. This perspective highlights how these modules can also serve as a great model system for investigating basic concepts in gene regulation. However, as the genomic background and environmental conditions substantially influence toxin activation, it is important to study (auto)regulation of toxin–antitoxin systems in well-defined setups as well as in conditions that resemble the environmental niche.","lang":"eng"}],"citation":{"mla":"Nikolic, Nela. “Autoregulation of Bacterial Gene Expression: Lessons from the MazEF Toxin–Antitoxin System.” Current Genetics, vol. 65, no. 1, Springer, 2019, pp. 133–38, doi:10.1007/s00294-018-0879-8.","apa":"Nikolic, N. (2019). Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system. Current Genetics. Springer. https://doi.org/10.1007/s00294-018-0879-8","short":"N. Nikolic, Current Genetics 65 (2019) 133–138.","chicago":"Nikolic, Nela. “Autoregulation of Bacterial Gene Expression: Lessons from the MazEF Toxin–Antitoxin System.” Current Genetics. Springer, 2019. https://doi.org/10.1007/s00294-018-0879-8.","ista":"Nikolic N. 2019. Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system. Current Genetics. 65(1), 133–138.","ieee":"N. Nikolic, “Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system,” Current Genetics, vol. 65, no. 1. Springer, pp. 133–138, 2019.","ama":"Nikolic N. Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system. Current Genetics. 2019;65(1):133-138. doi:10.1007/s00294-018-0879-8"},"year":"2019","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2020-07-14T12:44:47Z","title":"Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system","publication_status":"published","scopus_import":"1","doi":"10.1007/s00294-018-0879-8","date_updated":"2023-09-08T13:23:42Z","ec_funded":1,"publication":"Current Genetics","department":[{"_id":"CaGu"}],"intvolume":" 65","volume":65,"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Nikolic","first_name":"Nela","full_name":"Nikolic, Nela","orcid":"0000-0001-9068-6090","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87"}]},{"oa":1,"type":"conference","external_id":{"arxiv":["1905.01258"]},"date_published":"2019-12-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco"},{"full_name":"Tschannen, Michael","last_name":"Tschannen","first_name":"Michael"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"},{"last_name":"Bachem","first_name":"Olivier","full_name":"Bachem, Olivier"}],"date_updated":"2023-09-12T07:01:34Z","publication":"8th International Conference on Learning Representations","status":"public","department":[{"_id":"FrLo"}],"month":"12","extern":"1","arxiv":1,"language":[{"iso":"eng"}],"oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","title":"Disentangling factors of variation using few labels","quality_controlled":"1","day":"20","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.01258"}],"date_created":"2023-08-22T14:06:37Z","_id":"14184","conference":{"end_date":"2020-05-01","location":"Virtual","name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-26"},"abstract":[{"text":"Learning disentangled representations is considered a cornerstone problem in\r\nrepresentation learning. Recently, Locatello et al. (2019) demonstrated that\r\nunsupervised disentanglement learning without inductive biases is theoretically\r\nimpossible and that existing inductive biases and unsupervised methods do not\r\nallow to consistently learn disentangled representations. However, in many\r\npractical settings, one might have access to a limited amount of supervision,\r\nfor example through manual labeling of (some) factors of variation in a few\r\ntraining examples. In this paper, we investigate the impact of such supervision\r\non state-of-the-art disentanglement methods and perform a large scale study,\r\ntraining over 52000 models under well-defined and reproducible experimental\r\nconditions. We observe that a small number of labeled examples (0.01--0.5\\% of\r\nthe data set), with potentially imprecise and incomplete labels, is sufficient\r\nto perform model selection on state-of-the-art unsupervised models. Further, we\r\ninvestigate the benefit of incorporating supervision into the training process.\r\nOverall, we empirically validate that with little and imprecise supervision it\r\nis possible to reliably learn disentangled representations.","lang":"eng"}],"citation":{"ama":"Locatello F, Tschannen M, Bauer S, Rätsch G, Schölkopf B, Bachem O. Disentangling factors of variation using few labels. In: 8th International Conference on Learning Representations. ; 2019.","ista":"Locatello F, Tschannen M, Bauer S, Rätsch G, Schölkopf B, Bachem O. 2019. Disentangling factors of variation using few labels. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ieee":"F. Locatello, M. Tschannen, S. Bauer, G. Rätsch, B. Schölkopf, and O. Bachem, “Disentangling factors of variation using few labels,” in 8th International Conference on Learning Representations, Virtual, 2019.","short":"F. Locatello, M. Tschannen, S. Bauer, G. Rätsch, B. Schölkopf, O. Bachem, in:, 8th International Conference on Learning Representations, 2019.","apa":"Locatello, F., Tschannen, M., Bauer, S., Rätsch, G., Schölkopf, B., & Bachem, O. (2019). Disentangling factors of variation using few labels. In 8th International Conference on Learning Representations. Virtual.","chicago":"Locatello, Francesco, Michael Tschannen, Stefan Bauer, Gunnar Rätsch, Bernhard Schölkopf, and Olivier Bachem. “Disentangling Factors of Variation Using Few Labels.” In 8th International Conference on Learning Representations, 2019.","mla":"Locatello, Francesco, et al. “Disentangling Factors of Variation Using Few Labels.” 8th International Conference on Learning Representations, 2019."},"year":"2019"},{"author":[{"full_name":"Gresele, Luigi","last_name":"Gresele","first_name":"Luigi"},{"full_name":"Rubenstein, Paul K.","last_name":"Rubenstein","first_name":"Paul K."},{"first_name":"Arash","last_name":"Mehrjou","full_name":"Mehrjou, Arash"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":115,"oa":1,"arxiv":1,"intvolume":" 115","department":[{"_id":"FrLo"}],"date_updated":"2023-09-12T08:07:38Z","publication":"Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1905.06642","open_access":"1"}],"publication_status":"published","title":"The incomplete Rosetta Stone problem: Identifiability results for multi-view nonlinear ICA","oa_version":"Preprint","article_processing_charge":"No","citation":{"mla":"Gresele, Luigi, et al. “The Incomplete Rosetta Stone Problem: Identifiability Results for Multi-View Nonlinear ICA.” Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence, vol. 115, ML Research Press, 2019, pp. 217–27.","short":"L. Gresele, P.K. Rubenstein, A. Mehrjou, F. Locatello, B. Schölkopf, in:, Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2019, pp. 217–227.","apa":"Gresele, L., Rubenstein, P. K., Mehrjou, A., Locatello, F., & Schölkopf, B. (2019). The incomplete Rosetta Stone problem: Identifiability results for multi-view nonlinear ICA. In Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence (Vol. 115, pp. 217–227). Tel Aviv, Israel: ML Research Press.","chicago":"Gresele, Luigi, Paul K. Rubenstein, Arash Mehrjou, Francesco Locatello, and Bernhard Schölkopf. “The Incomplete Rosetta Stone Problem: Identifiability Results for Multi-View Nonlinear ICA.” In Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence, 115:217–27. ML Research Press, 2019.","ama":"Gresele L, Rubenstein PK, Mehrjou A, Locatello F, Schölkopf B. The incomplete Rosetta Stone problem: Identifiability results for multi-view nonlinear ICA. In: Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence. Vol 115. ML Research Press; 2019:217-227.","ista":"Gresele L, Rubenstein PK, Mehrjou A, Locatello F, Schölkopf B. 2019. The incomplete Rosetta Stone problem: Identifiability results for multi-view nonlinear ICA. Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial Intelligence, PMLR, vol. 115, 217–227.","ieee":"L. Gresele, P. K. Rubenstein, A. Mehrjou, F. Locatello, and B. Schölkopf, “The incomplete Rosetta Stone problem: Identifiability results for multi-view nonlinear ICA,” in Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence, Tel Aviv, Israel, 2019, vol. 115, pp. 217–227."},"year":"2019","abstract":[{"lang":"eng","text":"We consider the problem of recovering a common latent source with independent\r\ncomponents from multiple views. This applies to settings in which a variable is\r\nmeasured with multiple experimental modalities, and where the goal is to\r\nsynthesize the disparate measurements into a single unified representation. We\r\nconsider the case that the observed views are a nonlinear mixing of\r\ncomponent-wise corruptions of the sources. When the views are considered\r\nseparately, this reduces to nonlinear Independent Component Analysis (ICA) for\r\nwhich it is provably impossible to undo the mixing. We present novel\r\nidentifiability proofs that this is possible when the multiple views are\r\nconsidered jointly, showing that the mixing can theoretically be undone using\r\nfunction approximators such as deep neural networks. In contrast to known\r\nidentifiability results for nonlinear ICA, we prove that independent latent\r\nsources with arbitrary mixing can be recovered as long as multiple,\r\nsufficiently different noisy views are available."}],"conference":{"end_date":"2019-07-25","location":"Tel Aviv, Israel","name":"UAI: Uncertainty in Artificial Intelligence","start_date":"2019-07-22"},"date_created":"2023-08-22T14:08:35Z","_id":"14189","publisher":"ML Research Press","type":"conference","external_id":{"arxiv":["1905.06642"]},"date_published":"2019-05-16T00:00:00Z","language":[{"iso":"eng"}],"extern":"1","alternative_title":["PMLR"],"month":"05","status":"public","page":"217-227","day":"16","quality_controlled":"1"},{"arxiv":1,"language":[{"iso":"eng"}],"extern":"1","intvolume":" 32","month":"06","department":[{"_id":"FrLo"}],"status":"public","publication":"Advances in Neural Information Processing Systems","date_updated":"2023-09-13T09:46:38Z","author":[{"first_name":"Muhammad Waleed","last_name":"Gondal","full_name":"Gondal, Muhammad Waleed"},{"first_name":"Manuel","last_name":"Wüthrich","full_name":"Wüthrich, Manuel"},{"first_name":"Đorđe","last_name":"Miladinović","full_name":"Miladinović, Đorđe"},{"first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"last_name":"Breidt","first_name":"Martin","full_name":"Breidt, Martin"},{"last_name":"Volchkov","first_name":"Valentin","full_name":"Volchkov, Valentin"},{"full_name":"Akpo, Joel","first_name":"Joel","last_name":"Akpo"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"full_name":"Bauer, Stefan","first_name":"Stefan","last_name":"Bauer"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2019-06-07T00:00:00Z","external_id":{"arxiv":["1906.03292"]},"type":"conference","oa":1,"volume":32,"year":"2019","citation":{"ieee":"M. W. Gondal et al., “On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32.","ista":"Gondal MW, Wüthrich M, Miladinović Đ, Locatello F, Breidt M, Volchkov V, Akpo J, Bachem O, Schölkopf B, Bauer S. 2019. On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 32.","ama":"Gondal MW, Wüthrich M, Miladinović Đ, et al. On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset. In: Advances in Neural Information Processing Systems. Vol 32. ; 2019.","mla":"Gondal, Muhammad Waleed, et al. “On the Transfer of Inductive Bias from Simulation to the Real World: A New Disentanglement Dataset.” Advances in Neural Information Processing Systems, vol. 32, 2019.","chicago":"Gondal, Muhammad Waleed, Manuel Wüthrich, Đorđe Miladinović, Francesco Locatello, Martin Breidt, Valentin Volchkov, Joel Akpo, Olivier Bachem, Bernhard Schölkopf, and Stefan Bauer. “On the Transfer of Inductive Bias from Simulation to the Real World: A New Disentanglement Dataset.” In Advances in Neural Information Processing Systems, Vol. 32, 2019.","short":"M.W. Gondal, M. Wüthrich, Đ. Miladinović, F. Locatello, M. Breidt, V. Volchkov, J. Akpo, O. Bachem, B. Schölkopf, S. Bauer, in:, Advances in Neural Information Processing Systems, 2019.","apa":"Gondal, M. W., Wüthrich, M., Miladinović, Đ., Locatello, F., Breidt, M., Volchkov, V., … Bauer, S. (2019). On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset. In Advances in Neural Information Processing Systems (Vol. 32). Vancouver, Canada."},"abstract":[{"text":"Learning meaningful and compact representations with disentangled semantic\r\naspects is considered to be of key importance in representation learning. Since\r\nreal-world data is notoriously costly to collect, many recent state-of-the-art\r\ndisentanglement models have heavily relied on synthetic toy data-sets. In this\r\npaper, we propose a novel data-set which consists of over one million images of\r\nphysical 3D objects with seven factors of variation, such as object color,\r\nshape, size and position. In order to be able to control all the factors of\r\nvariation precisely, we built an experimental platform where the objects are\r\nbeing moved by a robotic arm. In addition, we provide two more datasets which\r\nconsist of simulations of the experimental setup. These datasets provide for\r\nthe first time the possibility to systematically investigate how well different\r\ndisentanglement methods perform on real data in comparison to simulation, and\r\nhow simulated data can be leveraged to build better representations of the real\r\nworld. We provide a first experimental study of these questions and our results\r\nindicate that learned models transfer poorly, but that model and hyperparameter\r\nselection is an effective means of transferring information to the real world.","lang":"eng"}],"conference":{"end_date":"2019-12-14","name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2019-12-08"},"_id":"14190","date_created":"2023-08-22T14:09:13Z","main_file_link":[{"url":"https://arxiv.org/abs/1906.03292","open_access":"1"}],"publication_identifier":{"isbn":["9781713807933"]},"day":"07","quality_controlled":"1","title":"On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No"},{"external_id":{"arxiv":["1901.10348"]},"date_published":"2019-12-29T00:00:00Z","type":"conference","extern":"1","language":[{"iso":"eng"}],"status":"public","month":"12","day":"29","page":"14291–14301","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco"},{"first_name":"Alp","last_name":"Yurtsever","full_name":"Yurtsever, Alp"},{"full_name":"Fercoq, Olivier","last_name":"Fercoq","first_name":"Olivier"},{"last_name":"Cevher","first_name":"Volkan","full_name":"Cevher, Volkan"}],"oa":1,"volume":32,"intvolume":" 32","arxiv":1,"publication":"Advances in Neural Information Processing Systems","date_updated":"2023-09-12T08:48:45Z","department":[{"_id":"FrLo"}],"publication_identifier":{"isbn":["9781713807933"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.10348"}],"scopus_import":"1","oa_version":"Preprint","article_processing_charge":"No","title":"Stochastic Frank-Wolfe for composite convex minimization","publication_status":"published","abstract":[{"lang":"eng","text":"A broad class of convex optimization problems can be formulated as a semidefinite program (SDP), minimization of a convex function over the positive-semidefinite cone subject to some affine constraints. The majority of classical SDP solvers are designed for the deterministic setting where problem data is readily available. In this setting, generalized conditional gradient methods (aka Frank-Wolfe-type methods) provide scalable solutions by leveraging the so-called linear minimization oracle instead of the projection onto the semidefinite cone. Most problems in machine learning and modern engineering applications, however, contain some degree of stochasticity. In this work, we propose the first conditional-gradient-type method for solving stochastic optimization problems under affine constraints. Our method guarantees O(k−1/3) convergence rate in expectation on the objective residual and O(k−5/12) on the feasibility gap."}],"year":"2019","citation":{"ista":"Locatello F, Yurtsever A, Fercoq O, Cevher V. 2019. Stochastic Frank-Wolfe for composite convex minimization. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 32, 14291–14301.","ieee":"F. Locatello, A. Yurtsever, O. Fercoq, and V. Cevher, “Stochastic Frank-Wolfe for composite convex minimization,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 14291–14301.","ama":"Locatello F, Yurtsever A, Fercoq O, Cevher V. Stochastic Frank-Wolfe for composite convex minimization. In: Advances in Neural Information Processing Systems. Vol 32. ; 2019:14291–14301.","mla":"Locatello, Francesco, et al. “Stochastic Frank-Wolfe for Composite Convex Minimization.” Advances in Neural Information Processing Systems, vol. 32, 2019, pp. 14291–14301.","chicago":"Locatello, Francesco, Alp Yurtsever, Olivier Fercoq, and Volkan Cevher. “Stochastic Frank-Wolfe for Composite Convex Minimization.” In Advances in Neural Information Processing Systems, 32:14291–14301, 2019.","apa":"Locatello, F., Yurtsever, A., Fercoq, O., & Cevher, V. (2019). Stochastic Frank-Wolfe for composite convex minimization. In Advances in Neural Information Processing Systems (Vol. 32, pp. 14291–14301). Vancouver, Canada.","short":"F. Locatello, A. Yurtsever, O. Fercoq, V. Cevher, in:, Advances in Neural Information Processing Systems, 2019, pp. 14291–14301."},"_id":"14191","date_created":"2023-08-22T14:09:35Z","conference":{"start_date":"2019-12-08","end_date":"2019-12-14","name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada"}},{"year":"2019","citation":{"ama":"Steenkiste S van, Locatello F, Schmidhuber J, Bachem O. Are disentangled representations helpful for abstract visual reasoning? In: Advances in Neural Information Processing Systems. Vol 32. ; 2019.","ieee":"S. van Steenkiste, F. Locatello, J. Schmidhuber, and O. Bachem, “Are disentangled representations helpful for abstract visual reasoning?,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32.","ista":"Steenkiste S van, Locatello F, Schmidhuber J, Bachem O. 2019. Are disentangled representations helpful for abstract visual reasoning? Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 32.","apa":"Steenkiste, S. van, Locatello, F., Schmidhuber, J., & Bachem, O. (2019). Are disentangled representations helpful for abstract visual reasoning? In Advances in Neural Information Processing Systems (Vol. 32). Vancouver, Canada.","short":"S. van Steenkiste, F. Locatello, J. Schmidhuber, O. Bachem, in:, Advances in Neural Information Processing Systems, 2019.","chicago":"Steenkiste, Sjoerd van, Francesco Locatello, Jürgen Schmidhuber, and Olivier Bachem. “Are Disentangled Representations Helpful for Abstract Visual Reasoning?” In Advances in Neural Information Processing Systems, Vol. 32, 2019.","mla":"Steenkiste, Sjoerd van, et al. “Are Disentangled Representations Helpful for Abstract Visual Reasoning?” Advances in Neural Information Processing Systems, vol. 32, 2019."},"abstract":[{"text":"A disentangled representation encodes information about the salient factors\r\nof variation in the data independently. Although it is often argued that this\r\nrepresentational format is useful in learning to solve many real-world\r\ndown-stream tasks, there is little empirical evidence that supports this claim.\r\nIn this paper, we conduct a large-scale study that investigates whether\r\ndisentangled representations are more suitable for abstract reasoning tasks.\r\nUsing two new tasks similar to Raven's Progressive Matrices, we evaluate the\r\nusefulness of the representations learned by 360 state-of-the-art unsupervised\r\ndisentanglement models. Based on these representations, we train 3600 abstract\r\nreasoning models and observe that disentangled representations do in fact lead\r\nto better down-stream performance. In particular, they enable quicker learning\r\nusing fewer samples.","lang":"eng"}],"conference":{"location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems","end_date":"2019-12-14","start_date":"2019-12-08"},"_id":"14193","date_created":"2023-08-22T14:09:53Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1905.12506"}],"day":"29","publication_identifier":{"isbn":["9781713807933"]},"quality_controlled":"1","title":"Are disentangled representations helpful for abstract visual reasoning?","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","arxiv":1,"language":[{"iso":"eng"}],"extern":"1","intvolume":" 32","month":"05","department":[{"_id":"FrLo"}],"status":"public","publication":"Advances in Neural Information Processing Systems","date_updated":"2023-09-12T09:02:43Z","author":[{"first_name":"Sjoerd van","last_name":"Steenkiste","full_name":"Steenkiste, Sjoerd van"},{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello"},{"first_name":"Jürgen","last_name":"Schmidhuber","full_name":"Schmidhuber, Jürgen"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1905.12506"]},"date_published":"2019-05-29T00:00:00Z","type":"conference","oa":1,"volume":32}]