[{"type":"journal_article","abstract":[{"text":"Hartree–Fock theory has been justified as a mean-field approximation for fermionic systems. However, it suffers from some defects in predicting physical properties, making necessary a theory of quantum correlations. Recently, bosonization of many-body correlations has been rigorously justified as an upper bound on the correlation energy at high density with weak interactions. We review the bosonic approximation, deriving an effective Hamiltonian. We then show that for systems with Coulomb interaction this effective theory predicts collective excitations (plasmons) in accordance with the random phase approximation of Bohm and Pines, and with experimental observation.","lang":"eng"}],"issue":"1","title":"Bosonic collective excitations in Fermi gases","status":"public","intvolume":" 33","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7900","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","publication":"Reviews in Mathematical Physics","citation":{"short":"N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).","mla":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews in Mathematical Physics, vol. 33, no. 1, 2060009, World Scientific, 2021, doi:10.1142/s0129055x20600090.","chicago":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews in Mathematical Physics. World Scientific, 2021. https://doi.org/10.1142/s0129055x20600090.","ama":"Benedikter NP. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 2021;33(1). doi:10.1142/s0129055x20600090","ieee":"N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” Reviews in Mathematical Physics, vol. 33, no. 1. World Scientific, 2021.","apa":"Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. World Scientific. https://doi.org/10.1142/s0129055x20600090","ista":"Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 33(1), 2060009."},"date_published":"2021-01-01T00:00:00Z","article_number":"2060009","ec_funded":1,"publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"World Scientific","year":"2021","date_updated":"2023-09-05T16:07:40Z","date_created":"2020-05-28T16:47:55Z","volume":33,"author":[{"full_name":"Benedikter, Niels P","last_name":"Benedikter","first_name":"Niels P","orcid":"0000-0002-1071-6091","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87"}],"month":"01","publication_identifier":{"eissn":["1793-6659"],"issn":["0129-055X"]},"isi":1,"quality_controlled":"1","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"oa":1,"external_id":{"isi":["000613313200010"],"arxiv":["1910.08190"]},"main_file_link":[{"url":"https://arxiv.org/abs/1910.08190","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1142/s0129055x20600090"},{"language":[{"iso":"eng"}],"doi":"10.1142/s0129055x20600120","project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.12509"}],"oa":1,"external_id":{"arxiv":["1912.12509"],"isi":["000613313200013"]},"publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"month":"02","volume":33,"date_updated":"2023-09-05T16:08:02Z","date_created":"2022-03-18T08:11:34Z","author":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"publisher":"World Scientific Publishing","department":[{"_id":"RoSe"}],"publication_status":"published","acknowledgement":"This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227).","year":"2021","ec_funded":1,"article_number":"2060012","date_published":"2021-02-01T00:00:00Z","article_type":"original","citation":{"ama":"Seiringer R. The polaron at strong coupling. Reviews in Mathematical Physics. 2021;33(01). doi:10.1142/s0129055x20600120","ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","ieee":"R. Seiringer, “The polaron at strong coupling,” Reviews in Mathematical Physics, vol. 33, no. 01. World Scientific Publishing, 2021.","apa":"Seiringer, R. (2021). The polaron at strong coupling. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x20600120","mla":"Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical Physics, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:10.1142/s0129055x20600120.","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021).","chicago":"Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical Physics. World Scientific Publishing, 2021. https://doi.org/10.1142/s0129055x20600120."},"publication":"Reviews in Mathematical Physics","article_processing_charge":"No","day":"01","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"scopus_import":"1","oa_version":"Preprint","intvolume":" 33","title":"The polaron at strong coupling","status":"public","_id":"10852","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"01","abstract":[{"text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass.","lang":"eng"}],"type":"journal_article"},{"degree_awarded":"PhD","supervisor":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:9056","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"02","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2023-09-07T13:29:01Z","date_created":"2021-02-02T14:11:06Z","author":[{"orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","first_name":"Georg F","full_name":"Osang, Georg F"}],"related_material":{"record":[{"id":"187","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"8703"}]},"publication_status":"published","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","year":"2021","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2021-02-03T10:37:28Z","place":"Klosterneuburg","date_published":"2021-02-01T00:00:00Z","page":"134","citation":{"ieee":"G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.","apa":"Osang, G. F. (2021). Multi-cover persistence and Delaunay mosaics. Institute of Science and Technology Austria, Klosterneuburg. https://doi.org/10.15479/AT:ISTA:9056","ista":"Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.","ama":"Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056","chicago":"Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9056.","short":"G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021.","mla":"Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","oa_version":"Published Version","file":[{"content_type":"application/zip","file_size":13446994,"creator":"patrickd","file_name":"thesis_source.zip","access_level":"closed","date_created":"2021-02-02T14:09:25Z","date_updated":"2021-02-03T10:37:28Z","checksum":"bcf27986147cab0533b6abadd74e7629","relation":"source_file","file_id":"9063"},{"access_level":"open_access","file_name":"thesis_pdfA2b.pdf","creator":"patrickd","file_size":5210329,"content_type":"application/pdf","file_id":"9064","relation":"main_file","success":1,"checksum":"9cc8af266579a464385bbe2aff6af606","date_created":"2021-02-02T14:09:18Z","date_updated":"2021-02-02T14:09:18Z"}],"title":"Multi-cover persistence and Delaunay mosaics","status":"public","ddc":["006","514","516"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9056","abstract":[{"text":"In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation"},{"month":"01","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:9022","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"oa":1,"file_date_updated":"2021-01-25T14:19:10Z","ec_funded":1,"date_updated":"2023-09-07T13:29:32Z","date_created":"2021-01-21T18:16:54Z","author":[{"last_name":"Cipolloni","first_name":"Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"publisher":"Institute of Science and Technology Austria","year":"2021","acknowledgement":"I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.","day":"25","article_processing_charge":"No","has_accepted_license":"1","date_published":"2021-01-25T00:00:00Z","page":"380","citation":{"ama":"Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022","ista":"Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria.","apa":"Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022","ieee":"G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021.","mla":"Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022.","short":"G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021.","chicago":"Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022."},"abstract":[{"lang":"eng","text":"In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","file":[{"file_name":"thesis.pdf","access_level":"open_access","creator":"gcipollo","file_size":4127796,"content_type":"application/pdf","file_id":"9043","relation":"main_file","date_updated":"2021-01-25T14:19:03Z","date_created":"2021-01-25T14:19:03Z","success":1,"checksum":"5a93658a5f19478372523ee232887e2b"},{"checksum":"e8270eddfe6a988e92a53c88d1d19b8c","date_created":"2021-01-25T14:19:10Z","date_updated":"2021-01-25T14:19:10Z","relation":"source_file","file_id":"9044","content_type":"application/zip","file_size":12775206,"creator":"gcipollo","access_level":"closed","file_name":"Thesis_files.zip"}],"oa_version":"Published Version","title":"Fluctuations in the spectrum of random matrices","ddc":["510"],"status":"public","_id":"9022","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"file_date_updated":"2021-05-24T11:15:57Z","abstract":[{"lang":"eng","text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks."}],"type":"conference","date_created":"2021-05-24T11:16:46Z","date_updated":"2023-09-07T13:29:50Z","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"iclr2021_conference.pdf","content_type":"application/pdf","file_size":502356,"creator":"bphuong","relation":"main_file","file_id":"9417","checksum":"f34ff17017527db5ba6927f817bdd125","date_updated":"2021-05-24T11:15:57Z","date_created":"2021-05-24T11:15:57Z"}],"author":[{"first_name":"Phuong","last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"related_material":{"record":[{"id":"9418","relation":"dissertation_contains","status":"public"}]},"title":"The inductive bias of ReLU networks on orthogonally separable data","ddc":["000"],"publication_status":"published","status":"public","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"year":"2021","_id":"9416","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","month":"05","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","language":[{"iso":"eng"}],"conference":{"start_date":"2021-05-03","location":"Virtual","end_date":"2021-05-07","name":" ICLR: International Conference on Learning Representations"},"date_published":"2021-05-01T00:00:00Z","quality_controlled":"1","publication":"9th International Conference on Learning Representations","citation":{"chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In 9th International Conference on Learning Representations, 2021.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” 9th International Conference on Learning Representations, 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In 9th International Conference on Learning Representations. Virtual.","ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in 9th International Conference on Learning Representations, Virtual, 2021.","ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: 9th International Conference on Learning Representations. ; 2021."},"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=krz7T0xU9Z_"}],"oa":1},{"day":"11","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":"1","date_published":"2021-02-11T00:00:00Z","publication":"Letters in Mathematical Physics","citation":{"apa":"Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (2021). Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-020-01350-5","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the spectral gap for the Landau–Pekar equations,” Letters in Mathematical Physics, vol. 111. Springer Nature, 2021.","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19.","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 2021;111. doi:10.1007/s11005-020-01350-5","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-020-01350-5.","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical Physics 111 (2021).","mla":"Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics, vol. 111, 19, Springer Nature, 2021, doi:10.1007/s11005-020-01350-5."},"article_type":"original","abstract":[{"text":"The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere, we provide a class of initial data for which the associated effective Hamiltonian\r\nhas a uniform spectral gap for all times. For such initial data, this allows us to extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations and their derivation\r\nfrom the Fröhlich model obtained in previous works to larger times.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":391205,"file_name":"2021_LettersMathPhysics_Feliciangeli.pdf","access_level":"open_access","date_updated":"2021-03-09T11:44:34Z","date_created":"2021-03-09T11:44:34Z","success":1,"checksum":"ffbfe1aad623bce7ff529c207e343b53","file_id":"9232","relation":"main_file"}],"_id":"9225","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Persistence of the spectral gap for the Landau–Pekar equations","status":"public","ddc":["510"],"intvolume":" 111","month":"02","publication_identifier":{"eissn":["15730530"],"issn":["03779017"]},"doi":"10.1007/s11005-020-01350-5","language":[{"iso":"eng"}],"external_id":{"isi":["000617195700001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"file_date_updated":"2021-03-09T11:44:34Z","ec_funded":1,"article_number":"19","author":[{"full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","first_name":"Dario","last_name":"Feliciangeli"},{"full_name":"Rademacher, Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","orcid":"0000-0001-5059-4466","first_name":"Simone Anna Elvira","last_name":"Rademacher"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9733"}]},"date_created":"2021-03-07T23:01:25Z","date_updated":"2023-09-07T13:30:11Z","volume":111,"year":"2021","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged. Open Access funding provided by Institute of Science and Technology (IST Austria)","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"RoSe"}]},{"month":"02","external_id":{"arxiv":["2101.12566"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.12566"}],"oa":1,"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"article_number":"2101.12566","ec_funded":1,"year":"2021","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n","publication_status":"submitted","department":[{"_id":"RoSe"}],"author":[{"full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","first_name":"Dario","last_name":"Feliciangeli"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"10224"},{"relation":"dissertation_contains","status":"public","id":"9733"}]},"date_updated":"2023-09-07T13:30:10Z","date_created":"2021-08-06T08:25:57Z","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"arXiv","citation":{"short":"D. Feliciangeli, R. Seiringer, ArXiv (n.d.).","mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, 2101.12566.","chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, n.d.","ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv.","apa":"Feliciangeli, D., & Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv.","ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” arXiv. .","ista":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566."},"date_published":"2021-02-01T00:00:00Z","type":"preprint","abstract":[{"text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging.","lang":"eng"}],"_id":"9787","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","status":"public","ddc":["510"],"oa_version":"Preprint"},{"abstract":[{"text":"Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, RVF-SMC generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Published Version","file":[{"date_created":"2022-05-13T07:00:20Z","date_updated":"2022-05-13T07:00:20Z","checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","success":1,"relation":"main_file","file_id":"11368","content_type":"application/pdf","file_size":1516756,"creator":"dernst","file_name":"2021_LNCS_Agarwal.pdf","access_level":"open_access"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9987","title":"Stateless model checking under a reads-value-from equivalence","status":"public","ddc":["000"],"day":"15","has_accepted_license":"1","article_processing_charge":"Yes","scopus_import":"1","date_published":"2021-07-15T00:00:00Z","publication":"33rd International Conference on Computer-Aided Verification ","citation":{"ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16","ista":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.","ieee":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.","apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16","mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.","short":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.","chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16."},"page":"341-366","file_date_updated":"2022-05-13T07:00:20Z","ec_funded":1,"author":[{"first_name":"Pratyush","last_name":"Agarwal","full_name":"Agarwal, Pratyush"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Pathak, Shreya","first_name":"Shreya","last_name":"Pathak"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"},{"full_name":"Toman, Viktor","last_name":"Toman","first_name":"Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"10199","status":"public","relation":"dissertation_contains"}]},"date_created":"2021-09-05T22:01:24Z","date_updated":"2023-09-07T13:30:27Z","volume":"12759 ","year":"2021","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","month":"07","publication_identifier":{"eisbn":["978-3-030-81685-8"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-030-81684-1"]},"conference":{"end_date":"2021-07-23","start_date":"2021-07-20","location":"Virtual","name":"CAV: Computer Aided Verification "},"doi":"10.1007/978-3-030-81685-8_16","language":[{"iso":"eng"}],"external_id":{"arxiv":["2105.06424"],"isi":["000698732400016"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}]},{"abstract":[{"lang":"eng","text":"The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","file":[{"file_size":15022154,"content_type":"application/x-zip-compressed","creator":"shensel","file_name":"thesis_final_Hensel.zip","access_level":"closed","date_updated":"2021-09-15T14:37:30Z","date_created":"2021-09-13T11:03:24Z","checksum":"c8475faaf0b680b4971f638f1db16347","relation":"source_file","file_id":"10008"},{"content_type":"application/pdf","file_size":6583638,"creator":"shensel","access_level":"open_access","file_name":"thesis_final_Hensel.pdf","checksum":"1a609937aa5275452822f45f2da17f07","date_updated":"2021-09-14T09:52:47Z","date_created":"2021-09-13T14:18:56Z","relation":"main_file","file_id":"10014"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10007","ddc":["515"],"status":"public","title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","has_accepted_license":"1","article_processing_charge":"No","day":"14","date_published":"2021-09-14T00:00:00Z","citation":{"chicago":"Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.","short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.","mla":"Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007.","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","apa":"Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007"},"page":"300","ec_funded":1,"file_date_updated":"2021-09-15T14:37:30Z","related_material":{"record":[{"id":"10012","status":"public","relation":"part_of_dissertation"},{"id":"10013","status":"public","relation":"part_of_dissertation"},{"id":"7489","status":"public","relation":"part_of_dissertation"}]},"author":[{"orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","first_name":"Sebastian","full_name":"Hensel, Sebastian"}],"date_created":"2021-09-13T11:12:34Z","date_updated":"2023-09-07T13:30:45Z","year":"2021","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"month":"09","doi":"10.15479/at:ista:10007","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","first_name":"Julian L","last_name":"Fischer"}],"degree_awarded":"PhD","oa":1,"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}]},{"volume":5,"date_created":"2021-10-27T15:05:34Z","date_updated":"2023-09-07T13:30:27Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10199"}]},"author":[{"last_name":"Bui","first_name":"Truc Lam","full_name":"Bui, Truc Lam"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Tushar","last_name":"Gautam","full_name":"Gautam, Tushar"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"},{"first_name":"Viktor","last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","publication_status":"published","acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","year":"2021","ec_funded":1,"file_date_updated":"2021-11-04T07:24:48Z","article_number":"164","language":[{"iso":"eng"}],"doi":"10.1145/3485541","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2011.11763"]},"publication_identifier":{"eissn":["2475-1421"]},"month":"10","oa_version":"Published Version","file":[{"file_name":"2021_ProcACMPL_Bui.pdf","access_level":"open_access","creator":"cchlebak","file_size":2903485,"content_type":"application/pdf","file_id":"10215","relation":"main_file","date_created":"2021-11-04T07:24:48Z","date_updated":"2021-11-04T07:24:48Z","success":1,"checksum":"9d6dce7b611853c529bb7b1915ac579e"}],"intvolume":" 5","ddc":["000"],"status":"public","title":"The reads-from equivalence for the TSO and PSO memory models","_id":"10191","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"OOPSLA","abstract":[{"lang":"eng","text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n"}],"type":"journal_article","date_published":"2021-10-15T00:00:00Z","article_type":"original","citation":{"ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164.","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541","ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541.","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021)."},"publication":"Proceedings of the ACM on Programming Languages","article_processing_charge":"No","has_accepted_license":"1","day":"15","keyword":["safety","risk","reliability and quality","software"],"scopus_import":"1"},{"language":[{"iso":"eng"}],"date_published":"2021-08-03T00:00:00Z","doi":"10.48550/arXiv.2108.01733","project":[{"name":"Bridging Scales in Random Materials","call_identifier":"H2020","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"citation":{"apa":"Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733","ieee":"S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” arXiv. .","ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733.","ama":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. doi:10.48550/arXiv.2108.01733","chicago":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733.","short":"S. Hensel, T. Laux, ArXiv (n.d.).","mla":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.01733"}],"external_id":{"arxiv":["2108.01733"]},"oa":1,"publication":"arXiv","article_processing_charge":"No","day":"03","month":"08","oa_version":"Preprint","date_created":"2021-09-13T12:17:11Z","date_updated":"2023-09-07T13:30:45Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"13043"},{"id":"10007","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Hensel, Sebastian","first_name":"Sebastian","last_name":"Hensel","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072"},{"last_name":"Laux","first_name":"Tim","full_name":"Laux, Tim"}],"department":[{"_id":"JuFi"}],"status":"public","title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","publication_status":"submitted","_id":"10013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","year":"2021","ec_funded":1,"abstract":[{"text":"We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions.","lang":"eng"}],"type":"preprint","article_number":"2108.01733"},{"date_published":"2021-11-24T00:00:00Z","citation":{"chicago":"Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko, Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” PRX Quantum. American Physical Society, 2021. https://doi.org/10.1103/PRXQuantum.2.040341.","short":"M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M. Fink, PRX Quantum 2 (2021) 040341.","mla":"Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” PRX Quantum, vol. 2, no. 4, American Physical Society, 2021, p. 040341, doi:10.1103/PRXQuantum.2.040341.","ieee":"M. Peruzzo et al., “Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction,” PRX Quantum, vol. 2, no. 4. American Physical Society, p. 040341, 2021.","apa":"Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., & Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. American Physical Society. https://doi.org/10.1103/PRXQuantum.2.040341","ista":"Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM. 2021. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2(4), 040341.","ama":"Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2021;2(4):040341. doi:10.1103/PRXQuantum.2.040341"},"publication":"PRX Quantum","page":"040341","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"24","scopus_import":"1","keyword":["quantum physics","mesoscale and nanoscale physics"],"file":[{"file_id":"10641","relation":"main_file","success":1,"checksum":"36eb41ea43d8ca22b0efab12419e4eb2","date_created":"2022-01-18T11:29:33Z","date_updated":"2022-01-18T11:29:33Z","access_level":"open_access","file_name":"2021_PRXQuantum_Peruzzo.pdf","creator":"cchlebak","content_type":"application/pdf","file_size":4247422}],"oa_version":"Published Version","_id":"9928","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 2","title":"Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction","ddc":["530"],"status":"public","issue":"4","abstract":[{"text":"There are two elementary superconducting qubit types that derive directly from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear Josephson junction to realize the widely used charge qubits with a compact phase variable and a discrete charge wave function. In the other, the junction is added in parallel, which gives rise to an extended phase variable, continuous wave functions, and a rich energy-level structure due to the loop topology. While the corresponding rf superconducting quantum interference device Hamiltonian was introduced as a quadratic quasi-one-dimensional potential approximation to describe the fluxonium qubit implemented with long Josephson-junction arrays, in this work we implement it directly using a linear superinductor formed by a single uninterrupted aluminum wire. We present a large variety of qubits, all stemming from the same circuit but with drastically different characteristic energy scales. This includes flux and fluxonium qubits but also the recently introduced quasicharge qubit with strongly enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion. The use of a geometric inductor results in high reproducibility of the inductive energy as guaranteed by top-down lithography—a key ingredient for intrinsically protected superconducting qubits.","lang":"eng"}],"type":"journal_article","doi":"10.1103/PRXQuantum.2.040341","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2106.05882"],"isi":["000723015100001"]},"oa":1,"project":[{"name":"Integrating superconducting quantum circuits","call_identifier":"FWF","grant_number":"F07105","_id":"26927A52-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"_id":"2622978C-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"}],"quality_controlled":"1","isi":1,"publication_identifier":{"eissn":["2691-3399"]},"month":"11","related_material":{"record":[{"id":"13057","status":"public","relation":"research_data"},{"id":"9920","relation":"dissertation_contains","status":"public"}]},"author":[{"orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo","first_name":"Matilda","full_name":"Peruzzo, Matilda"},{"full_name":"Hassani, Farid","last_name":"Hassani","first_name":"Farid","orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Szep","first_name":"Gregory","full_name":"Szep, Gregory"},{"last_name":"Trioni","first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea"},{"full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","last_name":"Redchenko"},{"id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Zemlicka","full_name":"Zemlicka, Martin"},{"last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M"}],"volume":2,"date_updated":"2023-09-07T13:31:22Z","date_created":"2021-08-17T08:14:18Z","acknowledgement":"We thank W. Hughes for analytic and numerical modeling during the early stages of this work, J. Koch for discussions and support with the scqubits package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros for equipment support, as well as the MIBA workshop and the Institute of Science and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise, and E. Flurin for discussions. This work was supported by a NOMIS Foundation research grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria. M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria.","year":"2021","publisher":"American Physical Society","department":[{"_id":"JoFi"},{"_id":"NanoFab"},{"_id":"M-Shop"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2022-01-18T11:29:33Z"},{"file":[{"file_id":"10032","relation":"source_file","date_created":"2021-09-21T09:17:34Z","date_updated":"2022-03-10T12:14:42Z","checksum":"8cd60dcb8762e8f21867e21e8001e183","file_name":"tex_and_pictures.zip","access_level":"closed","creator":"cchlebak","content_type":"application/x-zip-compressed","file_size":3876668},{"file_name":"thesis_portinale_Final (1).pdf","access_level":"open_access","creator":"cchlebak","file_size":2532673,"content_type":"application/pdf","file_id":"10047","relation":"main_file","date_created":"2021-09-27T11:14:31Z","date_updated":"2021-09-27T11:14:31Z","checksum":"9789e9d967c853c1503ec7f307170279"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10030","ddc":["515"],"status":"public","title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","abstract":[{"lang":"eng","text":"This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2021-09-22T00:00:00Z","citation":{"mla":"Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10030.","short":"L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.","chicago":"Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10030.","ama":"Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:10.15479/at:ista:10030","ista":"Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria.","apa":"Portinale, L. (2021). Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10030","ieee":"L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021."},"day":"22","has_accepted_license":"1","article_processing_charge":"No","author":[{"full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","last_name":"Portinale"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"10022"},{"status":"public","relation":"part_of_dissertation","id":"9792"},{"status":"public","relation":"part_of_dissertation","id":"7573"}]},"date_updated":"2023-09-07T13:31:06Z","date_created":"2021-09-21T09:14:15Z","acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","year":"2021","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2022-03-10T12:14:42Z","doi":"10.15479/at:ista:10030","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338"}],"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations","call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"month":"09","publication_identifier":{"issn":["2663-337X"]}},{"file_date_updated":"2021-09-06T08:39:47Z","date_created":"2021-08-16T09:44:09Z","date_updated":"2023-09-07T13:31:22Z","author":[{"full_name":"Peruzzo, Matilda","last_name":"Peruzzo","first_name":"Matilda","orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9928"},{"id":"8755","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"year":"2021","month":"08","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-013-8"]},"supervisor":[{"full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:9920","oa":1,"abstract":[{"lang":"eng","text":"This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"checksum":"3cd1986efde5121d7581f6fcf9090da8","date_created":"2021-08-16T09:33:21Z","date_updated":"2021-09-06T08:39:47Z","file_id":"9924","relation":"source_file","creator":"mperuzzo","file_size":151387283,"content_type":"application/x-zip-compressed","access_level":"closed","file_name":"GeometricSuperinductorsForCQED.zip"},{"access_level":"open_access","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf","creator":"mperuzzo","content_type":"application/pdf","file_size":17596344,"file_id":"9939","relation":"main_file","checksum":"50928c621cdf0775d7a5906b9dc8602c","date_created":"2021-08-18T14:20:06Z","date_updated":"2021-09-06T08:39:47Z"},{"description":"Extra copy of the thesis as PDF/A-2b","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf","access_level":"closed","file_size":17592425,"content_type":"application/pdf","creator":"mperuzzo","relation":"other","file_id":"9940","date_updated":"2021-09-06T08:39:47Z","date_created":"2021-08-18T14:20:09Z","checksum":"37f486aa1b622fe44af00d627ec13f6c"}],"status":"public","title":"Geometric superinductors and their applications in circuit quantum electrodynamics","ddc":["539"],"_id":"9920","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"19","article_processing_charge":"No","has_accepted_license":"1","keyword":["quantum computing","superinductor","quantum metrology"],"date_published":"2021-08-19T00:00:00Z","page":"149","citation":{"ieee":"M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021.","apa":"Peruzzo, M. (2021). Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9920","ista":"Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria.","ama":"Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:10.15479/at:ista:9920","chicago":"Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9920.","short":"M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021.","mla":"Peruzzo, Matilda. Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9920."}},{"_id":"10432","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","intvolume":" 35","oa_version":"Published Version","type":"conference","abstract":[{"lang":"eng","text":"One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification."}],"issue":"10","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","citation":{"ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.","apa":"Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.","ieee":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.","ista":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","mla":"Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.","chicago":"Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021."},"page":"9037-9045","date_published":"2021-05-18T00:00:00Z","day":"18","article_processing_charge":"No","acknowledgement":"We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus).","year":"2021","publication_status":"published","department":[{"_id":"DaAl"}],"author":[{"full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","last_name":"Nadiradze","first_name":"Giorgi"},{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia","last_name":"Markov","full_name":"Markov, Ilia"},{"last_name":"Chatterjee","first_name":"Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi"},{"first_name":"Vyacheslav ","last_name":"Kungurtsev","full_name":"Kungurtsev, Vyacheslav "},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10429"}]},"date_updated":"2023-09-07T13:31:39Z","date_created":"2021-12-09T09:21:35Z","volume":35,"ec_funded":1,"oa":1,"external_id":{"arxiv":["2001.05918"]},"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092"}],"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"conference":{"location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"language":[{"iso":"eng"}],"month":"05"},{"month":"08","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-84245-1"],"eissn":["1611-3349"],"isbn":["978-3-030-84244-4"]},"conference":{"name":"CRYPTO: Annual International Cryptology Conference","start_date":"2021-08-16","location":"Virtual","end_date":"2021-08-20"},"doi":"10.1007/978-3-030-84245-1_17","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/945"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"place":"Cham","author":[{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"related_material":{"record":[{"id":"10035","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-09-07T13:32:11Z","date_created":"2021-09-23T14:06:15Z","volume":12826,"acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","year":"2021","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","day":"11","article_processing_charge":"No","date_published":"2021-08-11T00:00:00Z","publication":"41st Annual International Cryptology Conference, Part II ","citation":{"ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II (Vol. 12826, pp. 486–515). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-84245-1_17","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.","mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In 41st Annual International Cryptology Conference, Part II , 12826:486–515. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-84245-1_17."},"page":"486-515","abstract":[{"lang":"eng","text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth δ , the loss in security is at most exponential in δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security."}],"type":"conference","alternative_title":["LCNS"],"oa_version":"Preprint","_id":"10041","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Limits on the Adaptive Security of Yao’s Garbling","status":"public","intvolume":" 12826"},{"date_published":"2021-08-26T00:00:00Z","page":"268-284","publication":"2021 IEEE Symposium on Security and Privacy ","citation":{"mla":"Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.","short":"K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.","chicago":"Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035.","ama":"Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035","ista":"Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.","apa":"Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy (pp. 268–284). San Francisco, CA, United States: IEEE. https://doi.org/10.1109/sp40001.2021.00035","ieee":"K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284."},"day":"26","article_processing_charge":"No","oa_version":"Preprint","status":"public","title":"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10049","abstract":[{"text":"While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"SP: Symposium on Security and Privacy","location":"San Francisco, CA, United States","start_date":"2021-05-24","end_date":"2021-05-27"},"doi":"10.1109/sp40001.2021.00035","quality_controlled":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1489"}],"month":"08","date_created":"2021-09-27T13:46:27Z","date_updated":"2023-09-07T13:32:11Z","author":[{"last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"full_name":"Pascual Perez, Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8630-415X","first_name":"Guillermo","last_name":"Pascual Perez"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"full_name":"Capretto, Margarita","last_name":"Capretto","first_name":"Margarita"},{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","first_name":"Miguel","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel"},{"full_name":"Markov, Ilia","last_name":"Markov","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"full_name":"Yeo, Michelle X","last_name":"Yeo","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10035"}]},"publication_status":"published","department":[{"_id":"KrPi"},{"_id":"DaAl"}],"publisher":"IEEE","acknowledgement":"The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385.","year":"2021","ec_funded":1},{"abstract":[{"text":"We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.","lang":"eng"}],"ec_funded":1,"article_number":"2021/926","type":"conference","author":[{"last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","first_name":"Karen"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"10409"},{"id":"10035","status":"public","relation":"dissertation_contains"}]},"date_created":"2021-09-24T12:01:34Z","date_updated":"2023-09-07T13:32:11Z","oa_version":"Preprint","_id":"10044","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. ","year":"2021","publication_status":"published","status":"public","title":"On treewidth, separators and Yao's garbling","publisher":"International Association for Cryptologic Research","department":[{"_id":"KrPi"}],"month":"07","day":"08","article_processing_charge":"No","conference":{"start_date":"2021-11-08","location":"Raleigh, NC, United States","end_date":"2021-11-11","name":"TCC: Theory of Cryptography Conference"},"date_published":"2021-07-08T00:00:00Z","language":[{"iso":"eng"}],"publication":"19th Theory of Cryptography Conference 2021","oa":1,"citation":{"mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021.","apa":"Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research."},"main_file_link":[{"url":"https://eprint.iacr.org/2021/926","open_access":"1"}],"quality_controlled":"1","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}]},{"degree_awarded":"MS","supervisor":[{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","last_name":"Goodrich","first_name":"Carl Peter"}],"language":[{"iso":"eng"}],"date_published":"2021-12-07T00:00:00Z","doi":"10.15479/at:ista:10422","citation":{"chicago":"Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422.","short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021.","mla":"Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422.","ieee":"A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021.","apa":"Piankov, A. (2021). Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422","ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria.","ama":"Piankov A. Towards designer materials using customizable particle shape. 2021. doi:10.15479/at:ista:10422"},"oa":1,"day":"07","month":"12","article_processing_charge":"No","has_accepted_license":"1","publication_identifier":{"issn":["2791-4585"]},"date_created":"2021-12-07T10:48:06Z","date_updated":"2023-09-07T13:34:12Z","file":[{"file_name":"Thesis.zip","access_level":"closed","creator":"cchlebak","content_type":"application/x-zip-compressed","file_size":394018,"file_id":"10424","relation":"source_file","date_updated":"2022-03-10T12:10:25Z","date_created":"2021-12-07T11:13:52Z","checksum":"114e8f4b2c002c6c352416c12de2c695"},{"creator":"cchlebak","file_size":47638,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","file_name":"Preliminary_pages_Piankov.docx","checksum":"cd15ae991ced352a9959815f794e657c","date_created":"2021-12-07T11:14:01Z","date_updated":"2022-03-10T12:10:25Z","file_id":"10425","relation":"source_file"},{"checksum":"e6899c798b75ba42fab9822bce309050","success":1,"date_created":"2021-12-07T11:20:35Z","date_updated":"2021-12-07T11:20:35Z","relation":"main_file","file_id":"10426","content_type":"application/pdf","file_size":484965,"creator":"cchlebak","access_level":"open_access","file_name":"2021_Piankov_combined.pdf"}],"oa_version":"Published Version","author":[{"full_name":"Piankov, Anton","first_name":"Anton","last_name":"Piankov","id":"865E3C26-AA8C-11E9-A409-C4C4E5697425"}],"ddc":["530"],"title":"Towards designer materials using customizable particle shape","publication_status":"published","status":"public","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"CaGo"}],"_id":"10422","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2021","file_date_updated":"2022-03-10T12:10:25Z","abstract":[{"lang":"eng","text":"Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems."}],"alternative_title":["ISTA Master's Thesis"],"type":"dissertation"},{"doi":"10.48550/arXiv.2102.05996","date_published":"2021-06-07T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv. doi:10.48550/arXiv.2102.05996","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” arXiv. .","apa":"Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.","chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.05996"}],"oa":1,"external_id":{"arxiv":["2102.05996"]},"publication":"arXiv","article_processing_charge":"No","day":"07","month":"06","related_material":{"record":[{"id":"10799","relation":"dissertation_contains","status":"public"}]},"author":[{"first_name":"Nikola H","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Lampert, Christoph"}],"oa_version":"Preprint","date_updated":"2023-09-07T13:42:08Z","date_created":"2022-02-28T14:13:59Z","_id":"10803","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","department":[{"_id":"ChLa"}],"status":"public","title":"Fairness through regularization for learning to rank","publication_status":"submitted","abstract":[{"text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.","lang":"eng"}],"type":"preprint","article_number":"2102.05996"},{"article_processing_charge":"No","day":"31","month":"05","project":[{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"page":"2105.15193","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2105.15193","open_access":"1"}],"citation":{"chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” arXiv. .","apa":"Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, 10.48550/arXiv.2105.15193.","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193"},"external_id":{"arxiv":["2105.15193"]},"publication":"arXiv","language":[{"iso":"eng"}],"date_published":"2021-05-31T00:00:00Z","doi":"10.48550/arXiv.2105.15193","type":"preprint","ec_funded":1,"abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"department":[{"_id":"MiLe"}],"title":"Artificial neural network states for non-additive systems","status":"public","publication_status":"submitted","_id":"10762","year":"2021","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_updated":"2023-09-07T13:44:16Z","date_created":"2022-02-17T11:18:57Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10759"}]},"author":[{"full_name":"Rzadkowski, Wojciech","last_name":"Rzadkowski","first_name":"Wojciech","orcid":"0000-0002-1106-4419","id":"48C55298-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"full_name":"Mentink, Johan H.","last_name":"Mentink","first_name":"Johan H."}]},{"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"year":"2021","date_created":"2021-05-24T13:06:23Z","date_updated":"2023-09-08T11:11:12Z","author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong","last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong"}],"related_material":{"record":[{"id":"7435","relation":"part_of_dissertation","status":"deleted"},{"status":"public","relation":"part_of_dissertation","id":"7481"},{"status":"public","relation":"part_of_dissertation","id":"9416"},{"id":"7479","status":"public","relation":"part_of_dissertation"}]},"file_date_updated":"2021-05-24T11:56:02Z","oa":1,"supervisor":[{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:9418","month":"05","publication_identifier":{"issn":["2663-337X"]},"ddc":["000"],"title":"Underspecification in deep learning","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9418","oa_version":"Published Version","file":[{"file_size":2673905,"content_type":"application/pdf","creator":"bphuong","file_name":"mph-thesis-v519-pdfimages.pdf","access_level":"open_access","date_updated":"2021-05-24T11:22:29Z","date_created":"2021-05-24T11:22:29Z","checksum":"4f0abe64114cfed264f9d36e8d1197e3","success":1,"relation":"main_file","file_id":"9419"},{"content_type":"application/zip","file_size":92995100,"creator":"bphuong","access_level":"closed","file_name":"thesis.zip","checksum":"f5699e876bc770a9b0df8345a77720a2","date_created":"2021-05-24T11:56:02Z","date_updated":"2021-05-24T11:56:02Z","relation":"source_file","file_id":"9420"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"page":"125","citation":{"mla":"Phuong, Mary. Underspecification in Deep Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","apa":"Phuong, M. (2021). Underspecification in deep learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021."},"date_published":"2021-05-30T00:00:00Z","day":"30","has_accepted_license":"1","article_processing_charge":"No"},{"conference":{"start_date":"2021-07-18","location":"Virtual","end_date":"2021-07-24","name":"ICML: International Conference on Machine Learning"},"language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["2006.07886"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.07886"}],"quality_controlled":"1","month":"08","author":[{"full_name":"Träuble, Frederik","last_name":"Träuble","first_name":"Frederik"},{"full_name":"Creager, Elliot","first_name":"Elliot","last_name":"Creager"},{"full_name":"Kilbertus, Niki","last_name":"Kilbertus","first_name":"Niki"},{"last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"full_name":"Dittadi, Andrea","last_name":"Dittadi","first_name":"Andrea"},{"first_name":"Anirudh","last_name":"Goyal","full_name":"Goyal, Anirudh"},{"last_name":"Schölkopf","first_name":"Bernhard","full_name":"Schölkopf, Bernhard"},{"full_name":"Bauer, Stefan","last_name":"Bauer","first_name":"Stefan"}],"volume":139,"date_updated":"2023-09-11T10:18:48Z","date_created":"2023-08-22T14:03:47Z","year":"2021","department":[{"_id":"FrLo"}],"publisher":"ML Research Press","publication_status":"published","extern":"1","date_published":"2021-08-01T00:00:00Z","citation":{"apa":"Träuble, F., Creager, E., Kilbertus, N., Locatello, F., Dittadi, A., Goyal, A., … Bauer, S. (2021). On disentangled representations learned from correlated data. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 10401–10412). Virtual: ML Research Press.","ieee":"F. Träuble et al., “On disentangled representations learned from correlated data,” in Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 10401–10412.","ista":"Träuble F, Creager E, Kilbertus N, Locatello F, Dittadi A, Goyal A, Schölkopf B, Bauer S. 2021. On disentangled representations learned from correlated data. Proceedings of the 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 139, 10401–10412.","ama":"Träuble F, Creager E, Kilbertus N, et al. On disentangled representations learned from correlated data. In: Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:10401-10412.","chicago":"Träuble, Frederik, Elliot Creager, Niki Kilbertus, Francesco Locatello, Andrea Dittadi, Anirudh Goyal, Bernhard Schölkopf, and Stefan Bauer. “On Disentangled Representations Learned from Correlated Data.” In Proceedings of the 38th International Conference on Machine Learning, 139:10401–12. ML Research Press, 2021.","short":"F. Träuble, E. Creager, N. Kilbertus, F. Locatello, A. Dittadi, A. Goyal, B. Schölkopf, S. Bauer, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 10401–10412.","mla":"Träuble, Frederik, et al. “On Disentangled Representations Learned from Correlated Data.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 10401–12."},"publication":"Proceedings of the 38th International Conference on Machine Learning","page":"10401-10412","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Published Version","_id":"14177","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 139","status":"public","title":"On disentangled representations learned from correlated data","abstract":[{"lang":"eng","text":"The focus of disentanglement approaches has been on identifying independent factors of variation in data. However, the causal variables underlying real-world observations are often not statistically independent. In this work, we bridge the gap to real-world scenarios by analyzing the behavior of the most prominent disentanglement approaches on correlated data in a large-scale empirical study (including 4260 models). We show and quantify that systematically induced correlations in the dataset are being learned and reflected in the latent representations, which has implications for downstream applications of disentanglement such as fairness. We also demonstrate how to resolve these latent correlations, either using weak supervision during\r\ntraining or by post-hoc correcting a pre-trained model with a small number of labels."}],"type":"conference","alternative_title":["PMLR"]},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2021-08-01T00:00:00Z","publication":"Proceedings of 38th International Conference on Machine Learning","citation":{"ieee":"H. Yèche, G. Dresdner, F. Locatello, M. Hüser, and G. Rätsch, “Neighborhood contrastive learning applied to online patient monitoring,” in Proceedings of 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 11964–11974.","apa":"Yèche, H., Dresdner, G., Locatello, F., Hüser, M., & Rätsch, G. (2021). Neighborhood contrastive learning applied to online patient monitoring. In Proceedings of 38th International Conference on Machine Learning (Vol. 139, pp. 11964–11974). Virtual: ML Research Press.","ista":"Yèche H, Dresdner G, Locatello F, Hüser M, Rätsch G. 2021. Neighborhood contrastive learning applied to online patient monitoring. Proceedings of 38th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 139, 11964–11974.","ama":"Yèche H, Dresdner G, Locatello F, Hüser M, Rätsch G. Neighborhood contrastive learning applied to online patient monitoring. In: Proceedings of 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:11964-11974.","chicago":"Yèche, Hugo, Gideon Dresdner, Francesco Locatello, Matthias Hüser, and Gunnar Rätsch. “Neighborhood Contrastive Learning Applied to Online Patient Monitoring.” In Proceedings of 38th International Conference on Machine Learning, 139:11964–74. ML Research Press, 2021.","short":"H. Yèche, G. Dresdner, F. Locatello, M. Hüser, G. Rätsch, in:, Proceedings of 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 11964–11974.","mla":"Yèche, Hugo, et al. “Neighborhood Contrastive Learning Applied to Online Patient Monitoring.” Proceedings of 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 11964–74."},"page":"11964-11974","abstract":[{"text":"Intensive care units (ICU) are increasingly looking towards machine learning for methods to provide online monitoring of critically ill patients. In machine learning, online monitoring is often formulated as a supervised learning problem. Recently, contrastive learning approaches have demonstrated promising improvements over competitive supervised benchmarks. These methods rely on well-understood data augmentation techniques developed for image data which do not apply to online monitoring. In this work, we overcome this limitation by\r\nsupplementing time-series data augmentation techniques with a novel contrastive\r\nlearning objective which we call neighborhood contrastive learning (NCL). Our objective explicitly groups together contiguous time segments from each patient while maintaining state-specific information. Our experiments demonstrate a marked improvement over existing work applying contrastive methods to medical time-series.","lang":"eng"}],"type":"conference","alternative_title":["PMLR"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14176","status":"public","title":"Neighborhood contrastive learning applied to online patient monitoring","intvolume":" 139","month":"08","conference":{"name":"International Conference on Machine Learning","location":"Virtual","start_date":"2021-07-18","end_date":"2021-07-24"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2106.05142"]},"main_file_link":[{"url":"https://arxiv.org/abs/2106.05142","open_access":"1"}],"oa":1,"quality_controlled":"1","extern":"1","author":[{"first_name":"Hugo","last_name":"Yèche","full_name":"Yèche, Hugo"},{"full_name":"Dresdner, Gideon","first_name":"Gideon","last_name":"Dresdner"},{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"},{"full_name":"Hüser, Matthias","first_name":"Matthias","last_name":"Hüser"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"}],"date_updated":"2023-09-11T10:16:55Z","date_created":"2023-08-22T14:03:04Z","volume":139,"year":"2021","publication_status":"published","publisher":"ML Research Press","department":[{"_id":"FrLo"}]},{"type":"conference","extern":"1","abstract":[{"lang":"eng","text":"When machine learning systems meet real world applications, accuracy is only\r\none of several requirements. In this paper, we assay a complementary\r\nperspective originating from the increasing availability of pre-trained and\r\nregularly improving state-of-the-art models. While new improved models develop\r\nat a fast pace, downstream tasks vary more slowly or stay constant. Assume that\r\nwe have a large unlabelled data set for which we want to maintain accurate\r\npredictions. Whenever a new and presumably better ML models becomes available,\r\nwe encounter two problems: (i) given a limited budget, which data points should\r\nbe re-evaluated using the new model?; and (ii) if the new predictions differ\r\nfrom the current ones, should we update? Problem (i) is about compute cost,\r\nwhich matters for very large data sets and models. Problem (ii) is about\r\nmaintaining consistency of the predictions, which can be highly relevant for\r\ndownstream applications; our demand is to avoid negative flips, i.e., changing\r\ncorrect to incorrect predictions. In this paper, we formalize the Prediction\r\nUpdate Problem and present an efficient probabilistic approach as answer to the\r\nabove questions. In extensive experiments on standard classification benchmark\r\ndata sets, we show that our method outperforms alternative strategies along key\r\nmetrics for backward-compatible prediction updates."}],"status":"public","publication_status":"published","title":"Backward-compatible prediction updates: A probabilistic approach","intvolume":" 34","department":[{"_id":"FrLo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14182","year":"2021","date_updated":"2023-09-11T11:31:59Z","date_created":"2023-08-22T14:05:41Z","oa_version":"Preprint","volume":34,"author":[{"full_name":"Träuble, Frederik","last_name":"Träuble","first_name":"Frederik"},{"first_name":"Julius von","last_name":"Kügelgen","full_name":"Kügelgen, Julius von"},{"last_name":"Kleindessner","first_name":"Matthäus","full_name":"Kleindessner, Matthäus"},{"full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"},{"last_name":"Gehler","first_name":"Peter","full_name":"Gehler, Peter"}],"month":"07","day":"02","article_processing_charge":"No","publication_identifier":{"isbn":["9781713845393"]},"quality_controlled":"1","page":"116-128","publication":"35th Conference on Neural Information Processing Systems","citation":{"chicago":"Träuble, Frederik, Julius von Kügelgen, Matthäus Kleindessner, Francesco Locatello, Bernhard Schölkopf, and Peter Gehler. “Backward-Compatible Prediction Updates: A Probabilistic Approach.” In 35th Conference on Neural Information Processing Systems, 34:116–28, 2021.","short":"F. Träuble, J. von Kügelgen, M. Kleindessner, F. Locatello, B. Schölkopf, P. Gehler, in:, 35th Conference on Neural Information Processing Systems, 2021, pp. 116–128.","mla":"Träuble, Frederik, et al. “Backward-Compatible Prediction Updates: A Probabilistic Approach.” 35th Conference on Neural Information Processing Systems, vol. 34, 2021, pp. 116–28.","apa":"Träuble, F., Kügelgen, J. von, Kleindessner, M., Locatello, F., Schölkopf, B., & Gehler, P. (2021). Backward-compatible prediction updates: A probabilistic approach. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 116–128). Virtual.","ieee":"F. Träuble, J. von Kügelgen, M. Kleindessner, F. Locatello, B. Schölkopf, and P. Gehler, “Backward-compatible prediction updates: A probabilistic approach,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021, vol. 34, pp. 116–128.","ista":"Träuble F, Kügelgen J von, Kleindessner M, Locatello F, Schölkopf B, Gehler P. 2021. Backward-compatible prediction updates: A probabilistic approach. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 116–128.","ama":"Träuble F, Kügelgen J von, Kleindessner M, Locatello F, Schölkopf B, Gehler P. Backward-compatible prediction updates: A probabilistic approach. In: 35th Conference on Neural Information Processing Systems. Vol 34. ; 2021:116-128."},"external_id":{"arxiv":["2107.01057"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2107.01057"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2021-12-07","location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems"},"date_published":"2021-07-02T00:00:00Z"},{"date_created":"2023-08-22T14:05:14Z","date_updated":"2023-09-11T11:14:30Z","oa_version":"Published Version","author":[{"full_name":"Dresdner, Gideon","last_name":"Dresdner","first_name":"Gideon"},{"full_name":"Shekhar, Saurav","first_name":"Saurav","last_name":"Shekhar"},{"full_name":"Pedregosa, Fabian","last_name":"Pedregosa","first_name":"Fabian"},{"last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"}],"status":"public","publication_status":"published","title":"Boosting variational inference with locally adaptive step-sizes","publisher":"International Joint Conferences on Artificial Intelligence","department":[{"_id":"FrLo"}],"_id":"14181","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","abstract":[{"text":"Variational Inference makes a trade-off between the capacity of the variational family and the tractability of finding an approximate posterior distribution. Instead, Boosting Variational Inference allows practitioners to obtain increasingly good posterior approximations by spending more compute. The main obstacle to widespread adoption of Boosting Variational Inference is the amount of resources necessary to improve over a strong Variational Inference baseline. In our work, we trace this limitation back to the global curvature of the KL-divergence. We characterize how the global curvature impacts time and memory consumption, address the problem with the notion of local curvature, and provide a novel approximate backtracking algorithm for estimating local curvature. We give new theoretical convergence rates for our algorithms and provide experimental validation on synthetic and real-world datasets.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2021-08-27","location":"Montreal, Canada","start_date":"2021-08-19","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"doi":"10.24963/ijcai.2021/322","date_published":"2021-05-19T00:00:00Z","quality_controlled":"1","page":"2337-2343","publication":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","external_id":{"arxiv":["2105.09240"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2105.09240","open_access":"1"}],"citation":{"short":"G. Dresdner, S. Shekhar, F. Pedregosa, F. Locatello, G. Rätsch, in:, Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 2337–2343.","mla":"Dresdner, Gideon, et al. “Boosting Variational Inference with Locally Adaptive Step-Sizes.” Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 2337–43, doi:10.24963/ijcai.2021/322.","chicago":"Dresdner, Gideon, Saurav Shekhar, Fabian Pedregosa, Francesco Locatello, and Gunnar Rätsch. “Boosting Variational Inference with Locally Adaptive Step-Sizes.” In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2337–43. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/322.","ama":"Dresdner G, Shekhar S, Pedregosa F, Locatello F, Rätsch G. Boosting variational inference with locally adaptive step-sizes. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:2337-2343. doi:10.24963/ijcai.2021/322","apa":"Dresdner, G., Shekhar, S., Pedregosa, F., Locatello, F., & Rätsch, G. (2021). Boosting variational inference with locally adaptive step-sizes. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (pp. 2337–2343). Montreal, Canada: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/322","ieee":"G. Dresdner, S. Shekhar, F. Pedregosa, F. Locatello, and G. Rätsch, “Boosting variational inference with locally adaptive step-sizes,” in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, Montreal, Canada, 2021, pp. 2337–2343.","ista":"Dresdner G, Shekhar S, Pedregosa F, Locatello F, Rätsch G. 2021. Boosting variational inference with locally adaptive step-sizes. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 2337–2343."},"oa":1,"month":"05","day":"19","article_processing_charge":"No","publication_identifier":{"eisbn":["9780999241196"]}},{"publication_identifier":{"isbn":["9781713845393"]},"article_processing_charge":"No","day":"08","month":"06","language":[{"iso":"eng"}],"date_published":"2021-06-08T00:00:00Z","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","start_date":"2021-12-07","location":"Virtual"},"page":"16451-16467","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2106.04619"}],"oa":1,"external_id":{"arxiv":["2106.04619"]},"citation":{"mla":"Kügelgen, Julius von, et al. “Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style.” Advances in Neural Information Processing Systems, vol. 34, 2021, pp. 16451–67.","short":"J. von Kügelgen, Y. Sharma, L. Gresele, W. Brendel, B. Schölkopf, M. Besserve, F. Locatello, in:, Advances in Neural Information Processing Systems, 2021, pp. 16451–16467.","chicago":"Kügelgen, Julius von, Yash Sharma, Luigi Gresele, Wieland Brendel, Bernhard Schölkopf, Michel Besserve, and Francesco Locatello. “Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style.” In Advances in Neural Information Processing Systems, 34:16451–67, 2021.","ama":"Kügelgen J von, Sharma Y, Gresele L, et al. Self-supervised learning with data augmentations provably isolates content from style. In: Advances in Neural Information Processing Systems. Vol 34. ; 2021:16451-16467.","ista":"Kügelgen J von, Sharma Y, Gresele L, Brendel W, Schölkopf B, Besserve M, Locatello F. 2021. Self-supervised learning with data augmentations provably isolates content from style. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 16451–16467.","apa":"Kügelgen, J. von, Sharma, Y., Gresele, L., Brendel, W., Schölkopf, B., Besserve, M., & Locatello, F. (2021). Self-supervised learning with data augmentations provably isolates content from style. In Advances in Neural Information Processing Systems (Vol. 34, pp. 16451–16467). Virtual.","ieee":"J. von Kügelgen et al., “Self-supervised learning with data augmentations provably isolates content from style,” in Advances in Neural Information Processing Systems, Virtual, 2021, vol. 34, pp. 16451–16467."},"publication":"Advances in Neural Information Processing Systems","extern":"1","abstract":[{"text":"Self-supervised representation learning has shown remarkable success in a number of domains. A common practice is to perform data augmentation via hand-crafted transformations intended to leave the semantics of the data invariant. We seek to understand the empirical success of this approach from a theoretical perspective. We formulate the augmentation process as a latent variable model by postulating a partition of the latent representation into a content component, which is assumed invariant to augmentation, and a style component, which is allowed to change. Unlike prior work on disentanglement and independent component analysis, we allow for both nontrivial statistical and causal dependencies in the latent space. We study the identifiability of the latent representation based on pairs of views of the observations and prove sufficient conditions that allow us to identify the invariant content partition up to an invertible mapping in both generative and discriminative settings. We find numerical simulations with dependent latent variables are consistent with our theory. Lastly, we introduce Causal3DIdent, a dataset of high-dimensional, visually complex images with rich causal dependencies, which we use to study the effect of data augmentations performed in practice.","lang":"eng"}],"type":"conference","oa_version":"Preprint","volume":34,"date_created":"2023-08-22T14:04:36Z","date_updated":"2023-09-11T10:33:19Z","author":[{"full_name":"Kügelgen, Julius von","first_name":"Julius von","last_name":"Kügelgen"},{"full_name":"Sharma, Yash","first_name":"Yash","last_name":"Sharma"},{"last_name":"Gresele","first_name":"Luigi","full_name":"Gresele, Luigi"},{"full_name":"Brendel, Wieland","first_name":"Wieland","last_name":"Brendel"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"},{"full_name":"Besserve, Michel","last_name":"Besserve","first_name":"Michel"},{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco","full_name":"Locatello, Francesco"}],"department":[{"_id":"FrLo"}],"intvolume":" 34","title":"Self-supervised learning with data augmentations provably isolates content from style","publication_status":"published","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14179","year":"2021"},{"day":"12","month":"10","article_processing_charge":"No","publication_identifier":{"isbn":["9781713845393"]},"quality_controlled":"1","page":"10985-10998","publication":"Advances in Neural Information Processing Systems","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2110.06399","open_access":"1"}],"external_id":{"arxiv":["2110.06399"]},"citation":{"mla":"Rahaman, Nasim, et al. “Dynamic Inference with Neural Interpreters.” Advances in Neural Information Processing Systems, vol. 34, 2021, pp. 10985–98.","short":"N. Rahaman, M.W. Gondal, S. Joshi, P. Gehler, Y. Bengio, F. Locatello, B. Schölkopf, in:, Advances in Neural Information Processing Systems, 2021, pp. 10985–10998.","chicago":"Rahaman, Nasim, Muhammad Waleed Gondal, Shruti Joshi, Peter Gehler, Yoshua Bengio, Francesco Locatello, and Bernhard Schölkopf. “Dynamic Inference with Neural Interpreters.” In Advances in Neural Information Processing Systems, 34:10985–98, 2021.","ama":"Rahaman N, Gondal MW, Joshi S, et al. Dynamic inference with neural interpreters. In: Advances in Neural Information Processing Systems. Vol 34. ; 2021:10985-10998.","ista":"Rahaman N, Gondal MW, Joshi S, Gehler P, Bengio Y, Locatello F, Schölkopf B. 2021. Dynamic inference with neural interpreters. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 10985–10998.","ieee":"N. Rahaman et al., “Dynamic inference with neural interpreters,” in Advances in Neural Information Processing Systems, Virtual, 2021, vol. 34, pp. 10985–10998.","apa":"Rahaman, N., Gondal, M. W., Joshi, S., Gehler, P., Bengio, Y., Locatello, F., & Schölkopf, B. (2021). Dynamic inference with neural interpreters. In Advances in Neural Information Processing Systems (Vol. 34, pp. 10985–10998). Virtual."},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-07","location":"Virtual","end_date":"2021-12-10"},"date_published":"2021-10-12T00:00:00Z","type":"conference","extern":"1","abstract":[{"text":"Modern neural network architectures can leverage large amounts of data to generalize well within the training distribution. However, they are less capable of systematic generalization to data drawn from unseen but related distributions, a feat that is hypothesized to require compositional reasoning and reuse of knowledge. In this work, we present Neural Interpreters, an architecture that factorizes inference in a self-attention network as a system of modules, which we call \\emph{functions}. Inputs to the model are routed through a sequence of functions in a way that is end-to-end learned. The proposed architecture can flexibly compose computation along width and depth, and lends itself well to capacity extension after training. To demonstrate the versatility of Neural Interpreters, we evaluate it in two distinct settings: image classification and visual abstract reasoning on Raven Progressive Matrices. In the former, we show that Neural Interpreters perform on par with the vision transformer using fewer parameters, while being transferrable to a new task in a sample efficient manner. In the latter, we find that Neural Interpreters are competitive with respect to the state-of-the-art in terms of systematic generalization. ","lang":"eng"}],"title":"Dynamic inference with neural interpreters","status":"public","publication_status":"published","department":[{"_id":"FrLo"}],"intvolume":" 34","_id":"14180","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-08-22T14:04:55Z","date_updated":"2023-09-11T11:33:46Z","oa_version":"Preprint","volume":34,"author":[{"full_name":"Rahaman, Nasim","last_name":"Rahaman","first_name":"Nasim"},{"full_name":"Gondal, Muhammad Waleed","last_name":"Gondal","first_name":"Muhammad Waleed"},{"full_name":"Joshi, Shruti","first_name":"Shruti","last_name":"Joshi"},{"first_name":"Peter","last_name":"Gehler","full_name":"Gehler, Peter"},{"last_name":"Bengio","first_name":"Yoshua","full_name":"Bengio, Yoshua"},{"full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"}]},{"author":[{"full_name":"Scholkopf, Bernhard","first_name":"Bernhard","last_name":"Scholkopf"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"full_name":"Ke, Nan Rosemary","last_name":"Ke","first_name":"Nan Rosemary"},{"last_name":"Kalchbrenner","first_name":"Nal","full_name":"Kalchbrenner, Nal"},{"last_name":"Goyal","first_name":"Anirudh","full_name":"Goyal, Anirudh"},{"full_name":"Bengio, Yoshua","last_name":"Bengio","first_name":"Yoshua"}],"volume":109,"date_updated":"2023-09-11T11:43:35Z","date_created":"2023-08-21T12:19:30Z","year":"2021","department":[{"_id":"FrLo"}],"publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","extern":"1","doi":"10.1109/jproc.2021.3058954","language":[{"iso":"eng"}],"external_id":{"arxiv":["2102.11107"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1109/JPROC.2021.3058954"}],"quality_controlled":"1","publication_identifier":{"eissn":["1558-2256"],"issn":["0018-9219"]},"month":"05","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14117","intvolume":" 109","title":"Toward causal representation learning","status":"public","issue":"5","abstract":[{"text":"The two fields of machine learning and graphical causality arose and are developed separately. However, there is, now, cross-pollination and increasing interest in both fields to benefit from the advances of the other. In this article, we review fundamental concepts of causal inference and relate them to crucial open problems of machine learning, including transfer and generalization, thereby assaying how causality can contribute to modern machine learning research. This also applies in the opposite direction: we note that most work in causality starts from the premise that the causal variables are given. A central problem for AI and causality is, thus, causal representation learning, that is, the discovery of high-level causal variables from low-level observations. Finally, we delineate some implications of causality for machine learning and propose key research areas at the intersection of both communities.","lang":"eng"}],"type":"journal_article","date_published":"2021-05-01T00:00:00Z","citation":{"short":"B. Scholkopf, F. Locatello, S. Bauer, N.R. Ke, N. Kalchbrenner, A. Goyal, Y. Bengio, Proceedings of the IEEE 109 (2021) 612–634.","mla":"Scholkopf, Bernhard, et al. “Toward Causal Representation Learning.” Proceedings of the IEEE, vol. 109, no. 5, Institute of Electrical and Electronics Engineers, 2021, pp. 612–34, doi:10.1109/jproc.2021.3058954.","chicago":"Scholkopf, Bernhard, Francesco Locatello, Stefan Bauer, Nan Rosemary Ke, Nal Kalchbrenner, Anirudh Goyal, and Yoshua Bengio. “Toward Causal Representation Learning.” Proceedings of the IEEE. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/jproc.2021.3058954.","ama":"Scholkopf B, Locatello F, Bauer S, et al. Toward causal representation learning. Proceedings of the IEEE. 2021;109(5):612-634. doi:10.1109/jproc.2021.3058954","ieee":"B. Scholkopf et al., “Toward causal representation learning,” Proceedings of the IEEE, vol. 109, no. 5. Institute of Electrical and Electronics Engineers, pp. 612–634, 2021.","apa":"Scholkopf, B., Locatello, F., Bauer, S., Ke, N. R., Kalchbrenner, N., Goyal, A., & Bengio, Y. (2021). Toward causal representation learning. Proceedings of the IEEE. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/jproc.2021.3058954","ista":"Scholkopf B, Locatello F, Bauer S, Ke NR, Kalchbrenner N, Goyal A, Bengio Y. 2021. Toward causal representation learning. Proceedings of the IEEE. 109(5), 612–634."},"publication":"Proceedings of the IEEE","page":"612-634","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","keyword":["Electrical and Electronic Engineering"]},{"language":[{"iso":"eng"}],"date_published":"2021-05-04T00:00:00Z","conference":{"location":"Virtual","start_date":"2021-05-03","end_date":"2021-05-07","name":"ICLR: International Conference on Learning Representations"},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.14407"}],"external_id":{"arxiv":["2010.14407"]},"citation":{"ama":"Dittadi A, Träuble F, Locatello F, et al. On the transfer of disentangled representations in realistic settings. In: The Ninth International Conference on Learning Representations. ; 2021.","ista":"Dittadi A, Träuble F, Locatello F, Wüthrich M, Agrawal V, Winther O, Bauer S, Schölkopf B. 2021. On the transfer of disentangled representations in realistic settings. The Ninth International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ieee":"A. Dittadi et al., “On the transfer of disentangled representations in realistic settings,” in The Ninth International Conference on Learning Representations, Virtual, 2021.","apa":"Dittadi, A., Träuble, F., Locatello, F., Wüthrich, M., Agrawal, V., Winther, O., … Schölkopf, B. (2021). On the transfer of disentangled representations in realistic settings. In The Ninth International Conference on Learning Representations. Virtual.","mla":"Dittadi, Andrea, et al. “On the Transfer of Disentangled Representations in Realistic Settings.” The Ninth International Conference on Learning Representations, 2021.","short":"A. Dittadi, F. Träuble, F. Locatello, M. Wüthrich, V. Agrawal, O. Winther, S. Bauer, B. Schölkopf, in:, The Ninth International Conference on Learning Representations, 2021.","chicago":"Dittadi, Andrea, Frederik Träuble, Francesco Locatello, Manuel Wüthrich, Vaibhav Agrawal, Ole Winther, Stefan Bauer, and Bernhard Schölkopf. “On the Transfer of Disentangled Representations in Realistic Settings.” In The Ninth International Conference on Learning Representations, 2021."},"oa":1,"publication":"The Ninth International Conference on Learning Representations","article_processing_charge":"No","day":"04","month":"05","oa_version":"Preprint","date_updated":"2023-09-11T10:55:30Z","date_created":"2023-08-22T14:04:16Z","author":[{"first_name":"Andrea","last_name":"Dittadi","full_name":"Dittadi, Andrea"},{"first_name":"Frederik","last_name":"Träuble","full_name":"Träuble, Frederik"},{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"},{"last_name":"Wüthrich","first_name":"Manuel","full_name":"Wüthrich, Manuel"},{"full_name":"Agrawal, Vaibhav","last_name":"Agrawal","first_name":"Vaibhav"},{"last_name":"Winther","first_name":"Ole","full_name":"Winther, Ole"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"}],"department":[{"_id":"FrLo"}],"publication_status":"published","status":"public","title":"On the transfer of disentangled representations in realistic settings","_id":"14178","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","abstract":[{"text":"Learning meaningful representations that disentangle the underlying structure of the data generating process is considered to be of key importance in machine learning. While disentangled representations were found to be useful for diverse tasks such as abstract reasoning and fair classification, their scalability and real-world impact remain questionable. We introduce a new high-resolution dataset with 1M simulated images and over 1,800 annotated real-world images of the same setup. In contrast to previous work, this new dataset exhibits correlations, a complex underlying structure, and allows to evaluate transfer to unseen simulated and real-world settings where the encoder i) remains in distribution or ii) is out of distribution. We propose new architectures in order to scale disentangled representation learning to realistic high-resolution settings and conduct a large-scale empirical study of disentangled representations on this dataset. We observe that disentanglement is a good predictor for out-of-distribution (OOD) task performance.","lang":"eng"}],"type":"conference"},{"author":[{"last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"}],"oa_version":"Preprint","date_created":"2023-08-22T14:23:35Z","date_updated":"2023-09-12T07:04:44Z","_id":"14221","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","department":[{"_id":"FrLo"}],"publication_status":"submitted","status":"public","title":"Enforcing and discovering structure in machine learning","abstract":[{"text":"The world is structured in countless ways. It may be prudent to enforce corresponding structural properties to a learning algorithm's solution, such as incorporating prior beliefs, natural constraints, or causal structures. Doing so may translate to faster, more accurate, and more flexible models, which may directly relate to real-world impact. In this dissertation, we consider two different research areas that concern structuring a learning algorithm's solution: when the structure is known and when it has to be discovered.","lang":"eng"}],"extern":"1","type":"preprint","article_number":"2111.13693","doi":"10.48550/arXiv.2111.13693","date_published":"2021-11-26T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.13693"}],"oa":1,"external_id":{"arxiv":["2111.13693"]},"citation":{"ama":"Locatello F. Enforcing and discovering structure in machine learning. arXiv. doi:10.48550/arXiv.2111.13693","ista":"Locatello F. Enforcing and discovering structure in machine learning. arXiv, 2111.13693.","ieee":"F. Locatello, “Enforcing and discovering structure in machine learning,” arXiv. .","apa":"Locatello, F. (n.d.). Enforcing and discovering structure in machine learning. arXiv. https://doi.org/10.48550/arXiv.2111.13693","mla":"Locatello, Francesco. “Enforcing and Discovering Structure in Machine Learning.” ArXiv, 2111.13693, doi:10.48550/arXiv.2111.13693.","short":"F. Locatello, ArXiv (n.d.).","chicago":"Locatello, Francesco. “Enforcing and Discovering Structure in Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2111.13693."},"publication":"arXiv","article_processing_charge":"No","month":"11","day":"26"},{"day":"23","month":"11","article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.48550/ARXIV.2111.12171","date_published":"2021-11-23T00:00:00Z","publication":"arXiv","oa":1,"citation":{"ista":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv, 2111.12171.","apa":"Koval, I. (n.d.). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv. https://doi.org/10.48550/ARXIV.2111.12171","ieee":"I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” arXiv. .","ama":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv. doi:10.48550/ARXIV.2111.12171","chicago":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2111.12171.","mla":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” ArXiv, 2111.12171, doi:10.48550/ARXIV.2111.12171.","short":"I. Koval, ArXiv (n.d.)."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2111.12171","open_access":"1"}],"external_id":{"arxiv":["2111.12171"]},"abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral rigidity of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish rigidity for almost all of them.","lang":"eng"}],"article_number":"2111.12171","type":"preprint","date_created":"2023-09-06T08:35:43Z","date_updated":"2023-09-15T06:44:00Z","oa_version":"Preprint","author":[{"full_name":"Koval, Illya","last_name":"Koval","first_name":"Illya","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e"}],"status":"public","title":"Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse","publication_status":"submitted","department":[{"_id":"GradSch"}],"_id":"14278","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021"},{"abstract":[{"lang":"eng","text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","file":[{"file_name":"toman_th_final.pdf","access_level":"open_access","creator":"vtoman","content_type":"application/pdf","file_size":2915234,"file_id":"10225","relation":"main_file","date_updated":"2021-11-08T14:12:22Z","date_created":"2021-11-08T14:12:22Z","checksum":"4f412a1ee60952221b499a4b1268df35"},{"file_size":8616056,"content_type":"application/zip","creator":"vtoman","file_name":"toman_thesis.zip","access_level":"closed","date_created":"2021-11-08T14:12:46Z","date_updated":"2021-11-09T09:00:50Z","checksum":"9584943f99127be2dd2963f6784c37d4","relation":"source_file","file_id":"10226"}],"oa_version":"Published Version","ddc":["000"],"status":"public","title":"Improved verification techniques for concurrent systems","_id":"10199","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","article_processing_charge":"No","day":"31","keyword":["concurrency","verification","model checking"],"date_published":"2021-10-31T00:00:00Z","page":"166","citation":{"mla":"Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","apa":"Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199"},"ec_funded":1,"file_date_updated":"2021-11-09T09:00:50Z","date_created":"2021-10-29T20:09:01Z","date_updated":"2023-09-19T09:59:54Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10190"},{"id":"10191","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9987"},{"id":"141","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Toman, Viktor","last_name":"Toman","first_name":"Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","year":"2021","publication_identifier":{"issn":["2663-337X"]},"month":"10","language":[{"iso":"eng"}],"supervisor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"SSU"}],"doi":"10.15479/at:ista:10199","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"oa":1},{"publication_identifier":{"eissn":["2041-1723"]},"month":"11","doi":"10.1038/s41467-021-27258-9","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000724450600023"]},"isi":1,"quality_controlled":"1","file_date_updated":"2021-12-06T07:47:11Z","article_number":"6972","related_material":{"record":[{"relation":"research_data","status":"public","id":"13063"}]},"author":[{"full_name":"Patxot, Marion","first_name":"Marion","last_name":"Patxot"},{"full_name":"Trejo Banos, Daniel","last_name":"Trejo Banos","first_name":"Daniel"},{"last_name":"Kousathanas","first_name":"Athanasios","full_name":"Kousathanas, Athanasios"},{"full_name":"Orliac, Etienne J","last_name":"Orliac","first_name":"Etienne J"},{"full_name":"Ojavee, Sven E","last_name":"Ojavee","first_name":"Sven E"},{"first_name":"Gerhard","last_name":"Moser","full_name":"Moser, Gerhard"},{"full_name":"Sidorenko, Julia","last_name":"Sidorenko","first_name":"Julia"},{"first_name":"Zoltan","last_name":"Kutalik","full_name":"Kutalik, Zoltan"},{"last_name":"Magi","first_name":"Reedik","full_name":"Magi, Reedik"},{"full_name":"Visscher, Peter M","first_name":"Peter M","last_name":"Visscher"},{"first_name":"Lars","last_name":"Ronnegard","full_name":"Ronnegard, Lars"},{"orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"}],"volume":12,"date_updated":"2023-09-26T10:36:14Z","date_created":"2020-09-17T10:52:38Z","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). L.R. acknowledges funding from the Kjell & Märta Beijer Foundation (Stockholm, Sweden). We also would like to acknowledge Simone Rubinacci, Oliver Delanau, Alexander Terenin, Eleonora Porcu, and Mike Goddard for their useful comments and suggestions.","year":"2021","publisher":"Springer Nature","department":[{"_id":"MaRo"}],"publication_status":"published","article_processing_charge":"No","has_accepted_license":"1","day":"30","scopus_import":"1","date_published":"2021-11-30T00:00:00Z","citation":{"short":"M. Patxot, D. Trejo Banos, A. Kousathanas, E.J. Orliac, S.E. Ojavee, G. Moser, J. Sidorenko, Z. Kutalik, R. Magi, P.M. Visscher, L. Ronnegard, M.R. Robinson, Nature Communications 12 (2021).","mla":"Patxot, Marion, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” Nature Communications, vol. 12, no. 1, 6972, Springer Nature, 2021, doi:10.1038/s41467-021-27258-9.","chicago":"Patxot, Marion, Daniel Trejo Banos, Athanasios Kousathanas, Etienne J Orliac, Sven E Ojavee, Gerhard Moser, Julia Sidorenko, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-27258-9.","ama":"Patxot M, Trejo Banos D, Kousathanas A, et al. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-27258-9","apa":"Patxot, M., Trejo Banos, D., Kousathanas, A., Orliac, E. J., Ojavee, S. E., Moser, G., … Robinson, M. R. (2021). Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-27258-9","ieee":"M. Patxot et al., “Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.","ista":"Patxot M, Trejo Banos D, Kousathanas A, Orliac EJ, Ojavee SE, Moser G, Sidorenko J, Kutalik Z, Magi R, Visscher PM, Ronnegard L, Robinson MR. 2021. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 12(1), 6972."},"publication":"Nature Communications","article_type":"original","issue":"1","abstract":[{"text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only ≤10% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data.","lang":"eng"}],"type":"journal_article","file":[{"creator":"cchlebak","file_size":6519771,"content_type":"application/pdf","file_name":"2021_NatComm_Paxtot.pdf","access_level":"open_access","date_updated":"2021-12-06T07:47:11Z","date_created":"2021-12-06T07:47:11Z","success":1,"checksum":"384681be17aff902c149a48f52d13d4f","file_id":"10419","relation":"main_file"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8429","intvolume":" 12","ddc":["610"],"status":"public","title":"Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits"},{"author":[{"full_name":"Foerster, Klaus-Tycho","last_name":"Foerster","first_name":"Klaus-Tycho"},{"full_name":"Korhonen, Janne","first_name":"Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"related_material":{"record":[{"status":"public","relation":"extended_version","id":"10855"}]},"date_updated":"2023-09-26T10:40:55Z","date_created":"2022-03-18T08:48:41Z","acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","year":"2021","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"ec_funded":1,"conference":{"name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems","end_date":"2021-06-18","start_date":"2021-06-14","location":"Virtual, Online"},"doi":"10.1145/3410220.3453923","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["2005.07637"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"quality_controlled":"1","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"},{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"}],"month":"05","publication_identifier":{"isbn":["9781450380720"]},"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10854","title":"Input-dynamic distributed algorithms for communication networks","status":"public","abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task."}],"type":"conference","date_published":"2021-05-01T00:00:00Z","publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","citation":{"mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 71–72. Association for Computing Machinery, 2021. https://doi.org/10.1145/3410220.3453923.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association for Computing Machinery. https://doi.org/10.1145/3410220.3453923","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72."},"page":"71-72","day":"01","article_processing_charge":"No","scopus_import":"1"},{"doi":"10.1145/3447384","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"oa":1,"external_id":{"arxiv":["2005.07637"]},"quality_controlled":"1","project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"},{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"month":"03","publication_identifier":{"issn":["2476-1249"]},"author":[{"full_name":"Foerster, Klaus-Tycho","last_name":"Foerster","first_name":"Klaus-Tycho"},{"first_name":"Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne"},{"last_name":"Paz","first_name":"Ami","full_name":"Paz, Ami"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","first_name":"Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"related_material":{"record":[{"id":"10854","status":"public","relation":"shorter_version"}]},"date_created":"2022-03-18T09:10:27Z","date_updated":"2023-09-26T10:40:55Z","volume":5,"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","year":"2021","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"ec_funded":1,"date_published":"2021-03-01T00:00:00Z","publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","citation":{"mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:10.1145/3447384.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery, 2021. https://doi.org/10.1145/3447384.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery. https://doi.org/10.1145/3447384"},"article_type":"original","page":"1-33","day":"01","article_processing_charge":"No","scopus_import":"1","keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"oa_version":"Preprint","_id":"10855","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Input-dynamic distributed algorithms for communication networks","intvolume":" 5","abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques."}],"issue":"1","type":"journal_article"},{"abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"issue":"8","type":"journal_article","oa_version":"Preprint","_id":"9293","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Algorithms and conditional lower bounds for planning problems","intvolume":" 297","day":"16","article_processing_charge":"No","scopus_import":"1","date_published":"2021-03-16T00:00:00Z","publication":"Artificial Intelligence","citation":{"mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 2021;297(8). doi:10.1016/j.artint.2021.103499","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2021.103499","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021."},"article_type":"original","article_number":"103499","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Dvořák, Wolfgang","last_name":"Dvořák","first_name":"Wolfgang"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"35"}]},"date_updated":"2023-09-26T10:41:42Z","date_created":"2021-03-28T22:01:40Z","volume":297,"year":"2021","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Elsevier","month":"03","publication_identifier":{"issn":["0004-3702"]},"doi":"10.1016/j.artint.2021.103499","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"oa":1,"external_id":{"isi":["000657537500003"],"arxiv":["1804.07031"]},"isi":1,"quality_controlled":"1"},{"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"main_file_link":[{"url":"https://doi.org/10.5061/dryad.sqv9s4n51","open_access":"1"}],"citation":{"ista":"Robinson MR. 2021. Probabilistic inference of the genetic architecture of functional enrichment of complex traits, Dryad, 10.5061/dryad.sqv9s4n51.","ieee":"M. R. Robinson, “Probabilistic inference of the genetic architecture of functional enrichment of complex traits.” Dryad, 2021.","apa":"Robinson, M. R. (2021). Probabilistic inference of the genetic architecture of functional enrichment of complex traits. Dryad. https://doi.org/10.5061/dryad.sqv9s4n51","ama":"Robinson MR. Probabilistic inference of the genetic architecture of functional enrichment of complex traits. 2021. doi:10.5061/dryad.sqv9s4n51","chicago":"Robinson, Matthew Richard. “Probabilistic Inference of the Genetic Architecture of Functional Enrichment of Complex Traits.” Dryad, 2021. https://doi.org/10.5061/dryad.sqv9s4n51.","mla":"Robinson, Matthew Richard. Probabilistic Inference of the Genetic Architecture of Functional Enrichment of Complex Traits. Dryad, 2021, doi:10.5061/dryad.sqv9s4n51.","short":"M.R. Robinson, (2021)."},"date_published":"2021-11-04T00:00:00Z","doi":"10.5061/dryad.sqv9s4n51","article_processing_charge":"No","month":"11","day":"04","_id":"13063","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Dryad","department":[{"_id":"MaRo"}],"ddc":["570"],"status":"public","title":"Probabilistic inference of the genetic architecture of functional enrichment of complex traits","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8429"}],"link":[{"url":"https://github.com/medical-genomics-group/gmrm","relation":"software"}]},"author":[{"full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813"}],"oa_version":"Published Version","date_updated":"2023-09-26T10:36:15Z","date_created":"2023-05-23T16:20:16Z","type":"research_data_reference","abstract":[{"lang":"eng","text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only $\\leq$ 10\\% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32-44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having >95% probability of contributing >0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data."}],"license":"https://creativecommons.org/publicdomain/zero/1.0/"},{"month":"08","publication_identifier":{"issn":["1385-8947"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.cej.2021.129374","quality_controlled":"1","isi":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"oa":1,"external_id":{"isi":["000655672000005"]},"main_file_link":[{"open_access":"1","url":"https://ddd.uab.cat/record/271949"}],"ec_funded":1,"article_number":"129374","date_updated":"2023-09-27T07:36:29Z","date_created":"2021-04-04T22:01:20Z","volume":418,"author":[{"last_name":"Zhang","first_name":"Yu","full_name":"Zhang, Yu"},{"full_name":"Xing, Congcong","last_name":"Xing","first_name":"Congcong"},{"first_name":"Yu","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu"},{"full_name":"Li, Mengyao","last_name":"Li","first_name":"Mengyao"},{"first_name":"Ke","last_name":"Xiao","full_name":"Xiao, Ke"},{"full_name":"Guardia, Pablo","last_name":"Guardia","first_name":"Pablo"},{"full_name":"Lee, Seungho","orcid":"0000-0002-6962-8598","id":"BB243B88-D767-11E9-B658-BC13E6697425","last_name":"Lee","first_name":"Seungho"},{"first_name":"Xu","last_name":"Han","full_name":"Han, Xu"},{"full_name":"Moghaddam, Ahmad","last_name":"Moghaddam","first_name":"Ahmad"},{"full_name":"Roa, Joan J","last_name":"Roa","first_name":"Joan J"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"last_name":"Pan","first_name":"Kai","full_name":"Pan, Kai"},{"full_name":"Prato, Mirko","first_name":"Mirko","last_name":"Prato"},{"full_name":"Xie, Ying","last_name":"Xie","first_name":"Ying"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"MaIb"}],"year":"2021","acknowledgement":"This work was supported by the European Regional Development Funds and by the Generalitat de Catalunya through the project 2017SGR1246. Y.Z, C.X, M.L, K.X and X.H thank the China Scholarship Council for the scholarship support. MI acknowledges financial support from IST Austria. YL acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. ICN2\r\nacknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA Program/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science PhD program.","day":"15","article_processing_charge":"No","scopus_import":"1","date_published":"2021-08-15T00:00:00Z","article_type":"original","publication":"Chemical Engineering Journal","citation":{"chicago":"Zhang, Yu, Congcong Xing, Yu Liu, Mengyao Li, Ke Xiao, Pablo Guardia, Seungho Lee, et al. “Influence of Copper Telluride Nanodomains on the Transport Properties of N-Type Bismuth Telluride.” Chemical Engineering Journal. Elsevier, 2021. https://doi.org/10.1016/j.cej.2021.129374.","short":"Y. Zhang, C. Xing, Y. Liu, M. Li, K. Xiao, P. Guardia, S. Lee, X. Han, A. Moghaddam, J.J. Roa, J. Arbiol, M. Ibáñez, K. Pan, M. Prato, Y. Xie, A. Cabot, Chemical Engineering Journal 418 (2021).","mla":"Zhang, Yu, et al. “Influence of Copper Telluride Nanodomains on the Transport Properties of N-Type Bismuth Telluride.” Chemical Engineering Journal, vol. 418, no. 8, 129374, Elsevier, 2021, doi:10.1016/j.cej.2021.129374.","ieee":"Y. Zhang et al., “Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride,” Chemical Engineering Journal, vol. 418, no. 8. Elsevier, 2021.","apa":"Zhang, Y., Xing, C., Liu, Y., Li, M., Xiao, K., Guardia, P., … Cabot, A. (2021). Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride. Chemical Engineering Journal. Elsevier. https://doi.org/10.1016/j.cej.2021.129374","ista":"Zhang Y, Xing C, Liu Y, Li M, Xiao K, Guardia P, Lee S, Han X, Moghaddam A, Roa JJ, Arbiol J, Ibáñez M, Pan K, Prato M, Xie Y, Cabot A. 2021. Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride. Chemical Engineering Journal. 418(8), 129374.","ama":"Zhang Y, Xing C, Liu Y, et al. Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride. Chemical Engineering Journal. 2021;418(8). doi:10.1016/j.cej.2021.129374"},"abstract":[{"text":"The high processing cost, poor mechanical properties and moderate performance of Bi2Te3–based alloys used in thermoelectric devices limit the cost-effectiveness of this energy conversion technology. Towards solving these current challenges, in the present work, we detail a low temperature solution-based approach to produce Bi2Te3-Cu2-xTe nanocomposites with improved thermoelectric performance. Our approach consists in combining proper ratios of colloidal nanoparticles and to consolidate the resulting mixture into nanocomposites using a hot press. The transport properties of the nanocomposites are characterized and compared with those of pure Bi2Te3 nanomaterials obtained following the same procedure. In contrast with most previous works, the presence of Cu2-xTe nanodomains does not result in a significant reduction of the lattice thermal conductivity of the reference Bi2Te3 nanomaterial, which is already very low. However, the introduction of Cu2-xTe yields a nearly threefold increase of the power factor associated to a simultaneous increase of the Seebeck coefficient and electrical conductivity at temperatures above 400 K. Taking into account the band alignment of the two materials, we rationalize this increase by considering that Cu2-xTe nanostructures, with a relatively low electron affinity, are able to inject electrons into Bi2Te3, enhancing in this way its electrical conductivity. The simultaneous increase of the Seebeck coefficient is related to the energy filtering of charge carriers at energy barriers within Bi2Te3 domains associated with the accumulation of electrons in regions nearby a Cu2-xTe/Bi2Te3 heterojunction. Overall, with the incorporation of a proper amount of Cu2-xTe nanoparticles, we demonstrate a 250% improvement of the thermoelectric figure of merit of Bi2Te3.","lang":"eng"}],"issue":"8","type":"journal_article","oa_version":"Submitted Version","title":"Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride","status":"public","intvolume":" 418","_id":"9304","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"doi":"10.1016/j.neuron.2021.05.025","quality_controlled":"1","isi":1,"project":[{"grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"external_id":{"isi":["000692851900010"],"pmid":["34171291"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.neuron.2021.05.025","open_access":"1"}],"month":"08","publication_identifier":{"issn":["0896-6273"],"eissn":["1097-4199"]},"date_created":"2021-08-06T09:08:25Z","date_updated":"2023-09-27T07:46:09Z","volume":109,"author":[{"full_name":"Baldwin, Katherine T.","first_name":"Katherine T.","last_name":"Baldwin"},{"full_name":"Tan, Christabel X.","first_name":"Christabel X.","last_name":"Tan"},{"full_name":"Strader, Samuel T.","last_name":"Strader","first_name":"Samuel T."},{"first_name":"Changyu","last_name":"Jiang","full_name":"Jiang, Changyu"},{"first_name":"Justin T.","last_name":"Savage","full_name":"Savage, Justin T."},{"full_name":"Elorza-Vidal, Xabier","last_name":"Elorza-Vidal","first_name":"Xabier"},{"full_name":"Contreras, Ximena","first_name":"Ximena","last_name":"Contreras","id":"475990FE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rülicke, Thomas","first_name":"Thomas","last_name":"Rülicke"},{"full_name":"Hippenmeyer, Simon","first_name":"Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061"},{"full_name":"Estévez, Raúl","last_name":"Estévez","first_name":"Raúl"},{"first_name":"Ru-Rong","last_name":"Ji","full_name":"Ji, Ru-Rong"},{"last_name":"Eroglu","first_name":"Cagla","full_name":"Eroglu, Cagla"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"SiHi"}],"year":"2021","acknowledgement":"This work was supported by the National Institutes of Health (R01 DA047258 and R01 NS102237 to C.E., F32 NS100392 to K.T.B.) and the Holland-Trice Brain Research Award (to C.E.). K.T.B. was supported by postdoctoral fellowships from the Foerster-Bernstein Family and The Hartwell Foundation. The Hippenmeyer lab was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovations program (725780 LinPro) to S.H. R.E. was supported by Ministerio de Ciencia y Tecnología (RTI2018-093493-B-I00). We thank the Duke Light Microscopy Core Facility, the Duke Transgenic Mouse Facility, Dr. U. Schulte for assistance with proteomic experiments, and Dr. D. Silver for critical review of the manuscript. Cartoon elements of figure panels were created using BioRender.com.","pmid":1,"ec_funded":1,"date_published":"2021-08-04T00:00:00Z","article_type":"original","page":"2427-2442.e10","publication":"Neuron","citation":{"mla":"Baldwin, Katherine T., et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” Neuron, vol. 109, no. 15, Elsevier, 2021, p. 2427–2442.e10, doi:10.1016/j.neuron.2021.05.025.","short":"K.T. Baldwin, C.X. Tan, S.T. Strader, C. Jiang, J.T. Savage, X. Elorza-Vidal, X. Contreras, T. Rülicke, S. Hippenmeyer, R. Estévez, R.-R. Ji, C. Eroglu, Neuron 109 (2021) 2427–2442.e10.","chicago":"Baldwin, Katherine T., Christabel X. Tan, Samuel T. Strader, Changyu Jiang, Justin T. Savage, Xabier Elorza-Vidal, Ximena Contreras, et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” Neuron. Elsevier, 2021. https://doi.org/10.1016/j.neuron.2021.05.025.","ama":"Baldwin KT, Tan CX, Strader ST, et al. HepaCAM controls astrocyte self-organization and coupling. Neuron. 2021;109(15):2427-2442.e10. doi:10.1016/j.neuron.2021.05.025","ista":"Baldwin KT, Tan CX, Strader ST, Jiang C, Savage JT, Elorza-Vidal X, Contreras X, Rülicke T, Hippenmeyer S, Estévez R, Ji R-R, Eroglu C. 2021. HepaCAM controls astrocyte self-organization and coupling. Neuron. 109(15), 2427–2442.e10.","ieee":"K. T. Baldwin et al., “HepaCAM controls astrocyte self-organization and coupling,” Neuron, vol. 109, no. 15. Elsevier, p. 2427–2442.e10, 2021.","apa":"Baldwin, K. T., Tan, C. X., Strader, S. T., Jiang, C., Savage, J. T., Elorza-Vidal, X., … Eroglu, C. (2021). HepaCAM controls astrocyte self-organization and coupling. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2021.05.025"},"day":"04","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","status":"public","title":"HepaCAM controls astrocyte self-organization and coupling","intvolume":" 109","_id":"9793","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Astrocytes extensively infiltrate the neuropil to regulate critical aspects of synaptic development and function. This process is regulated by transcellular interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes coordinate developmental processes among one another to parse out the synaptic neuropil and form non-overlapping territories is unknown. Here we identify a molecular mechanism regulating astrocyte-astrocyte interactions during development to coordinate astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked, astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for territory and morphological complexity in the developing mouse cortex. Furthermore, conditional deletion of Hepacam from developing astrocytes significantly impairs gap junction coupling between astrocytes and disrupts the balance between synaptic excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy with subcortical cysts in humans. Therefore, our findings suggest that disruption of astrocyte self-organization mechanisms could be an underlying cause of neural pathology."}],"issue":"15","type":"journal_article"},{"date_published":"2021-07-01T00:00:00Z","citation":{"apa":"Zhang, Y., Xing, C., Liu, Y., Spadaro, M. C., Wang, X., Li, M., … Cabot, A. (2021). Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS. Nano Energy. Elsevier. https://doi.org/10.1016/j.nanoen.2021.105991","ieee":"Y. Zhang et al., “Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS,” Nano Energy, vol. 85, no. 7. Elsevier, 2021.","ista":"Zhang Y, Xing C, Liu Y, Spadaro MC, Wang X, Li M, Xiao K, Zhang T, Guardia P, Lim KH, Moghaddam AO, Llorca J, Arbiol J, Ibáñez M, Cabot A. 2021. Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS. Nano Energy. 85(7), 105991.","ama":"Zhang Y, Xing C, Liu Y, et al. Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS. Nano Energy. 2021;85(7). doi:10.1016/j.nanoen.2021.105991","chicago":"Zhang, Yu, Congcong Xing, Yu Liu, Maria Chiara Spadaro, Xiang Wang, Mengyao Li, Ke Xiao, et al. “Doping-Mediated Stabilization of Copper Vacancies to Promote Thermoelectric Properties of Cu2-XS.” Nano Energy. Elsevier, 2021. https://doi.org/10.1016/j.nanoen.2021.105991.","short":"Y. Zhang, C. Xing, Y. Liu, M.C. Spadaro, X. Wang, M. Li, K. Xiao, T. Zhang, P. Guardia, K.H. Lim, A.O. Moghaddam, J. Llorca, J. Arbiol, M. Ibáñez, A. Cabot, Nano Energy 85 (2021).","mla":"Zhang, Yu, et al. “Doping-Mediated Stabilization of Copper Vacancies to Promote Thermoelectric Properties of Cu2-XS.” Nano Energy, vol. 85, no. 7, 105991, Elsevier, 2021, doi:10.1016/j.nanoen.2021.105991."},"publication":"Nano Energy","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9305","intvolume":" 85","title":"Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS","status":"public","issue":"7","abstract":[{"lang":"eng","text":"Copper chalcogenides are outstanding thermoelectric materials for applications in the medium-high temperature range. Among different chalcogenides, while Cu2−xSe is characterized by higher thermoelectric figures of merit, Cu2−xS provides advantages in terms of low cost and element abundance. In the present work, we investigate the effect of different dopants to enhance the Cu2−xS performance and also its thermal stability. Among the tested options, Pb-doped Cu2−xS shows the highest improvement in stability against sulfur volatilization. Additionally, Pb incorporation allows tuning charge carrier concentration, which enables a significant improvement of the power factor. We demonstrate here that the introduction of an optimal additive amount of just 0.3% results in a threefold increase of the power factor in the middle-temperature range (500–800 K) and a record dimensionless thermoelectric figure of merit above 2 at 880 K."}],"type":"journal_article","doi":"10.1016/j.nanoen.2021.105991","language":[{"iso":"eng"}],"external_id":{"isi":["000663442200004"]},"oa":1,"main_file_link":[{"url":"https://ddd.uab.cat/record/271947","open_access":"1"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["2211-2855"]},"month":"07","author":[{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"first_name":"Congcong","last_name":"Xing","full_name":"Xing, Congcong"},{"full_name":"Liu, Yu","orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","first_name":"Yu"},{"full_name":"Spadaro, Maria Chiara","first_name":"Maria Chiara","last_name":"Spadaro"},{"full_name":"Wang, Xiang","first_name":"Xiang","last_name":"Wang"},{"full_name":"Li, Mengyao","last_name":"Li","first_name":"Mengyao"},{"full_name":"Xiao, Ke","first_name":"Ke","last_name":"Xiao"},{"full_name":"Zhang, Ting","first_name":"Ting","last_name":"Zhang"},{"first_name":"Pablo","last_name":"Guardia","full_name":"Guardia, Pablo"},{"full_name":"Lim, Khak Ho","first_name":"Khak Ho","last_name":"Lim"},{"full_name":"Moghaddam, Ahmad Ostovari","last_name":"Moghaddam","first_name":"Ahmad Ostovari"},{"last_name":"Llorca","first_name":"Jordi","full_name":"Llorca, Jordi"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"volume":85,"date_created":"2021-04-04T22:01:21Z","date_updated":"2023-09-27T07:41:00Z","year":"2021","acknowledgement":"This work was supported by the European Regional Development Fund and by the Spanish Ministerio de Economía y Competitividad through the project SEHTOP (ENE2016-77798-C4-3-R). MI acknowledges financial support from IST Austria. YL acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. YZ, CX, XW, KX and TZ thank the China Scholarship Council for the scholarship support. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA program/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science Ph.D. program. M.C.S. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754510 (PROBIST) and the Severo Ochoa programme. P.G. acknowledges financial support from the Spanish government (MICIU) through the RTI2018-102006-J-I00 project and the Catalan Agency of Competitiveness (ACCIO) through the TecnioSpring+ Marie Sklodowska-Curie action TECSPR16-1-0082. YZ and CX contributed equally to this work.","publisher":"Elsevier","department":[{"_id":"MaIb"}],"publication_status":"published","ec_funded":1,"article_number":"105991"},{"date_published":"2021-07-01T00:00:00Z","article_type":"original","publication":"Cold Spring Harbor Perspectives in Biology","citation":{"short":"N. Cavallari, C. Artner, E. Benková, Cold Spring Harbor Perspectives in Biology 13 (2021).","mla":"Cavallari, Nicola, et al. “Auxin-Regulated Lateral Root Organogenesis.” Cold Spring Harbor Perspectives in Biology, vol. 13, no. 7, a039941, Cold Spring Harbor Laboratory Press, 2021, doi:10.1101/cshperspect.a039941.","chicago":"Cavallari, Nicola, Christina Artner, and Eva Benková. “Auxin-Regulated Lateral Root Organogenesis.” Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory Press, 2021. https://doi.org/10.1101/cshperspect.a039941.","ama":"Cavallari N, Artner C, Benková E. Auxin-regulated lateral root organogenesis. Cold Spring Harbor Perspectives in Biology. 2021;13(7). doi:10.1101/cshperspect.a039941","ieee":"N. Cavallari, C. Artner, and E. Benková, “Auxin-regulated lateral root organogenesis,” Cold Spring Harbor Perspectives in Biology, vol. 13, no. 7. Cold Spring Harbor Laboratory Press, 2021.","apa":"Cavallari, N., Artner, C., & Benková, E. (2021). Auxin-regulated lateral root organogenesis. Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/cshperspect.a039941","ista":"Cavallari N, Artner C, Benková E. 2021. Auxin-regulated lateral root organogenesis. Cold Spring Harbor Perspectives in Biology. 13(7), a039941."},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","status":"public","title":"Auxin-regulated lateral root organogenesis","intvolume":" 13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9212","abstract":[{"text":"Plant fitness is largely dependent on the root, the underground organ, which, besides its anchoring function, supplies the plant body with water and all nutrients necessary for growth and development. To exploit the soil effectively, roots must constantly integrate environmental signals and react through adjustment of growth and development. Important components of the root management strategy involve a rapid modulation of the root growth kinetics and growth direction, as well as an increase of the root system radius through formation of lateral roots (LRs). At the molecular level, such a fascinating growth and developmental flexibility of root organ requires regulatory networks that guarantee stability of the developmental program but also allows integration of various environmental inputs. The plant hormone auxin is one of the principal endogenous regulators of root system architecture by controlling primary root growth and formation of LR. In this review, we discuss recent progress in understanding molecular networks where auxin is one of the main players shaping the root system and acting as mediator between endogenous cues and environmental factors.","lang":"eng"}],"issue":"7","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1101/cshperspect.a039941","quality_controlled":"1","isi":1,"project":[{"name":"Hormonal regulation of plant adaptive responses to environmental signals","_id":"2685A872-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000692069100001"],"pmid":["33558367"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/cshperspect.a039941"}],"oa":1,"month":"07","publication_identifier":{"issn":["1943-0264"]},"date_created":"2021-03-01T10:08:32Z","date_updated":"2023-09-27T06:44:06Z","volume":13,"author":[{"full_name":"Cavallari, Nicola","id":"457160E6-F248-11E8-B48F-1D18A9856A87","first_name":"Nicola","last_name":"Cavallari"},{"id":"45DF286A-F248-11E8-B48F-1D18A9856A87","first_name":"Christina","last_name":"Artner","full_name":"Artner, Christina"},{"full_name":"Benková, Eva","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"}],"publication_status":"published","publisher":"Cold Spring Harbor Laboratory Press","department":[{"_id":"EvBe"}],"acknowledgement":"We apologize to all the authors whose scientific work could not be cited and discussed because of space restrictions. We thank Dr. Inge Verstraeten (ISTAustria) and Dr. Juan Carlos Montesinos-Lopez (ETH Zürich) for helpful suggestions. This work was supported by the DOC Fellowship Programme of the Austrian Academy of Sciences (25008) to C.A.","year":"2021","pmid":1,"article_number":"a039941"},{"abstract":[{"lang":"eng","text":"Chronic psychological stress is one of the most important triggers and environmental risk factors for neuropsychiatric disorders. Chronic stress can influence all organs via the secretion of stress hormones, including glucocorticoids by the adrenal glands, which coordinate the stress response across the body. In the brain, glucocorticoid receptors (GR) are expressed by various cell types including microglia, which are its resident immune cells regulating stress-induced inflammatory processes. To study the roles of microglial GR under normal homeostatic conditions and following chronic stress, we generated a mouse model in which the GR gene is depleted in microglia specifically at adulthood to prevent developmental confounds. We first confirmed that microglia were depleted in GR in our model in males and females among the cingulate cortex and the hippocampus, both stress-sensitive brain regions. Then, cohorts of microglial-GR depleted and wild-type (WT) adult female mice were housed for 3 weeks in a standard or stressful condition, using a chronic unpredictable mild stress (CUMS) paradigm. CUMS induced stress-related behavior in both microglial-GR depleted and WT animals as demonstrated by a decrease of both saccharine preference and progressive ratio breakpoint. Nevertheless, the hippocampal microglial and neural mechanisms underlying the adaptation to stress occurred differently between the two genotypes. Upon CUMS exposure, microglial morphology was altered in the WT controls, without any apparent effect in microglial-GR depleted mice. Furthermore, in the standard environment condition, GR depleted-microglia showed increased expression of pro-inflammatory genes, and genes involved in microglial homeostatic functions (such as Trem2, Cx3cr1 and Mertk). On the contrary, in CUMS condition, GR depleted-microglia showed reduced expression levels of pro-inflammatory genes and increased neuroprotective as well as anti-inflammatory genes compared to WT-microglia. Moreover, in microglial-GR depleted mice, but not in WT mice, CUMS led to a significant reduction of CA1 long-term potentiation and paired-pulse ratio. Lastly, differences in adult hippocampal neurogenesis were observed between the genotypes during normal homeostatic conditions, with microglial-GR deficiency increasing the formation of newborn neurons in the dentate gyrus subgranular zone independently from stress exposure. Together, these findings indicate that, although the deletion of microglial GR did not prevent the animal’s ability to respond to stress, it contributed to modulating hippocampal functions in both standard and stressful conditions, notably by shaping the microglial response to chronic stress."}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 97","title":"Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice","status":"public","_id":"9953","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2021-10-01T00:00:00Z","page":"423-439","article_type":"original","citation":{"mla":"Picard, Katherine, et al. “Microglial-Glucocorticoid Receptor Depletion Alters the Response of Hippocampal Microglia and Neurons in a Chronic Unpredictable Mild Stress Paradigm in Female Mice.” Brain, Behavior, and Immunity, vol. 97, Elsevier, 2021, pp. 423–39, doi:10.1016/j.bbi.2021.07.022.","short":"K. Picard, K. Bisht, S. Poggini, S. Garofalo, M.T. Golia, B. Basilico, F. Abdallah, N. Ciano Albanese, I. Amrein, N. Vernoux, K. Sharma, C.W. Hui, J. C. Savage, C. Limatola, D. Ragozzino, L. Maggi, I. Branchi, M.È. Tremblay, Brain, Behavior, and Immunity 97 (2021) 423–439.","chicago":"Picard, Katherine, Kanchan Bisht, Silvia Poggini, Stefano Garofalo, Maria Teresa Golia, Bernadette Basilico, Fatima Abdallah, et al. “Microglial-Glucocorticoid Receptor Depletion Alters the Response of Hippocampal Microglia and Neurons in a Chronic Unpredictable Mild Stress Paradigm in Female Mice.” Brain, Behavior, and Immunity. Elsevier, 2021. https://doi.org/10.1016/j.bbi.2021.07.022.","ama":"Picard K, Bisht K, Poggini S, et al. Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior, and Immunity. 2021;97:423-439. doi:10.1016/j.bbi.2021.07.022","ista":"Picard K, Bisht K, Poggini S, Garofalo S, Golia MT, Basilico B, Abdallah F, Ciano Albanese N, Amrein I, Vernoux N, Sharma K, Hui CW, C. Savage J, Limatola C, Ragozzino D, Maggi L, Branchi I, Tremblay MÈ. 2021. Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior, and Immunity. 97, 423–439.","ieee":"K. Picard et al., “Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice,” Brain, Behavior, and Immunity, vol. 97. Elsevier, pp. 423–439, 2021.","apa":"Picard, K., Bisht, K., Poggini, S., Garofalo, S., Golia, M. T., Basilico, B., … Tremblay, M. È. (2021). Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior, and Immunity. Elsevier. https://doi.org/10.1016/j.bbi.2021.07.022"},"publication":"Brain, Behavior, and Immunity","volume":97,"date_updated":"2023-10-03T09:49:18Z","date_created":"2021-08-22T22:01:21Z","author":[{"first_name":"Katherine","last_name":"Picard","full_name":"Picard, Katherine"},{"first_name":"Kanchan","last_name":"Bisht","full_name":"Bisht, Kanchan"},{"full_name":"Poggini, Silvia","first_name":"Silvia","last_name":"Poggini"},{"full_name":"Garofalo, Stefano","first_name":"Stefano","last_name":"Garofalo"},{"last_name":"Golia","first_name":"Maria Teresa","full_name":"Golia, Maria Teresa"},{"full_name":"Basilico, Bernadette","id":"36035796-5ACA-11E9-A75E-7AF2E5697425","orcid":"0000-0003-1843-3173","first_name":"Bernadette","last_name":"Basilico"},{"full_name":"Abdallah, Fatima","first_name":"Fatima","last_name":"Abdallah"},{"full_name":"Ciano Albanese, Naomi","last_name":"Ciano Albanese","first_name":"Naomi"},{"full_name":"Amrein, Irmgard","first_name":"Irmgard","last_name":"Amrein"},{"full_name":"Vernoux, Nathalie","first_name":"Nathalie","last_name":"Vernoux"},{"first_name":"Kaushik","last_name":"Sharma","full_name":"Sharma, Kaushik"},{"full_name":"Hui, Chin Wai","first_name":"Chin Wai","last_name":"Hui"},{"first_name":"Julie","last_name":"C. Savage","full_name":"C. Savage, Julie"},{"first_name":"Cristina","last_name":"Limatola","full_name":"Limatola, Cristina"},{"first_name":"Davide","last_name":"Ragozzino","full_name":"Ragozzino, Davide"},{"full_name":"Maggi, Laura","first_name":"Laura","last_name":"Maggi"},{"full_name":"Branchi, Igor","last_name":"Branchi","first_name":"Igor"},{"first_name":"Marie Ève","last_name":"Tremblay","full_name":"Tremblay, Marie Ève"}],"department":[{"_id":"GaNo"}],"publisher":"Elsevier","publication_status":"published","pmid":1,"acknowledgement":"We acknowledge that Université Laval stands on the traditional and unceded land of the Huron-Wendat peoples; and that the University of Victoria exists on the territory of the Lekwungen peoples and that the Songhees, Esquimalt and WSÁNEÆ peoples have relationships to this land. We thank Emmanuel Planel for the access to the epifluorescence microscope and Julie-Christine Lévesque at the Bioimaging Platform of CRCHU de Québec-Université Laval for technical assistance. We also thank the Centre for Advanced Materials and Related Technology for the access to the confocal microscope with Airyscan. K.P. was supported by a doctoral scholarship from Fonds de Recherche du Québec – Santé (FRQS), an excellence award from Fondation du CHU de Québec, as well as from Centre Thématique de Recherche en Neurosciences and from Fondation Famille-Choquette. K.B. was supported by excellence scholarships from Université Laval and Fondation du CHU de Québec. S.G. is supported by FIRC-AIRC fellowship for Italy 22329/2018 and by Pilot ARISLA NKINALS 2019. C.W.H. and J.C.S. were supported by postdoctoral fellowships from FRQS. This study was funded by a Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery grant (RGPIN-2014-05308) awarded to M.E.T., by ERANET neuron 2017 MicroSynDep to M.E.T. and I.B., and by the Italian Ministry of Health, grant RF-2018-12367249 to I.B, by PRIN 2017, AIRC 2019 and Ministero della Salute RF2018 to C.L. M.E.T. is a Tier II Canada Research Chair in Neurobiology of Aging and Cognition.","year":"2021","publication_identifier":{"issn":["0889-1591"]},"month":"10","language":[{"iso":"eng"}],"doi":"10.1016/j.bbi.2021.07.022","isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://www.zora.uzh.ch/id/eprint/208855/1/ZORA208855.pdf","open_access":"1"}],"oa":1,"external_id":{"pmid":["34343616"],"isi":["000702878400007"]}},{"ec_funded":1,"pmid":1,"acknowledgement":"This work was supported by the European Regional Development Funds. M.L., Y.Z., X.H., and K.X. thank the China Scholarship Council for scholarship support. M. I. has been financially supported by IST Austria and the Werner Siemens Foundation. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. is a Serra Húnter fellow and is grateful to ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project NANOGEN (PID2020-116093RB-C43). ICN2 was supported by the Severo Ochoa program from Spanish MINECO (grant no. SEV-2017-0706) and was funded by the CERCA Programme/Generalitat de Catalunya. X.H. thanks China Scholarship Council for scholarship support (201804910551). Part of the present work was performed in the framework of Universitat Autònoma de Barcelona Materials Science Ph.D. program.","year":"2021","publisher":"American Chemical Society ","department":[{"_id":"MaIb"}],"publication_status":"published","author":[{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","first_name":"Yu","last_name":"Liu","full_name":"Liu, Yu"},{"first_name":"Yu","last_name":"Zhang","full_name":"Zhang, Yu"},{"full_name":"Han, Xu","last_name":"Han","first_name":"Xu"},{"full_name":"Xiao, Ke","first_name":"Ke","last_name":"Xiao"},{"first_name":"Mehran","last_name":"Nabahat","full_name":"Nabahat, Mehran"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Llorca, Jordi","first_name":"Jordi","last_name":"Llorca"},{"full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"volume":13,"date_updated":"2023-10-03T09:55:33Z","date_created":"2021-11-21T23:01:30Z","publication_identifier":{"eissn":["1944-8252"],"issn":["1944-8244"]},"month":"10","oa":1,"external_id":{"pmid":["34665616"],"isi":["000715852100070"]},"main_file_link":[{"url":"https://upcommons.upc.edu/bitstream/2117/363528/1/Pb%20mengyao.pdf","open_access":"1"}],"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"quality_controlled":"1","isi":1,"doi":"10.1021/acsami.1c15609","language":[{"iso":"eng"}],"type":"journal_article","issue":"43","abstract":[{"text":"Composite materials offer numerous advantages in a wide range of applications, including thermoelectrics. Here, semiconductor–metal composites are produced by just blending nanoparticles of a sulfide semiconductor obtained in aqueous solution and at room temperature with a metallic Cu powder. The obtained blend is annealed in a reducing atmosphere and afterward consolidated into dense polycrystalline pellets through spark plasma sintering (SPS). We observe that, during the annealing process, the presence of metallic copper activates a partial reduction of the PbS, resulting in the formation of PbS–Pb–CuxS composites. The presence of metallic lead during the SPS process habilitates the liquid-phase sintering of the composite. Besides, by comparing the transport properties of PbS, the PbS–Pb–CuxS composites, and PbS–CuxS composites obtained by blending PbS and CuxS nanoparticles, we demonstrate that the presence of metallic lead decisively contributes to a strong increase of the charge carrier concentration through spillover of charge carriers enabled by the low work function of lead. The increase in charge carrier concentration translates into much higher electrical conductivities and moderately lower Seebeck coefficients. These properties translate into power factors up to 2.1 mW m–1 K–2 at ambient temperature, well above those of PbS and PbS + CuxS. Additionally, the presence of multiple phases in the final composite results in a notable decrease in the lattice thermal conductivity. Overall, the introduction of metallic copper in the initial blend results in a significant improvement of the thermoelectric performance of PbS, reaching a dimensionless thermoelectric figure of merit ZT = 1.1 at 750 K, which represents about a 400% increase over bare PbS. Besides, an average ZTave = 0.72 in the temperature range 320–773 K is demonstrated.","lang":"eng"}],"_id":"10327","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13","status":"public","title":"PbS–Pb–CuxS composites for thermoelectric application","oa_version":"Submitted Version","scopus_import":"1","keyword":["CuxS","PbS","energy conversion","nanocomposite","nanoparticle","solution synthesis","thermoelectric"],"article_processing_charge":"No","day":"19","citation":{"ama":"Li M, Liu Y, Zhang Y, et al. PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials and Interfaces. 2021;13(43):51373–51382. doi:10.1021/acsami.1c15609","ieee":"M. Li et al., “PbS–Pb–CuxS composites for thermoelectric application,” ACS Applied Materials and Interfaces, vol. 13, no. 43. American Chemical Society , pp. 51373–51382, 2021.","apa":"Li, M., Liu, Y., Zhang, Y., Han, X., Xiao, K., Nabahat, M., … Cabot, A. (2021). PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials and Interfaces. American Chemical Society . https://doi.org/10.1021/acsami.1c15609","ista":"Li M, Liu Y, Zhang Y, Han X, Xiao K, Nabahat M, Arbiol J, Llorca J, Ibáñez M, Cabot A. 2021. PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials and Interfaces. 13(43), 51373–51382.","short":"M. Li, Y. Liu, Y. Zhang, X. Han, K. Xiao, M. Nabahat, J. Arbiol, J. Llorca, M. Ibáñez, A. Cabot, ACS Applied Materials and Interfaces 13 (2021) 51373–51382.","mla":"Li, Mengyao, et al. “PbS–Pb–CuxS Composites for Thermoelectric Application.” ACS Applied Materials and Interfaces, vol. 13, no. 43, American Chemical Society , 2021, pp. 51373–51382, doi:10.1021/acsami.1c15609.","chicago":"Li, Mengyao, Yu Liu, Yu Zhang, Xu Han, Ke Xiao, Mehran Nabahat, Jordi Arbiol, Jordi Llorca, Maria Ibáñez, and Andreu Cabot. “PbS–Pb–CuxS Composites for Thermoelectric Application.” ACS Applied Materials and Interfaces. American Chemical Society , 2021. https://doi.org/10.1021/acsami.1c15609."},"publication":"ACS Applied Materials and Interfaces","page":"51373–51382","article_type":"original","date_published":"2021-10-19T00:00:00Z"},{"author":[{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","first_name":"Yu","last_name":"Liu"},{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"full_name":"Han, Xu","first_name":"Xu","last_name":"Han"},{"full_name":"Zhang, Ting","first_name":"Ting","last_name":"Zhang"},{"last_name":"Zuo","first_name":"Yong","full_name":"Zuo, Yong"},{"full_name":"Xie, Chenyang","first_name":"Chenyang","last_name":"Xie"},{"full_name":"Xiao, Ke","last_name":"Xiao","first_name":"Ke"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Llorca, Jordi","first_name":"Jordi","last_name":"Llorca"},{"last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"last_name":"Liu","first_name":"Junfeng","full_name":"Liu, Junfeng"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"date_created":"2021-03-10T20:12:45Z","date_updated":"2023-10-03T09:59:55Z","volume":15,"year":"2021","acknowledgement":"This work was supported by the European Regional Development Funds. M.Y.L., X.H., T.Z., and K.X. thank the China Scholarship Council for scholarship support. M.I. acknowledges financial support from IST Austria. J.L. acknowledges support from the National Natural Science Foundation of China (No. 22008091), the funding for scientific research startup of Jiangsu University (No. 19JDG044), and Jiangsu Provincial Program for High-Level Innovative and Entrepreneurial Talents Introduction. J.L. is a Serra Húnter fellow and is grateful to the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science PhD program. T.Z. has received funding from the CSC-UAB PhD scholarship program.","pmid":1,"publication_status":"published","publisher":"American Chemical Society ","department":[{"_id":"MaIb"}],"month":"03","publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"doi":"10.1021/acsnano.0c09866","language":[{"iso":"eng"}],"external_id":{"isi":["000634569100106"],"pmid":["33645986"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/handle/2117/363528/Pb%20mengyao.pdf?sequence=1&isAllowed=y"}],"quality_controlled":"1","isi":1,"abstract":[{"text":"Cu2–xS has become one of the most promising thermoelectric materials for application in the middle-high temperature range. Its advantages include the abundance, low cost, and safety of its elements and a high performance at relatively elevated temperatures. However, stability issues limit its operation current and temperature, thus calling for the optimization of the material performance in the middle temperature range. Here, we present a synthetic protocol for large scale production of covellite CuS nanoparticles at ambient temperature and atmosphere, and using water as a solvent. The crystal phase and stoichiometry of the particles are afterward tuned through an annealing process at a moderate temperature under inert or reducing atmosphere. While annealing under argon results in Cu1.8S nanopowder with a rhombohedral crystal phase, annealing in an atmosphere containing hydrogen leads to tetragonal Cu1.96S. High temperature X-ray diffraction analysis shows the material annealed in argon to transform to the cubic phase at ca. 400 K, while the material annealed in the presence of hydrogen undergoes two phase transitions, first to hexagonal and then to the cubic structure. The annealing atmosphere, temperature, and time allow adjustment of the density of copper vacancies and thus tuning of the charge carrier concentration and material transport properties. In this direction, the material annealed under Ar is characterized by higher electrical conductivities but lower Seebeck coefficients than the material annealed in the presence of hydrogen. By optimizing the charge carrier concentration through the annealing time, Cu2–xS with record figures of merit in the middle temperature range, up to 1.41 at 710 K, is obtained. We finally demonstrate that this strategy, based on a low-cost and scalable solution synthesis process, is also suitable for the production of high performance Cu2–xS layers using high throughput and cost-effective printing technologies.","lang":"eng"}],"issue":"3","type":"journal_article","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9235","status":"public","title":"Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide","intvolume":" 15","day":"01","article_processing_charge":"No","scopus_import":"1","keyword":["General Engineering","General Physics and Astronomy","General Materials Science"],"date_published":"2021-03-01T00:00:00Z","publication":"ACS Nano","citation":{"mla":"Li, Mengyao, et al. “Effect of the Annealing Atmosphere on Crystal Phase and Thermoelectric Properties of Copper Sulfide.” ACS Nano, vol. 15, no. 3, American Chemical Society , 2021, pp. 4967–4978, doi:10.1021/acsnano.0c09866.","short":"M. Li, Y. Liu, Y. Zhang, X. Han, T. Zhang, Y. Zuo, C. Xie, K. Xiao, J. Arbiol, J. Llorca, M. Ibáñez, J. Liu, A. Cabot, ACS Nano 15 (2021) 4967–4978.","chicago":"Li, Mengyao, Yu Liu, Yu Zhang, Xu Han, Ting Zhang, Yong Zuo, Chenyang Xie, et al. “Effect of the Annealing Atmosphere on Crystal Phase and Thermoelectric Properties of Copper Sulfide.” ACS Nano. American Chemical Society , 2021. https://doi.org/10.1021/acsnano.0c09866.","ama":"Li M, Liu Y, Zhang Y, et al. Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide. ACS Nano. 2021;15(3):4967–4978. doi:10.1021/acsnano.0c09866","ista":"Li M, Liu Y, Zhang Y, Han X, Zhang T, Zuo Y, Xie C, Xiao K, Arbiol J, Llorca J, Ibáñez M, Liu J, Cabot A. 2021. Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide. ACS Nano. 15(3), 4967–4978.","ieee":"M. Li et al., “Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide,” ACS Nano, vol. 15, no. 3. American Chemical Society , pp. 4967–4978, 2021.","apa":"Li, M., Liu, Y., Zhang, Y., Han, X., Zhang, T., Zuo, Y., … Cabot, A. (2021). Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide. ACS Nano. American Chemical Society . https://doi.org/10.1021/acsnano.0c09866"},"article_type":"original","page":"4967–4978"},{"external_id":{"pmid":["34569592"],"isi":["000700090000001"]},"oa":1,"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"doi":"10.1039/d1sm00774b","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"month":"10","pmid":1,"acknowledgement":"MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme, grant no. 788183 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","year":"2021","publisher":"Royal Society of Chemistry ","department":[{"_id":"HeEd"}],"publication_status":"published","author":[{"full_name":"Osang, Georg F","first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8882-5116"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Mohammad","last_name":"Saadatfar","full_name":"Saadatfar, Mohammad"}],"volume":17,"date_created":"2021-10-31T23:01:30Z","date_updated":"2023-10-03T09:24:27Z","ec_funded":1,"file_date_updated":"2023-10-03T09:21:42Z","citation":{"chicago":"Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter. Royal Society of Chemistry , 2021. https://doi.org/10.1039/d1sm00774b.","short":"G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.","mla":"Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b.","ieee":"G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” Soft Matter, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.","apa":"Osang, G. F., Edelsbrunner, H., & Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. Royal Society of Chemistry . https://doi.org/10.1039/d1sm00774b","ista":"Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.","ama":"Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 2021;17(40):9107-9115. doi:10.1039/d1sm00774b"},"publication":"Soft Matter","page":"9107-9115","article_type":"original","date_published":"2021-10-20T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10204","intvolume":" 17","ddc":["540"],"status":"public","title":"Topological signatures and stability of hexagonal close packing and Barlow stackings","file":[{"creator":"dernst","file_size":4678788,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_SoftMatter_acceptedversion_Osang.pdf","success":1,"checksum":"b4da0c420530295e61b153960f6cb350","date_created":"2023-10-03T09:21:42Z","date_updated":"2023-10-03T09:21:42Z","file_id":"14385","relation":"main_file"}],"oa_version":"Submitted Version","type":"journal_article","issue":"40","abstract":[{"lang":"eng","text":"Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals."}]},{"date_created":"2021-06-27T22:01:49Z","date_updated":"2023-10-04T12:03:39Z","volume":189,"author":[{"full_name":"Corbet, René","first_name":"René","last_name":"Corbet"},{"last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"},{"first_name":"Michael","last_name":"Lesnick","full_name":"Lesnick, Michael"},{"last_name":"Osang","first_name":"Georg F","orcid":"0000-0002-8882-5116","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"}],"related_material":{"record":[{"id":"12709","relation":"later_version","status":"public"}],"link":[{"relation":"extended_version","url":"https://arxiv.org/abs/2103.07823"}]},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"year":"2021","acknowledgement":"The authors want to thank the reviewers for many helpful comments and suggestions.","file_date_updated":"2021-06-28T12:40:47Z","article_number":"27","language":[{"iso":"eng"}],"conference":{"end_date":"2021-06-11","location":"Online","start_date":"2021-06-07","name":"SoCG: International Symposium on Computational Geometry"},"doi":"10.4230/LIPIcs.SoCG.2021.27","quality_controlled":"1","external_id":{"arxiv":["2103.07823"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"06","publication_identifier":{"issn":["18688969"],"isbn":["9783959771849"]},"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2021_LIPIcs_Corbet.pdf","content_type":"application/pdf","file_size":"1367983","creator":"cziletti","relation":"main_file","file_id":"9610","checksum":"0de217501e7ba8b267d58deed0d51761","success":1,"date_created":"2021-06-28T12:40:47Z","date_updated":"2021-06-28T12:40:47Z"}],"title":"Computing the multicover bifiltration","status":"public","ddc":["516"],"intvolume":" 189","_id":"9605","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","abstract":[{"text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. ","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2021-06-02T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","citation":{"short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.","chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” In Leibniz International Proceedings in Informatics, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.27.","ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.","apa":"Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2021). Computing the multicover bifiltration. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.27","ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 27."},"day":"02","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"related_material":{"record":[{"status":"public","relation":"later_version","id":"12960"}]},"author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"first_name":"Siargey","last_name":"Kachanovich","full_name":"Kachanovich, Siargey"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs"}],"volume":189,"date_updated":"2023-10-10T07:34:34Z","date_created":"2021-06-02T10:10:55Z","year":"2021","acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","ec_funded":1,"file_date_updated":"2021-06-02T10:22:33Z","place":"Dagstuhl, Germany","doi":"10.4230/LIPIcs.SoCG.2021.17","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2021-06-07","location":"Virtual","end_date":"2021-06-11"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-184-9"]},"month":"06","file":[{"access_level":"open_access","file_name":"LIPIcs-SoCG-2021-17.pdf","creator":"mwintrae","file_size":1972902,"content_type":"application/pdf","file_id":"9442","relation":"main_file","success":1,"checksum":"c322aa48d5d35a35877896cc565705b6","date_updated":"2021-06-02T10:22:33Z","date_created":"2021-06-02T10:22:33Z"}],"oa_version":"Published Version","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9441","intvolume":" 189","title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","ddc":["005","516","514"],"status":"public","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. ","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2021-06-02T00:00:00Z","citation":{"mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” 37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:10.4230/LIPIcs.SoCG.2021.17.","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In 37th International Symposium on Computational Geometry (SoCG 2021), 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.17.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: 37th International Symposium on Computational Geometry (SoCG 2021). Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:10.4230/LIPIcs.SoCG.2021.17","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in 37th International Symposium on Computational Geometry (SoCG 2021), Virtual, 2021, vol. 189, p. 17:1-17:16.","apa":"Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.17"},"publication":"37th International Symposium on Computational Geometry (SoCG 2021)","page":"17:1-17:16","article_processing_charge":"No","has_accepted_license":"1","day":"02","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)"},{"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.","year":"2021","department":[{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"volume":57,"date_created":"2021-05-16T22:01:47Z","date_updated":"2023-10-10T11:13:20Z","ec_funded":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.07384","open_access":"1"}],"external_id":{"arxiv":["1504.07384"],"isi":["000645490300001"]},"oa":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","doi":"10.1007/s10703-021-00373-5","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0925-9856"],"eissn":["1572-8102"]},"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9393","intvolume":" 57","status":"public","title":"Faster algorithms for quantitative verification in bounded treewidth graphs","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021."},"publication":"Formal Methods in System Design","page":"401-428","article_type":"original","date_published":"2021-09-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"month":"11","project":[{"_id":"05943252-7A3F-11EA-A408-12923DDC885E","grant_number":"851288","name":"Design Principles of Branching Morphogenesis","call_identifier":"H2020"},{"name":"Active mechano-chemical description of the cell cytoskeleton","call_identifier":"FWF","grant_number":"P31639","_id":"268294B6-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000720204300004"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41567-021-01374-1","ec_funded":1,"file_date_updated":"2023-10-11T09:31:43Z","publisher":"Springer Nature","department":[{"_id":"EdHa"}],"publication_status":"published","year":"2021","acknowledgement":"S.G. acknowledges funding from FEDER Prostem Research Project no. 1510614 (Wallonia DG06), F.R.S.-FNRS Epiforce Research Project no. T.0092.21 and Interreg MAT(T)ISSE project, which is financially supported by Interreg France-Wallonie-Vlaanderen (Fonds Européen de Développement Régional, FEDER-ERDF). This project was supported by the European Research Council under the European Union’s Horizon 2020 Research and Innovation Programme grant agreement 851288 (to E.H.), and by the Austrian Science Fund (FWF) (P 31639; to E.H.). L.R.M. acknowledges funding from the Agence National de la Recherche (ANR), as part of the ‘Investments d’Avenir’ Programme (I-SITE ULNE/ANR-16-IDEX-0004 ULNE). This work benefited from ANR-10-EQPX-04-01 and FEDER 12001407 grants to F.L. W.D.V. is supported by the Research Foundation Flanders (FWO 1516619N, FWO GOO5819N, FWO I003420N, FWO IRI I000321N) and is member of the Research Excellence Consortium µNEURO at the University of Antwerp. M.L. is financially supported by FRIA (F.R.S.-FNRS). M.S. is a Senior Research Associate of the Fund for Scientific Research (F.R.S.-FNRS) and acknowledges EOS grant no. 30650939 (PRECISION). Sketches in Figs. 1a and 5e and Extended Data Fig. 9 were drawn by C. Levicek.","volume":17,"date_created":"2021-11-28T23:01:29Z","date_updated":"2023-10-16T06:31:54Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/how-cells-feel-curvature/","description":"News on IST Webpage","relation":"press_release"}]},"author":[{"first_name":"Marine","last_name":"Luciano","full_name":"Luciano, Marine"},{"id":"31D2C804-F248-11E8-B48F-1D18A9856A87","first_name":"Shi-lei","last_name":"Xue","full_name":"Xue, Shi-lei"},{"full_name":"De Vos, Winnok H.","first_name":"Winnok H.","last_name":"De Vos"},{"first_name":"Lorena","last_name":"Redondo-Morata","full_name":"Redondo-Morata, Lorena"},{"last_name":"Surin","first_name":"Mathieu","full_name":"Surin, Mathieu"},{"first_name":"Frank","last_name":"Lafont","full_name":"Lafont, Frank"},{"orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B"},{"last_name":"Gabriele","first_name":"Sylvain","full_name":"Gabriele, Sylvain"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"18","page":"1382–1390","article_type":"original","citation":{"chicago":"Luciano, Marine, Shi-lei Xue, Winnok H. De Vos, Lorena Redondo-Morata, Mathieu Surin, Frank Lafont, Edouard B Hannezo, and Sylvain Gabriele. “Cell Monolayers Sense Curvature by Exploiting Active Mechanics and Nuclear Mechanoadaptation.” Nature Physics. Springer Nature, 2021. https://doi.org/10.1038/s41567-021-01374-1.","short":"M. Luciano, S. Xue, W.H. De Vos, L. Redondo-Morata, M. Surin, F. Lafont, E.B. Hannezo, S. Gabriele, Nature Physics 17 (2021) 1382–1390.","mla":"Luciano, Marine, et al. “Cell Monolayers Sense Curvature by Exploiting Active Mechanics and Nuclear Mechanoadaptation.” Nature Physics, vol. 17, no. 12, Springer Nature, 2021, pp. 1382–1390, doi:10.1038/s41567-021-01374-1.","ieee":"M. Luciano et al., “Cell monolayers sense curvature by exploiting active mechanics and nuclear mechanoadaptation,” Nature Physics, vol. 17, no. 12. Springer Nature, pp. 1382–1390, 2021.","apa":"Luciano, M., Xue, S., De Vos, W. H., Redondo-Morata, L., Surin, M., Lafont, F., … Gabriele, S. (2021). Cell monolayers sense curvature by exploiting active mechanics and nuclear mechanoadaptation. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-021-01374-1","ista":"Luciano M, Xue S, De Vos WH, Redondo-Morata L, Surin M, Lafont F, Hannezo EB, Gabriele S. 2021. Cell monolayers sense curvature by exploiting active mechanics and nuclear mechanoadaptation. Nature Physics. 17(12), 1382–1390.","ama":"Luciano M, Xue S, De Vos WH, et al. Cell monolayers sense curvature by exploiting active mechanics and nuclear mechanoadaptation. Nature Physics. 2021;17(12):1382–1390. doi:10.1038/s41567-021-01374-1"},"publication":"Nature Physics","date_published":"2021-11-18T00:00:00Z","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"The early development of many organisms involves the folding of cell monolayers, but this behaviour is difficult to reproduce in vitro; therefore, both mechanistic causes and effects of local curvature remain unclear. Here we study epithelial cell monolayers on corrugated hydrogels engineered into wavy patterns, examining how concave and convex curvatures affect cellular and nuclear shape. We find that substrate curvature affects monolayer thickness, which is larger in valleys than crests. We show that this feature generically arises in a vertex model, leading to the hypothesis that cells may sense curvature by modifying the thickness of the tissue. We find that local curvature also affects nuclear morphology and positioning, which we explain by extending the vertex model to take into account membrane–nucleus interactions, encoding thickness modulation in changes to nuclear deformation and position. We propose that curvature governs the spatial distribution of yes-associated proteins via nuclear shape and density changes. We show that curvature also induces significant variations in lamins, chromatin condensation and cell proliferation rate in folded epithelial tissues. Together, this work identifies active cell mechanics and nuclear mechanoadaptation as the key players of the mechanistic regulation of epithelia to substrate curvature."}],"intvolume":" 17","title":"Cell monolayers sense curvature by exploiting active mechanics and nuclear mechanoadaptation","status":"public","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10365","file":[{"creator":"channezo","content_type":"application/pdf","file_size":40285498,"file_name":"50145_4_merged_1630498627.pdf","access_level":"open_access","date_updated":"2023-10-11T09:31:43Z","date_created":"2023-10-11T09:31:43Z","success":1,"checksum":"5d6d76750a71d7cb632bb15417c38ef7","file_id":"14420","relation":"main_file"}],"oa_version":"Submitted Version"}]