[{"publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"17173"},{"id":"11135","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"17047","relation":"part_of_dissertation"},{"status":"public","id":"17154","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"17174","status":"public"}]},"file_date_updated":"2024-06-26T12:44:53Z","status":"public","date_created":"2024-06-24T11:23:29Z","article_processing_charge":"No","author":[{"first_name":"Jana","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","full_name":"Reker, Jana","last_name":"Reker"}],"abstract":[{"lang":"eng","text":"This thesis is structured into two parts. In the first part, we consider the random\r\nvariable X := Tr(f1(W)A1 . . . fk(W)Ak) where W is an N × N Hermitian Wigner matrix, k ∈ N, and we choose (possibly N-dependent) regular functions f1, . . . , fk as well as\r\nbounded deterministic matrices A1, . . . , Ak. In this context, we prove a functional central\r\nlimit theorem on macroscopic and mesoscopic scales, showing that the fluctuations of X\r\naround its expectation are Gaussian and that the limiting covariance structure is given\r\nby a deterministic recursion. We further give explicit error bounds in terms of the scaling\r\nof f1, . . . , fk and the number of traceless matrices among A1, . . . , Ak, thus extending\r\nthe results of Cipolloni, Erdős and Schröder [40] to products of arbitrary length k ≥ 2.\r\nAnalyzing the underlying combinatorics leads to a non-recursive formula for the variance\r\nof X as well as the covariance of X and Y := Tr(fk+1(W)Ak+1 . . . fk+ℓ(W)Ak+ℓ) of similar\r\nbuild. When restricted to polynomials, these formulas reproduce recent results of Male,\r\nMingo, Peché, and Speicher [107], showing that the underlying combinatorics of noncrossing partitions and annular non-crossing permutations continue to stay valid beyond\r\nthe setting of second-order free probability theory. As an application, we consider the\r\nfluctuation of Tr(eitW A1e\r\n−itW A2)/N around its thermal value Tr(A1) Tr(A2)/N2 when t\r\nis large and give an explicit formula for the variance.\r\nThe second part of the thesis collects three smaller projects focusing on different random\r\nmatrix models. In the first project, we show that a class of weakly perturbed Hamiltonians\r\nof the form Hλ = H0 + λW, where W is a Wigner matrix, exhibits prethermalization.\r\nThat is, the time evolution generated by Hλ relaxes to its ultimate thermal state via an\r\nintermediate prethermal state with a lifetime of order λ\r\n−2\r\n. As the main result, we obtain\r\na general relaxation formula, expressing the perturbed dynamics via the unperturbed\r\ndynamics and the ultimate thermal state. The proof relies on a two-resolvent global law\r\nfor the deformed Wigner matrix Hλ.\r\nThe second project focuses on correlated random matrices, more precisely on a correlated N × N Hermitian random matrix with a polynomially decaying metric correlation\r\nstructure. A trivial a priori bound shows that the operator norm of this model is stochastically dominated by √\r\nN. However, by calculating the trace of the moments of the matrix\r\nand using the summable decay of the cumulants, the norm estimate can be improved to a\r\nbound of order one.\r\nIn the third project, we consider a multiplicative perturbation of the form UA(t) where U\r\nis a unitary random matrix and A = diag(t, 1, ..., 1). This so-called UA model was\r\nfirst introduced by Fyodorov [73] for its applications in scattering theory. We give a\r\ngeneral description of the eigenvalue trajectories obtained by varying the parameter t and\r\nintroduce a flow of deterministic domains that separates the outlier resulting from the\r\nrank-one perturbation from the typical eigenvalues for all sub-critical timescales. The\r\nresults are obtained under generic assumptions on U that hold for various unitary random\r\nmatrices, including the circular unitary ensemble (CUE) in the original formulation of\r\nthe model."}],"date_updated":"2026-04-07T13:02:13Z","oa_version":"Published Version","day":"26","alternative_title":["ISTA Thesis"],"ddc":["519"],"title":"Central limit theorems for random matrices: From resolvents to free probability","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"has_accepted_license":"1","page":"206","year":"2024","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:17164","publisher":"Institute of Science and Technology Austria","date_published":"2024-06-26T00:00:00Z","oa":1,"file":[{"relation":"main_file","creator":"jreker","date_created":"2024-06-26T12:39:36Z","file_size":2783027,"content_type":"application/pdf","date_updated":"2024-06-26T12:44:53Z","file_name":"ISTA_Thesis_JReker.pdf","access_level":"open_access","checksum":"fb16d86e1f2753dc3a9e14d2bdfd84cd","file_id":"17176"},{"content_type":"application/zip","date_updated":"2024-06-26T12:44:53Z","file_size":3054878,"file_id":"17177","file_name":"ISTA_Thesis_JReker_SourceFiles.zip","access_level":"closed","checksum":"cb1e54009d47c1dcf5b866c4566fa27f","relation":"source_file","creator":"jreker","date_created":"2024-06-26T12:39:42Z"}],"keyword":["Random Matrices","Spectrum","Central Limit Theorem","Resolvent","Free Probability"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","corr_author":"1","type":"dissertation","degree_awarded":"PhD","citation":{"chicago":"Reker, Jana. “Central Limit Theorems for Random Matrices: From Resolvents to Free Probability.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17164\">https://doi.org/10.15479/at:ista:17164</a>.","mla":"Reker, Jana. <i>Central Limit Theorems for Random Matrices: From Resolvents to Free Probability</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17164\">10.15479/at:ista:17164</a>.","ista":"Reker J. 2024. Central limit theorems for random matrices: From resolvents to free probability. Institute of Science and Technology Austria.","short":"J. Reker, Central Limit Theorems for Random Matrices: From Resolvents to Free Probability, Institute of Science and Technology Austria, 2024.","ieee":"J. Reker, “Central limit theorems for random matrices: From resolvents to free probability,” Institute of Science and Technology Austria, 2024.","apa":"Reker, J. (2024). <i>Central limit theorems for random matrices: From resolvents to free probability</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17164\">https://doi.org/10.15479/at:ista:17164</a>","ama":"Reker J. Central limit theorems for random matrices: From resolvents to free probability. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17164\">10.15479/at:ista:17164</a>"},"supervisor":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös"}],"publication_status":"published","month":"06","_id":"17164","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"}},{"date_published":"2024-06-06T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.SoCG.2024.11","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_updated":"2024-06-25T11:47:26Z","file_size":20886142,"file_id":"17171","file_name":"LIPIcs.SoCG.2024.11.pdf","access_level":"open_access","checksum":"6a2ddc8b51aa58f197a8b294750f1f8d","creator":"cfillmor","relation":"main_file","success":1,"date_created":"2024-06-25T11:47:26Z"}],"oa":1,"quality_controlled":"1","year":"2024","page":"11:1-11:19","external_id":{"arxiv":["2206.10485"]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"17170","scopus_import":"1","month":"06","arxiv":1,"volume":293,"type":"conference","publication_status":"published","citation":{"ieee":"D. Attali <i>et al.</i>, “Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 11:1-11:19.","ama":"Attali D, Kourimska H, Fillmore CD, et al. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">10.4230/LIPIcs.SoCG.2024.11</a>","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., &#38; Wintraecken, M. (2024). Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 11:1-11:19). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">https://doi.org/10.4230/LIPIcs.SoCG.2024.11</a>","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” In <i>40th International Symposium on Computational Geometry</i>, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">https://doi.org/10.4230/LIPIcs.SoCG.2024.11</a>.","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 11:1-11:19.","mla":"Attali, Dominique, et al. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">10.4230/LIPIcs.SoCG.2024.11</a>.","short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nWintraecken, Mathijs: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d'Azur.","date_created":"2024-06-25T11:45:58Z","status":"public","file_date_updated":"2024-06-25T11:47:26Z","publication":"40th International Symposium on Computational Geometry","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773164"]},"ec_funded":1,"conference":{"start_date":"2024-06-11","location":"Athens, Greece","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14"},"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"project":[{"call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"has_accepted_license":"1","ddc":["516"],"day":"06","alternative_title":["LIPIcs"],"title":"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds","abstract":[{"lang":"eng","text":"In this article we extend and strengthen the seminal work by Niyogi, Smale, and Weinberger on the learning of the homotopy type from a sample of an underlying space. In their work, Niyogi, Smale, and Weinberger studied samples of C² manifolds with positive reach embedded in ℝ^d. We extend their results in the following ways: - As the ambient space we consider both ℝ^d and Riemannian manifolds with lower bounded sectional curvature. - In both types of ambient spaces, we study sets of positive reach - a significantly more general setting than C² manifolds - as well as general manifolds of positive reach. - The sample P of a set (or a manifold) 𝒮 of positive reach may be noisy. We work with two one-sided Hausdorff distances - ε and δ - between P and 𝒮. We provide tight bounds in terms of ε and δ, that guarantee that there exists a parameter r such that the union of balls of radius r centred at the sample P deformation-retracts to 𝒮. We exhibit their tightness by an explicit construction. We carefully distinguish the roles of δ and ε. This is not only essential to achieve tight bounds, but also sensible in practical situations, since it allows one to adapt the bound according to sample density and the amount of noise present in the sample separately."}],"oa_version":"Published Version","date_updated":"2025-04-15T07:16:57Z","intvolume":"       293","author":[{"last_name":"Attali","full_name":"Attali, Dominique","first_name":"Dominique"},{"id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana","orcid":"0000-0001-7841-0091","last_name":"Kourimska","full_name":"Kourimska, Hana"},{"full_name":"Fillmore, Christopher D","last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D"},{"full_name":"Ghosh, Ishika","last_name":"Ghosh","first_name":"Ishika","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff"},{"first_name":"André","full_name":"Lieutier, André","last_name":"Lieutier"},{"full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R"},{"last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}]},{"article_processing_charge":"No","acknowledgement":"This research was supported by the Scientific Service Units of ISTA through resources provided by the MIBA Machine Shop and the Nanofabrication facility. ","contributor":[{"last_name":"Crippa","contributor_type":"project_member","orcid":"0000-0002-2968-611X","first_name":"Alessandro","id":"1F2B21A2-F6E7-11E9-9B82-F7DBE5697425"},{"contributor_type":"project_member","last_name":"Valentini","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","first_name":"Marco"},{"first_name":"Marian","id":"396A1950-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","last_name":"Janik"},{"id":"7aa1f788-b527-11ee-aa9e-e6111a79e0c7","first_name":"Levon","last_name":"Baghumyan","contributor_type":"project_member"},{"last_name":"Fabris","contributor_type":"project_member","first_name":"Giorgio","id":"298cf6f3-1ff6-11ee-9fa6-d94cfa0b3352"},{"first_name":"Lucky","id":"84b9700b-15b2-11ec-abd3-831089e67615","last_name":"Kapoor","contributor_type":"project_member"},{"last_name":"Hassani","contributor_type":"project_member","orcid":"0000-0001-6937-5773","first_name":"Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87"},{"contributor_type":"project_member","last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"},{"contributor_type":"project_member","last_name":"Calcaterra","first_name":"Stefano"},{"first_name":"Daniel","contributor_type":"project_member","last_name":"Chrastina"},{"contributor_type":"project_member","last_name":"Isella","first_name":"Giovanni"},{"orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros","contributor_type":"supervisor"}],"date_created":"2024-07-04T10:14:34Z","file_date_updated":"2024-07-04T10:11:40Z","status":"public","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"related_material":{"record":[{"id":"17202","relation":"used_in_publication","status":"public"}]},"department":[{"_id":"GradSch"},{"_id":"GeKa"},{"_id":"JoFi"}],"project":[{"grant_number":"I05060","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1","name":"High impedance circuit quantum electrodynamics with hole spins"},{"_id":"262116AA-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"},{"name":"Merging spin and superconducting qubits in planar Ge","grant_number":"P36507","_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a"}],"has_accepted_license":"1","ddc":["530"],"day":"04","title":"A gate-tunable transmon in planar Ge","abstract":[{"lang":"eng","text":"This .zip File contains the data for the figures presented in the main text and supplementary material of \"A gate tunable transmon qubit in planar Ge\" by O.Sagi et al. The measurements were done using Qcodes. The description of the files and the instructions on opening the data can be found in the Readme. An additional Jupyter Notebook is attached that walks through the data analysis."}],"oa_version":"Published Version","date_updated":"2026-04-16T12:20:39Z","author":[{"full_name":"Sagi, Oliver","last_name":"Sagi","first_name":"Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425"}],"publisher":"Institute of Science and Technology Austria","date_published":"2024-07-04T00:00:00Z","doi":"10.15479/AT:ISTA:17196","file":[{"relation":"main_file","creator":"osagi","success":1,"date_created":"2024-07-04T10:01:51Z","date_updated":"2024-07-04T10:01:51Z","content_type":"application/octet-stream","file_size":1960182,"file_id":"17197","checksum":"a9f640a0b72a92171353f3ea14406f0b","access_level":"open_access","file_name":"GeGatemon_DataAnalysis.ipynb"},{"file_id":"17198","checksum":"f0feec931233e8e845ade56165c1588f","access_level":"open_access","file_name":"OlSa_Readme.pptx","date_updated":"2024-07-04T10:01:50Z","content_type":"application/vnd.openxmlformats-officedocument.presentationml.presentation","file_size":34194,"date_created":"2024-07-04T10:01:50Z","creator":"osagi","relation":"main_file","success":1},{"file_id":"17199","checksum":"92bb11e3a508d736d01ff0738a1172c7","access_level":"open_access","file_name":"Al_Transmon.zip","date_updated":"2024-07-04T10:11:16Z","content_type":"application/x-zip-compressed","file_size":72939292,"date_created":"2024-07-04T10:11:16Z","relation":"main_file","creator":"osagi","success":1},{"success":1,"creator":"osagi","relation":"main_file","date_created":"2024-07-04T10:11:40Z","file_size":465618029,"date_updated":"2024-07-04T10:11:40Z","content_type":"application/x-zip-compressed","access_level":"open_access","checksum":"871e96fe0ecc97581196e883045cd516","file_name":"Gatemon_RT_5nm_1.zip","file_id":"17200"},{"date_created":"2024-07-04T10:11:35Z","success":1,"relation":"main_file","creator":"osagi","checksum":"a3e141af90f0104b7269c8a72370848a","access_level":"open_access","file_name":"Gatemon_RT_5nm_2.zip","file_id":"17201","file_size":281503513,"date_updated":"2024-07-04T10:11:35Z","content_type":"application/x-zip-compressed"}],"oa":1,"year":"2024","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"17196","month":"07","type":"research_data","corr_author":"1","citation":{"ieee":"O. Sagi, “A gate-tunable transmon in planar Ge.” Institute of Science and Technology Austria, 2024.","ama":"Sagi O. A gate-tunable transmon in planar Ge. 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17196\">10.15479/AT:ISTA:17196</a>","apa":"Sagi, O. (2024). A gate-tunable transmon in planar Ge. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:17196\">https://doi.org/10.15479/AT:ISTA:17196</a>","short":"O. Sagi, (2024).","chicago":"Sagi, Oliver. “A Gate-Tunable Transmon in Planar Ge.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:17196\">https://doi.org/10.15479/AT:ISTA:17196</a>.","mla":"Sagi, Oliver. <i>A Gate-Tunable Transmon in Planar Ge</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17196\">10.15479/AT:ISTA:17196</a>.","ista":"Sagi O. 2024. A gate-tunable transmon in planar Ge, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:17196\">10.15479/AT:ISTA:17196</a>."},"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d"},{"publication_identifier":{"issn":["2160-5033"],"isbn":["9798350384925"],"eissn":["2160-5041"]},"conference":{"name":"OMN: Conference on Optical MEMS and Nanophotonics","end_date":"2024-08-01","location":"San Sebastian, Spain","start_date":"2024-07-28"},"external_id":{"isi":["001327768000060"]},"publication":"2024 International Conference on Optical MEMS and Nanophotonics","quality_controlled":"1","year":"2024","doi":"10.1109/OMN61224.2024.10685279","date_published":"2024-09-27T00:00:00Z","publisher":"Institute of Electrical and Electronics Engineers","language":[{"iso":"eng"}],"acknowledgement":"The authors acknowledge the financial support of the project HfPT – Health from Portugal, with the reference n.° C644937233-00000047, co-funded by Component C5 – Capitalisation and Business Innovation under the Portuguese Resilience and Recovery Plan, through the NextGenerationEU Fund.","date_created":"2024-10-20T22:02:07Z","status":"public","article_processing_charge":"No","author":[{"last_name":"Quintero","full_name":"Quintero, Sergio","first_name":"Sergio"},{"first_name":"Maria","last_name":"Relvas","full_name":"Relvas, Maria"},{"first_name":"Marta","last_name":"Aranda","full_name":"Aranda, Marta"},{"first_name":"Fernando","id":"8ad43d5a-1ffe-11ee-8b67-8176f59de781","orcid":"0009-0006-4119-4376","last_name":"Nodal","full_name":"Nodal, Fernando"},{"first_name":"Lorena","full_name":"Dieguez, Lorena","last_name":"Dieguez"},{"first_name":"Sara","full_name":"Abalde-Cela, Sara","last_name":"Abalde-Cela"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"In this work we present the engineering of a portable platform for sensing SERS signals in droplets microfluidics. This system comprised not only the read-out platform but also a design for the microfluidic devices optimized to enhanced the obtained SERS signals."}],"type":"conference","oa_version":"None","publication_status":"published","date_updated":"2025-09-08T14:19:49Z","citation":{"ieee":"S. Quintero, M. Relvas, M. Aranda, F. Nodal, L. Dieguez, and S. Abalde-Cela, “Portable Raman platform for SERS droplets microfludics,” in <i>2024 International Conference on Optical MEMS and Nanophotonics</i>, San Sebastian, Spain, 2024.","ama":"Quintero S, Relvas M, Aranda M, Nodal F, Dieguez L, Abalde-Cela S. Portable Raman platform for SERS droplets microfludics. In: <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. Institute of Electrical and Electronics Engineers; 2024. doi:<a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">10.1109/OMN61224.2024.10685279</a>","apa":"Quintero, S., Relvas, M., Aranda, M., Nodal, F., Dieguez, L., &#38; Abalde-Cela, S. (2024). Portable Raman platform for SERS droplets microfludics. In <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. San Sebastian, Spain: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">https://doi.org/10.1109/OMN61224.2024.10685279</a>","short":"S. Quintero, M. Relvas, M. Aranda, F. Nodal, L. Dieguez, S. Abalde-Cela, in:, 2024 International Conference on Optical MEMS and Nanophotonics, Institute of Electrical and Electronics Engineers, 2024.","ista":"Quintero S, Relvas M, Aranda M, Nodal F, Dieguez L, Abalde-Cela S. 2024. Portable Raman platform for SERS droplets microfludics. 2024 International Conference on Optical MEMS and Nanophotonics. OMN: Conference on Optical MEMS and Nanophotonics.","mla":"Quintero, Sergio, et al. “Portable Raman Platform for SERS Droplets Microfludics.” <i>2024 International Conference on Optical MEMS and Nanophotonics</i>, Institute of Electrical and Electronics Engineers, 2024, doi:<a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">10.1109/OMN61224.2024.10685279</a>.","chicago":"Quintero, Sergio, Maria Relvas, Marta Aranda, Fernando Nodal, Lorena Dieguez, and Sara Abalde-Cela. “Portable Raman Platform for SERS Droplets Microfludics.” In <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. Institute of Electrical and Electronics Engineers, 2024. <a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">https://doi.org/10.1109/OMN61224.2024.10685279</a>."},"month":"09","day":"27","scopus_import":"1","title":"Portable Raman platform for SERS droplets microfludics","department":[{"_id":"GradSch"}],"OA_type":"closed access","isi":1,"_id":"18450"},{"volume":85,"type":"journal_article","corr_author":"1","publication_status":"published","citation":{"short":"P. Arkhipov, Automation and Remote Control 85 (2024) 522–532.","mla":"Arkhipov, Pavel. “An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.” <i>Automation and Remote Control</i>, vol. 85, no. 6, Springer Nature, 2024, pp. 522–32, doi:<a href=\"https://doi.org/10.1134/S0005117924060031\">10.1134/S0005117924060031</a>.","chicago":"Arkhipov, Pavel. “An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.” <i>Automation and Remote Control</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1134/S0005117924060031\">https://doi.org/10.1134/S0005117924060031</a>.","ista":"Arkhipov P. 2024. An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. Automation and Remote Control. 85(6), 522–532.","ieee":"P. Arkhipov, “An algorithm for finding the generalized Chebyshev center of sets defined via their support functions,” <i>Automation and Remote Control</i>, vol. 85, no. 6. Springer Nature, pp. 522–532, 2024.","apa":"Arkhipov, P. (2024). An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. <i>Automation and Remote Control</i>. Springer Nature. <a href=\"https://doi.org/10.1134/S0005117924060031\">https://doi.org/10.1134/S0005117924060031</a>","ama":"Arkhipov P. An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. <i>Automation and Remote Control</i>. 2024;85(6):522-532. doi:<a href=\"https://doi.org/10.1134/S0005117924060031\">10.1134/S0005117924060031</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"18482","month":"06","scopus_import":"1","quality_controlled":"1","year":"2024","page":"522-532","external_id":{"isi":["001338721700007"]},"article_type":"original","language":[{"iso":"eng"}],"date_published":"2024-06-01T00:00:00Z","doi":"10.1134/S0005117924060031","publisher":"Springer Nature","issue":"6","abstract":[{"text":"This paper is dedicated to an optimization problem. Let A, B ⊂ Rn be compact convex sets. Consider the minimal number t0 > 0 such that t0B covers A after a shift to a vector x0 ∈ \r\nRn. The goal is to find t0 and x0. In the special case of B being a unit ball centered at zero, x0 and t0 are known as the Chebyshev center and the Chebyshev radius of A. This paper focuses on the case in which A and B are defined with their black-box support functions. An algorithm for solving such problems efficiently is suggested. The algorithm has a superlinear convergence rate, and it can solve hundred-dimensional test problems in a reasonable time, but some additional conditions on A and B are required to guarantee the presence of convergence. Additionally, the behavior of the algorithm for a simple special case is investigated, which leads to a number of theoretical results. Perturbations of this special case are also studied.","lang":"eng"}],"oa_version":"None","intvolume":"        85","date_updated":"2025-09-08T14:27:08Z","author":[{"full_name":"Arkhipov, Pavel","last_name":"Arkhipov","first_name":"Pavel","id":"b25f2ab2-1fed-11ee-8599-fe02d211784f"}],"department":[{"_id":"GradSch"}],"isi":1,"OA_type":"closed access","day":"01","title":"An algorithm for finding the generalized Chebyshev center of sets defined via their support functions","publication":"Automation and Remote Control","publication_identifier":{"issn":["0005-1179"],"eissn":["1608-3032"]},"article_processing_charge":"No","acknowledgement":"The author is grateful to Maxim Balashov for setting the problem, providing useful literature, important discussions and text review. Also, I thank Dmitry Tsarev and Kseniia Petukhova for meaningful talks and support.","date_created":"2024-10-27T23:01:45Z","status":"public"},{"title":"Effect of population structure on neutral genetic variation and barriers to gene exchange","alternative_title":["ISTA Thesis"],"day":"07","ddc":["576"],"has_accepted_license":"1","OA_type":"gold","project":[{"name":"Snapdragon Speciation","grant_number":"P32166","_id":"05959E1C-7A3F-11EA-A408-12923DDC885E"},{"_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","grant_number":"101055327","name":"Understanding the evolution of continuous genomes"}],"department":[{"_id":"GradSch"},{"_id":"NiBa"}],"author":[{"last_name":"Surendranadh","full_name":"Surendranadh, Parvathy","id":"455235B8-F248-11E8-B48F-1D18A9856A87","first_name":"Parvathy","orcid":"0000-0001-6395-386X"}],"date_updated":"2026-04-07T12:56:52Z","oa_version":"Published Version","abstract":[{"text":"Understanding the role of evolutionary processes in shaping genetic variation has been a\r\nprimary goal in evolutionary genetics. In this regard, a key question is how genetically\r\ndistinct populations evolve in the face of gene flow, thereby generating genetic and\r\nphenotypic divergence and reproductive isolation (RI). This requires quantifying the role\r\nand relative contributions of prezygotic and postzygotic isolating mechanisms on the\r\nreduction of gene exchange between populations, and identifying regions in the genome\r\nthat mediate RI, which is often polygenic. Further, this needs distinguishing neutral and\r\nselected regions in the genome, and discerning how selection influences patterns of neutral\r\ndivergence.\r\nPopulation structure, defined as any deviation from panmixia, such as geographic distribution, movement and mating patterns of individuals, influences how genetic variation is\r\nstructured in space and shapes the neutral null model. Availability of large scale spatial\r\ngenomic datasets now enables us to detect signatures of population structure in genetic\r\ndata and infer population genetic parameters. Such inferences are crucial and have wide\r\napplications in biodiversity, conservation genetics, population management and medical\r\ngenetics. However, inferences are based on assumptions that do not always match the\r\ncomplex reality, thus leading to erroneous conclusions. Moreover, the role and interaction\r\nof heterogeneous population density and dispersal, which are ubiquitous in nature, has\r\nbeen challenging to study owing to their mathematical complexity. In such scenarios,\r\nfeedback between theory, data and simulations can prove to be useful.\r\nIn this thesis, I examine the effect of population structure on neutral genetic variation\r\nand barriers to gene exchange in hybridising populations, thereby bridging together the\r\nfields of spatial population genetics and speciation.\r\nDespite being a key concept in speciation, reproductive isolation (RI) lacks a quantitative\r\ndefinition and has been used and measured differently across different fields. Chapter 2\r\ngives a quantitative definition of RI, in terms of the effect of genetic differences on gene\r\nflow. We give analytical predictions for RI in a range of scenarios, in terms of effective migration rates for discrete populations and barrier strength for continuous populations.\r\nIn addition to this, we discuss current measures of RI and their limitations, and propose\r\nthe need for new measures that combine organismal and genetic perspectives of RI.\r\nIn chapter 3, I examine the combined effect of assortative mating, sexual selection\r\nand viability selection on RI. For this, we consider a polygenic ‘magic’ trait under a\r\nmainland-island model. We obtain novel theoretical predictions for molecular divergence\r\nin terms of effective migration rates, which bears a simple relationship to measurable\r\nfitness components of migrants and various early generation hybrids. We explore the\r\nconditions under which local adaptation can be maintained despite maladaptive gene flow\r\nand quantify the relative contributions of viability and sexual selection to genome-wide\r\nbarriers to gene flow.\r\nThe next two chapters of the thesis focus on a hybrid zone of Antirrhinum majus that\r\nconsist of two subspecies- the magenta flowered A. m. pseudomajus and the yellow\r\nflowered A.m. striatum. Previous studies have suggested that flower colour is target of\r\npollinator mediated selection and is influenced only by few genes. While these regions\r\nshow high genetic differentiation between the subspecies, the rest of the genome is seen\r\nto be well mixed. Chapter 4 examines the effects of heterogeneous population density\r\nand leptokurtic dispersal on isolation by distance and the distribution of heterozygosity\r\nby focusing on non-flower colour markers.\r\nChapter 5 analyses cline shapes and associations among 6 focal flower colour markers to\r\nunderstand how selection and dispersal maintain this hybrid zone. We see sharp coincident\r\nstepped clines at all loci and positive associations throughout the hybrid zone, contrary to\r\nthe expected patterns from diffusive gene flow. With a novel scheme of inferring dispersal\r\ncombined with multilocus simulations, we show that stepped clines do not reflect genetic\r\nbarriers to gene flow, but are rather a result of long-distance migration. This framework\r\nallows us to get realistic estimates gene flow and selection and shows how traditional cline\r\nanalysis may lead to inaccurate conclusions when assumptions of the theory are not met.\r\nOverall, this thesis investigates how different features of population structure leave\r\ndetectable signatures in genetic variation, namely in patterns of isolation by distance,\r\nlinkage disequilibrium and genetic divergence. It also highlights how effective migration\r\nrates provide useful way of analysing polygenic architectures and shed new light into\r\nhybrid zones. In doing so, I identify scenarios when simple models become insufficient\r\nand suggest possibe directions by combining genetic data with simulations.","lang":"eng"}],"file_date_updated":"2024-11-07T10:59:42Z","status":"public","date_created":"2024-11-06T21:25:37Z","acknowledgement":"I also acknowledge the funding agencies Marie Curie COFUND Doctoral Fellowship,\r\nAustrian Science Fund FWF (grant P32166) and ERC (grant PR1000ERC02) for financially\r\nsupporting my research over the years.","article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"month":"11","_id":"18515","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"short":"P. Surendranadh, Effect of Population Structure on Neutral Genetic Variation and Barriers to Gene Exchange, Institute of Science and Technology Austria, 2024.","ista":"Surendranadh P. 2024. Effect of population structure on neutral genetic variation and barriers to gene exchange. Institute of Science and Technology Austria.","mla":"Surendranadh, Parvathy. <i>Effect of Population Structure on Neutral Genetic Variation and Barriers to Gene Exchange</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18515\">10.15479/at:ista:18515</a>.","chicago":"Surendranadh, Parvathy. “Effect of Population Structure on Neutral Genetic Variation and Barriers to Gene Exchange.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18515\">https://doi.org/10.15479/at:ista:18515</a>.","ama":"Surendranadh P. Effect of population structure on neutral genetic variation and barriers to gene exchange. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18515\">10.15479/at:ista:18515</a>","apa":"Surendranadh, P. (2024). <i>Effect of population structure on neutral genetic variation and barriers to gene exchange</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18515\">https://doi.org/10.15479/at:ista:18515</a>","ieee":"P. Surendranadh, “Effect of population structure on neutral genetic variation and barriers to gene exchange,” Institute of Science and Technology Austria, 2024."},"supervisor":[{"last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"}],"publication_status":"published","type":"dissertation","corr_author":"1","degree_awarded":"PhD","oa":1,"file":[{"date_created":"2024-11-07T10:59:29Z","relation":"main_file","creator":"psurendr","success":1,"file_id":"18519","checksum":"c32cf7bc75748d9c551d8eb70178bbec","access_level":"open_access","file_name":"PhD_Thesis__Parvathy_071124_PDFA.pdf","date_updated":"2024-11-07T10:59:29Z","content_type":"application/pdf","file_size":37019760},{"date_created":"2024-11-07T10:59:42Z","creator":"psurendr","relation":"source_file","file_name":"PhD Thesis- Parvathy_071124.zip","access_level":"closed","checksum":"4417e02d54084d89e75734e18caaa96d","file_id":"18520","file_size":41198857,"content_type":"application/zip","date_updated":"2024-11-07T10:59:42Z"}],"publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:18515","date_published":"2024-11-07T00:00:00Z","language":[{"iso":"eng"}],"page":"219","year":"2024"},{"file_date_updated":"2024-11-11T09:42:28Z","status":"public","date_created":"2024-11-10T23:01:58Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. This work is sponsored in part by the United States NSF CCF-2118356 award. This research was partially funded by A-IQ Ready (Chips JU, grant agreement No. 101096658).","article_processing_charge":"Yes (in subscription journal)","conference":{"location":"Istanbul, Turkey","start_date":"2024-10-15","end_date":"2024-10-17","name":"RV: Conference on Runtime Verification"},"ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031742330"],"eissn":["1611-3349"]},"publication":"24th International Conference on Runtime Verification","title":"Approximate distributed monitoring under partial synchrony: Balancing speed & accuracy","day":"12","alternative_title":["LNCS"],"ddc":["000"],"has_accepted_license":"1","isi":1,"OA_type":"hybrid","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"department":[{"_id":"ToHe"},{"_id":"GradSch"}],"author":[{"full_name":"Bonakdarpour, Borzoo","last_name":"Bonakdarpour","first_name":"Borzoo"},{"last_name":"Momtaz","full_name":"Momtaz, Anik","first_name":"Anik"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac"}],"intvolume":"     15191","date_updated":"2026-05-20T08:43:20Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In distributed systems with processes that do not share a global clock, partial synchrony is achieved by clock synchronization that guarantees bounded clock skew among all applications. Existing solutions for distributed runtime verification under partial synchrony against temporal logic specifications are exact but suffer from significant computational overhead. In this paper, we propose an approximate distributed monitoring algorithm for Signal Temporal Logic (STL) that mitigates this issue by abstracting away potential interleaving behaviors. This conservative abstraction enables a significant speedup of the distributed monitors, albeit with a tradeoff in accuracy. We address this tradeoff with a methodology that combines our approximate monitor with its exact counterpart, resulting in enhanced efficiency without sacrificing precision. We evaluate our approach with multiple experiments, showcasing its efficacy in both real-world applications and synthetic examples."}],"oa":1,"file":[{"relation":"main_file","creator":"dernst","success":1,"date_created":"2024-11-11T09:42:28Z","content_type":"application/pdf","date_updated":"2024-11-11T09:42:28Z","file_size":1897101,"file_id":"18539","file_name":"2024_LNCS_Bonakdarpour.pdf","checksum":"7b8ca21b8c19ab796fa445b0e54003ca","access_level":"open_access"}],"APC_amount":"2748 EUR","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2024-10-12T00:00:00Z","doi":"10.1007/978-3-031-74234-7_18","external_id":{"arxiv":["2408.05033"],"isi":["001420093700018"]},"page":"282-301","year":"2024","quality_controlled":"1","arxiv":1,"month":"10","scopus_import":"1","_id":"18521","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"B. Bonakdarpour, A. Momtaz, D. Nickovic, and N. E. Sarac, “Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy,” in <i>24th International Conference on Runtime Verification</i>, Istanbul, Turkey, 2024, vol. 15191, pp. 282–301.","apa":"Bonakdarpour, B., Momtaz, A., Nickovic, D., &#38; Sarac, N. E. (2024). Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy. In <i>24th International Conference on Runtime Verification</i> (Vol. 15191, pp. 282–301). Istanbul, Turkey: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">https://doi.org/10.1007/978-3-031-74234-7_18</a>","ama":"Bonakdarpour B, Momtaz A, Nickovic D, Sarac NE. Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy. In: <i>24th International Conference on Runtime Verification</i>. Vol 15191. Springer Nature; 2024:282-301. doi:<a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">10.1007/978-3-031-74234-7_18</a>","ista":"Bonakdarpour B, Momtaz A, Nickovic D, Sarac NE. 2024. Approximate distributed monitoring under partial synchrony: Balancing speed &#38; accuracy. 24th International Conference on Runtime Verification. RV: Conference on Runtime Verification, LNCS, vol. 15191, 282–301.","mla":"Bonakdarpour, Borzoo, et al. “Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed &#38; Accuracy.” <i>24th International Conference on Runtime Verification</i>, vol. 15191, Springer Nature, 2024, pp. 282–301, doi:<a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">10.1007/978-3-031-74234-7_18</a>.","chicago":"Bonakdarpour, Borzoo, Anik Momtaz, Dejan Nickovic, and Naci E Sarac. “Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed &#38; Accuracy.” In <i>24th International Conference on Runtime Verification</i>, 15191:282–301. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-74234-7_18\">https://doi.org/10.1007/978-3-031-74234-7_18</a>.","short":"B. Bonakdarpour, A. Momtaz, D. Nickovic, N.E. Sarac, in:, 24th International Conference on Runtime Verification, Springer Nature, 2024, pp. 282–301."},"publication_status":"published","corr_author":"1","volume":15191,"type":"conference"},{"author":[{"orcid":"0009-0006-2974-5075","first_name":"Roshan K","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","full_name":"Satapathy, Roshan K","last_name":"Satapathy"}],"oa_version":"Published Version","date_updated":"2026-04-07T13:00:36Z","abstract":[{"lang":"eng","text":"Locomotion is ubiquitous in the animal kingdom because an animal's survival depends on its ability to navigate its environment to find food, avoid predators and locate potential mates. These behaviours require control mechanisms that can extract information from the environment, particularly visual cues. Selective evolutionary pressures have thus refined such visuomotor transformations in a species-specific manner to meet the specific ecological and ethological challenges of each organism. However, a common challenge across organisms as visual information processing\r\nbecomes increasingly detailed is the mechanisms required to synthesise disparate pieces of information into a coherent percept or unified picture of the world. In this thesis, I investigate how disparate visual information is combined in the brain of Drosophila melanogaster to effectively guide locomotion.\r\nFor this, I first designed and built a behavioural setup to record locomotion and present visual stimuli to freely-walking fruit flies in a closed-loop manner. This setup allowed the investigation of innate visually-guided behaviours, including the optomotor reflex and courtship.\r\nSecond, taking advantage of my system I investigated the optomotor response, a reflexive visual stabilisation behaviour in which flies turn in the direction of global motion to minimise retinal slip. This behaviour is thought to be mediated by Lobula plate tangential cells (LPTCs); a complex network of optic-flow-sensitive neurons essential for self-motion estimation. Using a novel genetic mutant, I demonstrate that electrical coupling between two LPTC subtypes, contralateral HS and H2 neurons, regulates the balance between smooth optomotor turning and saccadic anti-optomotor responses. These findings underscore the critical role of binocular motion cue integration in guiding course control. Finally, I developed a novel behavioural paradigm in which a sexually aroused male fruit fly is presented with an optomotor distractor. This setup creates competition between two visual behaviours, courtship tracking and the  optomotor response, enabling me to explore how the visual system resolves this conflict. In this setting, males\r\nengaged in courtship selectively suppress their optomotor response based on the female's location. Furthermore, when this experiment is replicated with an “artificial female”, optogenetically aroused males alternate between tracking and optomotor responses. The probability and dynamics of this switching are determined by the relative strengths of the two competing stimuli. In summary, the results presented in this thesis explore two mechanisms – integration and competition - through which visual information is combined in the brain of the fruit fly to drive locomotion."}],"title":"Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster","ddc":["573"],"day":"20","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"MaJö"}],"project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-047-3"]},"related_material":{"record":[{"relation":"part_of_dissertation","id":"18444","status":"public"}]},"acknowledged_ssus":[{"_id":"M-Shop"}],"date_created":"2024-11-19T12:34:30Z","file_date_updated":"2024-12-13T10:27:25Z","status":"public","acknowledgement":"I am incredibly thankful for the outstanding support provided by ISTA, especially the Machine Shop team, who made conducting research much easier and more efficient. I am also grateful for the funding provided by European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie programme (665385) and The German Research Foundation grant DFG (SPP2205) “Evolutionary optimization of neuronal processing”.","article_processing_charge":"No","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","citation":{"mla":"Satapathy, Roshan K. <i>Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18568\">10.15479/at:ista:18568</a>.","ista":"Satapathy RK. 2024. Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. Institute of Science and Technology Austria.","chicago":"Satapathy, Roshan K. “Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18568\">https://doi.org/10.15479/at:ista:18568</a>.","short":"R.K. Satapathy, Mechanisms of Visual Integration and Competition in Innate Behaviours in Drosophila Melanogaster, Institute of Science and Technology Austria, 2024.","ieee":"R. K. Satapathy, “Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster,” Institute of Science and Technology Austria, 2024.","ama":"Satapathy RK. Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18568\">10.15479/at:ista:18568</a>","apa":"Satapathy, R. K. (2024). <i>Mechanisms of visual integration and competition in innate behaviours in Drosophila melanogaster</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18568\">https://doi.org/10.15479/at:ista:18568</a>"},"supervisor":[{"full_name":"Jösch, Maximilian A","last_name":"Jösch","orcid":"0000-0002-3937-1330","first_name":"Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","type":"dissertation","corr_author":"1","month":"11","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)"},"_id":"18568","page":"114","year":"2024","file":[{"date_created":"2024-11-19T12:39:55Z","success":1,"relation":"main_file","creator":"rsatapat","file_name":"Roshan PhD thesis-Final.pdf","access_level":"open_access","checksum":"340f2bfe882c8a85e11ec0687ca15f5e","file_id":"18570","file_size":10960975,"content_type":"application/pdf","date_updated":"2024-11-19T12:39:55Z"},{"file_id":"18571","file_name":"Roshan PhD thesis-Final.docx","access_level":"closed","checksum":"0f846fce60d6ea511e07f77eff59a6a1","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2024-12-13T10:27:25Z","file_size":36695917,"date_created":"2024-11-19T12:46:47Z","creator":"rsatapat","relation":"source_file"}],"oa":1,"date_published":"2024-11-20T00:00:00Z","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:18568"},{"month":"11","_id":"18588","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","supervisor":[{"first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R"},{"full_name":"Palacci, Jérémie A","last_name":"Palacci","orcid":"0000-0002-7253-9465","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","first_name":"Jérémie A"}],"citation":{"short":"C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales, Institute of Science and Technology Austria, 2024.","ista":"Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria.","mla":"Mweka, Cecelia N. <i>Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>.","chicago":"Mweka, Cecelia N. “Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>.","ieee":"C. N. Mweka, “Non equilibrium dynamics of driven individual particles and 3D printing across scales,” Institute of Science and Technology Austria, 2024.","apa":"Mweka, C. N. (2024). <i>Non equilibrium dynamics of driven individual particles and 3D printing across scales</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>","ama":"Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing across scales. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>"},"publication_status":"published","corr_author":"1","type":"dissertation","degree_awarded":"MS","oa":1,"file":[{"date_created":"2024-11-28T12:50:32Z","success":1,"creator":"cmweka","relation":"main_file","file_name":"Cecelia Mweka Master Thesis.pdf","checksum":"054ed7a5e5ae6e7220e6bb37ea57a3c3","access_level":"open_access","file_id":"18597","file_size":3836671,"content_type":"application/pdf","date_updated":"2024-11-28T12:50:32Z"},{"date_created":"2024-11-28T12:51:43Z","relation":"source_file","creator":"cmweka","file_id":"18598","file_name":"Cecelia Mweka Master Thesis.docx","checksum":"7d7d9299f090d83e628d65d93116e8c2","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2024-12-13T11:30:53Z","file_size":7068210}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:18588","date_published":"2024-11-29T00:00:00Z","page":"61","year":"2024","title":"Non equilibrium dynamics of driven individual particles and 3D printing across scales","alternative_title":["ISTA Master's Thesis"],"day":"29","ddc":["530"],"has_accepted_license":"1","department":[{"_id":"GradSch"}],"author":[{"last_name":"Mweka","full_name":"Mweka, Cecelia N","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21","first_name":"Cecelia N"}],"date_updated":"2026-04-07T12:42:13Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"This thesis is an experimental work about two distinct research projects that evolved from a single project: non-equilibrium dynamics of an acoustically vibrated particle and microfabrication of particles with nano-scale 3D printing. The first project explores non equilibrium dynamics of a particle driven by ultrasonic vibrations. We design an experimental system consisting of an electromechanical vibration scheme to drive the particle’s vibrations and an imaging scheme to track its trajectories. We study the trajectories to determine how the particle’s dynamics evolve under the driven conditions, considering out of equilibrium systems in the context of equilibrium statistical mechanics. Using a Langevin framework and the Boltzmann factor, we characterize the particle’s dynamics as complex; the particle motion\r\nis not purely diffusive. We extract physical parameters like spring constant, effective temperature, damping coefficient and resonance frequency.\r\n\r\nIn the second project, we explore and develop techniques in the design and microfabrication of particles across scales. Microfabrication involves building structures at the micron or submicron scale. These designed miniaturized patterns, objects, or devices are useful in biophysics, pharmacology, medical biology, and nanotechnology. We specifically apply two-photon polymerization, a form of 3D nano printing. We print millimetric particles, characterizing different designs to evaluate and showcase the resolution, aspect ratio integrity and print quality of the printing process. We also design and fabricate a microsensor to deflect under applicable force of order 0.1 pN. We present fundamental concepts needed to design the microsensor, showcasing 3D printing at considerably smaller scales down to the µm or below."}],"status":"public","file_date_updated":"2024-12-13T11:30:53Z","date_created":"2024-11-27T09:12:02Z","acknowledgement":"I would like to acknowledge Scott Waitukaitis and Jérémie Palacci, for their supervision, and their extensive support of my learning. \r\n\r\nFor the beautiful characterization images used in this work, I would like to thank Dr. Daniel Grober, Samuel Hajek and Felix Pertl.\r\n\r\nThe Palacci group, particularly Malina Strugaru and Dan Grober, for their continuous guidance in decoding and following my streams of thought.\r\n\r\nTo the Waitukaitis group, for helping me find my footing in science, and making me feel at\r\nhome.\r\n\r\nTo the Nanofabrication Facility (NFF) at ISTA, for training me in significant aspects of my research. The MIBA Facility, and particularly Todor Asenov for consistently picking up the phone for my machining and designing needs.\r\n\r\nTo my friends, Mariana, Lenka, Aaron, Rebecca, Eavan who provided an ear, wine, and a lot more when I needed to vent, talk through my crises as well as experiment. For the walks, for the coffees, for reading through my work and providing edits, for dinners to take me out of blocks and binds and for cheering me on when it felt insurmountable. \r\n\r\nFinally, I am grateful to Griff and Fletcher, whose music helped me through several blocks, especially with my writing.\r\n\r\nMy science would not have been possible without the guidance, support and contributions of\r\nall these people, and more.","article_processing_charge":"No","publication_identifier":{"issn":["2791-4585"]},"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}]},{"article_processing_charge":"No","date_created":"2024-12-17T16:17:55Z","status":"public","file_date_updated":"2024-12-19T10:24:50Z","acknowledgement":"I was supported by the European Research Council (ERC) Horizon 2020 project\r\n“Alpha Shape Theory Extended” No. 788183 and by the Pöttinger Scholarship. In addition,\r\nI am very thankful for having been able to attend the second Workshop for Women in\r\nComputational Topology in July 2019, funded by the Mathematical Sciences Institute at\r\nANU, the US National Science Foundation through the award CCF-1841455, the Australian\r\nMathematical Sciences Institute and the Association for Women in Mathematics. Two of the\r\nprojects presented in this thesis started there. One of them reached completion thanks to\r\nfunding from the MSRI Summer Research in Mathematics program awarded to me and my\r\ncollaborators in 2020.","related_material":{"record":[{"id":"10828","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"11440","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18673"},{"status":"public","relation":"part_of_dissertation","id":"9345"}]},"ec_funded":1,"publication_identifier":{"isbn":["978-3-99078-052-7"],"issn":["2663-337X"]},"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"}],"title":"New methods for applying topological data analysis to materials science","ddc":["514","516","004"],"day":"17","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","date_updated":"2026-04-07T12:54:10Z","abstract":[{"lang":"eng","text":"Many chemical and physical properties of materials are determined by the material’s shape,\r\nfor example the size of its pores and the width of its tunnels. This makes materials science\r\na prime application area for geometrical and topological methods. Nevertheless many\r\nmethods in topological data analysis have not been satisfyingly extended to the needs of\r\nmaterials science. This thesis provides new methods and new mathematical theorems\r\ntargeted at those specific needs by answering four different research questions. While the\r\nmotivation for each of the research questions arises from materials science, the methods\r\nare versatile and can be applied in different areas as well. \r\n\r\nThe first research question is concerned with image data, for example a three-dimensional\r\ncomputed tomography (CT) scan of a material, like sand or stone. There are two commonly\r\nused topologies for digital images and depending on the application either of them might be\r\nrequired. However, software for computing the topological data analysis method persistence\r\nhomology, usually supports only one of the two topologies. We answer the question how to\r\ncompute persistent homology of an image with respect to one of the two topologies using\r\nsoftware that is intended for the other topology. \r\n\r\nThe second research question is concerned with image data as well, and asks how much\r\nof the topological information of an image is lost when the resolution is coarsened. As\r\ncomputer tomography scanners are more expensive the higher the resolution, it is an\r\nimportant question in materials science to know which resolution is enough to get satisfying\r\npersistent homology. We give theoretical bounds on the information loss based on different\r\ngeometrical properties of the object to be scanned. In addition, we conduct experiments on\r\nsand and stone CT image data. \r\n\r\nThe third research question is motivated by comparing crystalline materials efficiently. As\r\nthe atoms within a crystal repeat periodically, crystalline materials are either modeled by\r\nunmanageable infinite periodic point sets, or by one of their fundamental domains, which is\r\nunstable under perturbation. Therefore a fingerprint of crystalline materials is needed, with\r\nappropriate properties such that comparing the crystals can be eased by comparing the\r\nfingerprints instead. We define the density fingerprint and prove the necessary properties. \r\n\r\nThe fourth research question is motivated by studying the hole-structure or connectedness,\r\ni.e. persistent homology or merge trees, of crystalline materials. A common way to deal\r\nwith periodicity is to take a fundamental domain and identify opposite boundaries to form a\r\ntorus. However, computing persistent homology or merge trees on that torus loses some\r\nof the information materials scientists are interested in and is additionally not stable under\r\ncertain noise. We therefore decorate the merge tree stemming from the torus with additional\r\ninformation describing the density and growth rate of the periodic copies of a component\r\nwithin a growing spherical window. We prove all desired properties, like stability and efficient\r\ncomputability."}],"author":[{"full_name":"Heiss, Teresa","last_name":"Heiss","orcid":"0000-0002-1780-2689","first_name":"Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87"}],"keyword":["persistent homology","topological data analysis","periodic","crystalline materials","images","fingerprint"],"file":[{"date_created":"2024-12-19T10:24:46Z","success":1,"relation":"main_file","creator":"theiss","file_name":"Teresa_Heiss_PhD_Thesis_final.pdf","access_level":"open_access","checksum":"247bb057aed2fba1cd4711917aaa2d77","file_id":"18686","file_size":7752253,"content_type":"application/pdf","date_updated":"2024-12-19T10:24:46Z"},{"file_name":"PhD_Thesis.zip","access_level":"closed","checksum":"9648b45c07a008ee11a07f99856a139d","file_id":"18687","file_size":17197731,"content_type":"application/zip","date_updated":"2024-12-19T10:24:50Z","date_created":"2024-12-19T10:24:50Z","creator":"theiss","relation":"source_file"}],"oa":1,"doi":"10.15479/at:ista:18667","publisher":"Institute of Science and Technology Austria","date_published":"2024-12-17T00:00:00Z","language":[{"iso":"eng"}],"year":"2024","page":"111","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"18667","month":"12","publication_status":"published","citation":{"short":"T. Heiss, New Methods for Applying Topological Data Analysis to Materials Science, Institute of Science and Technology Austria, 2024.","mla":"Heiss, Teresa. <i>New Methods for Applying Topological Data Analysis to Materials Science</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18667\">10.15479/at:ista:18667</a>.","ista":"Heiss T. 2024. New methods for applying topological data analysis to materials science. Institute of Science and Technology Austria.","chicago":"Heiss, Teresa. “New Methods for Applying Topological Data Analysis to Materials Science.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18667\">https://doi.org/10.15479/at:ista:18667</a>.","ieee":"T. Heiss, “New methods for applying topological data analysis to materials science,” Institute of Science and Technology Austria, 2024.","ama":"Heiss T. New methods for applying topological data analysis to materials science. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18667\">10.15479/at:ista:18667</a>","apa":"Heiss, T. (2024). <i>New methods for applying topological data analysis to materials science</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18667\">https://doi.org/10.15479/at:ista:18667</a>"},"supervisor":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"degree_awarded":"PhD","corr_author":"1","type":"dissertation","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"status":"public","file_date_updated":"2024-12-18T14:41:53Z","date_created":"2024-12-18T14:24:43Z","article_processing_charge":"No","ec_funded":1,"publication_identifier":{"issn":["2663-337X"],"isbn":[" 978-3-99078-051-0"]},"related_material":{"record":[{"relation":"part_of_dissertation","id":"11160","status":"public"},{"relation":"part_of_dissertation","id":"18677","status":"public"},{"relation":"part_of_dissertation","id":"13267","status":"public"},{"relation":"part_of_dissertation","id":"14257","status":"public"}]},"acknowledged_ssus":[{"_id":"Bio"}],"title":"Image analysis for brain tissue reconstruction with super-resolution light microscopy","day":"18","alternative_title":["ISTA Thesis"],"ddc":["004"],"has_accepted_license":"1","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"GradSch"},{"_id":"JoDa"}],"author":[{"full_name":"Lyudchik, Julia","last_name":"Lyudchik","first_name":"Julia","id":"46E28B80-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-14T08:34:35Z","oa_version":"Published Version","abstract":[{"text":"Mapping the complex and dense arrangement of cells and their connectivity in brain tissue requires volumetric imaging at nanoscale spatial resolution. While light microscopy excels at visualizing specific molecules and individual cells, achieving dense, synapse-level circuit reconstruction has not been possible with any light microscopy technique. Thus, the goal of my work was to develop image and data analysis pipelines for brain tissue visualization and reconstruction with light microscopy. To achieve dense circuit reconstruction with single-synapse resolution, I developed both conventional and deep-learning-based synapse detection algorithms, as well as connectivity analysis pipelines that integrate synapse detection with volumetric segmentation of brain tissue.","lang":"eng"}],"oa":1,"file":[{"content_type":"application/pdf","date_updated":"2024-12-18T14:17:34Z","file_size":160536833,"file_id":"18675","file_name":"18122024_PhDthesis_corrected_final_pdfa.pdf","checksum":"1b42b8073e2bc09fc504da52372248c1","access_level":"open_access","creator":"jlyudchi","relation":"main_file","success":1,"date_created":"2024-12-18T14:17:34Z"},{"date_created":"2024-12-18T14:21:06Z","creator":"jlyudchi","relation":"source_file","access_level":"closed","checksum":"b4da84624060745519723698f7ddf54b","file_name":"18122024_PhDthesis_corrected_final_JL_markup.docx","file_id":"18676","file_size":99172203,"date_updated":"2024-12-18T14:41:53Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}],"publisher":"Institute of Science and Technology Austria","date_published":"2024-12-18T00:00:00Z","doi":"10.15479/at:ista:18674","language":[{"iso":"eng"}],"page":"217","year":"2024","month":"12","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"18674","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"mla":"Lyudchik, Julia. <i>Image Analysis for Brain Tissue Reconstruction with Super-Resolution Light Microscopy</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18674\">10.15479/at:ista:18674</a>.","chicago":"Lyudchik, Julia. “Image Analysis for Brain Tissue Reconstruction with Super-Resolution Light Microscopy.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18674\">https://doi.org/10.15479/at:ista:18674</a>.","ista":"Lyudchik J. 2024. Image analysis for brain tissue reconstruction with super-resolution light microscopy. Institute of Science and Technology Austria.","short":"J. Lyudchik, Image Analysis for Brain Tissue Reconstruction with Super-Resolution Light Microscopy, Institute of Science and Technology Austria, 2024.","ieee":"J. Lyudchik, “Image analysis for brain tissue reconstruction with super-resolution light microscopy,” Institute of Science and Technology Austria, 2024.","apa":"Lyudchik, J. (2024). <i>Image analysis for brain tissue reconstruction with super-resolution light microscopy</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18674\">https://doi.org/10.15479/at:ista:18674</a>","ama":"Lyudchik J. Image analysis for brain tissue reconstruction with super-resolution light microscopy. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18674\">10.15479/at:ista:18674</a>"},"supervisor":[{"orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","full_name":"Danzl, Johann G","last_name":"Danzl"}],"publication_status":"published","corr_author":"1","type":"dissertation","degree_awarded":"PhD"},{"OA_embargo":"20","article_processing_charge":"No","date_created":"2024-12-19T02:30:39Z","status":"public","file_date_updated":"2024-12-20T10:31:37Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"related_material":{"record":[{"id":"11160","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18688"},{"status":"public","id":"18677","relation":"part_of_dissertation"},{"id":"18689","relation":"part_of_dissertation","status":"public"}]},"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-048-0"]},"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"JoDa"}],"project":[{"name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","grant_number":"26137","_id":"6285a163-2b32-11ec-9570-8e204ca2dba5"},{"_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","call_identifier":"FWF","name":"Molecular Drug Targets"}],"title":"Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy","ddc":["600","570"],"alternative_title":["ISTA Thesis"],"day":"20","oa_version":"Published Version","date_updated":"2026-04-07T12:56:37Z","author":[{"last_name":"Tavakoli","full_name":"Tavakoli, Mojtaba","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","first_name":"Mojtaba","orcid":"0000-0002-7667-6854"}],"file":[{"checksum":"b61651d417cafddd740a8528f46068c5","access_level":"closed","file_name":"Thesis_Mojtaba Tavakoli_.docx","file_id":"18699","file_size":118593521,"date_updated":"2024-12-20T10:31:37Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2024-12-20T10:23:17Z","relation":"source_file","creator":"mtavakol"},{"embargo_to":"open_access","file_name":"Thesis_Mojtaba Tavakoli_.pdf","checksum":"c80bcfd1a34c23afc3538052325283e5","access_level":"closed","embargo":"2026-08-01","file_id":"18700","file_size":63885521,"content_type":"application/pdf","date_updated":"2024-12-20T10:25:12Z","date_created":"2024-12-20T10:25:12Z","creator":"mtavakol","relation":"main_file"}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"doi":"10.15479/at:ista:18681","date_published":"2024-12-20T00:00:00Z","year":"2024","page":"230","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"18681","month":"12","publication_status":"published","citation":{"chicago":"Tavakoli, Mojtaba. “Developing Molecular and Structural Tools for Studying Brain Architecture with Super Resolution Expansion Microscopy. LICONN: Molecularly-Informed Connectomics Reconstruction with Light Microscopy.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18681\">https://doi.org/10.15479/at:ista:18681</a>.","ista":"Tavakoli M. 2024. Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy. Institute of Science and Technology Austria.","mla":"Tavakoli, Mojtaba. <i>Developing Molecular and Structural Tools for Studying Brain Architecture with Super Resolution Expansion Microscopy. LICONN: Molecularly-Informed Connectomics Reconstruction with Light Microscopy</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18681\">10.15479/at:ista:18681</a>.","short":"M. Tavakoli, Developing Molecular and Structural Tools for Studying Brain Architecture with Super Resolution Expansion Microscopy. LICONN: Molecularly-Informed Connectomics Reconstruction with Light Microscopy, Institute of Science and Technology Austria, 2024.","ieee":"M. Tavakoli, “Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy,” Institute of Science and Technology Austria, 2024.","apa":"Tavakoli, M. (2024). <i>Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18681\">https://doi.org/10.15479/at:ista:18681</a>","ama":"Tavakoli M. Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18681\">10.15479/at:ista:18681</a>"},"supervisor":[{"first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","last_name":"Danzl","full_name":"Danzl, Johann G"}],"degree_awarded":"PhD","corr_author":"1","type":"dissertation","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"keyword":["cryo-EM","cryo-ET","cryo-SPA","Structural Virology","Poxvirus","Vaccinia Virus","Structural Biology"],"date_published":"2024-12-30T00:00:00Z","doi":"10.15479/at:ista:18766","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"file":[{"file_size":38814932,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2025-01-07T12:15:11Z","file_name":"PhD_thesis_Julia_Datler.docx","access_level":"closed","checksum":"3e51cab327c754045c3d29c1a50cc9a9","file_id":"18769","relation":"source_file","creator":"jstanger","date_created":"2025-01-07T12:15:11Z"},{"file_id":"18770","checksum":"22fabe5b97950bf852212f6edb555173","access_level":"open_access","file_name":"PhD_thesis_Julia_Datler.pdf","date_updated":"2025-01-07T12:15:14Z","content_type":"application/pdf","file_size":12044865,"date_created":"2025-01-07T12:15:14Z","relation":"main_file","creator":"jstanger","success":1}],"oa":1,"year":"2024","page":"106","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"_id":"18766","month":"12","degree_awarded":"PhD","corr_author":"1","type":"dissertation","publication_status":"published","citation":{"ieee":"J. Datler, “Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM,” Institute of Science and Technology Austria, 2024.","apa":"Datler, J. (2024). <i>Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18766\">https://doi.org/10.15479/at:ista:18766</a>","ama":"Datler J. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18766\">10.15479/at:ista:18766</a>","chicago":"Datler, Julia. “Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18766\">https://doi.org/10.15479/at:ista:18766</a>.","ista":"Datler J. 2024. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. Institute of Science and Technology Austria.","mla":"Datler, Julia. <i>Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18766\">10.15479/at:ista:18766</a>.","short":"J. Datler, Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM, Institute of Science and Technology Austria, 2024."},"supervisor":[{"full_name":"Schur, Florian KM","last_name":"Schur","orcid":"0000-0003-4790-8078","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","article_processing_charge":"No","acknowledgement":"This work was funded by the Austrian Science Fund (FWF) grant P31445 and ISTA. I\r\nwould like to express my gratitude to the Scientific Service Units, particularly the Lab\r\nSupport Facility, the Scientific Computing Facility and the Electron Microscopy Facility\r\nfor their tremendous support. I want to especially thank Alois for assisting me with the\r\ninstallation of countless new software and for troubleshooting cluster issues. A special\r\nthanks goes to Valentin for his outstanding support in cryo-EM data acquisition and\r\nhis ongoing help in improving the process to ensure that I obtained the best possible\r\ndata from my sample.","date_created":"2025-01-07T10:23:12Z","status":"public","file_date_updated":"2025-01-07T12:15:14Z","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"related_material":{"record":[{"status":"public","id":"12334","relation":"part_of_dissertation"},{"status":"public","id":"14979","relation":"part_of_dissertation"}]},"publication_identifier":{"isbn":["978-3-99078-049-7"],"issn":["2663-337X"]},"department":[{"_id":"GradSch"},{"_id":"FlSc"}],"project":[{"name":"Structural conservation and diversity in retroviral capsid","call_identifier":"FWF","grant_number":"P31445","_id":"26736D6A-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","ddc":["570"],"day":"30","alternative_title":["ISTA thesis"],"title":"Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM","abstract":[{"lang":"eng","text":"Poxviruses are large pleomorphic double-stranded DNA viruses that include well known members such as variola virus, the causative agent of smallpox, Mpox virus, as well as Vaccinia virus (VACV), which serves as a vaccination strain for formerly mentioned viruses. VACV is a valuable model for studying large pleomorphic DNA viruses in general and poxviruses specifically, as many features, such as core morphology and structural proteins, are well conserved within this family. Despite decades of research, our understanding of the structural components and proteins that comprise the poxvirus core in mature virions remains limited. Although major core proteins were identified via indirect experimental evidence, the core's complexity, with its large size, structure and number of involved proteins, has hindered efforts to achieve high-resolution insights and to define the roles of the individual proteins. The specific protein composition of the core's individual layers, including the palisade layer and the inner core wall, has remained unclear. In this study, we have merged multiple approaches, including single particle cryo electron microscopy of purified virus cores, cryo-electron tomography and subtomogram averaging of mature virions and molecular modeling to elucidate the structural determinants of the VACV core. Due to the lack of experimentally derived structures, either in situ or reconstituted in vitro, we used Alphafold to predict models of the putative major core protein candidates, A10, 23k, A3, A4, and L4. Our results show that the VACV core is composed of several layers with varying local symmetries, forming more intricate interactions than observed previously. This allowed us to identify several molecular building blocks forming the viral core lattice. In particular, we identified trimers of protein A10 as a major core structure that forms the palisade layer of the viral core. Additionally, we revealed that six petals of a flower shaped core pore within the core wall are composed of A10 trimers. Furthermore, we obtained a cryo-EM density for the inner core wall that could potentially accommodate an A3 dimer. Integrating descriptions of protein interactions from previous studies enabled us to provide a detailed structural model of the poxvirus core wall, and our findings indicate that the interactions within A10 trimers are likely consistent across orthopox- and parapoxviruses. This combined application of cryo-SPA and cryo-ET can help overcome obstacles in studying complex virus structures in the future, including their key assembly proteins, interactions, and the formation into a core lattice. Our work provides important fundamental new insights into poxvirus core architecture, also considering the recent re-emergence of poxviruses."}],"oa_version":"Published Version","date_updated":"2026-04-07T12:59:44Z","author":[{"id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Julia","orcid":"0000-0002-3616-8580","last_name":"Datler","full_name":"Datler, Julia"}]},{"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"18847","month":"09","scopus_import":"1","arxiv":1,"corr_author":"1","type":"conference","volume":38,"citation":{"ista":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. 2024. Smoke and mirrors in causal downstream tasks. ICML 2024 Workshop AI4Science. ICML: International Conference on Machine Learning vol. 38.","chicago":"Cadei, Riccardo, Lukas Lindorfer, Sylvia Cremer, Cordelia Schmid, and Francesco Locatello. “Smoke and Mirrors in Causal Downstream Tasks.” In <i>ICML 2024 Workshop AI4Science</i>, Vol. 38. Curran Associates, 2024.","mla":"Cadei, Riccardo, et al. “Smoke and Mirrors in Causal Downstream Tasks.” <i>ICML 2024 Workshop AI4Science</i>, vol. 38, Curran Associates, 2024.","short":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, F. Locatello, in:, ICML 2024 Workshop AI4Science, Curran Associates, 2024.","ama":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. Smoke and mirrors in causal downstream tasks. In: <i>ICML 2024 Workshop AI4Science</i>. Vol 38. Curran Associates; 2024.","apa":"Cadei, R., Lindorfer, L., Cremer, S., Schmid, C., &#38; Locatello, F. (2024). Smoke and mirrors in causal downstream tasks. In <i>ICML 2024 Workshop AI4Science</i> (Vol. 38). Curran Associates.","ieee":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, and F. Locatello, “Smoke and mirrors in causal downstream tasks,” in <i>ICML 2024 Workshop AI4Science</i>, 2024, vol. 38."},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","language":[{"iso":"eng"}],"date_published":"2024-09-25T00:00:00Z","publisher":"Curran Associates","oa":1,"file":[{"file_size":4453014,"date_updated":"2025-01-27T11:42:24Z","content_type":"application/pdf","access_level":"open_access","checksum":"beedf05388bbdb7ddda81ec3d5ec7026","file_name":"2024_ICML_Cadei.pdf","file_id":"18896","success":1,"relation":"main_file","creator":"dernst","date_created":"2025-01-27T11:42:24Z"}],"year":"2024","quality_controlled":"1","external_id":{"arxiv":["2405.17151"]},"department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"OA_type":"gold","has_accepted_license":"1","day":"25","ddc":["000","570"],"title":"Smoke and mirrors in causal downstream tasks","abstract":[{"lang":"eng","text":"Machine Learning and AI have the potential to transform data-driven\r\nscientific discovery, enabling accurate predictions for several scientific\r\nphenomena. As many scientific questions are inherently causal, this paper looks\r\nat the causal inference task of treatment effect estimation, where the outcome\r\nof interest is recorded in high-dimensional observations in a Randomized\r\nControlled Trial (RCT). Despite being the simplest possible causal setting and\r\na perfect fit for deep learning, we theoretically find that many common choices\r\nin the literature may lead to biased estimates. To test the practical impact of\r\nthese considerations, we recorded ISTAnt, the first real-world benchmark for\r\ncausal inference downstream tasks on high-dimensional observations as an RCT\r\nstudying how garden ants (Lasius neglectus) respond to microparticles applied\r\nonto their colony members by hygienic grooming. Comparing 6 480 models\r\nfine-tuned from state-of-the-art visual backbones, we find that the sampling\r\nand modeling choices significantly affect the accuracy of the causal estimate,\r\nand that classification accuracy is not a proxy thereof. We further validated\r\nthe analysis, repeating it on a synthetically generated visual data set\r\ncontrolling the causal model. Our results suggest that future benchmarks should\r\ncarefully consider real downstream scientific questions, especially causal\r\nones. Further, we highlight guidelines for representation learning methods to\r\nhelp answer causal questions in the sciences."}],"intvolume":"        38","date_updated":"2025-07-10T11:51:50Z","oa_version":"Published Version","author":[{"last_name":"Cadei","full_name":"Cadei, Riccardo","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","first_name":"Riccardo"},{"id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455","first_name":"Lukas","last_name":"Lindorfer","full_name":"Lindorfer, Lukas"},{"last_name":"Cremer","full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"full_name":"Schmid, Cordelia","last_name":"Schmid","first_name":"Cordelia"},{"full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"}],"article_processing_charge":"No","acknowledgement":"We thank Piersilvio De Bartolomeis, and the full Causal Learning and Artificial Intelligence (CLAI) group at ISTA for the extremely helpful discussions. Riccardo Cadei was supported by a Google Research Scholar Award and a Google Initiated Gift to Francesco Locatello. We thank the Social Immunity team at ISTA particularly Michaela Hönigsberger and Wilfrid Jean Louis, for supporting the ecological experiment and Farnaz Beikzadeh Abbasi, Luisa Fiebig and Martin Estermann for annotating ant behavior in ISTAnt.","file_date_updated":"2025-01-27T11:42:24Z","status":"public","date_created":"2025-01-14T07:27:26Z","publication":"ICML 2024 Workshop AI4Science","related_material":{"link":[{"url":"https://github.com/CausalLearningAI/ISTAnt","relation":"software"}],"record":[{"status":"public","relation":"research_data","id":"18895"},{"status":"for_moderation","relation":"is_continued_by","id":"19509"}]},"conference":{"end_date":"2024-07-26","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-26"}},{"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"_id":"18874","month":"12","day":"05","arxiv":1,"title":"Intriguing properties of robust classification","abstract":[{"text":"Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers.","lang":"eng"}],"corr_author":"1","type":"preprint","date_updated":"2026-04-07T11:49:51Z","citation":{"ama":"Prach B, Lampert C. Intriguing properties of robust classification. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>","apa":"Prach, B., &#38; Lampert, C. (n.d.). Intriguing properties of robust classification. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” <i>arXiv</i>. .","short":"B. Prach, C. Lampert, ArXiv (n.d.).","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, 2412.04245, doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>.","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>."},"article_number":"2412.04245","publication_status":"draft","oa_version":"Preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","last_name":"Prach","full_name":"Prach, Bernd"},{"last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"OA_place":"repository","article_processing_charge":"No","doi":"10.48550/arXiv.2412.04245","language":[{"iso":"eng"}],"date_published":"2024-12-05T00:00:00Z","status":"public","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"date_created":"2025-01-24T16:57:29Z","related_material":{"record":[{"id":"20455","relation":"later_version","status":"public"},{"relation":"dissertation_contains","id":"19759","status":"public"}]},"publication":"arXiv","year":"2024","external_id":{"arxiv":["2412.04245"]}},{"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"N. Kalinin, C. Lampert, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","chicago":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","mla":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","ista":"Kalinin N, Lampert C. 2024. Banded square root matrix factorization for differentially private model training. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","apa":"Kalinin, N., &#38; Lampert, C. (2024). Banded square root matrix factorization for differentially private model training. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ama":"Kalinin N, Lampert C. Banded square root matrix factorization for differentially private model training. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","ieee":"N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37."},"publication_status":"published","type":"conference","corr_author":"1","volume":37,"arxiv":1,"month":"12","scopus_import":"1","_id":"18875","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"external_id":{"arxiv":["2405.13763"]},"year":"2024","quality_controlled":"1","oa":1,"file":[{"file_size":1144656,"content_type":"application/pdf","date_updated":"2025-01-27T09:52:15Z","file_name":"2024_NeurIPS_Nikita.pdf","access_level":"open_access","checksum":"a216cab8eddc1fe7840aede0e2c0d41e","file_id":"18888","success":1,"creator":"dernst","relation":"main_file","date_created":"2025-01-27T09:52:15Z"}],"language":[{"iso":"eng"}],"publisher":"Neural Information Processing Systems Foundation","date_published":"2024-12-01T00:00:00Z","author":[{"full_name":"Kalinin, Nikita","last_name":"Kalinin","first_name":"Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137"},{"last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"intvolume":"        37","date_updated":"2025-05-14T11:34:20Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Current state-of-the-art methods for differentially private model training are based on matrix factorization techniques. However, these methods suffer from high computational overhead because they require numerically solving a demanding optimization problem to determine an approximately optimal factorization prior to the actual model training. In this work, we present a new matrix factorization approach, BSR, which overcomes this computational bottleneck. By exploiting properties of the standard matrix square root, BSR allows to efficiently handle also large-scale problems. For the key scenario of stochastic gradient descent with momentum and weight decay, we even derive analytical expressions for BSR that render the computational overhead negligible. We prove bounds on the approximation quality that hold both in the centralized and in the federated learning setting. Our numerical experiments demonstrate that models trained using BSR perform on par with the best existing methods, while completely avoiding their computational overhead."}],"title":"Banded square root matrix factorization for differentially private model training","alternative_title":["Advances in Neural Information Processing Systems"],"day":"01","ddc":["000"],"has_accepted_license":"1","OA_type":"gold","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"conference":{"location":"Vancouver, Canada","start_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","end_date":"2024-12-16"},"publication_identifier":{"eissn":["1049-5258"]},"publication":"38th Annual Conference on Neural Information Processing Systems","status":"public","file_date_updated":"2025-01-27T09:52:15Z","date_created":"2025-01-24T17:58:16Z","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"date_published":"2024-12-01T00:00:00Z","publisher":"Neural Information Processing Systems Foundation","oa":1,"quality_controlled":"1","year":"2024","external_id":{"arxiv":["2402.13728"]},"_id":"18890","month":"12","scopus_import":"1","arxiv":1,"volume":37,"corr_author":"1","type":"conference","publication_status":"published","citation":{"ista":"Beaglehole D, Súkeník P, Mondelli M, Belkin M. 2024. Average gradient outer product as a mechanism for deep neural collapse. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","mla":"Beaglehole, Daniel, et al. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","chicago":"Beaglehole, Daniel, Peter Súkeník, Marco Mondelli, and Mikhail Belkin. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","short":"D. Beaglehole, P. Súkeník, M. Mondelli, M. Belkin, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Beaglehole D, Súkeník P, Mondelli M, Belkin M. Average gradient outer product as a mechanism for deep neural collapse. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","apa":"Beaglehole, D., Súkeník, P., Mondelli, M., &#38; Belkin, M. (2024). Average gradient outer product as a mechanism for deep neural collapse. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"D. Beaglehole, P. Súkeník, M. Mondelli, and M. Belkin, “Average gradient outer product as a mechanism for deep neural collapse,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","article_processing_charge":"No","acknowledgement":"We acknowledge support from the National Science Foundation (NSF) and the Simons Foundation for the Collaboration on the Theoretical Foundations of Deep Learning through awards DMS-2031883 and #814639 as well as the TILOS institute (NSF CCF-2112665). This work used the programs (1) XSEDE (Extreme science and engineering discovery environment) which is supported by NSF grant numbers ACI-1548562, and (2) ACCESS (Advanced cyberinfrastructure coordination ecosystem: services & support) which is supported by NSF grants numbers #2138259, #2138286, #2138307, #2137603, and #2138296. Specifically, we used the resources from SDSC Expanse GPU compute nodes, and NCSA Delta system, via allocations TG-CIS220009. Marco Mondelli is supported by the 2019 Lopez-Loreta prize. We also acknowledge useful feedback from anonymous reviewers. ","date_created":"2025-01-27T11:11:40Z","main_file_link":[{"url":"https://openreview.net/forum?id=lJ1jdl2K9k","open_access":"1"}],"status":"public","publication":"38th Annual Conference on Neural Information Processing Systems","publication_identifier":{"eissn":["1049-5258"]},"conference":{"location":"Vancouver, Canada","start_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","end_date":"2024-12-16"},"department":[{"_id":"GradSch"},{"_id":"MaMo"}],"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"OA_type":"green","alternative_title":["Advances in Neural Information Processing Systems"],"day":"01","title":"Average gradient outer product as a mechanism for deep neural collapse","abstract":[{"lang":"eng","text":"Deep Neural Collapse (DNC) refers to the surprisingly rigid structure of the data representations in the final layers of Deep Neural Networks (DNNs). Though the phenomenon has been measured in a variety of settings, its emergence is typically explained via data-agnostic approaches, such as the unconstrained features model. In this work, we introduce a data-dependent setting where DNC forms due to feature learning through the average gradient outer product (AGOP). The AGOP is defined with respect to a learned predictor and is equal to the uncentered covariance matrix of its input-output gradients averaged over the training dataset. The Deep Recursive Feature Machine (Deep RFM) is a method that constructs a neural network by iteratively mapping the data with the AGOP and applying an untrained random feature map. We demonstrate empirically that DNC occurs in Deep RFM across standard settings as a consequence of the projection with the AGOP matrix computed at each layer. Further, we theoretically explain DNC in Deep RFM in an asymptotic setting and as a result of kernel learning. We then provide evidence that this mechanism holds for neural networks more generally. In particular, we show that the right singular vectors and values of the weights can be responsible for the majority of within-class variability collapse for DNNs trained in the feature learning regime. As observed in recent work, this singular structure is highly correlated with that of the AGOP."}],"oa_version":"Preprint","intvolume":"        37","date_updated":"2025-05-14T11:29:45Z","author":[{"last_name":"Beaglehole","full_name":"Beaglehole, Daniel","first_name":"Daniel"},{"first_name":"Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","last_name":"Súkeník","full_name":"Súkeník, Peter"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020"},{"first_name":"Mikhail","last_name":"Belkin","full_name":"Belkin, Mikhail"}]},{"acknowledged_ssus":[{"_id":"ScienComp"}],"publication":"38th Annual Conference on Neural Information Processing Systems","conference":{"start_date":"2024-12-16","location":"Vancouver, Canada","end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems"},"article_processing_charge":"No","acknowledgement":"Marco Mondelli is partially supported by the 2019 Lopez-Loreta prize. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","date_created":"2025-01-27T11:15:18Z","file_date_updated":"2025-02-04T08:11:25Z","status":"public","abstract":[{"text":"Deep neural networks (DNNs) exhibit a surprising structure in their final layer\r\nknown as neural collapse (NC), and a growing body of works has currently investigated the propagation of neural collapse to earlier layers of DNNs – a phenomenon\r\ncalled deep neural collapse (DNC). However, existing theoretical results are restricted to special cases: linear models, only two layers or binary classification.\r\nIn contrast, we focus on non-linear models of arbitrary depth in multi-class classification and reveal a surprising qualitative shift. As soon as we go beyond two\r\nlayers or two classes, DNC stops being optimal for the deep unconstrained features\r\nmodel (DUFM) – the standard theoretical framework for the analysis of collapse.\r\nThe main culprit is a low-rank bias of multi-layer regularization schemes: this bias\r\nleads to optimal solutions of even lower rank than the neural collapse. We support\r\nour theoretical findings with experiments on both DUFM and real data, which show\r\nthe emergence of the low-rank structure in the solution found by gradient descent.","lang":"eng"}],"oa_version":"Published Version","intvolume":"        37","date_updated":"2025-06-04T07:19:21Z","author":[{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","first_name":"Peter","full_name":"Súkeník, Peter","last_name":"Súkeník"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph"},{"orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","last_name":"Mondelli"}],"department":[{"_id":"GradSch"},{"_id":"MaMo"},{"_id":"ChLa"}],"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"OA_type":"gold","has_accepted_license":"1","ddc":["000"],"alternative_title":["Advances in Neural Information Processing Systems"],"day":"01","title":"Neural collapse versus low-rank bias: Is deep neural collapse really optimal?","quality_controlled":"1","year":"2024","external_id":{"arxiv":["2405.14468"]},"publisher":"Neural Information Processing Systems Foundation","language":[{"iso":"eng"}],"date_published":"2024-12-01T00:00:00Z","file":[{"date_created":"2025-02-04T08:11:25Z","relation":"main_file","creator":"dernst","success":1,"file_id":"18989","access_level":"open_access","checksum":"b7b79f1ea3ac1e9e11b3d91faaeb0780","file_name":"2024_NeurIPS_Sukenik.pdf","date_updated":"2025-02-04T08:11:25Z","content_type":"application/pdf","file_size":1784118}],"oa":1,"corr_author":"1","type":"conference","volume":37,"publication_status":"published","citation":{"short":"P. Súkeník, C. Lampert, M. Mondelli, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","mla":"Súkeník, Peter, et al. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","chicago":"Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","ista":"Súkeník P, Lampert C, Mondelli M. 2024. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse versus low-rank bias: Is deep neural collapse really optimal?,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","ama":"Súkeník P, Lampert C, Mondelli M. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","apa":"Súkeník, P., Lampert, C., &#38; Mondelli, M. (2024). Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"18891","month":"12","arxiv":1},{"year":"2024","related_material":{"record":[{"status":"public","id":"18847","relation":"used_in_publication"}]},"main_file_link":[{"open_access":"1","url":"https://10.6084/M9.FIGSHARE.26484934.V2"}],"date_created":"2025-01-27T11:45:43Z","oa":1,"status":"public","date_published":"2024-10-23T00:00:00Z","doi":"10.6084/M9.FIGSHARE.26484934.V2","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","OA_place":"repository","author":[{"id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","first_name":"Riccardo","last_name":"Cadei","full_name":"Cadei, Riccardo"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","full_name":"Locatello, Francesco"},{"last_name":"Cremer","full_name":"Cremer, Sylvia M","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia M","orcid":"0000-0002-2193-3868"},{"full_name":"Lindorfer, Lukas","last_name":"Lindorfer","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455","first_name":"Lukas"},{"full_name":"Schmid, Cordelia","last_name":"Schmid","first_name":"Cordelia"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_updated":"2025-01-27T11:58:38Z","citation":{"ama":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. ISTAnt. 2024. doi:<a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>","apa":"Cadei, R., Locatello, F., Cremer, S., Lindorfer, L., &#38; Schmid, C. (2024). ISTAnt. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">https://doi.org/10.6084/M9.FIGSHARE.26484934.V2</a>","ieee":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, and C. Schmid, “ISTAnt.” Institute of Science and Technology Austria, 2024.","short":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, C. Schmid, (2024).","chicago":"Cadei, Riccardo, Francesco Locatello, Sylvia Cremer, Lukas Lindorfer, and Cordelia Schmid. “ISTAnt.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">https://doi.org/10.6084/M9.FIGSHARE.26484934.V2</a>.","mla":"Cadei, Riccardo, et al. <i>ISTAnt</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>.","ista":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. 2024. ISTAnt, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>."},"corr_author":"1","abstract":[{"lang":"eng","text":"ISTAnt is a new ecological dataset for social immunity and represents the first real-world benchmark for causal inference downstream tasks on high-dimensional observations. It analyzes grooming behavior in the ant Lasius neglectus in groups of three worker ants. The workers for the experiment were obtained from their laboratory stock colony, which had been collected from the field in 2022 in the Botanical Garden Jena, Germany. Ant collection and all experimental work were performed in compliance with international, national and institutional regulations and ethical guidelines. For the experiment, the body surface of one of the three ants was treated with a suspension of either of two microparticle types (diameter ~5 µm) to induce grooming by the two nestmates, which were individually color-coded by application of a dot of blue or orange paint, respectively. The three ants were housed in small plastic containers (diameter 28mm, height 30mm) with moistened, plastered ground and the interior walls covered with PTFE (polytetrafluoroethane) to hamper climbing by the ants. Filming occurred in a temperature- and humidity-controlled room at 23°C within a custom-made filming box with controlled lighting and ventilation conditions. We set up nine ant groups at a time (always containing both treatments) and placed them randomly on positions 1-9 marked on the floor in a 3x3 grid, about 3mm from each other. The experiment was performed on two consecutive days. Videos were acquired using a USB camera (FLIR blackfly S BFS-U3-120S4C, Teledyne FLIR) with a high-performance lens (HP Series 25mm Focal Length, Edmund optics 86-572) in OBS studio 29.0.0 \\citep{bailey2017obs} at a framerate of 30 FPS and a resolution of 2500x2500 pixels. From each original video (105x105 mm), we generated nine individual videos .mkv (each ~32x32 mm, 770x770 pixels) by determining exact coordinates per container from one frame in GIMP 2.10.36 and cropping of the videos with FFmpeg 6.1.1. Annotation was performed over two consecutive days by three observers who had not been involved in the experimental setup or recording and were unaware of the treatment assignments to ensure bias-free behavioral annotation. They annotated the behavior of the ants during video observations, using custom-made software that saves the start and end frames of behaviors marked in a .csv file (see 'annotations' folder). In one of the videos, one of the nestmates' legs got inadvertently stuck to its body surface during the color-coding, interfering with its behavior, so the video was discarded. This left 44 videos from 5 independent setups (n=24 of treatment 1 and n=20 of treatment 2) of 10 minutes each for a total of 792 000 annotated frames (see 'video' folder). For each video, we provide the following information: the number of the set to which it belongs (1-5); the number of the position within the set reflecting the position of the ant group under the camera (1-9), for which we also provide ‘coordinates’ in the 3x3 grid (taking values -1/0/1 for both X and Y axis); treatment (1 or 2); the hour of the day when the recording was started (in 24h CEST); experimental day (A or B); the top left coordinate of the cropping square from the original video (CropX/CropY); the person annotating the video (given as A, B, C); the date of annotation (1: first day, 2: second day) and in which order the videos were annotated by each person, both reflecting a possible training effect of the person (see 'experiments_settings.csv' file)."}],"type":"research_data_reference","title":"ISTAnt","ddc":["570"],"day":"23","month":"10","OA_type":"gold","_id":"18895","department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}]},{"quality_controlled":"1","year":"2024","external_id":{"arxiv":["2403.02627"]},"page":"8:1-8:15","file":[{"success":1,"relation":"main_file","creator":"dernst","date_created":"2025-01-27T14:17:37Z","file_size":880725,"content_type":"application/pdf","date_updated":"2025-01-27T14:17:37Z","file_name":"2024_LIPICs_Aronov.pdf","checksum":"443aa29ea5d948e917cfccd681dcf176","access_level":"open_access","file_id":"18918"}],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2024-06-06T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2024.8","language":[{"iso":"eng"}],"publication_status":"published","citation":{"ama":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>","apa":"Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>","ieee":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.","ista":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.","mla":"Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>.","chicago":"Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In <i>40th International Symposium on Computational Geometry</i>, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>.","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15."},"corr_author":"1","type":"conference","volume":293,"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"18917","arxiv":1,"month":"06","scopus_import":"1","publication":"40th International Symposium on Computational Geometry","related_material":{"record":[{"id":"19860","relation":"later_version","status":"public"}]},"conference":{"location":"Athens, Greece","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14"},"publication_identifier":{"isbn":["9783959773164"]},"article_processing_charge":"Yes","date_created":"2025-01-27T14:19:17Z","file_date_updated":"2025-01-27T14:17:37Z","status":"public","acknowledgement":"Aronov, Boris: Work has been supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work.","oa_version":"Published Version","intvolume":"       293","date_updated":"2026-06-18T18:18:27Z","abstract":[{"text":"An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.\r\nWe prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.\r\nMoreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2}).","lang":"eng"}],"author":[{"full_name":"Aronov, Boris","last_name":"Aronov","first_name":"Boris"},{"last_name":"Basit","full_name":"Basit, Abdul","first_name":"Abdul"},{"full_name":"Ramesh, Indu","last_name":"Ramesh","first_name":"Indu"},{"full_name":"Tasinato, Gianluca","last_name":"Tasinato","first_name":"Gianluca","id":"0433290C-AF8F-11E9-A4C7-F729E6697425"},{"full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"OA_type":"gold","has_accepted_license":"1","department":[{"_id":"UlWa"},{"_id":"GradSch"}],"title":"Eight-partitioning points in 3D, and efficiently too","ddc":["510"],"day":"06"}]