[{"isi":1,"year":"2019","day":"01","publication":"Journal of Spectral Theory","page":"921-965","doi":"10.4171/jst/267","date_published":"2019-03-01T00:00:00Z","date_created":"2022-03-18T12:36:42Z","acknowledgement":"M.G. was supported by the DFG under grant GE 2871/1-1.","quality_controlled":"1","publisher":"European Mathematical Society Publishing House","oa":1,"citation":{"chicago":"Dietlein, Adrian M, Martin Gebert, and Peter Müller. “Perturbations of Continuum Random Schrödinger Operators with Applications to Anderson Orthogonality and the Spectral Shift Function.” Journal of Spectral Theory. European Mathematical Society Publishing House, 2019. https://doi.org/10.4171/jst/267.","ista":"Dietlein AM, Gebert M, Müller P. 2019. Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function. Journal of Spectral Theory. 9(3), 921–965.","mla":"Dietlein, Adrian M., et al. “Perturbations of Continuum Random Schrödinger Operators with Applications to Anderson Orthogonality and the Spectral Shift Function.” Journal of Spectral Theory, vol. 9, no. 3, European Mathematical Society Publishing House, 2019, pp. 921–65, doi:10.4171/jst/267.","ieee":"A. M. Dietlein, M. Gebert, and P. Müller, “Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function,” Journal of Spectral Theory, vol. 9, no. 3. European Mathematical Society Publishing House, pp. 921–965, 2019.","short":"A.M. Dietlein, M. Gebert, P. Müller, Journal of Spectral Theory 9 (2019) 921–965.","apa":"Dietlein, A. M., Gebert, M., & Müller, P. (2019). Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function. Journal of Spectral Theory. European Mathematical Society Publishing House. https://doi.org/10.4171/jst/267","ama":"Dietlein AM, Gebert M, Müller P. Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function. Journal of Spectral Theory. 2019;9(3):921-965. doi:10.4171/jst/267"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Adrian M","id":"317CB464-F248-11E8-B48F-1D18A9856A87","last_name":"Dietlein","full_name":"Dietlein, Adrian M"},{"first_name":"Martin","full_name":"Gebert, Martin","last_name":"Gebert"},{"full_name":"Müller, Peter","last_name":"Müller","first_name":"Peter"}],"external_id":{"isi":["000484709400006"],"arxiv":["1701.02956"]},"article_processing_charge":"No","title":"Perturbations of continuum random Schrödinger operators with applications to Anderson orthogonality and the spectral shift function","publication_identifier":{"issn":["1664-039X"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"3","volume":9,"abstract":[{"text":"We study effects of a bounded and compactly supported perturbation on multidimensional continuum random Schrödinger operators in the region of complete localisation. Our main emphasis is on Anderson orthogonality for random Schrödinger operators. Among others, we prove that Anderson orthogonality does occur for Fermi energies in the region of complete localisation with a non-zero probability. This partially confirms recent non-rigorous findings [V. Khemani et al., Nature Phys. 11 (2015), 560–565]. The spectral shift function plays an important role in our analysis of Anderson orthogonality. We identify it with the index of the corresponding pair of spectral projections and explore the consequences thereof. All our results rely on the main technical estimate of this paper which guarantees separate exponential decay of the disorder-averaged Schatten p-norm of χa(f(H)−f(Hτ))χb in a and b. Here, Hτ is a perturbation of the random Schrödinger operator H, χa is the multiplication operator corresponding to the indicator function of a unit cube centred about a∈Rd, and f is in a suitable class of functions of bounded variation with distributional derivative supported in the region of complete localisation for H.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1701.02956","open_access":"1"}],"month":"03","intvolume":" 9","date_updated":"2023-09-08T11:35:31Z","department":[{"_id":"LaEr"}],"_id":"10879","article_type":"original","type":"journal_article","status":"public","keyword":["Random Schrödinger operators","spectral shift function","Anderson orthogonality"]},{"external_id":{"arxiv":["1708.04156"],"isi":["000459954800003"]},"article_processing_charge":"No","author":[{"first_name":"Franco","full_name":"Flandoli, Franco","last_name":"Flandoli"},{"last_name":"Priola","full_name":"Priola, Enrico","first_name":"Enrico"},{"first_name":"Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87","full_name":"Zanco, Giovanni A","last_name":"Zanco"}],"title":"A mean-field model with discontinuous coefficients for neurons with spatial interaction","citation":{"chicago":"Flandoli, Franco, Enrico Priola, and Giovanni A Zanco. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” Discrete and Continuous Dynamical Systems. American Institute of Mathematical Sciences, 2019. https://doi.org/10.3934/dcds.2019126.","ista":"Flandoli F, Priola E, Zanco GA. 2019. A mean-field model with discontinuous coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical Systems. 39(6), 3037–3067.","mla":"Flandoli, Franco, et al. “A Mean-Field Model with Discontinuous Coefficients for Neurons with Spatial Interaction.” Discrete and Continuous Dynamical Systems, vol. 39, no. 6, American Institute of Mathematical Sciences, 2019, pp. 3037–67, doi:10.3934/dcds.2019126.","apa":"Flandoli, F., Priola, E., & Zanco, G. A. (2019). A mean-field model with discontinuous coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical Systems. American Institute of Mathematical Sciences. https://doi.org/10.3934/dcds.2019126","ama":"Flandoli F, Priola E, Zanco GA. A mean-field model with discontinuous coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical Systems. 2019;39(6):3037-3067. doi:10.3934/dcds.2019126","ieee":"F. Flandoli, E. Priola, and G. A. Zanco, “A mean-field model with discontinuous coefficients for neurons with spatial interaction,” Discrete and Continuous Dynamical Systems, vol. 39, no. 6. American Institute of Mathematical Sciences, pp. 3037–3067, 2019.","short":"F. Flandoli, E. Priola, G.A. Zanco, Discrete and Continuous Dynamical Systems 39 (2019) 3037–3067."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"page":"3037-3067","date_created":"2022-03-18T12:33:34Z","doi":"10.3934/dcds.2019126","date_published":"2019-06-01T00:00:00Z","year":"2019","isi":1,"publication":"Discrete and Continuous Dynamical Systems","day":"01","oa":1,"quality_controlled":"1","publisher":"American Institute of Mathematical Sciences","acknowledgement":"The second author has been partially supported by INdAM through the GNAMPA Research\r\nProject (2017) “Sistemi stocastici singolari: buona posizione e problemi di controllo”. The third\r\nauthor was partly funded by the Austrian Science Fund (FWF) project F 65.","department":[{"_id":"JaMa"}],"date_updated":"2023-09-08T11:34:45Z","type":"journal_article","article_type":"original","keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics","Analysis"],"status":"public","_id":"10878","volume":39,"issue":"6","publication_status":"published","publication_identifier":{"issn":["1553-5231"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.04156"}],"scopus_import":"1","intvolume":" 39","month":"06","abstract":[{"text":"Starting from a microscopic model for a system of neurons evolving in time which individually follow a stochastic integrate-and-fire type model, we study a mean-field limit of the system. Our model is described by a system of SDEs with discontinuous coefficients for the action potential of each neuron and takes into account the (random) spatial configuration of neurons allowing the interaction to depend on it. In the limit as the number of particles tends to infinity, we obtain a nonlinear Fokker-Planck type PDE in two variables, with derivatives only with respect to one variable and discontinuous coefficients. We also study strong well-posedness of the system of SDEs and prove the existence and uniqueness of a weak measure-valued solution to the PDE, obtained as the limit of the laws of the empirical measures for the system of particles.","lang":"eng"}],"oa_version":"Preprint"},{"department":[{"_id":"DaAl"}],"date_updated":"2023-09-08T11:37:22Z","status":"public","conference":{"end_date":"2019-08-02","location":"Toronto, ON, Canada","start_date":"2019-07-29","name":"PODC: Symposium on Principles of Distributed Computing"},"type":"conference","_id":"6935","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781450362177"]},"month":"08","main_file_link":[{"url":"https://arxiv.org/abs/1905.03012","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of distributed algorithms in Software-Defined Networks (SDNs). In this paper, we show that a large class of lower bounds in the CONGEST model still hold in the SUPPORTED model, highlighting the robustness of these bounds. This also raises the question how much does\r\npreprocessing help in the CONGEST model."}],"title":"Does preprocessing help under congestion?","article_processing_charge":"No","external_id":{"isi":["000570442000037"],"arxiv":["1905.03012"]},"author":[{"last_name":"Foerster","full_name":"Foerster, Klaus-Tycho","first_name":"Klaus-Tycho"},{"full_name":"Korhonen, Janne","last_name":"Korhonen","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"last_name":"Rybicki","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.","short":"K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.","ama":"Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581","apa":"Foerster, K.-T., Korhonen, J., Rybicki, J., & Schmid, S. (2019). Does preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331581","mla":"Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.","ista":"Foerster K-T, Korhonen J, Rybicki J, Schmid S. 2019. Does preprocessing help under congestion? Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 259–261.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Joel Rybicki, and Stefan Schmid. “Does Preprocessing Help under Congestion?” In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 259–61. ACM, 2019. https://doi.org/10.1145/3293611.3331581."},"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"date_created":"2019-10-08T12:57:14Z","doi":"10.1145/3293611.3331581","date_published":"2019-08-01T00:00:00Z","page":"259-261","publication":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","day":"01","year":"2019","isi":1,"oa":1,"quality_controlled":"1","publisher":"ACM"},{"quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","publication":"Current Genetics","isi":1,"has_accepted_license":"1","year":"2019","doi":"10.1007/s00294-018-0879-8","date_published":"2019-02-01T00:00:00Z","date_created":"2018-12-11T11:44:50Z","page":"133-138","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","short":"N. Nikolic, Current Genetics 65 (2019) 133–138.","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","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","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.","ista":"Nikolic N. 2019. Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system. Current Genetics. 65(1), 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."},"title":"Autoregulation of bacterial gene expression: lessons from the MazEF toxin–antitoxin system","publist_id":"7785","author":[{"orcid":"0000-0001-9068-6090","full_name":"Nikolic, Nela","last_name":"Nikolic","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","first_name":"Nela"}],"external_id":{"isi":["000456958800017"]},"article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","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"}],"month":"02","intvolume":" 65","scopus_import":"1","file":[{"file_id":"5930","checksum":"6779708b0b632a1a6ed28c56f5161142","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-02-06T07:50:58Z","file_name":"2019_CurrentGenetics_Nikolic.pdf","creator":"dernst","date_updated":"2020-07-14T12:44:47Z","file_size":776399}],"language":[{"iso":"eng"}],"publication_status":"published","volume":65,"issue":"1","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","_id":"138","status":"public","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2023-09-08T13:23:42Z","file_date_updated":"2020-07-14T12:44:47Z","department":[{"_id":"CaGu"}]},{"intvolume":" 266","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.1587"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"volume":266,"issue":"1","language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"151","department":[{"_id":"JuFi"}],"date_updated":"2023-09-08T13:25:35Z","oa":1,"quality_controlled":"1","publisher":"Elsevier","date_created":"2018-12-11T11:44:54Z","doi":"10.1016/j.jde.2018.07.045","date_published":"2019-01-05T00:00:00Z","page":"257 - 311","publication":"Journal of Differential Equations","day":"05","year":"2019","isi":1,"title":"Bi-Sobolev solutions to the prescribed Jacobian inequality in the plane with L p data and applications to nonlinear elasticity","article_processing_charge":"No","external_id":{"isi":["000449108500010"],"arxiv":["1408.1587"]},"author":[{"last_name":"Fischer","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L"},{"full_name":"Kneuss, Olivier","last_name":"Kneuss","first_name":"Olivier"}],"publist_id":"7770","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","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.","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.","short":"J.L. Fischer, O. Kneuss, Journal of Differential Equations 266 (2019) 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","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","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."}},{"project":[{"_id":"25D92700-B435-11E9-9278-68D0E5697425","name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain","grant_number":"LS13-002"},{"grant_number":"RGP0053/2014","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","_id":"25D7962E-B435-11E9-9278-68D0E5697425"},{"_id":"25D61E48-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Molecular Mechanisms of Cerebral Cortex Development","grant_number":"618444"},{"grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Amberg, N., Laukoter, S., & Hippenmeyer, S. (2019). Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. Wiley. https://doi.org/10.1111/jnc.14601","ama":"Amberg N, Laukoter S, Hippenmeyer S. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 2019;149(1):12-26. doi:10.1111/jnc.14601","ieee":"N. Amberg, S. Laukoter, and S. Hippenmeyer, “Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex,” Journal of Neurochemistry, vol. 149, no. 1. Wiley, pp. 12–26, 2019.","short":"N. Amberg, S. Laukoter, S. Hippenmeyer, Journal of Neurochemistry 149 (2019) 12–26.","mla":"Amberg, Nicole, et al. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” Journal of Neurochemistry, vol. 149, no. 1, Wiley, 2019, pp. 12–26, doi:10.1111/jnc.14601.","ista":"Amberg N, Laukoter S, Hippenmeyer S. 2019. Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex. Journal of Neurochemistry. 149(1), 12–26.","chicago":"Amberg, Nicole, Susanne Laukoter, and Simon Hippenmeyer. “Epigenetic Cues Modulating the Generation of Cell Type Diversity in the Cerebral Cortex.” Journal of Neurochemistry. Wiley, 2019. https://doi.org/10.1111/jnc.14601."},"title":"Epigenetic cues modulating the generation of cell type diversity in the cerebral cortex","author":[{"first_name":"Nicole","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","full_name":"Amberg, Nicole","orcid":"0000-0002-3183-8207","last_name":"Amberg"},{"id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","first_name":"Susanne","full_name":"Laukoter, Susanne","orcid":"0000-0002-7903-3010","last_name":"Laukoter"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"}],"external_id":{"isi":["000462680200002"]},"article_processing_charge":"Yes (via OA deal)","acknowledgement":" This work was supported by IST Austria institutional funds; NÖ Forschung und Bildung \r\nn[f+b] (C13-002) to SH; a program grant from the Human Frontiers Science Program (RGP0053/2014) to SH; the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No 618444 to SH, and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 725780 LinPro)to SH.\r\n","publisher":"Wiley","quality_controlled":"1","oa":1,"day":"01","publication":"Journal of Neurochemistry","has_accepted_license":"1","isi":1,"year":"2019","doi":"10.1111/jnc.14601","date_published":"2019-04-01T00:00:00Z","date_created":"2018-12-11T11:44:14Z","page":"12-26","_id":"27","status":"public","article_type":"review","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2023-09-11T13:40:26Z","department":[{"_id":"SiHi"}],"file_date_updated":"2020-07-14T12:45:45Z","oa_version":"Published Version","abstract":[{"text":"The cerebral cortex is composed of a large variety of distinct cell-types including projection neurons, interneurons and glial cells which emerge from distinct neural stem cell (NSC) lineages. The vast majority of cortical projection neurons and certain classes of glial cells are generated by radial glial progenitor cells (RGPs) in a highly orchestrated manner. Recent studies employing single cell analysis and clonal lineage tracing suggest that NSC and RGP lineage progression are regulated in a profound deterministic manner. In this review we focus on recent advances based mainly on correlative phenotypic data emerging from functional genetic studies in mice. We establish hypotheses to test in future research and outline a conceptual framework how epigenetic cues modulate the generation of cell-type diversity during cortical development. This article is protected by copyright. All rights reserved.","lang":"eng"}],"month":"04","intvolume":" 149","scopus_import":"1","file":[{"creator":"kschuh","file_size":889709,"date_updated":"2020-07-14T12:45:45Z","file_name":"2019_Wiley_Amberg.pdf","date_created":"2020-01-07T13:35:52Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"db027721a95d36f5de36aadcd0bdf7e6","file_id":"7239"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"1","volume":149,"ec_funded":1},{"publication":"Nature Cell Biology","day":"01","year":"2019","has_accepted_license":"1","isi":1,"date_created":"2018-12-30T22:59:15Z","date_published":"2019-02-01T00:00:00Z","doi":"10.1038/s41556-018-0247-4","page":"169–178","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Petridou N, Grigolon S, Salbreux G, Hannezo EB, Heisenberg C-PJ. 2019. Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling. Nature Cell Biology. 21, 169–178.","chicago":"Petridou, Nicoletta, Silvia Grigolon, Guillaume Salbreux, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Fluidization-Mediated Tissue Spreading by Mitotic Cell Rounding and Non-Canonical Wnt Signalling.” Nature Cell Biology. Nature Publishing Group, 2019. https://doi.org/10.1038/s41556-018-0247-4.","ieee":"N. Petridou, S. Grigolon, G. Salbreux, E. B. Hannezo, and C.-P. J. Heisenberg, “Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling,” Nature Cell Biology, vol. 21. Nature Publishing Group, pp. 169–178, 2019.","short":"N. Petridou, S. Grigolon, G. Salbreux, E.B. Hannezo, C.-P.J. Heisenberg, Nature Cell Biology 21 (2019) 169–178.","ama":"Petridou N, Grigolon S, Salbreux G, Hannezo EB, Heisenberg C-PJ. Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling. Nature Cell Biology. 2019;21:169–178. doi:10.1038/s41556-018-0247-4","apa":"Petridou, N., Grigolon, S., Salbreux, G., Hannezo, E. B., & Heisenberg, C.-P. J. (2019). Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/s41556-018-0247-4","mla":"Petridou, Nicoletta, et al. “Fluidization-Mediated Tissue Spreading by Mitotic Cell Rounding and Non-Canonical Wnt Signalling.” Nature Cell Biology, vol. 21, Nature Publishing Group, 2019, pp. 169–178, doi:10.1038/s41556-018-0247-4."},"title":"Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling","external_id":{"pmid":["30559456"],"isi":["000457468300011"]},"article_processing_charge":"No","author":[{"last_name":"Petridou","orcid":"0000-0002-8451-1195","full_name":"Petridou, Nicoletta","first_name":"Nicoletta","id":"2A003F6C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Silvia","full_name":"Grigolon, Silvia","last_name":"Grigolon"},{"full_name":"Salbreux, Guillaume","last_name":"Salbreux","first_name":"Guillaume"},{"last_name":"Hannezo","orcid":"0000-0001-6005-1561","full_name":"Hannezo, Edouard B","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"project":[{"_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation"},{"name":"Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants (EMBO fellowship)","grant_number":"ALTF710-2016","_id":"253E54C8-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":71590590,"date_updated":"2020-10-21T07:18:35Z","file_name":"2018_NatureCellBio_Petridou_accepted.pdf","date_created":"2020-10-21T07:18:35Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"e38523787b3bc84006f2793de99ad70f","file_id":"8685"}],"publication_status":"published","publication_identifier":{"issn":["14657392"]},"ec_funded":1,"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/when-a-fish-becomes-fluid/","relation":"press_release"}]},"volume":21,"pmid":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Tissue morphogenesis is driven by mechanical forces that elicit changes in cell size, shape and motion. The extent by which forces deform tissues critically depends on the rheological properties of the recipient tissue. Yet, whether and how dynamic changes in tissue rheology affect tissue morphogenesis and how they are regulated within the developing organism remain unclear. Here, we show that blastoderm spreading at the onset of zebrafish morphogenesis relies on a rapid, pronounced and spatially patterned tissue fluidization. Blastoderm fluidization is temporally controlled by mitotic cell rounding-dependent cell–cell contact disassembly during the last rounds of cell cleavages. Moreover, fluidization is spatially restricted to the central blastoderm by local activation of non-canonical Wnt signalling within the blastoderm margin, increasing cell cohesion and thereby counteracting the effect of mitotic rounding on contact disassembly. Overall, our results identify a fluidity transition mediated by loss of cell cohesion as a critical regulator of embryo morphogenesis."}],"acknowledged_ssus":[{"_id":"Bio"}],"intvolume":" 21","month":"02","scopus_import":"1","ddc":["570"],"date_updated":"2023-09-11T14:03:28Z","department":[{"_id":"CaHe"},{"_id":"EdHa"}],"file_date_updated":"2020-10-21T07:18:35Z","_id":"5789","status":"public","type":"journal_article","article_type":"original"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","ista":"Lang M, Shkolnikov M. 2019. Harmonic dynamics of the Abelian sandpile. Proceedings of the National Academy of Sciences. 116(8), 2821–2830.","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.","short":"M. Lang, M. Shkolnikov, Proceedings of the National Academy of Sciences 116 (2019) 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","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"},"title":"Harmonic dynamics of the Abelian sandpile","article_processing_charge":"No","external_id":{"arxiv":["1806.10823"],"pmid":[" 30728300"],"isi":["000459074400013"]},"author":[{"full_name":"Lang, Moritz","last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","first_name":"Moritz"},{"id":"35084A62-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Shkolnikov","full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X"}],"publication":"Proceedings of the National Academy of Sciences","day":"19","year":"2019","isi":1,"date_created":"2018-12-11T11:45:08Z","date_published":"2019-02-19T00:00:00Z","doi":"10.1073/pnas.1812015116","page":"2821-2830","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","oa":1,"publisher":"National Academy of Sciences","quality_controlled":"1","date_updated":"2023-09-11T14:09:34Z","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"TaHa"}],"_id":"196","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1091-6490"]},"issue":"8","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"}]},"volume":116,"oa_version":"Published Version","pmid":1,"abstract":[{"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. ","lang":"eng"}],"intvolume":" 116","month":"02","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1812015116","open_access":"1"}],"scopus_import":"1"},{"citation":{"mla":"Locatello, Francesco, et al. “Disentangling Factors of Variation Using Few Labels.” 8th International Conference on Learning Representations, 2019.","short":"F. Locatello, M. Tschannen, S. Bauer, G. Rätsch, B. Schölkopf, O. Bachem, in:, 8th International Conference on Learning Representations, 2019.","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.","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.","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.","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.","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."},"date_updated":"2023-09-12T07:01:34Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Michael","full_name":"Tschannen, Michael","last_name":"Tschannen"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"last_name":"Rätsch","full_name":"Rätsch, Gunnar","first_name":"Gunnar"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"}],"external_id":{"arxiv":["1905.01258"]},"article_processing_charge":"No","department":[{"_id":"FrLo"}],"title":"Disentangling factors of variation using few labels","_id":"14184","type":"conference","conference":{"name":"ICLR: International Conference on Learning Representations","location":"Virtual","end_date":"2020-05-01","start_date":"2020-04-26"},"status":"public","publication_status":"published","year":"2019","day":"20","publication":"8th International Conference on Learning Representations","language":[{"iso":"eng"}],"date_published":"2019-12-20T00:00:00Z","date_created":"2023-08-22T14:06:37Z","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"}],"oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1905.01258","open_access":"1"}],"oa":1,"month":"12"},{"department":[{"_id":"FrLo"}],"date_updated":"2023-09-12T08:07:38Z","extern":"1","conference":{"end_date":"2019-07-25","location":"Tel Aviv, Israel","start_date":"2019-07-22","name":"UAI: Uncertainty in Artificial Intelligence"},"type":"conference","status":"public","_id":"14189","volume":115,"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1905.06642","open_access":"1"}],"alternative_title":["PMLR"],"scopus_import":"1","intvolume":" 115","month":"05","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."}],"oa_version":"Preprint","external_id":{"arxiv":["1905.06642"]},"article_processing_charge":"No","author":[{"first_name":"Luigi","last_name":"Gresele","full_name":"Gresele, Luigi"},{"full_name":"Rubenstein, Paul K.","last_name":"Rubenstein","first_name":"Paul K."},{"last_name":"Mehrjou","full_name":"Mehrjou, Arash","first_name":"Arash"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"}],"title":"The incomplete Rosetta Stone problem: Identifiability results for multi-view nonlinear ICA","citation":{"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.","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.","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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"217-227","date_created":"2023-08-22T14:08:35Z","date_published":"2019-05-16T00:00:00Z","year":"2019","publication":"Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence","day":"16","oa":1,"publisher":"ML Research Press","quality_controlled":"1"},{"extern":"1","date_updated":"2023-09-12T09:37:22Z","department":[{"_id":"FrLo"}],"_id":"14197","status":"public","conference":{"start_date":"2019-12-08","location":"Vancouver, Canada","end_date":"2019-12-14","name":"NeurIPS: Neural Information Processing Systems"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781713807933"]},"volume":32,"oa_version":"Preprint","abstract":[{"text":"Recently there has been a significant interest in learning disentangled\r\nrepresentations, as they promise increased interpretability, generalization to\r\nunseen scenarios and faster learning on downstream tasks. In this paper, we\r\ninvestigate the usefulness of different notions of disentanglement for\r\nimproving the fairness of downstream prediction tasks based on representations.\r\nWe consider the setting where the goal is to predict a target variable based on\r\nthe learned representation of high-dimensional observations (such as images)\r\nthat depend on both the target variable and an \\emph{unobserved} sensitive\r\nvariable. We show that in this setting both the optimal and empirical\r\npredictions can be unfair, even if the target variable and the sensitive\r\nvariable are independent. Analyzing the representations of more than\r\n\\num{12600} trained state-of-the-art disentangled models, we observe that\r\nseveral disentanglement scores are consistently correlated with increased\r\nfairness, suggesting that disentanglement may be a useful property to encourage\r\nfairness when sensitive variables are not observed.","lang":"eng"}],"intvolume":" 32","month":"12","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.13662"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Locatello F, Abbati G, Rainforth T, Bauer S, Schölkopf B, Bachem O. 2019. On the fairness of disentangled representations. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 32, 14611–14624.","chicago":"Locatello, Francesco, Gabriele Abbati, Tom Rainforth, Stefan Bauer, Bernhard Schölkopf, and Olivier Bachem. “On the Fairness of Disentangled Representations.” In Advances in Neural Information Processing Systems, 32:14611–14624, 2019.","short":"F. Locatello, G. Abbati, T. Rainforth, S. Bauer, B. Schölkopf, O. Bachem, in:, Advances in Neural Information Processing Systems, 2019, pp. 14611–14624.","ieee":"F. Locatello, G. Abbati, T. Rainforth, S. Bauer, B. Schölkopf, and O. Bachem, “On the fairness of disentangled representations,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 14611–14624.","ama":"Locatello F, Abbati G, Rainforth T, Bauer S, Schölkopf B, Bachem O. On the fairness of disentangled representations. In: Advances in Neural Information Processing Systems. Vol 32. ; 2019:14611–14624.","apa":"Locatello, F., Abbati, G., Rainforth, T., Bauer, S., Schölkopf, B., & Bachem, O. (2019). On the fairness of disentangled representations. In Advances in Neural Information Processing Systems (Vol. 32, pp. 14611–14624). Vancouver, Canada.","mla":"Locatello, Francesco, et al. “On the Fairness of Disentangled Representations.” Advances in Neural Information Processing Systems, vol. 32, 2019, pp. 14611–14624."},"title":"On the fairness of disentangled representations","external_id":{"arxiv":["1905.13662"]},"article_processing_charge":"No","author":[{"last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"first_name":"Gabriele","full_name":"Abbati, Gabriele","last_name":"Abbati"},{"last_name":"Rainforth","full_name":"Rainforth, Tom","first_name":"Tom"},{"first_name":"Stefan","full_name":"Bauer, Stefan","last_name":"Bauer"},{"last_name":"Schölkopf","full_name":"Schölkopf, Bernhard","first_name":"Bernhard"},{"first_name":"Olivier","full_name":"Bachem, Olivier","last_name":"Bachem"}],"publication":"Advances in Neural Information Processing Systems","day":"08","year":"2019","date_created":"2023-08-22T14:12:28Z","date_published":"2019-12-08T00:00:00Z","page":"14611–14624","oa":1,"quality_controlled":"1"},{"oa":1,"quality_controlled":"1","year":"2019","publication":"Advances in Neural Information Processing Systems","day":"29","page":"14291–14301","date_created":"2023-08-22T14:09:35Z","date_published":"2019-12-29T00:00:00Z","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.","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.","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.","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.","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.","mla":"Locatello, Francesco, et al. “Stochastic Frank-Wolfe for Composite Convex Minimization.” Advances in Neural Information Processing Systems, vol. 32, 2019, pp. 14291–14301."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1901.10348"]},"article_processing_charge":"No","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Yurtsever, Alp","last_name":"Yurtsever","first_name":"Alp"},{"last_name":"Fercoq","full_name":"Fercoq, Olivier","first_name":"Olivier"},{"first_name":"Volkan","last_name":"Cevher","full_name":"Cevher, Volkan"}],"title":"Stochastic Frank-Wolfe for composite convex minimization","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."}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1901.10348","open_access":"1"}],"scopus_import":"1","intvolume":" 32","month":"12","publication_status":"published","publication_identifier":{"isbn":["9781713807933"]},"language":[{"iso":"eng"}],"volume":32,"_id":"14191","conference":{"start_date":"2019-12-08","location":"Vancouver, Canada","end_date":"2019-12-14","name":"NeurIPS: Neural Information Processing Systems"},"type":"conference","status":"public","date_updated":"2023-09-12T08:48:45Z","extern":"1","department":[{"_id":"FrLo"}]},{"_id":"14193","status":"public","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2019-12-14","location":"Vancouver, Canada","start_date":"2019-12-08"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Steenkiste, Sjoerd van, et al. “Are Disentangled Representations Helpful for Abstract Visual Reasoning?” 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.","short":"S. van Steenkiste, F. Locatello, J. Schmidhuber, O. Bachem, in:, Advances in Neural Information Processing Systems, 2019.","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.","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.","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.","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."},"date_updated":"2023-09-12T09:02:43Z","department":[{"_id":"FrLo"}],"title":"Are disentangled representations helpful for abstract visual reasoning?","article_processing_charge":"No","external_id":{"arxiv":["1905.12506"]},"author":[{"last_name":"Steenkiste","full_name":"Steenkiste, Sjoerd van","first_name":"Sjoerd van"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683"},{"first_name":"Jürgen","full_name":"Schmidhuber, Jürgen","last_name":"Schmidhuber"},{"first_name":"Olivier","full_name":"Bachem, Olivier","last_name":"Bachem"}],"oa_version":"Preprint","abstract":[{"lang":"eng","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."}],"intvolume":" 32","month":"05","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1905.12506"}],"quality_controlled":"1","publication":"Advances in Neural Information Processing Systems","language":[{"iso":"eng"}],"day":"29","year":"2019","publication_status":"published","publication_identifier":{"isbn":["9781713807933"]},"date_created":"2023-08-22T14:09:53Z","volume":32,"date_published":"2019-05-29T00:00:00Z"},{"volume":97,"language":[{"iso":"eng"}],"publication_status":"published","month":"06","intvolume":" 97","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1811.12359","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The key idea behind the unsupervised learning of disentangled representations\r\nis that real-world data is generated by a few explanatory factors of variation\r\nwhich can be recovered by unsupervised learning algorithms. In this paper, we\r\nprovide a sober look at recent progress in the field and challenge some common\r\nassumptions. We first theoretically show that the unsupervised learning of\r\ndisentangled representations is fundamentally impossible without inductive\r\nbiases on both the models and the data. Then, we train more than 12000 models\r\ncovering most prominent methods and evaluation metrics in a reproducible\r\nlarge-scale experimental study on seven different data sets. We observe that\r\nwhile the different methods successfully enforce properties ``encouraged'' by\r\nthe corresponding losses, well-disentangled models seemingly cannot be\r\nidentified without supervision. Furthermore, increased disentanglement does not\r\nseem to lead to a decreased sample complexity of learning for downstream tasks.\r\nOur results suggest that future work on disentanglement learning should be\r\nexplicit about the role of inductive biases and (implicit) supervision,\r\ninvestigate concrete benefits of enforcing disentanglement of the learned\r\nrepresentations, and consider a reproducible experimental setup covering\r\nseveral data sets."}],"department":[{"_id":"FrLo"}],"extern":"1","date_updated":"2023-09-13T07:45:30Z","status":"public","type":"conference","conference":{"name":"International Conference on Machine Learning","location":"Long Beach, CA, United States","end_date":"2019-06-15","start_date":"2019-06-10"},"_id":"14200","date_published":"2019-06-09T00:00:00Z","date_created":"2023-08-22T14:13:08Z","page":"4114-4124","day":"09","publication":"Proceedings of the 36th International Conference on Machine Learning","year":"2019","quality_controlled":"1","publisher":"ML Research Press","oa":1,"title":"Challenging common assumptions in the unsupervised learning of disentangled representations","author":[{"last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Bauer, Stefan","last_name":"Bauer","first_name":"Stefan"},{"last_name":"Lucic","full_name":"Lucic, Mario","first_name":"Mario"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"},{"first_name":"Sylvain","last_name":"Gelly","full_name":"Gelly, Sylvain"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"first_name":"Olivier","full_name":"Bachem, Olivier","last_name":"Bachem"}],"article_processing_charge":"No","external_id":{"arxiv":["1811.12359"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations.” In Proceedings of the 36th International Conference on Machine Learning, 97:4114–24. ML Research Press, 2019.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2019. Challenging common assumptions in the unsupervised learning of disentangled representations. Proceedings of the 36th International Conference on Machine Learning. International Conference on Machine Learning vol. 97, 4114–4124.","mla":"Locatello, Francesco, et al. “Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations.” Proceedings of the 36th International Conference on Machine Learning, vol. 97, ML Research Press, 2019, pp. 4114–24.","ama":"Locatello F, Bauer S, Lucic M, et al. Challenging common assumptions in the unsupervised learning of disentangled representations. In: Proceedings of the 36th International Conference on Machine Learning. Vol 97. ML Research Press; 2019:4114-4124.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2019). Challenging common assumptions in the unsupervised learning of disentangled representations. In Proceedings of the 36th International Conference on Machine Learning (Vol. 97, pp. 4114–4124). Long Beach, CA, United States: ML Research Press.","ieee":"F. Locatello et al., “Challenging common assumptions in the unsupervised learning of disentangled representations,” in Proceedings of the 36th International Conference on Machine Learning, Long Beach, CA, United States, 2019, vol. 97, pp. 4114–4124.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, in:, Proceedings of the 36th International Conference on Machine Learning, ML Research Press, 2019, pp. 4114–4124."}},{"status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"article_type":"original","type":"journal_article","_id":"5817","file_date_updated":"2020-10-09T11:00:05Z","department":[{"_id":"GaTk"}],"ddc":["530"],"date_updated":"2023-09-13T08:47:16Z","intvolume":" 15","month":"01","scopus_import":"1","oa_version":"Submitted Version","pmid":1,"abstract":[{"text":"We theoretically study the shapes of lipid vesicles confined to a spherical cavity, elaborating a framework based on the so-called limiting shapes constructed from geometrically simple structural elements such as double-membrane walls and edges. Partly inspired by numerical results, the proposed non-compartmentalized and compartmentalized limiting shapes are arranged in the bilayer-couple phase diagram which is then compared to its free-vesicle counterpart. We also compute the area-difference-elasticity phase diagram of the limiting shapes and we use it to interpret shape transitions experimentally observed in vesicles confined within another vesicle. The limiting-shape framework may be generalized to theoretically investigate the structure of certain cell organelles such as the mitochondrion.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","issue":"4","volume":15,"language":[{"iso":"eng"}],"file":[{"creator":"bkavcic","date_updated":"2020-10-09T11:00:05Z","file_size":5370762,"date_created":"2020-10-09T11:00:05Z","file_name":"lmt_sftmtr_V8.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"614c337d6424ccd3d48d1b1f9513510d","file_id":"8641","success":1}],"publication_status":"published","publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"title":"Limiting shapes of confined lipid vesicles","external_id":{"pmid":["30629082"],"isi":["000457329700003"]},"article_processing_charge":"No","author":[{"full_name":"Kavcic, Bor","orcid":"0000-0001-6041-254X","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","first_name":"Bor"},{"first_name":"A.","full_name":"Sakashita, A.","last_name":"Sakashita"},{"full_name":"Noguchi, H.","last_name":"Noguchi","first_name":"H."},{"first_name":"P.","last_name":"Ziherl","full_name":"Ziherl, P."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Kavcic B, Sakashita A, Noguchi H, Ziherl P. Limiting shapes of confined lipid vesicles. Soft Matter. 2019;15(4):602-614. doi:10.1039/c8sm01956h","apa":"Kavcic, B., Sakashita, A., Noguchi, H., & Ziherl, P. (2019). Limiting shapes of confined lipid vesicles. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/c8sm01956h","short":"B. Kavcic, A. Sakashita, H. Noguchi, P. Ziherl, Soft Matter 15 (2019) 602–614.","ieee":"B. Kavcic, A. Sakashita, H. Noguchi, and P. Ziherl, “Limiting shapes of confined lipid vesicles,” Soft Matter, vol. 15, no. 4. Royal Society of Chemistry, pp. 602–614, 2019.","mla":"Kavcic, Bor, et al. “Limiting Shapes of Confined Lipid Vesicles.” Soft Matter, vol. 15, no. 4, Royal Society of Chemistry, 2019, pp. 602–14, doi:10.1039/c8sm01956h.","ista":"Kavcic B, Sakashita A, Noguchi H, Ziherl P. 2019. Limiting shapes of confined lipid vesicles. Soft Matter. 15(4), 602–614.","chicago":"Kavcic, Bor, A. Sakashita, H. Noguchi, and P. Ziherl. “Limiting Shapes of Confined Lipid Vesicles.” Soft Matter. Royal Society of Chemistry, 2019. https://doi.org/10.1039/c8sm01956h."},"oa":1,"publisher":"Royal Society of Chemistry","quality_controlled":"1","date_created":"2019-01-11T07:37:47Z","date_published":"2019-01-10T00:00:00Z","doi":"10.1039/c8sm01956h","page":"602-614","publication":"Soft Matter","day":"10","year":"2019","isi":1,"has_accepted_license":"1"},{"file_date_updated":"2020-07-14T12:47:55Z","department":[{"_id":"JaMa"}],"date_updated":"2023-09-13T09:12:35Z","ddc":["510"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"73","ec_funded":1,"volume":58,"issue":"1","publication_status":"published","publication_identifier":{"issn":["09442669"]},"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":645565,"date_updated":"2020-07-14T12:47:55Z","file_name":"2018_Calculus_Erbar.pdf","date_created":"2019-01-28T15:37:11Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5895","checksum":"ba05ac2d69de4c58d2cd338b63512798"}],"scopus_import":"1","intvolume":" 58","month":"02","abstract":[{"text":"We consider the space of probability measures on a discrete set X, endowed with a dynamical optimal transport metric. Given two probability measures supported in a subset Y⊆X, it is natural to ask whether they can be connected by a constant speed geodesic with support in Y at all times. Our main result answers this question affirmatively, under a suitable geometric condition on Y introduced in this paper. The proof relies on an extension result for subsolutions to discrete Hamilton-Jacobi equations, which is of independent interest.","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000452849400001"],"arxiv":["1805.06040"]},"author":[{"full_name":"Erbar, Matthias","last_name":"Erbar","first_name":"Matthias"},{"last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wirth, Melchior","last_name":"Wirth","first_name":"Melchior"}],"title":"On the geometry of geodesics in discrete optimal transport","citation":{"chicago":"Erbar, Matthias, Jan Maas, and Melchior Wirth. “On the Geometry of Geodesics in Discrete Optimal Transport.” Calculus of Variations and Partial Differential Equations. Springer, 2019. https://doi.org/10.1007/s00526-018-1456-1.","ista":"Erbar M, Maas J, Wirth M. 2019. On the geometry of geodesics in discrete optimal transport. Calculus of Variations and Partial Differential Equations. 58(1), 19.","mla":"Erbar, Matthias, et al. “On the Geometry of Geodesics in Discrete Optimal Transport.” Calculus of Variations and Partial Differential Equations, vol. 58, no. 1, 19, Springer, 2019, doi:10.1007/s00526-018-1456-1.","ieee":"M. Erbar, J. Maas, and M. Wirth, “On the geometry of geodesics in discrete optimal transport,” Calculus of Variations and Partial Differential Equations, vol. 58, no. 1. Springer, 2019.","short":"M. Erbar, J. Maas, M. Wirth, Calculus of Variations and Partial Differential Equations 58 (2019).","ama":"Erbar M, Maas J, Wirth M. On the geometry of geodesics in discrete optimal transport. Calculus of Variations and Partial Differential Equations. 2019;58(1). doi:10.1007/s00526-018-1456-1","apa":"Erbar, M., Maas, J., & Wirth, M. (2019). On the geometry of geodesics in discrete optimal transport. Calculus of Variations and Partial Differential Equations. Springer. https://doi.org/10.1007/s00526-018-1456-1"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"name":"Taming Complexity in Partial Di erential Systems","grant_number":" F06504","_id":"260482E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"article_number":"19","date_created":"2018-12-11T11:44:29Z","date_published":"2019-02-01T00:00:00Z","doi":"10.1007/s00526-018-1456-1","year":"2019","isi":1,"has_accepted_license":"1","publication":"Calculus of Variations and Partial Differential Equations","day":"01","oa":1,"quality_controlled":"1","publisher":"Springer"},{"date_updated":"2023-09-13T09:46:38Z","citation":{"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.","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.","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.","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.","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.","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.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","extern":"1","article_processing_charge":"No","external_id":{"arxiv":["1906.03292"]},"author":[{"first_name":"Muhammad Waleed","full_name":"Gondal, Muhammad Waleed","last_name":"Gondal"},{"last_name":"Wüthrich","full_name":"Wüthrich, Manuel","first_name":"Manuel"},{"first_name":"Đorđe","full_name":"Miladinović, Đorđe","last_name":"Miladinović"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"},{"first_name":"Martin","full_name":"Breidt, Martin","last_name":"Breidt"},{"first_name":"Valentin","last_name":"Volchkov","full_name":"Volchkov, Valentin"},{"first_name":"Joel","full_name":"Akpo, Joel","last_name":"Akpo"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"last_name":"Bauer","full_name":"Bauer, Stefan","first_name":"Stefan"}],"title":"On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset","department":[{"_id":"FrLo"}],"_id":"14190","conference":{"start_date":"2019-12-08","location":"Vancouver, Canada","end_date":"2019-12-14","name":"NeurIPS: Neural Information Processing Systems"},"type":"conference","status":"public","year":"2019","publication_status":"published","publication_identifier":{"isbn":["9781713807933"]},"language":[{"iso":"eng"}],"publication":"Advances in Neural Information Processing Systems","day":"07","date_created":"2023-08-22T14:09:13Z","volume":32,"date_published":"2019-06-07T00:00:00Z","abstract":[{"lang":"eng","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."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1906.03292"}],"oa":1,"quality_controlled":"1","intvolume":" 32","month":"06"},{"issue":"4","related_material":{"record":[{"relation":"earlier_version","id":"309","status":"public"}]},"volume":15,"language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 15","month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1709.09209","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","abstract":[{"text":"We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding ϕ : G → M of a graph G into a 2-manifold M maps the vertices in V(G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to the same point or overlapping arcs due to data compression or low resolution. This raises the computational problem of deciding whether a given map ϕ : G → M comes from an embedding. A map ϕ : G → M is a weak embedding if it can be perturbed into an embedding ψ ϵ : G → M with ‖ ϕ − ψ ϵ ‖ < ϵ for every ϵ > 0, where ‖.‖ is the unform norm.\r\nA polynomial-time algorithm for recognizing weak embeddings has recently been found by Fulek and Kynčl. It reduces the problem to solving a system of linear equations over Z2. It runs in O(n2ω)≤ O(n4.75) time, where ω ∈ [2,2.373) is the matrix multiplication exponent and n is the number of vertices and edges of G. We improve the running time to O(n log n). Our algorithm is also conceptually simpler: We perform a sequence of local operations that gradually “untangles” the image ϕ(G) into an embedding ψ(G) or reports that ϕ is not a weak embedding. It combines local constraints on the orientation of subgraphs directly, thereby eliminating the need for solving large systems of linear equations.\r\n","lang":"eng"}],"department":[{"_id":"UlWa"}],"date_updated":"2023-09-15T12:19:31Z","status":"public","article_type":"original","type":"journal_article","_id":"6982","date_created":"2019-11-04T15:45:17Z","date_published":"2019-10-01T00:00:00Z","doi":"10.1145/3344549","publication":"ACM Transactions on Algorithms","day":"01","year":"2019","oa":1,"quality_controlled":"1","publisher":"ACM","title":"Recognizing weak embeddings of graphs","external_id":{"arxiv":["1709.09209"]},"author":[{"full_name":"Akitaya, Hugo","last_name":"Akitaya","first_name":"Hugo"},{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774"},{"full_name":"Tóth, Csaba","last_name":"Tóth","first_name":"Csaba"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Akitaya, Hugo, et al. “Recognizing Weak Embeddings of Graphs.” ACM Transactions on Algorithms, vol. 15, no. 4, 50, ACM, 2019, doi:10.1145/3344549.","ama":"Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 2019;15(4). doi:10.1145/3344549","apa":"Akitaya, H., Fulek, R., & Tóth, C. (2019). Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3344549","ieee":"H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” ACM Transactions on Algorithms, vol. 15, no. 4. ACM, 2019.","short":"H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019).","chicago":"Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs.” ACM Transactions on Algorithms. ACM, 2019. https://doi.org/10.1145/3344549.","ista":"Akitaya H, Fulek R, Tóth C. 2019. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 15(4), 50."},"project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs"}],"article_number":"50"},{"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"eissn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"6916","checksum":"773beaf4a85dc2acc2c12b578fbe1965","creator":"mgiacobbe","date_updated":"2020-07-14T12:47:43Z","file_size":4100685,"date_created":"2019-09-27T14:15:05Z","file_name":"giacobbe_thesis.pdf"},{"creator":"mgiacobbe","file_size":7959732,"date_updated":"2020-07-14T12:47:43Z","file_name":"giacobbe_thesis_src.tar.gz","date_created":"2019-09-27T14:22:04Z","relation":"source_file","access_level":"closed","content_type":"application/gzip","file_id":"6917","checksum":"97f1c3da71feefd27e6e625d32b4c75b"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"631","status":"public"},{"relation":"part_of_dissertation","id":"647","status":"public"},{"status":"public","id":"140","relation":"part_of_dissertation"}]},"abstract":[{"text":"Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving.\r\nNevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions.\r\nWhile, previously, directions were given by the user, we introduce (1) the first method\r\nfor computing template directions from spurious counterexamples, so as to generalize and\r\neliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid\r\nautomata with (possibly non-linear) convex constraints on derivatives only, while for linear\r\nODE requires further abstraction. Specifically, we introduce (2) the conic abstractions,\r\nwhich, partitioning the state space into appropriate (possibly non-uniform) cones, divide\r\ncurvy trajectories into relatively straight sections, suitable for polyhedral abstractions.\r\nFinally, we introduce (3) space-time interpolation, which, combining interval arithmetic\r\nand template refinement, computes appropriate (possibly non-uniform) time partitioning\r\nand template directions along spurious trajectories, so as to eliminate them.\r\nWe obtain sound and automatic methods for the reachability analysis over dense\r\nand unbounded time of convex hybrid automata and hybrid automata with linear ODE.\r\nWe build prototype tools and compare—favorably—our methods against the respective\r\nstate-of-the-art tools, on several benchmarks.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"09","date_updated":"2023-09-19T09:30:43Z","supervisor":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"ToHe"}],"_id":"6894","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","status":"public","year":"2019","has_accepted_license":"1","day":"30","page":"132","date_created":"2019-09-22T14:08:44Z","date_published":"2019-09-30T00:00:00Z","doi":"10.15479/AT:ISTA:6894","oa":1,"publisher":"Institute of Science and Technology Austria","citation":{"mla":"Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.","ama":"Giacobbe M. Automatic time-unbounded reachability analysis of hybrid systems. 2019. doi:10.15479/AT:ISTA:6894","apa":"Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6894","short":"M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems, Institute of Science and Technology Austria, 2019.","ieee":"M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,” Institute of Science and Technology Austria, 2019.","chicago":"Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid Systems.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6894.","ista":"Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"last_name":"Giacobbe","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"}],"title":"Automatic time-unbounded reachability analysis of hybrid systems"},{"type":"research_data_reference","status":"public","_id":"9805","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","department":[{"_id":"NiBa"}],"title":"Data from: The consequences of an introgression event","citation":{"mla":"Barton, Nicholas H. Data from: The Consequences of an Introgression Event. Dryad, 2019, doi:10.5061/dryad.2kb6fh4.","short":"N.H. Barton, (2019).","ieee":"N. H. Barton, “Data from: The consequences of an introgression event.” Dryad, 2019.","ama":"Barton NH. Data from: The consequences of an introgression event. 2019. doi:10.5061/dryad.2kb6fh4","apa":"Barton, N. H. (2019). Data from: The consequences of an introgression event. Dryad. https://doi.org/10.5061/dryad.2kb6fh4","chicago":"Barton, Nicholas H. “Data from: The Consequences of an Introgression Event.” Dryad, 2019. https://doi.org/10.5061/dryad.2kb6fh4.","ista":"Barton NH. 2019. Data from: The consequences of an introgression event, Dryad, 10.5061/dryad.2kb6fh4."},"date_updated":"2023-09-19T10:06:07Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publisher":"Dryad","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.2kb6fh4"}],"oa":1,"month":"01","abstract":[{"text":"The spread of adaptive alleles is fundamental to evolution, and in theory, this process is well‐understood. However, only rarely can we follow this process—whether it originates from the spread of a new mutation, or by introgression from another population. In this issue of Molecular Ecology, Hanemaaijer et al. (2018) report on a 25‐year long study of the mosquitoes Anopheles gambiae (Figure 1) and Anopheles coluzzi in Mali, based on genotypes at 15 single‐nucleotide polymorphism (SNP). The species are usually reproductively isolated from each other, but in 2002 and 2006, bursts of hybridization were observed, when F1 hybrids became abundant. Alleles backcrossed from A. gambiae into A. coluzzi, but after the first event, these declined over the following years. In contrast, after 2006, an insecticide resistance allele that had established in A. gambiae spread into A. coluzzi, and rose to high frequency there, over 6 years (~75 generations). Whole genome sequences of 74 individuals showed that A. gambiae SNP from across the genome had become common in the A. coluzzi population, but that most of these were clustered in 34 genes around the resistance locus. A new set of SNP from 25 of these genes were assayed over time; over the 4 years since near‐fixation of the resistance allele; some remained common, whereas others declined. What do these patterns tell us about this introgression event?","lang":"eng"}],"oa_version":"Published Version","date_published":"2019-01-09T00:00:00Z","related_material":{"record":[{"status":"public","id":"40","relation":"used_in_publication"}]},"doi":"10.5061/dryad.2kb6fh4","date_created":"2021-08-06T12:03:50Z","year":"2019","day":"09"}]