[{"date_published":"2021-03-01T00:00:00Z","has_accepted_license":"1","doi":"10.1364/OE.406095","acknowledgement":"H2020 Marie Skłodowska-Curie Actions (642841); European Research Council (715767); Grantová Agentura České Republiky (16-08111S, 16-18964S); Univerzita Karlova v Praze (SVV-2017-260452); Engineering and Physical Sciences Research Council (EP/K023578/1).\r\nWe are grateful to Stratasys Ltd. for access to the voxel-level print interface of the J750\r\nmachine.","day":"01","_id":"9241","publication":"Optics Express","type":"journal_article","isi":1,"publication_identifier":{"eissn":["1094-4087"]},"file_date_updated":"2021-03-22T08:15:28Z","title":"Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing","volume":29,"oa_version":"Published Version","ddc":["000"],"issue":"5","article_processing_charge":"No","status":"public","citation":{"ama":"Elek O, Zhang R, Sumin D, et al. Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. <i>Optics Express</i>. 2021;29(5):7568-7588. doi:<a href=\"https://doi.org/10.1364/OE.406095\">10.1364/OE.406095</a>","ista":"Elek O, Zhang R, Sumin D, Myszkowski K, Bickel B, Wilkie A, Křivánek J, Weyrich T. 2021. Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. Optics Express. 29(5), 7568–7588.","mla":"Elek, Oskar, et al. “Robust and Practical Measurement of Volume Transport Parameters in Solid Photo-Polymer Materials for 3D Printing.” <i>Optics Express</i>, vol. 29, no. 5, Optica Publishing Group, 2021, pp. 7568–88, doi:<a href=\"https://doi.org/10.1364/OE.406095\">10.1364/OE.406095</a>.","short":"O. Elek, R. Zhang, D. Sumin, K. Myszkowski, B. Bickel, A. Wilkie, J. Křivánek, T. Weyrich, Optics Express 29 (2021) 7568–7588.","chicago":"Elek, Oskar, Ran Zhang, Denis Sumin, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, Jaroslav Křivánek, and Tim Weyrich. “Robust and Practical Measurement of Volume Transport Parameters in Solid Photo-Polymer Materials for 3D Printing.” <i>Optics Express</i>. Optica Publishing Group, 2021. <a href=\"https://doi.org/10.1364/OE.406095\">https://doi.org/10.1364/OE.406095</a>.","apa":"Elek, O., Zhang, R., Sumin, D., Myszkowski, K., Bickel, B., Wilkie, A., … Weyrich, T. (2021). Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing. <i>Optics Express</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OE.406095\">https://doi.org/10.1364/OE.406095</a>","ieee":"O. Elek <i>et al.</i>, “Robust and practical measurement of volume transport parameters in solid photo-polymer materials for 3D printing,” <i>Optics Express</i>, vol. 29, no. 5. Optica Publishing Group, pp. 7568–7588, 2021."},"publisher":"Optica Publishing Group","page":"7568-7588","month":"03","scopus_import":"1","abstract":[{"text":"Volumetric light transport is a pervasive physical phenomenon, and therefore its accurate simulation is important for a broad array of disciplines. While suitable mathematical models for computing the transport are now available, obtaining the necessary material parameters needed to drive such simulations is a challenging task: direct measurements of these parameters from material samples are seldom possible. Building on the inverse scattering paradigm, we present a novel measurement approach which indirectly infers the transport parameters from extrinsic observations of multiple-scattered radiance. The novelty of the proposed approach lies in replacing structured illumination with a structured reflector bonded to the sample, and a robust fitting procedure that largely compensates for potential systematic errors in the calibration of the setup. We show the feasibility of our approach by validating simulations of complex 3D compositions of the measured materials against physical prints, using photo-polymer resins. As presented in this paper, our technique yields colorspace data suitable for accurate appearance reproduction in the area of 3D printing. Beyond that, and without fundamental changes to the basic measurement methodology, it could equally well be used to obtain spectral measurements that are useful for other application areas.","lang":"eng"}],"year":"2021","date_created":"2021-03-14T23:01:33Z","author":[{"last_name":"Elek","first_name":"Oskar","full_name":"Elek, Oskar"},{"orcid":"0000-0002-3808-281X","last_name":"Zhang","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","first_name":"Ran","full_name":"Zhang, Ran"},{"first_name":"Denis","last_name":"Sumin","full_name":"Sumin, Denis"},{"full_name":"Myszkowski, Karol","last_name":"Myszkowski","first_name":"Karol"},{"full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"full_name":"Wilkie, Alexander","first_name":"Alexander","last_name":"Wilkie"},{"full_name":"Křivánek, Jaroslav","first_name":"Jaroslav","last_name":"Křivánek"},{"first_name":"Tim","last_name":"Weyrich","full_name":"Weyrich, Tim"}],"external_id":{"isi":["000624968100103"]},"intvolume":"        29","publication_status":"published","date_updated":"2026-07-07T05:54:53Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1364/OE.406095","project":[{"name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"access_level":"open_access","success":1,"content_type":"application/pdf","checksum":"a9697ad83136c19ad87e46aa2db63cfd","relation":"main_file","date_updated":"2021-03-22T08:15:28Z","creator":"dernst","file_name":"2021_OpticsExpress_Elek.pdf","file_id":"9269","file_size":10873700,"date_created":"2021-03-22T08:15:28Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BeBi"}],"article_type":"original"},{"article_processing_charge":"No","status":"public","arxiv":1,"oa_version":"Preprint","ddc":["000"],"publication_identifier":{"eisbn":["978-1-7281-9077-8"],"issn":["1050-4729"],"eissn":["2577-087X"],"isbn":["978-1-7281-9078-5"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"title":"Adversarial training is not ready for robot learning","isi":1,"type":"conference","publication":"2021 IEEE International Conference on Robotics and Automation","_id":"10666","day":"01","doi":"10.1109/ICRA48506.2021.9561036","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","has_accepted_license":"1","date_published":"2021-06-01T00:00:00Z","OA_place":"repository","das_tickbox":"1","page":"4140-4147","publisher":"IEEE","citation":{"apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China: IEEE. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. IEEE, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, IEEE, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, IEEE, 2021, pp. 4140–4147.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. IEEE; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 4140–4147."},"OA_type":"green","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)"},"oa":1,"date_updated":"2026-07-07T06:20:35Z","publication_status":"published","external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"date_created":"2022-01-25T15:44:54Z","year":"2021","conference":{"end_date":"2021-06-05","start_date":"2021-05-30","location":"Xi'an, China","name":"ICRA: International Conference on Robotics and Automation"},"abstract":[{"text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning.","lang":"eng"}],"scopus_import":"1","month":"06","related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"fulldoi":"https://doi.org/10.1109/ICRA48506.2021.9561036","language":[{"iso":"eng"}],"quality_controlled":"1"},{"department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"earlier_version","id":"15074","status":"public"}]},"project":[{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"840605","name":"Coordination in constrained and natural distributed systems"}],"ec_funded":1,"language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.1145/3409964.3461785","oa":1,"date_updated":"2026-07-07T06:21:32Z","publication_status":"published","date_created":"2021-07-18T22:01:22Z","year":"2021","conference":{"location":" Virtual Event, United States","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures ","start_date":"2021-07-06","end_date":"2021-07-08"},"external_id":{"arxiv":["2005.07761"]},"author":[{"first_name":"Sebastian","last_name":"Brandt","full_name":"Brandt, Sebastian"},{"first_name":"Barbara","last_name":"Keller","full_name":"Keller, Barbara"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","first_name":"Joel"},{"last_name":"Suomela","first_name":"Jukka","full_name":"Suomela, Jukka"},{"last_name":"Uitto","first_name":"Jara","full_name":"Uitto, Jara"}],"abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.","lang":"eng"}],"month":"07","scopus_import":"1","das_tickbox":"1","publisher":"Association for Computing Machinery","page":"129-139","citation":{"apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2021). Efficient load-balancing through distributed token dropping. In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 129–139).  Virtual Event, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Efficient load-balancing through distributed token dropping,” in <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>,  Virtual Event, United States, 2021, pp. 129–139.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Efficient Load-Balancing through Distributed Token Dropping.” In <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 129–39. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461785\">https://doi.org/10.1145/3409964.3461785</a>.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2021. Efficient load-balancing through distributed token dropping. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures , 129–139.","mla":"Brandt, Sebastian, et al. “Efficient Load-Balancing through Distributed Token Dropping.” <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 129–39, doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Efficient load-balancing through distributed token dropping. In: <i>Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:129-139. doi:<a href=\"https://doi.org/10.1145/3409964.3461785\">10.1145/3409964.3461785</a>","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 129–139."},"article_processing_charge":"No","status":"public","oa_version":"Preprint","arxiv":1,"publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","main_file_link":[{"url":"https://arxiv.org/abs/2005.07761","open_access":"1"}],"publication_identifier":{"isbn":["9781450380706"]},"title":"Efficient load-balancing through distributed token dropping","type":"conference","doi":"10.1145/3409964.3461785","acknowledgement":"We thank Orr Fischer, Juho Hirvonen, and Tuomo Lempiäinen for valuable discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.","_id":"9678","day":"06","date_published":"2021-07-06T00:00:00Z"},{"publication":"35th Conference on Neural Information Processing Systems","file_date_updated":"2022-01-26T07:39:59Z","publication_identifier":{"issn":["1049-5258"]},"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"title":"Infinite time horizon safety of Bayesian neural networks","type":"conference","article_processing_charge":"No","status":"public","arxiv":1,"oa_version":"Published Version","ddc":["000"],"date_published":"2021-12-01T00:00:00Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","doi":"10.48550/arXiv.2111.03165","alternative_title":[" Advances in Neural Information Processing Systems"],"has_accepted_license":"1","_id":"10667","day":"01","publisher":"Neural Information Processing Systems Foundation","das_tickbox":"1","corr_author":"1","citation":{"chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021."},"publication_status":"published","date_updated":"2026-07-07T06:49:10Z","oa":1,"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)"},"abstract":[{"lang":"eng","text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications."}],"month":"12","year":"2021","date_created":"2022-01-25T15:45:58Z","conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","start_date":"2021-12-06","end_date":"2021-12-10"},"external_id":{"arxiv":["2111.03165"]},"author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Žikelić","first_name":"Ðorđe","full_name":"Žikelić, Ðorđe"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"file":[{"file_size":452492,"date_created":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","file_id":"10682","date_updated":"2022-01-26T07:39:59Z","creator":"mlechner","relation":"main_file","success":1,"content_type":"application/pdf","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","access_level":"open_access"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","fulldoi":"https://doi.org/10.48550/arXiv.2111.03165","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}]},{"publication":"35th Conference on Neural Information Processing Systems","type":"conference","file_date_updated":"2022-01-26T07:37:24Z","title":"Causal navigation by continuous-time neural networks","publication_identifier":{"issn":["1049-5258"]},"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html","open_access":"1"}],"arxiv":1,"ddc":["000"],"oa_version":"Published Version","article_processing_charge":"No","status":"public","date_published":"2021-12-01T00:00:00Z","alternative_title":[" Advances in Neural Information Processing Systems"],"has_accepted_license":"1","acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","day":"01","_id":"10670","publisher":"Neural Information Processing Systems Foundation","das_tickbox":"1","citation":{"ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual: Neural Information Processing Systems Foundation.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021."},"publication_status":"published","date_updated":"2026-07-07T06:49:46Z","oa":1,"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)"},"month":"12","abstract":[{"text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning.","lang":"eng"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","end_date":"2021-12-10","start_date":"2021-12-06"},"date_created":"2022-01-25T15:47:50Z","year":"2021","author":[{"last_name":"Vorbach","first_name":"Charles J","full_name":"Vorbach, Charles J"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"}],"external_id":{"arxiv":["2106.08314"]},"file":[{"access_level":"open_access","content_type":"application/pdf","checksum":"be81f0ade174a8c9b2d4fe09590b2021","success":1,"relation":"main_file","creator":"mlechner","date_updated":"2022-01-26T07:37:24Z","file_id":"10679","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_created":"2022-01-26T07:37:24Z","file_size":6841228}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"quality_controlled":"1","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}]},{"related_material":{"record":[{"relation":"earlier_version","id":"35","status":"public"}]},"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"fulldoi":"https://doi.org/10.1016/j.artint.2021.103499","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2026-07-07T13:36:04Z","oa":1,"intvolume":"       297","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Dvořák, Wolfgang","first_name":"Wolfgang","last_name":"Dvořák"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"external_id":{"isi":["000657537500003"],"arxiv":["1804.07031"]},"year":"2021","date_created":"2021-03-28T22:01:40Z","month":"03","scopus_import":"1","abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"publisher":"Elsevier","citation":{"mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>, vol. 297, no. 8, 103499, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>.","ista":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.","short":"K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","ama":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. 2021;297(8). doi:<a href=\"https://doi.org/10.1016/j.artint.2021.103499\">10.1016/j.artint.2021.103499</a>","apa":"Chatterjee, K., Dvořák, W., Henzinger, M., &#38; Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>","ieee":"K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” <i>Artificial Intelligence</i>, vol. 297, no. 8. Elsevier, 2021.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>Artificial Intelligence</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.artint.2021.103499\">https://doi.org/10.1016/j.artint.2021.103499</a>."},"corr_author":"1","arxiv":1,"oa_version":"Preprint","article_processing_charge":"No","issue":"8","status":"public","volume":297,"type":"journal_article","article_number":"103499","title":"Algorithms and conditional lower bounds for planning problems","isi":1,"publication_identifier":{"issn":["0004-3702"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"publication":"Artificial Intelligence","day":"16","_id":"9293","doi":"10.1016/j.artint.2021.103499","date_published":"2021-03-16T00:00:00Z"},{"publication":"37th International Symposium on Computational Geometry","file_date_updated":"2021-06-02T10:22:33Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-184-9"]},"title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","type":"conference","volume":189,"status":"public","article_processing_charge":"No","oa_version":"Published Version","ddc":["005","516","514"],"date_published":"2021-06-02T00:00:00Z","acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","doi":"10.4230/LIPIcs.SoCG.2021.17","alternative_title":["LIPIcs"],"has_accepted_license":"1","_id":"9441","day":"02","place":"Dagstuhl, Germany","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"17:1-17:16","das_tickbox":"1","citation":{"mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” <i>37th International Symposium on Computational Geometry</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>.","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: <i>37th International Symposium on Computational Geometry</i>. Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In <i>37th International Symposium on Computational Geometry</i>, 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>.","apa":"Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In <i>37th International Symposium on Computational Geometry</i> (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in <i>37th International Symposium on Computational Geometry</i>, Virtual, 2021, vol. 189, p. 17:1-17:16."},"publication_status":"published","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","intvolume":"       189","oa":1,"date_updated":"2026-07-07T13:43:40Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"abstract":[{"lang":"eng","text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. "}],"scopus_import":"1","month":"06","date_created":"2021-06-02T10:10:55Z","year":"2021","conference":{"start_date":"2021-06-07","end_date":"2021-06-11","location":"Virtual","name":"SoCG: Symposium on Computational Geometry"},"author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"full_name":"Kachanovich, Siargey","first_name":"Siargey","last_name":"Kachanovich"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"file":[{"content_type":"application/pdf","checksum":"c322aa48d5d35a35877896cc565705b6","success":1,"access_level":"open_access","creator":"mwintrae","date_updated":"2021-06-02T10:22:33Z","relation":"main_file","file_id":"9442","file_name":"LIPIcs-SoCG-2021-17.pdf","date_created":"2021-06-02T10:22:33Z","file_size":1972902}],"department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","status":"public","id":"12960"}]},"language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2021.17","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}]},{"alternative_title":["LCNS"],"doi":"10.1007/978-3-030-84245-1_17","acknowledgement":"We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper.","day":"11","_id":"10041","date_published":"2021-08-11T00:00:00Z","volume":12826,"oa_version":"Preprint","article_processing_charge":"No","status":"public","publication":"41st Annual International Cryptology Conference","type":"conference","title":"Limits on the Adaptive Security of Yao’s Garbling","publication_identifier":{"isbn":["978-3-030-84244-4"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-84245-1"]},"main_file_link":[{"url":"https://eprint.iacr.org/2021/945","open_access":"1"}],"isi":1,"citation":{"apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In <i>41st Annual International Cryptology Conference</i> (Vol. 12826, pp. 486–515). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in <i>41st Annual International Cryptology Conference</i>, Virtual, 2021, vol. 12826, pp. 486–515.","chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In <i>41st Annual International Cryptology Conference</i>, 12826:486–515. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">https://doi.org/10.1007/978-3-030-84245-1_17</a>.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: <i>41st Annual International Cryptology Conference</i>. Vol 12826. Cham: Springer Nature; 2021:486-515. doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>","mla":"Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” <i>41st Annual International Cryptology Conference</i>, vol. 12826, Springer Nature, 2021, pp. 486–515, doi:<a href=\"https://doi.org/10.1007/978-3-030-84245-1_17\">10.1007/978-3-030-84245-1_17</a>.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Springer Nature, Cham, 2021, pp. 486–515.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference. CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515."},"publisher":"Springer Nature","place":"Cham","page":"486-515","cryptoeprintid":1,"conference":{"start_date":"2021-08-16","end_date":"2021-08-20","name":"CRYPTO: Annual International Cryptology Conference","location":"Virtual"},"year":"2021","date_created":"2021-09-23T14:06:15Z","author":[{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","first_name":"Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"external_id":{"isi":["000696697800017"],"cryptoeprintid":["2021/945"]},"month":"08","scopus_import":"1","abstract":[{"text":"Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth   δ , the loss in security is at most exponential in   δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth  δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in   δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security.","lang":"eng"}],"date_updated":"2026-07-07T13:57:01Z","oa":1,"intvolume":"     12826","publication_status":"published","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1007/978-3-030-84245-1_17","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"related_material":{"record":[{"status":"public","id":"10035","relation":"dissertation_contains"}]}},{"citation":{"apa":"Braun, L., &#38; Vogels, T. P. (2021). Online learning of neural computations from sparse temporal feedback. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 20, pp. 16437–16450). Virtual, Online: Neural Information Processing Systems Foundation.","ieee":"L. Braun and T. P. Vogels, “Online learning of neural computations from sparse temporal feedback,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 20, pp. 16437–16450.","chicago":"Braun, Lukas, and Tim P Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” In <i>35th Conference on Neural Information Processing Systems</i>, 20:16437–50. Neural Information Processing Systems Foundation, 2021.","ama":"Braun L, Vogels TP. Online learning of neural computations from sparse temporal feedback. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 20. Neural Information Processing Systems Foundation; 2021:16437-16450.","short":"L. Braun, T.P. Vogels, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 16437–16450.","mla":"Braun, Lukas, and Tim P. Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 20, Neural Information Processing Systems Foundation, 2021, pp. 16437–50.","ista":"Braun L, Vogels TP. 2021. Online learning of neural computations from sparse temporal feedback. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 20, 16437–16450."},"corr_author":"1","publisher":"Neural Information Processing Systems Foundation","page":"16437-16450","das_tickbox":"1","date_published":"2021-12-01T00:00:00Z","alternative_title":["Advances in Neural Information Processing Systems"],"acknowledgement":"We would like to thank Professor Dr. Henning Sprekeler for his valuable suggestions and Dr. Andrew Saxe, Milan Klöwer and Anna Wallis for their constructive feedback on the manuscript. Lukas Braun was supported by the Network of European Neuroscience Schools through their NENS Exchange Grant program, by the European Union through their European Community Action Scheme for the Mobility of University Students, the Woodward Scholarship awarded by Wadham College, Oxford and the Medical Research Council [MR/N013468/1]. Tim P. Vogels was supported by a Wellcome Trust Senior Research Fellowship [214316/Z/18/Z].","day":"01","_id":"11453","publication":"35th Conference on Neural Information Processing Systems","type":"conference","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/88e1ce84f9feef5a08d0df0334c53468-Paper.pdf","open_access":"1"}],"title":"Online learning of neural computations from sparse temporal feedback","volume":20,"ddc":["000","570"],"oa_version":"Published Version","article_processing_charge":"No","status":"public","quality_controlled":"1","language":[{"iso":"eng"}],"project":[{"_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","grant_number":"214316/Z/18/Z","name":"Whatâs in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"TiVo"}],"month":"12","scopus_import":"1","abstract":[{"text":"Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological properties. Synaptic connectivity determines which inputs from presynaptic neurons are integrated, while cellular properties determine how inputs are filtered over time. Unlike their biological counterparts, most computational approaches to learning in simulated neural networks are limited to changes in synaptic connectivity. However, if intrinsic parameters change, neural computations are altered drastically. Here, we include the parameters that determine the intrinsic properties,\r\ne.g., time constants and reset potential, into the learning paradigm. Using sparse feedback signals that indicate target spike times, and gradient-based parameter updates, we show that the intrinsic parameters can be learned along with the synaptic weights to produce specific input-output functions. Specifically, we use a teacher-student paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire neuron must recover the parameters of a teacher neuron. We show that complex temporal functions can be learned online and without backpropagation through time, relying on event-based updates only. Our results are a step towards online learning of neural computations from ungraded and unsigned sparse feedback signals with a biologically inspired learning mechanism.","lang":"eng"}],"conference":{"location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-14","start_date":"2021-12-06"},"date_created":"2022-06-19T22:01:59Z","year":"2021","author":[{"full_name":"Braun, Lukas","first_name":"Lukas","last_name":"Braun"},{"full_name":"Vogels, Tim P","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","orcid":"0000-0003-3295-6181","first_name":"Tim P"}],"intvolume":"        20","publication_status":"published","oa":1,"date_updated":"2026-07-08T05:45:00Z"},{"das_tickbox":"1","publisher":"Neural Information Processing Systems Foundation","page":"2823-2834","citation":{"short":"F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 2823–2834.","mla":"Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited Communication.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34.","ista":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal component analysis with limited communication. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 4, 2823–2834.","ama":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.","chicago":"Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In <i>35th Conference on Neural Information Processing Systems</i>, 4:2823–34. Neural Information Processing Systems Foundation, 2021.","ieee":"F. Alimisis, P. Davies, B. Vandereycken, and D.-A. Alistarh, “Distributed principal component analysis with limited communication,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 4, pp. 2823–2834.","apa":"Alimisis, F., Davies, P., Vandereycken, B., &#38; Alistarh, D.-A. (2021). Distributed principal component analysis with limited communication. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 4, pp. 2823–2834). Virtual, Online: Neural Information Processing Systems Foundation."},"corr_author":"1","volume":4,"ddc":["000"],"arxiv":1,"oa_version":"Published Version","status":"public","article_processing_charge":"No","publication":"35th Conference on Neural Information Processing Systems","type":"conference","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf"}],"title":"Distributed principal component analysis with limited communication","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"alternative_title":["Advances in Neural Information Processing Systems"],"acknowledgement":"We would like to thank the anonymous reviewers for helpful comments and suggestions. We also thank Aurelien Lucchi and Antonio Orvieto for fruitful discussions at an early stage of this work. FA is partially supported by the SNSF under research project No. 192363 and conducted part of this work while at IST Austria under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411.","day":"01","_id":"11452","date_published":"2021-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"date_updated":"2026-07-08T05:44:33Z","oa":1,"intvolume":"         4","publication_status":"published","conference":{"location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-14","start_date":"2021-12-06"},"date_created":"2022-06-19T22:01:58Z","year":"2021","author":[{"full_name":"Alimisis, Foivos","first_name":"Foivos","last_name":"Alimisis"},{"full_name":"Davies, Peter","orcid":"0000-0002-5646-9524","id":"11396234-BB50-11E9-B24C-90FCE5697425","last_name":"Davies","first_name":"Peter"},{"full_name":"Vandereycken, Bart","last_name":"Vandereycken","first_name":"Bart"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2110.14391"]},"month":"12","scopus_import":"1","abstract":[{"lang":"eng","text":"We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a new quantized variant of Riemannian gradient descent to solve this problem, and prove that the algorithm converges with high probability under a set of necessary spherical-convexity properties. We give bounds on the number of bits transmitted by the algorithm under common initialization schemes, and investigate the dependency on the problem dimension in each case."}]},{"abstract":[{"lang":"eng","text":"Quantum entanglement has been generated and verified in cold-atom experiments and used to make atom-interferometric measurements below the shot-noise limit. However, current state-of-the-art cold-atom devices exploit separable (i.e., unentangled) atomic states. This perspective piece asks the question: can entanglement usefully improve cold-atom sensors, in the sense that it gives new sensing capabilities unachievable with current state-of-the-art devices? We briefly review the state-of-the-art in precision cold-atom sensing, focusing on clocks and inertial sensors, identifying the potential benefits entanglement could bring to these devices, and the challenges that need to be overcome to realize these benefits. We survey demonstrated methods of generating metrologically useful entanglement in cold-atom systems, note their relative strengths and weaknesses, and assess their prospects for near-to-medium term quantum-enhanced cold-atom sensing."}],"scopus_import":"1","month":"04","year":"2021","date_created":"2021-04-18T22:01:40Z","external_id":{"isi":["000637702100001"],"arxiv":["2010.09168"]},"author":[{"last_name":"Szigeti","first_name":"Stuart S.","full_name":"Szigeti, Stuart S."},{"full_name":"Hosten, Onur","orcid":"0000-0002-2031-204X","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur"},{"last_name":"Haine","first_name":"Simon A.","full_name":"Haine, Simon A."}],"supplementarymaterial":"no","publication_status":"published","intvolume":"       118","oa":1,"date_updated":"2026-07-08T08:53:45Z","language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.1063/5.0050235","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","department":[{"_id":"OnHo"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","article_type":"original","date_published":"2021-04-07T00:00:00Z","doi":"10.1063/5.0050235","acknowledgement":"We acknowledge fruitful discussions with John Close, Chris Freier, Kyle Hardman, Joseph Hope, and Paul Wigley, and insightful suggestions made by Franck Pereira dos Santos on behalf of the Atom Interferometry and Inertial Sensors team at SYRTE. S.S.S. was supported by an Australian Research Council Discovery Early Career Researcher Award (DECRA), Project No. DE200100495. O.H. was supported by IST Austria.","_id":"9331","day":"07","publication":"Applied Physics Letters","isi":1,"title":"Improving cold-atom sensors with quantum entanglement: Prospects and challenges","publication_identifier":{"issn":["0003-6951"]},"main_file_link":[{"url":"https://arxiv.org/abs/2010.09168","open_access":"1"}],"type":"journal_article","article_number":"140501","volume":118,"issue":"14","status":"public","article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","corr_author":"1","citation":{"mla":"Szigeti, Stuart S., et al. “Improving Cold-Atom Sensors with Quantum Entanglement: Prospects and Challenges.” <i>Applied Physics Letters</i>, vol. 118, no. 14, 140501, AIP Publishing, 2021, doi:<a href=\"https://doi.org/10.1063/5.0050235\">10.1063/5.0050235</a>.","short":"S.S. Szigeti, O. Hosten, S.A. Haine, Applied Physics Letters 118 (2021).","ista":"Szigeti SS, Hosten O, Haine SA. 2021. Improving cold-atom sensors with quantum entanglement: Prospects and challenges. Applied Physics Letters. 118(14), 140501.","ama":"Szigeti SS, Hosten O, Haine SA. Improving cold-atom sensors with quantum entanglement: Prospects and challenges. <i>Applied Physics Letters</i>. 2021;118(14). doi:<a href=\"https://doi.org/10.1063/5.0050235\">10.1063/5.0050235</a>","chicago":"Szigeti, Stuart S., Onur Hosten, and Simon A. Haine. “Improving Cold-Atom Sensors with Quantum Entanglement: Prospects and Challenges.” <i>Applied Physics Letters</i>. AIP Publishing, 2021. <a href=\"https://doi.org/10.1063/5.0050235\">https://doi.org/10.1063/5.0050235</a>.","apa":"Szigeti, S. S., Hosten, O., &#38; Haine, S. A. (2021). Improving cold-atom sensors with quantum entanglement: Prospects and challenges. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0050235\">https://doi.org/10.1063/5.0050235</a>","ieee":"S. S. Szigeti, O. Hosten, and S. A. Haine, “Improving cold-atom sensors with quantum entanglement: Prospects and challenges,” <i>Applied Physics Letters</i>, vol. 118, no. 14. AIP Publishing, 2021."},"researchdata_availability":"upon request","publisher":"AIP Publishing","das_tickbox":"1"},{"publication_status":"published","intvolume":"       217","oa":1,"date_updated":"2026-07-28T12:39:03Z","OA_type":"free access","abstract":[{"text":"Interspecific crossing experiments have shown that sex chromosomes play a major role in reproductive isolation between many pairs of species. However, their ability to act as reproductive barriers, which hamper interspecific genetic exchange, has rarely been evaluated quantitatively compared to Autosomes. This genome-wide limitation of gene flow is essential for understanding the complete separation of species, and thus speciation. Here, we develop a mainland-island model of secondary contact between hybridizing species of an XY (or ZW) sexual system. We obtain theoretical predictions for the frequency of introgressed alleles, and the strength of the barrier to neutral gene flow for the two types of chromosomes carrying multiple interspecific barrier loci. Theoretical predictions are obtained for scenarios where introgressed alleles are rare. We show that the same analytical expressions apply for sex chromosomes and autosomes, but with different sex-averaged effective parameters. The specific features of sex chromosomes (hemizygosity and absence of recombination in the heterogametic sex) lead to reduced levels of introgression on the X (or Z) compared to autosomes. This effect can be enhanced by certain types of sex-biased forces, but it remains overall small (except when alleles causing incompatibilities are recessive). We discuss these predictions in the light of empirical data comprising model-based tests of introgression and cline surveys in various biological systems.","lang":"eng"}],"scopus_import":"1","month":"02","date_created":"2021-02-18T14:41:30Z","year":"2021","external_id":{"isi":["000637218100005"],"pmid":["33724409"]},"author":[{"id":"32DF5794-F248-11E8-B48F-1D18A9856A87","last_name":"Fraisse","orcid":"0000-0001-8441-5075","first_name":"Christelle","full_name":"Fraisse, Christelle"},{"last_name":"Sachdeva","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","first_name":"Himani","full_name":"Sachdeva, Himani"}],"pmid":1,"department":[{"_id":"NiBa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.1093/genetics/iyaa025","project":[{"call_identifier":"FWF","grant_number":"M02463","name":"Sex chromosomes and species barriers","_id":"2662AADE-B435-11E9-9278-68D0E5697425"}],"publication":"Genetics","main_file_link":[{"url":"https://doi.org/10.1093/genetics/iyaa025","open_access":"1"}],"title":"The rates of introgression and barriers to genetic exchange between hybridizing species: Sex chromosomes vs autosomes","publication_identifier":{"issn":["1943-2631"]},"isi":1,"article_number":"iyaa025","type":"journal_article","volume":217,"article_processing_charge":"No","status":"public","issue":"2","ddc":["570"],"oa_version":"Published Version","date_published":"2021-02-01T00:00:00Z","OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"}],"acknowledgement":"The computations were performed with the IST Austria High-Performance Computing (HPC) Cluster and the Institut Français de Bioinformatique (IFB) Core Cluster. We are grateful to Nick Barton and Beatriz Vicoso for critical comments on the model and the manuscript. We also thank Brian Charlesworth, Stuart Baird, and an anonymous reviewer for insightful comments.\r\nC.F. was supported by an Austrian Science Foundation FWF grant (Project M 2463-B29).","doi":"10.1093/genetics/iyaa025","_id":"9168","day":"01","publisher":"Genetics Society of America","corr_author":"1","citation":{"apa":"Fraisse, C., &#38; Sachdeva, H. (2021). The rates of introgression and barriers to genetic exchange between hybridizing species: Sex chromosomes vs autosomes. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/iyaa025\">https://doi.org/10.1093/genetics/iyaa025</a>","ieee":"C. Fraisse and H. Sachdeva, “The rates of introgression and barriers to genetic exchange between hybridizing species: Sex chromosomes vs autosomes,” <i>Genetics</i>, vol. 217, no. 2. Genetics Society of America, 2021.","chicago":"Fraisse, Christelle, and Himani Sachdeva. “The Rates of Introgression and Barriers to Genetic Exchange between Hybridizing Species: Sex Chromosomes vs Autosomes.” <i>Genetics</i>. Genetics Society of America, 2021. <a href=\"https://doi.org/10.1093/genetics/iyaa025\">https://doi.org/10.1093/genetics/iyaa025</a>.","mla":"Fraisse, Christelle, and Himani Sachdeva. “The Rates of Introgression and Barriers to Genetic Exchange between Hybridizing Species: Sex Chromosomes vs Autosomes.” <i>Genetics</i>, vol. 217, no. 2, iyaa025, Genetics Society of America, 2021, doi:<a href=\"https://doi.org/10.1093/genetics/iyaa025\">10.1093/genetics/iyaa025</a>.","ama":"Fraisse C, Sachdeva H. The rates of introgression and barriers to genetic exchange between hybridizing species: Sex chromosomes vs autosomes. <i>Genetics</i>. 2021;217(2). doi:<a href=\"https://doi.org/10.1093/genetics/iyaa025\">10.1093/genetics/iyaa025</a>","ista":"Fraisse C, Sachdeva H. 2021. The rates of introgression and barriers to genetic exchange between hybridizing species: Sex chromosomes vs autosomes. Genetics. 217(2), iyaa025.","short":"C. Fraisse, H. Sachdeva, Genetics 217 (2021)."}},{"fulldoi":"https://doi.org/10.1016/j.neuron.2021.05.025","quality_controlled":"1","ec_funded":1,"language":[{"iso":"eng"}],"project":[{"grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425"}],"pmid":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SiHi"}],"month":"08","scopus_import":"1","abstract":[{"text":"Astrocytes extensively infiltrate the neuropil to regulate critical aspects of synaptic development and function. This process is regulated by transcellular interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes coordinate developmental processes among one another to parse out the synaptic neuropil and form non-overlapping territories is unknown. Here we identify a molecular mechanism regulating astrocyte-astrocyte interactions during development to coordinate astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked, astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for territory and morphological complexity in the developing mouse cortex. Furthermore, conditional deletion of Hepacam from developing astrocytes significantly impairs gap junction coupling between astrocytes and disrupts the balance between synaptic excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy with subcortical cysts in humans. Therefore, our findings suggest that disruption of astrocyte self-organization mechanisms could be an underlying cause of neural pathology.","lang":"eng"}],"author":[{"full_name":"Baldwin, Katherine T.","first_name":"Katherine T.","last_name":"Baldwin"},{"first_name":"Christabel X.","last_name":"Tan","full_name":"Tan, Christabel X."},{"full_name":"Strader, Samuel T.","last_name":"Strader","first_name":"Samuel T."},{"full_name":"Jiang, Changyu","last_name":"Jiang","first_name":"Changyu"},{"full_name":"Savage, Justin T.","first_name":"Justin T.","last_name":"Savage"},{"first_name":"Xabier","last_name":"Elorza-Vidal","full_name":"Elorza-Vidal, Xabier"},{"full_name":"Contreras, Ximena","first_name":"Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87","last_name":"Contreras"},{"first_name":"Thomas","last_name":"Rülicke","full_name":"Rülicke, Thomas"},{"full_name":"Hippenmeyer, Simon","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer"},{"first_name":"Raúl","last_name":"Estévez","full_name":"Estévez, Raúl"},{"first_name":"Ru-Rong","last_name":"Ji","full_name":"Ji, Ru-Rong"},{"last_name":"Eroglu","first_name":"Cagla","full_name":"Eroglu, Cagla"}],"external_id":{"pmid":["34171291"],"isi":["000692851900010"]},"year":"2021","date_created":"2021-08-06T09:08:25Z","intvolume":"       109","publication_status":"published","OA_type":"free access","oa":1,"date_updated":"2026-07-28T12:30:05Z","citation":{"chicago":"Baldwin, Katherine T., Christabel X. Tan, Samuel T. Strader, Changyu Jiang, Justin T. Savage, Xabier Elorza-Vidal, Ximena Contreras, et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” <i>Neuron</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">https://doi.org/10.1016/j.neuron.2021.05.025</a>.","ieee":"K. T. Baldwin <i>et al.</i>, “HepaCAM controls astrocyte self-organization and coupling,” <i>Neuron</i>, vol. 109, no. 15. Elsevier, p. 2427–2442.e10, 2021.","apa":"Baldwin, K. T., Tan, C. X., Strader, S. T., Jiang, C., Savage, J. T., Elorza-Vidal, X., … Eroglu, C. (2021). HepaCAM controls astrocyte self-organization and coupling. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">https://doi.org/10.1016/j.neuron.2021.05.025</a>","ama":"Baldwin KT, Tan CX, Strader ST, et al. HepaCAM controls astrocyte self-organization and coupling. <i>Neuron</i>. 2021;109(15):2427-2442.e10. doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">10.1016/j.neuron.2021.05.025</a>","mla":"Baldwin, Katherine T., et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” <i>Neuron</i>, vol. 109, no. 15, Elsevier, 2021, p. 2427–2442.e10, doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">10.1016/j.neuron.2021.05.025</a>.","short":"K.T. Baldwin, C.X. Tan, S.T. Strader, C. Jiang, J.T. Savage, X. Elorza-Vidal, X. Contreras, T. Rülicke, S. Hippenmeyer, R. Estévez, R.-R. Ji, C. Eroglu, Neuron 109 (2021) 2427–2442.e10.","ista":"Baldwin KT, Tan CX, Strader ST, Jiang C, Savage JT, Elorza-Vidal X, Contreras X, Rülicke T, Hippenmeyer S, Estévez R, Ji R-R, Eroglu C. 2021. HepaCAM controls astrocyte self-organization and coupling. Neuron. 109(15), 2427–2442.e10."},"page":"2427-2442.e10","publisher":"Elsevier","date_published":"2021-08-04T00:00:00Z","OA_place":"publisher","day":"04","_id":"9793","acknowledgement":"This work was supported by the National Institutes of Health (R01 DA047258 and R01 NS102237 to C.E., F32 NS100392 to K.T.B.) and the Holland-Trice Brain Research Award (to C.E.). K.T.B. was supported by postdoctoral fellowships from the Foerster-Bernstein Family and The Hartwell Foundation. The Hippenmeyer lab was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovations program (725780 LinPro) to S.H. R.E. was supported by Ministerio de Ciencia y Tecnología (RTI2018-093493-B-I00). We thank the Duke Light Microscopy Core Facility, the Duke Transgenic Mouse Facility, Dr. U. Schulte for assistance with proteomic experiments, and Dr. D. Silver for critical review of the manuscript. Cartoon elements of figure panels were created using BioRender.com.","doi":"10.1016/j.neuron.2021.05.025","type":"journal_article","publication_identifier":{"eissn":["1097-4199"],"issn":["0896-6273"]},"isi":1,"title":"HepaCAM controls astrocyte self-organization and coupling","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.neuron.2021.05.025"}],"publication":"Neuron","oa_version":"Published Version","ddc":["570"],"article_processing_charge":"No","status":"public","issue":"15","volume":109},{"publication_status":"published","intvolume":"        34","date_updated":"2026-07-28T12:27:59Z","oa":1,"OA_type":"free access","abstract":[{"lang":"eng","text":"Erythropoietin enhances oxygen delivery and reduces hypoxia-induced cell death, but its pro-thrombotic activity is problematic for use of erythropoietin in treating hypoxia. We constructed a fusion protein that stimulates red blood cell production and neuroprotection without triggering platelet production, a marker for thrombosis. The protein consists of an anti-glycophorin A nanobody and an erythropoietin mutant (L108A). The mutation reduces activation of erythropoietin receptor homodimers that induce erythropoiesis and thrombosis, but maintains the tissue-protective signaling. The binding of the nanobody element to glycophorin A rescues homodimeric erythropoietin receptor activation on red blood cell precursors. In a cell proliferation assay, the fusion protein is active at 10−14 M, allowing an estimate of the number of receptor–ligand complexes needed for signaling. This fusion protein stimulates erythroid cell proliferation in vitro and in mice, and shows neuroprotective activity in vitro. Our erythropoietin fusion protein presents a novel molecule for treating hypoxia."}],"scopus_import":"1","month":"11","year":"2021","date_created":"2021-11-28T23:01:28Z","external_id":{"isi":["000746596900001"],"pmid":["34725710"]},"author":[{"last_name":"Lee","first_name":"Jungmin","full_name":"Lee, Jungmin"},{"last_name":"Vernet","first_name":"Andyna","full_name":"Vernet, Andyna"},{"full_name":"Gruber, Nathalie","last_name":"Gruber","id":"2C9C8316-AA17-11E9-B5C2-8BC2E5697425","first_name":"Nathalie"},{"full_name":"Kready, Kasia M.","last_name":"Kready","first_name":"Kasia M."},{"full_name":"Burrill, Devin R.","last_name":"Burrill","first_name":"Devin R."},{"full_name":"Way, Jeffrey C.","first_name":"Jeffrey C.","last_name":"Way"},{"full_name":"Silver, Pamela A.","last_name":"Silver","first_name":"Pamela A."}],"pmid":1,"department":[{"_id":"CaGu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.1093/protein/gzab025","publication":"Protein Engineering, Design and Selection","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/protein/gzab025"}],"publication_identifier":{"eissn":["1741-0134"],"issn":["1741-0126"]},"isi":1,"title":"Rational engineering of an erythropoietin fusion protein to treat hypoxia","article_number":"gzab025","type":"journal_article","volume":34,"article_processing_charge":"No","status":"public","ddc":["570"],"oa_version":"Published Version","OA_place":"publisher","date_published":"2021-11-01T00:00:00Z","acknowledgement":"This work was supported by funds from the Wyss Institute for Biologically Inspired Engineering and the Boston Biomedical Innovation Center (Pilot Award 112475; Drive Award U54HL119145). J.L., K.M.K., D.R.B., J.C.W. and P.A.S. were supported by the Harvard Medical School Department of Systems Biology. J.C.W. was further supported by the Harvard Medical School Laboratory of Systems Pharmacology. A.V., D.R.B. and P.A.S. were further supported by the Wyss Institute for Biologically Inspired Engineering. N.G.G. was sponsored by the Army Research Office under Grant Number W911NF-17-2-0092. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Office or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein. We sincerely thank Amanda Graveline and the Wyss Institute at Harvard for their scientific support.","doi":"10.1093/protein/gzab025","_id":"10363","day":"01","publisher":"Oxford University Press","citation":{"ama":"Lee J, Vernet A, Gruber N, et al. Rational engineering of an erythropoietin fusion protein to treat hypoxia. <i>Protein Engineering, Design and Selection</i>. 2021;34. doi:<a href=\"https://doi.org/10.1093/protein/gzab025\">10.1093/protein/gzab025</a>","short":"J. Lee, A. Vernet, N. Gruber, K.M. Kready, D.R. Burrill, J.C. Way, P.A. Silver, Protein Engineering, Design and Selection 34 (2021).","ista":"Lee J, Vernet A, Gruber N, Kready KM, Burrill DR, Way JC, Silver PA. 2021. Rational engineering of an erythropoietin fusion protein to treat hypoxia. Protein Engineering, Design and Selection. 34, gzab025.","mla":"Lee, Jungmin, et al. “Rational Engineering of an Erythropoietin Fusion Protein to Treat Hypoxia.” <i>Protein Engineering, Design and Selection</i>, vol. 34, gzab025, Oxford University Press, 2021, doi:<a href=\"https://doi.org/10.1093/protein/gzab025\">10.1093/protein/gzab025</a>.","ieee":"J. Lee <i>et al.</i>, “Rational engineering of an erythropoietin fusion protein to treat hypoxia,” <i>Protein Engineering, Design and Selection</i>, vol. 34. Oxford University Press, 2021.","apa":"Lee, J., Vernet, A., Gruber, N., Kready, K. M., Burrill, D. R., Way, J. C., &#38; Silver, P. A. (2021). Rational engineering of an erythropoietin fusion protein to treat hypoxia. <i>Protein Engineering, Design and Selection</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/protein/gzab025\">https://doi.org/10.1093/protein/gzab025</a>","chicago":"Lee, Jungmin, Andyna Vernet, Nathalie Gruber, Kasia M. Kready, Devin R. Burrill, Jeffrey C. Way, and Pamela A. Silver. “Rational Engineering of an Erythropoietin Fusion Protein to Treat Hypoxia.” <i>Protein Engineering, Design and Selection</i>. Oxford University Press, 2021. <a href=\"https://doi.org/10.1093/protein/gzab025\">https://doi.org/10.1093/protein/gzab025</a>."}},{"publisher":"American Association for the Advancement of Science","page":"678-679","citation":{"chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>.","ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>.","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679."},"corr_author":"1","volume":371,"oa_version":"None","article_processing_charge":"No","status":"public","issue":"6530","publication":"Science","type":"journal_article","title":"Tidying up the mess","isi":1,"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"doi":"10.1126/science.abg0886","day":"12","_id":"10809","date_published":"2021-02-12T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaIb"}],"article_type":"letter_note","pmid":1,"quality_controlled":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1126/science.abg0886","date_updated":"2026-07-28T12:16:17Z","OA_type":"closed access","intvolume":"       371","publication_status":"published","year":"2021","date_created":"2022-03-03T09:51:48Z","author":[{"first_name":"Yu","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","first_name":"Maria"}],"external_id":{"isi":["000617551600027"],"pmid":["33574201"]},"scopus_import":"1","month":"02","abstract":[{"lang":"eng","text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material."}]},{"project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342"}],"fulldoi":"https://doi.org/10.1016/j.comgeo.2020.101700","quality_controlled":"1","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"shorter_version","status":"public","id":"6989"}]},"article_type":"original","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"HeEd"}],"author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"last_name":"Akitaya","first_name":"Hugo A.","full_name":"Akitaya, Hugo A."},{"first_name":"Kenneth C.","last_name":"Cheung","full_name":"Cheung, Kenneth C."},{"last_name":"Demaine","first_name":"Erik D.","full_name":"Demaine, Erik D."},{"full_name":"Demaine, Martin L.","last_name":"Demaine","first_name":"Martin L."},{"first_name":"Sándor P.","last_name":"Fekete","full_name":"Fekete, Sándor P."},{"last_name":"Kleist","first_name":"Linda","full_name":"Kleist, Linda"},{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"full_name":"Löffler, Maarten","last_name":"Löffler","first_name":"Maarten"},{"full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana"},{"full_name":"Mundilova, Klara","last_name":"Mundilova","first_name":"Klara"},{"first_name":"Christiane","last_name":"Schmidt","full_name":"Schmidt, Christiane"}],"external_id":{"arxiv":["1910.09917"],"isi":["000579185100004"]},"date_created":"2020-08-30T22:01:09Z","year":"2021","month":"02","scopus_import":"1","abstract":[{"lang":"eng","text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability."}],"date_updated":"2026-07-28T13:08:48Z","oa":1,"intvolume":"        93","publication_status":"published","citation":{"ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding polyominoes with holes into a cube. Computational Geometry: Theory and Applications. 93, 101700.","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. 2021;93. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>","short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, Computational Geometry: Theory and Applications 93 (2021).","mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>, vol. 93, 101700, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>.","ieee":"O. Aichholzer <i>et al.</i>, “Folding polyominoes with holes into a cube,” <i>Computational Geometry: Theory and Applications</i>, vol. 93. Elsevier, 2021.","apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>","chicago":"Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>."},"corr_author":"1","publisher":"Elsevier","day":"01","_id":"8317","doi":"10.1016/j.comgeo.2020.101700","acknowledgement":"This research was performed in part at the 33rd Bellairs Winter Workshop on Computational Geometry. We thank all other participants for a fruitful atmosphere. H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","date_published":"2021-02-01T00:00:00Z","arxiv":1,"oa_version":"Preprint","article_processing_charge":"No","status":"public","volume":93,"type":"journal_article","article_number":"101700","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.09917v3"}],"publication_identifier":{"issn":["0925-7721"],"eissn":["1879-081X"]},"isi":1,"title":"Folding polyominoes with holes into a cube","publication":"Computational Geometry: Theory and Applications"},{"abstract":[{"text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"month":"08","year":"2021","date_created":"2022-03-21T11:41:28Z","external_id":{"arxiv":["2108.06686"]},"author":[{"full_name":"Lombardi, Fabrizio","first_name":"Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","last_name":"Lombardi","orcid":"0000-0003-2623-5249"},{"full_name":"Pepic, Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","last_name":"Pepic","first_name":"Selver"},{"last_name":"Shriki","first_name":"Oren","full_name":"Shriki, Oren"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper"},{"full_name":"De Martino, Daniele","first_name":"Daniele","last_name":"De Martino"}],"publication_status":"submitted","oa":1,"date_updated":"2026-07-29T06:53:41Z","OA_type":"green","language":[{"iso":"eng"}],"ec_funded":1,"fulldoi":"https://doi.org/10.48550/ARXIV.2108.06686","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"Efficient coding with biophysical realism","grant_number":"P34015","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"department":[{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","id":"12762","status":"public"}]},"date_published":"2021-08-17T00:00:00Z","OA_place":"repository","doi":"10.48550/ARXIV.2108.06686","acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","_id":"10912","day":"17","title":"Quantifying the coexistence of neuronal oscillations and avalanches","main_file_link":[{"url":"https://arxiv.org/abs/2108.06686","open_access":"1"}],"type":"preprint","article_number":"2108.06686","status":"public","article_processing_charge":"No","ddc":["570"],"oa_version":"Preprint","arxiv":1,"citation":{"mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. 2108.06686, arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. 2108.06686.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv."},"publisher":"arXiv"},{"date_published":"2021-10-02T00:00:00Z","month":"10","abstract":[{"text":"Hippocampal and neocortical neural activity is modulated by the position of the individual in space. While hippocampal neurons provide the basis for a spatial map, prefrontal cortical neurons generalize over environmental features. Whether these generalized representations result from a bidirectional interaction with, or are mainly derived from hippocampal spatial representations is not known. By examining simultaneously recorded hippocampal and medial prefrontal neurons, we observed that prefrontal spatial representations show a delayed coherence with hippocampal ones. We also identified subpopulations of cells in the hippocampus and medial prefrontal cortex that formed functional cross-area couplings; these resembled the optimal connections predicted by a probabilistic model of spatial information transfer and generalization. Moreover, cross-area couplings were strongest and had the shortest delay preceding spatial decision-making. Our results suggest that generalized spatial coding in the medial prefrontal cortex is inherited from spatial representations in the hippocampus, and that the routing of information can change dynamically with behavioral demands.","lang":"eng"}],"date_created":"2021-10-04T06:28:32Z","year":"2021","acknowledgement":"We thank Federico Stella for invaluable suggestions and discussions. We thank Yosman BapatDhar and Andrea Cumpelik for comments, help and suggestions on the exposure of the text. We thank Predrag Živadinović and Juliana Couras for comments on the text and the figures. This work was supported by the EU-FP7 MC-ITN IN-SENS (grant 607616).","doi":"10.1101/2021.09.30.462269","day":"02","author":[{"full_name":"Nardin, Michele","first_name":"Michele","orcid":"0000-0001-8849-6570","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","last_name":"Nardin"},{"full_name":"Käfer, Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","last_name":"Käfer","first_name":"Karola"},{"full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"}],"_id":"10080","external_id":{"biorxivid":["10.1101/2021.09.30.462269"]},"publication":"bioRxiv","type":"preprint","biorxivid":1,"title":"The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus","publication_status":"submitted","main_file_link":[{"url":"https://doi.org/10.1101/2021.09.30.462269","open_access":"1"}],"oa":1,"date_updated":"2026-07-29T06:33:53Z","oa_version":"Preprint","article_processing_charge":"No","status":"public","ec_funded":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1101/2021.09.30.462269","citation":{"ista":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv, <a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>.","ama":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>","short":"M. Nardin, K. Käfer, J.L. Csicsvari, BioRxiv (n.d.).","mla":"Nardin, Michele, et al. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>.","chicago":"Nardin, Michele, Karola Käfer, and Jozsef L Csicsvari. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>.","ieee":"M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus,” <i>bioRxiv</i>. .","apa":"Nardin, M., Käfer, K., &#38; Csicsvari, J. L. (n.d.). The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>"},"project":[{"grant_number":"607616","name":"inter-and intracellular signalling in schizophrenia","call_identifier":"FP7","_id":"257BBB4C-B435-11E9-9278-68D0E5697425"}],"das_tickbox":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"JoCs"}]},{"related_material":{"link":[{"url":"https://ist.ac.at/en/news/counterintuitive-dynamics-threaten-the-end-of-the-pandemic/","relation":"press_release","description":"News on IST Website"}],"record":[{"relation":"dissertation_contains","status":"public","id":"20811"}]},"article_type":"original","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"FyKo"}],"file":[{"access_level":"open_access","success":1,"content_type":"application/pdf","checksum":"ac86892ed17e6724c7251844da5cef5c","relation":"main_file","date_updated":"2021-08-16T11:36:49Z","creator":"asandaue","file_name":"2021_ScientificReports_Rella.pdf","file_id":"9927","file_size":3432001,"date_created":"2021-08-16T11:36:49Z"}],"pmid":1,"project":[{"_id":"26580278-B435-11E9-9278-68D0E5697425","name":"Characterizing the fitness landscape on population and global scales","grant_number":"771209","call_identifier":"H2020"}],"fulldoi":"https://doi.org/10.1038/s41598-021-95025-3","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_updated":"2026-07-29T12:57:49Z","oa":1,"intvolume":"        11","publication_status":"published","author":[{"full_name":"Rella, Simon","first_name":"Simon","last_name":"Rella","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425"},{"full_name":"Kulikova, Yuliya A.","last_name":"Kulikova","first_name":"Yuliya A."},{"full_name":"Dermitzakis, Emmanouil T.","last_name":"Dermitzakis","first_name":"Emmanouil T."},{"full_name":"Kondrashov, Fyodor","first_name":"Fyodor","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov"}],"external_id":{"isi":["000683329100001"],"pmid":["34330988"]},"date_created":"2021-08-15T22:01:26Z","year":"2021","scopus_import":"1","month":"07","abstract":[{"lang":"eng","text":"Vaccines are thought to be the best available solution for controlling the ongoing SARS-CoV-2 pandemic. However, the emergence of vaccine-resistant strains may come too rapidly for current vaccine developments to alleviate the health, economic and social consequences of the pandemic. To quantify and characterize the risk of such a scenario, we created a SIR-derived model with initial stochastic dynamics of the vaccine-resistant strain to study the probability of its emergence and establishment. Using parameters realistically resembling SARS-CoV-2 transmission, we model a wave-like pattern of the pandemic and consider the impact of the rate of vaccination and the strength of non-pharmaceutical intervention measures on the probability of emergence of a resistant strain. As expected, we found that a fast rate of vaccination decreases the probability of emergence of a resistant strain. Counterintuitively, when a relaxation of non-pharmaceutical interventions happened at a time when most individuals of the population have already been vaccinated the probability of emergence of a resistant strain was greatly increased. Consequently, we show that a period of transmission reduction close to the end of the vaccination campaign can substantially reduce the probability of resistant strain establishment. Our results suggest that policymakers and individuals should consider maintaining non-pharmaceutical interventions and transmission-reducing behaviours throughout the entire vaccination period."}],"publisher":"Springer Nature","citation":{"apa":"Rella, S., Kulikova, Y. A., Dermitzakis, E. T., &#38; Kondrashov, F. (2021). Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-95025-3\">https://doi.org/10.1038/s41598-021-95025-3</a>","ieee":"S. Rella, Y. A. Kulikova, E. T. Dermitzakis, and F. Kondrashov, “Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains,” <i>Scientific Reports</i>, vol. 11, no. 1. Springer Nature, 2021.","chicago":"Rella, Simon, Yuliya A. Kulikova, Emmanouil T. Dermitzakis, and Fyodor Kondrashov. “Rates of SARS-CoV-2 Transmission and Vaccination Impact the Fate of Vaccine-Resistant Strains.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-95025-3\">https://doi.org/10.1038/s41598-021-95025-3</a>.","mla":"Rella, Simon, et al. “Rates of SARS-CoV-2 Transmission and Vaccination Impact the Fate of Vaccine-Resistant Strains.” <i>Scientific Reports</i>, vol. 11, no. 1, 15729, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-95025-3\">10.1038/s41598-021-95025-3</a>.","ista":"Rella S, Kulikova YA, Dermitzakis ET, Kondrashov F. 2021. Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains. Scientific Reports. 11(1), 15729.","ama":"Rella S, Kulikova YA, Dermitzakis ET, Kondrashov F. Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains. <i>Scientific Reports</i>. 2021;11(1). doi:<a href=\"https://doi.org/10.1038/s41598-021-95025-3\">10.1038/s41598-021-95025-3</a>","short":"S. Rella, Y.A. Kulikova, E.T. Dermitzakis, F. Kondrashov, Scientific Reports 11 (2021)."},"ddc":["570","610"],"oa_version":"Published Version","issue":"1","article_processing_charge":"Yes","status":"public","volume":11,"article_number":"15729","type":"journal_article","title":"Rates of SARS-CoV-2 transmission and vaccination impact the fate of vaccine-resistant strains","file_date_updated":"2021-08-16T11:36:49Z","isi":1,"publication_identifier":{"eissn":["2045-2322"]},"publication":"Scientific Reports","day":"30","_id":"9905","has_accepted_license":"1","doi":"10.1038/s41598-021-95025-3","acknowledgement":"We thank Alexey Kondrashov, Nick Machnik, Raimundo Julian Saona Urmeneta, Gasper Tkacik and Nick Barton for fruitful discussions. We also thank participants of EvoLunch seminar at IST Austria and the internal seminar at the Banco de España for useful comments. The opinions expressed in this document are exclusively of the authors and, therefore, do not necessarily coincide with those of the Banco de España or the Eurosystem. ETD is supported by the Swiss National Science and Louis Jeantet Foundation. The work of FAK was in part supported by the ERC Consolidator Grant (771209-CharFL).","date_published":"2021-07-30T00:00:00Z"},{"language":[{"iso":"eng"}],"doi_confirm":"1","fulldoi":"https://doi.org/10.15479/AT:ISTA:9418","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"id":"7435","status":"deleted","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7481","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"9416"},{"status":"public","id":"7479","relation":"part_of_dissertation"}]},"file":[{"file_id":"9419","file_name":"mph-thesis-v519-pdfimages.pdf","date_created":"2021-05-24T11:22:29Z","file_size":2673905,"access_level":"open_access","content_type":"application/pdf","checksum":"4f0abe64114cfed264f9d36e8d1197e3","success":1,"relation":"main_file","creator":"bphuong","date_updated":"2021-05-24T11:22:29Z"},{"file_name":"thesis.zip","file_id":"9420","file_size":92995100,"date_created":"2021-05-24T11:56:02Z","access_level":"closed","checksum":"f5699e876bc770a9b0df8345a77720a2","content_type":"application/zip","relation":"source_file","date_updated":"2021-05-24T11:56:02Z","creator":"bphuong"}],"date_created":"2021-05-24T13:06:23Z","year":"2021","author":[{"full_name":"Bui Thi Mai, Phuong","first_name":"Phuong","last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models.","lang":"eng"}],"month":"05","oa":1,"date_updated":"2026-07-30T05:33:52Z","publication_status":"published","corr_author":"1","citation":{"ama":"Phuong M. Underspecification in deep learning. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>","mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>."},"supervisor":[{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"publisher":"Institute of Science and Technology Austria","page":"125","doi":"10.15479/AT:ISTA:9418","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","_id":"9418","day":"30","date_published":"2021-05-30T00:00:00Z","OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"degree_awarded":"PhD","status":"public","article_processing_charge":"No","ddc":["000"],"oa_version":"Published Version","file_date_updated":"2021-05-24T11:56:02Z","publication_identifier":{"issn":["2663-337X"]},"title":"Underspecification in deep learning","type":"dissertation"}]
