--- _id: '14197' abstract: - lang: eng 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." article_processing_charge: No author: - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Gabriele full_name: Abbati, Gabriele last_name: Abbati - first_name: Tom full_name: Rainforth, Tom last_name: Rainforth - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem citation: 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. 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. 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. 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.' mla: Locatello, Francesco, et al. “On the Fairness of Disentangled Representations.” Advances in Neural Information Processing Systems, vol. 32, 2019, pp. 14611–14624. 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. conference: end_date: 2019-12-14 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2019-12-08 date_created: 2023-08-22T14:12:28Z date_published: 2019-12-08T00:00:00Z date_updated: 2023-09-12T09:37:22Z day: '08' department: - _id: FrLo extern: '1' external_id: arxiv: - '1905.13662' intvolume: ' 32' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.13662 month: '12' oa: 1 oa_version: Preprint page: 14611–14624 publication: Advances in Neural Information Processing Systems publication_identifier: isbn: - '9781713807933' publication_status: published quality_controlled: '1' scopus_import: '1' status: public title: On the fairness of disentangled representations type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2019' ... --- _id: '14191' 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. article_processing_charge: No author: - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Alp full_name: Yurtsever, Alp last_name: Yurtsever - first_name: Olivier full_name: Fercoq, Olivier last_name: Fercoq - first_name: Volkan full_name: Cevher, Volkan last_name: Cevher citation: 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. 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. 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. 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.' mla: Locatello, Francesco, et al. “Stochastic Frank-Wolfe for Composite Convex Minimization.” Advances in Neural Information Processing Systems, vol. 32, 2019, pp. 14291–14301. short: F. Locatello, A. Yurtsever, O. Fercoq, V. Cevher, in:, Advances in Neural Information Processing Systems, 2019, pp. 14291–14301. conference: end_date: 2019-12-14 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2019-12-08 date_created: 2023-08-22T14:09:35Z date_published: 2019-12-29T00:00:00Z date_updated: 2023-09-12T08:48:45Z day: '29' department: - _id: FrLo extern: '1' external_id: arxiv: - '1901.10348' intvolume: ' 32' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1901.10348 month: '12' oa: 1 oa_version: Preprint page: 14291–14301 publication: Advances in Neural Information Processing Systems publication_identifier: isbn: - '9781713807933' publication_status: published quality_controlled: '1' scopus_import: '1' status: public title: Stochastic Frank-Wolfe for composite convex minimization type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2019' ... --- _id: '14193' 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." article_processing_charge: No author: - first_name: Sjoerd van full_name: Steenkiste, Sjoerd van last_name: Steenkiste - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello 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 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.' 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. 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.' mla: Steenkiste, Sjoerd van, et al. “Are Disentangled Representations Helpful for Abstract Visual Reasoning?” Advances in Neural Information Processing Systems, vol. 32, 2019. short: S. van Steenkiste, F. Locatello, J. Schmidhuber, O. Bachem, in:, Advances in Neural Information Processing Systems, 2019. conference: end_date: 2019-12-14 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2019-12-08 date_created: 2023-08-22T14:09:53Z date_published: 2019-05-29T00:00:00Z date_updated: 2023-09-12T09:02:43Z day: '29' department: - _id: FrLo extern: '1' external_id: arxiv: - '1905.12506' intvolume: ' 32' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1905.12506 month: '05' oa: 1 oa_version: Preprint publication: Advances in Neural Information Processing Systems publication_identifier: isbn: - '9781713807933' publication_status: published quality_controlled: '1' status: public title: Are disentangled representations helpful for abstract visual reasoning? type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2019' ... --- _id: '14200' 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." article_processing_charge: No author: - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer - first_name: Mario full_name: Lucic, Mario last_name: Lucic - first_name: Gunnar full_name: Rätsch, Gunnar last_name: Rätsch - first_name: Sylvain full_name: Gelly, Sylvain last_name: Gelly - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem citation: 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.' 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. 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. 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. 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. conference: end_date: 2019-06-15 location: Long Beach, CA, United States name: International Conference on Machine Learning start_date: 2019-06-10 date_created: 2023-08-22T14:13:08Z date_published: 2019-06-09T00:00:00Z date_updated: 2023-09-13T07:45:30Z day: '09' department: - _id: FrLo extern: '1' external_id: arxiv: - '1811.12359' intvolume: ' 97' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1811.12359 month: '06' oa: 1 oa_version: Preprint page: 4114-4124 publication: Proceedings of the 36th International Conference on Machine Learning publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Challenging common assumptions in the unsupervised learning of disentangled representations type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 97 year: '2019' ... --- _id: '5817' abstract: - lang: eng 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. article_processing_charge: No article_type: original author: - first_name: Bor full_name: Kavcic, Bor id: 350F91D2-F248-11E8-B48F-1D18A9856A87 last_name: Kavcic orcid: 0000-0001-6041-254X - first_name: A. full_name: Sakashita, A. last_name: Sakashita - first_name: H. full_name: Noguchi, H. last_name: Noguchi - first_name: P. full_name: Ziherl, P. last_name: Ziherl 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 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. 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. ista: Kavcic B, Sakashita A, Noguchi H, Ziherl P. 2019. Limiting shapes of confined lipid vesicles. Soft Matter. 15(4), 602–614. 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. short: B. Kavcic, A. Sakashita, H. Noguchi, P. Ziherl, Soft Matter 15 (2019) 602–614. date_created: 2019-01-11T07:37:47Z date_published: 2019-01-10T00:00:00Z date_updated: 2023-09-13T08:47:16Z day: '10' ddc: - '530' department: - _id: GaTk doi: 10.1039/c8sm01956h external_id: isi: - '000457329700003' pmid: - '30629082' file: - access_level: open_access checksum: 614c337d6424ccd3d48d1b1f9513510d content_type: application/pdf creator: bkavcic date_created: 2020-10-09T11:00:05Z date_updated: 2020-10-09T11:00:05Z file_id: '8641' file_name: lmt_sftmtr_V8.pdf file_size: 5370762 relation: main_file success: 1 file_date_updated: 2020-10-09T11:00:05Z has_accepted_license: '1' intvolume: ' 15' isi: 1 issue: '4' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/3.0/ month: '01' oa: 1 oa_version: Submitted Version page: 602-614 pmid: 1 publication: Soft Matter publication_identifier: eissn: - 1744-6848 issn: - 1744-683X publication_status: published publisher: Royal Society of Chemistry quality_controlled: '1' scopus_import: '1' status: public title: Limiting shapes of confined lipid vesicles tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 15 year: '2019' ... --- _id: '73' abstract: - lang: eng 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. article_number: '19' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Matthias full_name: Erbar, Matthias last_name: Erbar - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Melchior full_name: Wirth, Melchior last_name: Wirth citation: 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 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. 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. 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. short: M. Erbar, J. Maas, M. Wirth, Calculus of Variations and Partial Differential Equations 58 (2019). date_created: 2018-12-11T11:44:29Z date_published: 2019-02-01T00:00:00Z date_updated: 2023-09-13T09:12:35Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1007/s00526-018-1456-1 ec_funded: 1 external_id: arxiv: - '1805.06040' isi: - '000452849400001' file: - access_level: open_access checksum: ba05ac2d69de4c58d2cd338b63512798 content_type: application/pdf creator: dernst date_created: 2019-01-28T15:37:11Z date_updated: 2020-07-14T12:47:55Z file_id: '5895' file_name: 2018_Calculus_Erbar.pdf file_size: 645565 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 58' isi: 1 issue: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: 260482E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: ' F06504' name: Taming Complexity in Partial Di erential Systems - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Calculus of Variations and Partial Differential Equations publication_identifier: issn: - '09442669' publication_status: published publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: On the geometry of geodesics in discrete optimal transport tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 58 year: '2019' ... --- _id: '14190' 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." article_processing_charge: No author: - first_name: Muhammad Waleed full_name: Gondal, Muhammad Waleed last_name: Gondal - first_name: Manuel full_name: Wüthrich, Manuel last_name: Wüthrich - first_name: Đorđe full_name: Miladinović, Đorđe last_name: Miladinović - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Martin full_name: Breidt, Martin last_name: Breidt - first_name: Valentin full_name: Volchkov, Valentin last_name: Volchkov - first_name: Joel full_name: Akpo, Joel last_name: Akpo - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer citation: 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.' 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.' 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.' 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.' 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.' 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. conference: end_date: 2019-12-14 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2019-12-08 date_created: 2023-08-22T14:09:13Z date_published: 2019-06-07T00:00:00Z date_updated: 2023-09-13T09:46:38Z day: '07' department: - _id: FrLo extern: '1' external_id: arxiv: - '1906.03292' intvolume: ' 32' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1906.03292 month: '06' oa: 1 oa_version: Preprint publication: Advances in Neural Information Processing Systems publication_identifier: isbn: - '9781713807933' publication_status: published quality_controlled: '1' status: public title: 'On the transfer of inductive bias from simulation to the real world: a new disentanglement dataset' type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 32 year: '2019' ... --- _id: '6982' abstract: - lang: eng 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" article_number: '50' article_type: original author: - first_name: Hugo full_name: Akitaya, Hugo last_name: Akitaya - first_name: Radoslav full_name: Fulek, Radoslav id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87 last_name: Fulek orcid: 0000-0001-8485-1774 - first_name: Csaba full_name: Tóth, Csaba last_name: Tóth citation: 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 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. ieee: H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” ACM Transactions on Algorithms, vol. 15, no. 4. ACM, 2019. ista: Akitaya H, Fulek R, Tóth C. 2019. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 15(4), 50. 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. short: H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019). date_created: 2019-11-04T15:45:17Z date_published: 2019-10-01T00:00:00Z date_updated: 2023-09-15T12:19:31Z day: '01' department: - _id: UlWa doi: 10.1145/3344549 external_id: arxiv: - '1709.09209' intvolume: ' 15' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1709.09209 month: '10' oa: 1 oa_version: Preprint project: - _id: 261FA626-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02281 name: Eliminating intersections in drawings of graphs publication: ACM Transactions on Algorithms publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '309' relation: earlier_version status: public scopus_import: 1 status: public title: Recognizing weak embeddings of graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2019' ... --- _id: '6894' abstract: - lang: eng 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Mirco full_name: Giacobbe, Mirco id: 3444EA5E-F248-11E8-B48F-1D18A9856A87 last_name: Giacobbe orcid: 0000-0001-8180-0904 citation: 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 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. ieee: M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,” Institute of Science and Technology Austria, 2019. ista: Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria. mla: Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894. short: M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems, Institute of Science and Technology Austria, 2019. date_created: 2019-09-22T14:08:44Z date_published: 2019-09-30T00:00:00Z date_updated: 2023-09-19T09:30:43Z day: '30' ddc: - '000' degree_awarded: PhD department: - _id: ToHe doi: 10.15479/AT:ISTA:6894 file: - access_level: open_access checksum: 773beaf4a85dc2acc2c12b578fbe1965 content_type: application/pdf creator: mgiacobbe date_created: 2019-09-27T14:15:05Z date_updated: 2020-07-14T12:47:43Z file_id: '6916' file_name: giacobbe_thesis.pdf file_size: 4100685 relation: main_file - access_level: closed checksum: 97f1c3da71feefd27e6e625d32b4c75b content_type: application/gzip creator: mgiacobbe date_created: 2019-09-27T14:22:04Z date_updated: 2020-07-14T12:47:43Z file_id: '6917' file_name: giacobbe_thesis_src.tar.gz file_size: 7959732 relation: source_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '132' publication_identifier: eissn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '631' relation: part_of_dissertation status: public - id: '647' relation: part_of_dissertation status: public - id: '140' relation: part_of_dissertation status: public status: public supervisor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 title: Automatic time-unbounded reachability analysis of hybrid systems tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '9805' abstract: - lang: eng 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? article_processing_charge: No author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: 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.' ieee: 'N. H. Barton, “Data from: The consequences of an introgression event.” Dryad, 2019.' ista: 'Barton NH. 2019. Data from: The consequences of an introgression event, Dryad, 10.5061/dryad.2kb6fh4.' mla: 'Barton, Nicholas H. Data from: The Consequences of an Introgression Event. Dryad, 2019, doi:10.5061/dryad.2kb6fh4.' short: N.H. Barton, (2019). date_created: 2021-08-06T12:03:50Z date_published: 2019-01-09T00:00:00Z date_updated: 2023-09-19T10:06:07Z day: '09' department: - _id: NiBa doi: 10.5061/dryad.2kb6fh4 main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.2kb6fh4 month: '01' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '40' relation: used_in_publication status: public status: public title: 'Data from: The consequences of an introgression event' type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2019' ...