[{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"9571","file_date_updated":"2021-06-23T07:09:41Z","department":[{"_id":"DaAl"}],"date_updated":"2024-03-06T12:22:07Z","ddc":["000"],"main_file_link":[{"open_access":"1","url":"https://www.jmlr.org/papers/v22/20-255.html"}],"scopus_import":"1","intvolume":" 22","month":"04","abstract":[{"text":"As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-parallel SGD is QSGD (Alistarh et al., 2017), which quantizes and encodes gradients to reduce communication costs. The baseline variant of QSGD provides strong theoretical guarantees, however, for practical purposes, the authors proposed a heuristic variant which we call QSGDinf, which demonstrated impressive empirical gains for distributed training of large neural networks. In this paper, we build on this work to propose a new gradient quantization scheme, and show that it has both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical performance of the QSGDinf heuristic and of other compression methods.","lang":"eng"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","issue":"114","volume":22,"publication_status":"published","publication_identifier":{"issn":["15324435"],"eissn":["15337928"]},"language":[{"iso":"eng"}],"file":[{"checksum":"6428aa8bcb67768b6949c99b55d5281d","file_id":"9595","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-06-23T07:09:41Z","file_name":"2021_JournalOfMachineLearningResearch_Ramezani-Kebrya.pdf","date_updated":"2021-06-23T07:09:41Z","file_size":11237154,"creator":"asandaue"}],"external_id":{"arxiv":["1908.06077"]},"article_processing_charge":"No","author":[{"first_name":"Ali","last_name":"Ramezani-Kebrya","full_name":"Ramezani-Kebrya, Ali"},{"full_name":"Faghri, Fartash","last_name":"Faghri","first_name":"Fartash"},{"full_name":"Markov, Ilya","last_name":"Markov","first_name":"Ilya"},{"full_name":"Aksenov, Vitalii","last_name":"Aksenov","id":"2980135A-F248-11E8-B48F-1D18A9856A87","first_name":"Vitalii"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Roy","full_name":"Roy, Daniel M.","first_name":"Daniel M."}],"title":"NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization","citation":{"mla":"Ramezani-Kebrya, Ali, et al. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research, vol. 22, no. 114, Journal of Machine Learning Research, 2021, p. 1−43.","ama":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 2021;22(114):1−43.","apa":"Ramezani-Kebrya, A., Faghri, F., Markov, I., Aksenov, V., Alistarh, D.-A., & Roy, D. M. (2021). NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. Journal of Machine Learning Research.","short":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.","ieee":"A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, and D. M. Roy, “NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization,” Journal of Machine Learning Research, vol. 22, no. 114. Journal of Machine Learning Research, p. 1−43, 2021.","chicago":"Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.","ista":"Ramezani-Kebrya A, Faghri F, Markov I, Aksenov V, Alistarh D-A, Roy DM. 2021. NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization. Journal of Machine Learning Research. 22(114), 1−43."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Journal of Machine Learning Research","quality_controlled":"1","page":"1−43","date_created":"2021-06-20T22:01:33Z","date_published":"2021-04-01T00:00:00Z","year":"2021","has_accepted_license":"1","publication":"Journal of Machine Learning Research","day":"01"},{"page":"P629-644.E8","doi":"10.1016/j.neuron.2020.11.028","date_published":"2021-02-17T00:00:00Z","date_created":"2020-09-21T11:59:47Z","year":"2021","day":"17","publication":"Neuron","quality_controlled":"1","publisher":"Elsevier","oa":1,"acknowledgement":"We thank M. Mishina for GluD2fl frozen embryos, T.C. Südhof and J.I. Morgan for Cbln1fl mice, L. Anderson for help in generating the MADM alleles, W. Joo for a previously unpublished construct, M. Yuzaki, K. Shen, J. Ding, and members of the Luo lab, including J.M. Kebschull, H. Li, J. Li, T. Li, C.M. McLaughlin, D. Pederick, J. Ren, D.C. Wang and C. Xu for discussions and critiques of the manuscript, and M. Yuzaki for supporting Y.H.T. during the final phase of this project. Y.H.T. was supported by a JSPS fellowship; S.A.S. was supported by a Stanford Graduate Fellowship and an NSF Predoctoral Fellowship; L.J. is supported by a Stanford Graduate Fellowship and an NSF Predoctoral Fellowship; M.J.W. is supported by a Burroughs Wellcome Fund CASI Award. This work was supported by an NIH grant (R01-NS050538) to L.L.; the European Research Council (ERC) under the European Union's Horizon 2020 research and innovations programme (No. 725780 LinPro) to S.H.; and Simons and James S. McDonnell Foundations and an NSF CAREER award to S.G.; L.L. is an HHMI investigator.","author":[{"last_name":"Takeo","full_name":"Takeo, Yukari H.","first_name":"Yukari H."},{"first_name":"S. Andrew","last_name":"Shuster","full_name":"Shuster, S. Andrew"},{"last_name":"Jiang","full_name":"Jiang, Linnie","first_name":"Linnie"},{"first_name":"Miley","last_name":"Hu","full_name":"Hu, Miley"},{"first_name":"David J.","last_name":"Luginbuhl","full_name":"Luginbuhl, David J."},{"full_name":"Rülicke, Thomas","last_name":"Rülicke","first_name":"Thomas"},{"first_name":"Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87","full_name":"Contreras, Ximena","last_name":"Contreras"},{"orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"first_name":"Mark J.","full_name":"Wagner, Mark J.","last_name":"Wagner"},{"last_name":"Ganguli","full_name":"Ganguli, Surya","first_name":"Surya"},{"first_name":"Liqun","last_name":"Luo","full_name":"Luo, Liqun"}],"article_processing_charge":"No","title":"GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells","citation":{"ista":"Takeo YH, Shuster SA, Jiang L, Hu M, Luginbuhl DJ, Rülicke T, Contreras X, Hippenmeyer S, Wagner MJ, Ganguli S, Luo L. 2021. GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. 109(4), P629–644.E8.","chicago":"Takeo, Yukari H., S. Andrew Shuster, Linnie Jiang, Miley Hu, David J. Luginbuhl, Thomas Rülicke, Ximena Contreras, et al. “GluD2- and Cbln1-Mediated Competitive Synaptogenesis Shapes the Dendritic Arbors of Cerebellar Purkinje Cells.” Neuron. Elsevier, 2021. https://doi.org/10.1016/j.neuron.2020.11.028.","ama":"Takeo YH, Shuster SA, Jiang L, et al. GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. 2021;109(4):P629-644.E8. doi:10.1016/j.neuron.2020.11.028","apa":"Takeo, Y. H., Shuster, S. A., Jiang, L., Hu, M., Luginbuhl, D. J., Rülicke, T., … Luo, L. (2021). GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2020.11.028","short":"Y.H. Takeo, S.A. Shuster, L. Jiang, M. Hu, D.J. Luginbuhl, T. Rülicke, X. Contreras, S. Hippenmeyer, M.J. Wagner, S. Ganguli, L. Luo, Neuron 109 (2021) P629–644.E8.","ieee":"Y. H. Takeo et al., “GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells,” Neuron, vol. 109, no. 4. Elsevier, p. P629–644.E8, 2021.","mla":"Takeo, Yukari H., et al. “GluD2- and Cbln1-Mediated Competitive Synaptogenesis Shapes the Dendritic Arbors of Cerebellar Purkinje Cells.” Neuron, vol. 109, no. 4, Elsevier, 2021, p. P629–644.E8, doi:10.1016/j.neuron.2020.11.028."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"issue":"4","volume":109,"ec_funded":1,"publication_identifier":{"eissn":["1097-4199"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.06.14.151258"}],"month":"02","intvolume":" 109","abstract":[{"text":"The synaptotrophic hypothesis posits that synapse formation stabilizes dendritic branches, yet this hypothesis has not been causally tested in vivo in the mammalian brain. Presynaptic ligand cerebellin-1 (Cbln1) and postsynaptic receptor GluD2 mediate synaptogenesis between granule cells and Purkinje cells in the molecular layer of the cerebellar cortex. Here we show that sparse but not global knockout of GluD2 causes under-elaboration of Purkinje cell dendrites in the deep molecular layer and overelaboration in the superficial molecular layer. Developmental, overexpression, structure-function, and genetic epistasis analyses indicate that dendrite morphogenesis defects result from competitive synaptogenesis in a Cbln1/GluD2-dependent manner. A generative model of dendritic growth based on competitive synaptogenesis largely recapitulates GluD2 sparse and global knockout phenotypes. Our results support the synaptotrophic hypothesis at initial stages of dendrite development, suggest a second mode in which cumulative synapse formation inhibits further dendrite growth, and highlight the importance of competition in dendrite morphogenesis.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"SiHi"}],"date_updated":"2024-03-06T12:12:48Z","type":"journal_article","article_type":"original","status":"public","_id":"8544"},{"abstract":[{"text":"We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar.","lang":"eng"}],"acknowledgement":"We thank Herbert Spohn for helpful comments. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged..","oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2107.03720","open_access":"1"}],"month":"07","publication_status":"submitted","year":"2021","publication":"arXiv","language":[{"iso":"eng"}],"day":"08","date_created":"2021-08-06T08:49:45Z","ec_funded":1,"date_published":"2021-07-08T00:00:00Z","related_material":{"record":[{"relation":"later_version","id":"10755","status":"public"},{"relation":"dissertation_contains","id":"9733","status":"public"}]},"_id":"9791","article_number":"2107.03720 ","type":"preprint","status":"public","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"date_updated":"2024-03-06T12:30:45Z","citation":{"mla":"Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, 2107.03720.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” arXiv. .","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv.","apa":"Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. arXiv.","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, n.d.","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"external_id":{"arxiv":["2107.03720"]},"article_processing_charge":"No","author":[{"orcid":"0000-0003-0754-8530","full_name":"Feliciangeli, Dario","last_name":"Feliciangeli","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"title":"The effective mass problem for the Landau-Pekar equations","department":[{"_id":"RoSe"}]},{"department":[{"_id":"GaTk"}],"date_updated":"2024-03-06T14:22:51Z","type":"journal_article","status":"public","_id":"7553","volume":109,"issue":"7","related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/can-evolution-be-predicted/","relation":"press_release"}],"record":[{"id":"15020","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/848374"}],"month":"04","intvolume":" 109","abstract":[{"text":"Normative theories and statistical inference provide complementary approaches for the study of biological systems. A normative theory postulates that organisms have adapted to efficiently solve essential tasks, and proceeds to mathematically work out testable consequences of such optimality; parameters that maximize the hypothesized organismal function can be derived ab initio, without reference to experimental data. In contrast, statistical inference focuses on efficient utilization of data to learn model parameters, without reference to any a priori notion of biological function, utility, or fitness. Traditionally, these two approaches were developed independently and applied separately. Here we unify them in a coherent Bayesian framework that embeds a normative theory into a family of maximum-entropy “optimization priors.” This family defines a smooth interpolation between a data-rich inference regime (characteristic of “bottom-up” statistical models), and a data-limited ab inito prediction regime (characteristic of “top-down” normative theory). We demonstrate the applicability of our framework using data from the visual cortex, and argue that the flexibility it affords is essential to address a number of fundamental challenges relating to inference and prediction in complex, high-dimensional biological problems.","lang":"eng"}],"oa_version":"Preprint","author":[{"last_name":"Mlynarski","full_name":"Mlynarski, Wiktor F","first_name":"Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87"},{"id":"4171253A-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Hledik","full_name":"Hledik, Michal"},{"full_name":"Sokolowski, Thomas R","orcid":"0000-0002-1287-3779","last_name":"Sokolowski","id":"3E999752-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas R"},{"last_name":"Tkačik","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper"}],"external_id":{"isi":["000637809600006"]},"article_processing_charge":"No","title":"Statistical analysis and optimality of neural systems","citation":{"mla":"Mlynarski, Wiktor F., et al. “Statistical Analysis and Optimality of Neural Systems.” Neuron, vol. 109, no. 7, Cell Press, 2021, p. 1227–1241.e5, doi:10.1016/j.neuron.2021.01.020.","apa":"Mlynarski, W. F., Hledik, M., Sokolowski, T. R., & Tkačik, G. (2021). Statistical analysis and optimality of neural systems. Neuron. Cell Press. https://doi.org/10.1016/j.neuron.2021.01.020","ama":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. Statistical analysis and optimality of neural systems. Neuron. 2021;109(7):1227-1241.e5. doi:10.1016/j.neuron.2021.01.020","ieee":"W. F. Mlynarski, M. Hledik, T. R. Sokolowski, and G. Tkačik, “Statistical analysis and optimality of neural systems,” Neuron, vol. 109, no. 7. Cell Press, p. 1227–1241.e5, 2021.","short":"W.F. Mlynarski, M. Hledik, T.R. Sokolowski, G. Tkačik, Neuron 109 (2021) 1227–1241.e5.","chicago":"Mlynarski, Wiktor F, Michal Hledik, Thomas R Sokolowski, and Gašper Tkačik. “Statistical Analysis and Optimality of Neural Systems.” Neuron. Cell Press, 2021. https://doi.org/10.1016/j.neuron.2021.01.020.","ista":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. 2021. Statistical analysis and optimality of neural systems. Neuron. 109(7), 1227–1241.e5."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"page":"1227-1241.e5","date_published":"2021-04-07T00:00:00Z","doi":"10.1016/j.neuron.2021.01.020","date_created":"2020-02-28T11:00:12Z","isi":1,"year":"2021","day":"07","publication":"Neuron","publisher":"Cell Press","quality_controlled":"1","oa":1,"acknowledgement":"The authors thank Dario Ringach for providing the V1 receptive fields and Olivier Marre for providing the retinal receptive fields. W.M. was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411. M.H. was funded in part by Human Frontiers Science grant no. HFSP RGP0032/2018."},{"department":[{"_id":"MaMo"}],"date_updated":"2024-03-07T10:36:53Z","status":"public","type":"conference","conference":{"name":"AISTATS: Artificial Intelligence and Statistics","end_date":"2021-04-15","location":"Virtual, San Diego, CA, United States","start_date":"2021-04-13"},"_id":"10598","volume":130,"related_material":{"record":[{"status":"public","id":"12480","relation":"later_version"}]},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2640-3498"]},"publication_status":"published","month":"04","intvolume":" 130","alternative_title":["Proceedings of Machine Learning Research"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v130/mondelli21a.html"}],"oa_version":"Preprint","abstract":[{"text":" We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach. ","lang":"eng"}],"title":"Approximate message passing with spectral initialization for generalized linear models","editor":[{"first_name":"Arindam","full_name":"Banerjee, Arindam","last_name":"Banerjee"},{"last_name":"Fukumizu","full_name":"Fukumizu, Kenji","first_name":"Kenji"}],"author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Venkataramanan","full_name":"Venkataramanan, Ramji","first_name":"Ramji"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"arxiv":["2010.03460"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” In Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, edited by Arindam Banerjee and Kenji Fukumizu, 130:397–405. ML Research Press, 2021.","ista":"Mondelli M, Venkataramanan R. 2021. Approximate message passing with spectral initialization for generalized linear models. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 130, 397–405.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, edited by Arindam Banerjee and Kenji Fukumizu, vol. 130, ML Research Press, 2021, pp. 397–405.","apa":"Mondelli, M., & Venkataramanan, R. (2021). Approximate message passing with spectral initialization for generalized linear models. In A. Banerjee & K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics (Vol. 130, pp. 397–405). Virtual, San Diego, CA, United States: ML Research Press.","ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. In: Banerjee A, Fukumizu K, eds. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics. Vol 130. ML Research Press; 2021:397-405.","short":"M. Mondelli, R. Venkataramanan, in:, A. Banerjee, K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 397–405.","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, Virtual, San Diego, CA, United States, 2021, vol. 130, pp. 397–405."},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"date_published":"2021-04-01T00:00:00Z","date_created":"2022-01-03T11:34:22Z","page":"397-405","day":"01","publication":"Proceedings of The 24th International Conference on Artificial Intelligence and Statistics","year":"2021","publisher":"ML Research Press","quality_controlled":"1","oa":1,"acknowledgement":"The authors would like to thank Andrea Montanari for helpful discussions. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1."},{"oa_version":"Published Version","abstract":[{"text":"This paper aims to obtain a strong convergence result for a Douglas–Rachford splitting method with inertial extrapolation step for finding a zero of the sum of two set-valued maximal monotone operators without any further assumption of uniform monotonicity on any of the involved maximal monotone operators. Furthermore, our proposed method is easy to implement and the inertial factor in our proposed method is a natural choice. Our method of proof is of independent interest. Finally, some numerical implementations are given to confirm the theoretical analysis.","lang":"eng"}],"month":"02","intvolume":" 22","scopus_import":"1","file":[{"file_id":"8197","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-08-03T15:24:39Z","file_name":"2020_OptimizationEngineering_Shehu.pdf","creator":"dernst","date_updated":"2020-08-03T15:24:39Z","file_size":2137860}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1573-2924"],"issn":["1389-4420"]},"publication_status":"published","volume":22,"ec_funded":1,"_id":"8196","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"date_updated":"2024-03-07T14:39:29Z","file_date_updated":"2020-08-03T15:24:39Z","department":[{"_id":"VlKo"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The project of Yekini Shehu has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013) (Grant Agreement No. 616160). The authors are grateful to the anonymous referees and the handling Editor for their comments and suggestions which have improved the earlier version of the manuscript greatly.","quality_controlled":"1","publisher":"Springer Nature","oa":1,"day":"25","publication":"Optimization and Engineering","has_accepted_license":"1","isi":1,"year":"2021","doi":"10.1007/s11081-020-09544-5","date_published":"2021-02-25T00:00:00Z","date_created":"2020-08-03T14:29:57Z","page":"2627-2653","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering 22 (2021) 2627–2653.","ieee":"Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method for the sum of two maximal monotone operators,” Optimization and Engineering, vol. 22. Springer Nature, pp. 2627–2653, 2021.","apa":"Shehu, Y., Dong, Q.-L., Liu, L.-L., & Yao, J.-C. (2021). New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. Springer Nature. https://doi.org/10.1007/s11081-020-09544-5","ama":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 2021;22:2627-2653. doi:10.1007/s11081-020-09544-5","mla":"Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” Optimization and Engineering, vol. 22, Springer Nature, 2021, pp. 2627–53, doi:10.1007/s11081-020-09544-5.","ista":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.","chicago":"Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” Optimization and Engineering. Springer Nature, 2021. https://doi.org/10.1007/s11081-020-09544-5."},"title":"New strong convergence method for the sum of two maximal monotone operators","author":[{"first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","last_name":"Shehu"},{"last_name":"Dong","full_name":"Dong, Qiao-Li","first_name":"Qiao-Li"},{"first_name":"Lu-Lu","full_name":"Liu, Lu-Lu","last_name":"Liu"},{"last_name":"Yao","full_name":"Yao, Jen-Chih","first_name":"Jen-Chih"}],"external_id":{"isi":["000559345400001"]},"article_processing_charge":"Yes (via OA deal)"},{"department":[{"_id":"GeKa"}],"date_updated":"2024-03-07T14:48:57Z","status":"public","article_type":"original","type":"journal_article","_id":"8911","volume":6,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2058-8437"]},"publication_status":"published","month":"10","intvolume":" 6","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.08133"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"In the worldwide endeavor for disruptive quantum technologies, germanium is emerging as a versatile material to realize devices capable of encoding, processing, or transmitting quantum information. These devices leverage special properties of the germanium valence-band states, commonly known as holes, such as their inherently strong spin-orbit coupling and the ability to host superconducting pairing correlations. In this Review, we initially introduce the physics of holes in low-dimensional germanium structures with key insights from a theoretical perspective. We then examine the material science progress underpinning germanium-based planar heterostructures and nanowires. We review the most significant experimental results demonstrating key building blocks for quantum technology, such as an electrically driven universal quantum gate set with spin qubits in quantum dots and superconductor-semiconductor devices for hybrid quantum systems. We conclude by identifying the most promising prospects\r\ntoward scalable quantum information processing. "}],"title":"The germanium quantum information route","author":[{"full_name":"Scappucci, Giordano","last_name":"Scappucci","first_name":"Giordano"},{"first_name":"Christoph","full_name":"Kloeffel, Christoph","last_name":"Kloeffel"},{"first_name":"Floris A.","full_name":"Zwanenburg, Floris A.","last_name":"Zwanenburg"},{"full_name":"Loss, Daniel","last_name":"Loss","first_name":"Daniel"},{"first_name":"Maksym","full_name":"Myronov, Maksym","last_name":"Myronov"},{"first_name":"Jian-Jun","last_name":"Zhang","full_name":"Zhang, Jian-Jun"},{"full_name":"Franceschi, Silvano De","last_name":"Franceschi","first_name":"Silvano De"},{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","last_name":"Katsaros"},{"last_name":"Veldhorst","full_name":"Veldhorst, Menno","first_name":"Menno"}],"external_id":{"isi":["000600826100003"],"arxiv":["2004.08133"]},"article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Scappucci, Giordano, Christoph Kloeffel, Floris A. Zwanenburg, Daniel Loss, Maksym Myronov, Jian-Jun Zhang, Silvano De Franceschi, Georgios Katsaros, and Menno Veldhorst. “The Germanium Quantum Information Route.” Nature Reviews Materials. Springer Nature, 2021. https://doi.org/10.1038/s41578-020-00262-z.","ista":"Scappucci G, Kloeffel C, Zwanenburg FA, Loss D, Myronov M, Zhang J-J, Franceschi SD, Katsaros G, Veldhorst M. 2021. The germanium quantum information route. Nature Reviews Materials. 6, 926–943.","mla":"Scappucci, Giordano, et al. “The Germanium Quantum Information Route.” Nature Reviews Materials, vol. 6, Springer Nature, 2021, pp. 926–943, doi:10.1038/s41578-020-00262-z.","ama":"Scappucci G, Kloeffel C, Zwanenburg FA, et al. The germanium quantum information route. Nature Reviews Materials. 2021;6:926–943. doi:10.1038/s41578-020-00262-z","apa":"Scappucci, G., Kloeffel, C., Zwanenburg, F. A., Loss, D., Myronov, M., Zhang, J.-J., … Veldhorst, M. (2021). The germanium quantum information route. Nature Reviews Materials. Springer Nature. https://doi.org/10.1038/s41578-020-00262-z","ieee":"G. Scappucci et al., “The germanium quantum information route,” Nature Reviews Materials, vol. 6. Springer Nature, pp. 926–943, 2021.","short":"G. Scappucci, C. Kloeffel, F.A. Zwanenburg, D. Loss, M. Myronov, J.-J. Zhang, S.D. Franceschi, G. Katsaros, M. Veldhorst, Nature Reviews Materials 6 (2021) 926–943."},"project":[{"grant_number":"335497","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425"},{"grant_number":"Y00715","name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","_id":"2552F888-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207","name":"Hole spin orbit qubits in Ge quantum wells"}],"date_published":"2021-10-01T00:00:00Z","doi":"10.1038/s41578-020-00262-z","date_created":"2020-12-02T10:52:51Z","page":"926–943 ","day":"01","publication":"Nature Reviews Materials","isi":1,"year":"2021","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"G.S., M.W.,F.A.Z acknowledge financial support from The Netherlands Organization for Scientific Research (NWO). F.Z., D.L., G.K. acknowledge funding from the European Union’s Horizon 2020 research and innovation programme under Grand Agreement Nr. 862046. G.K. acknowledges funding from FP7 ERC Starting Grant 335497, FWF Y 715-N30, FWF P-30207. S.D. acknowledges support from the European Union’s Horizon 2020 program under Grant\r\nAgreement No. 81050 and from the Agence Nationale de la Recherche through the TOPONANO and CMOSQSPIN projects. J.Z. acknowledges support from the National Key R&D Program of China (Grant No. 2016YFA0301701) and Strategic Priority Research Program of CAS (Grant No. XDB30000000). D.L. and C.K. acknowledge the Swiss National Science Foundation and NCCR QSIT."},{"title":"On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs","author":[{"last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexander I.","last_name":"Bobenko","full_name":"Bobenko, Alexander I."},{"first_name":"Wolfgang K.","last_name":"Schief","full_name":"Schief, Wolfgang K."},{"last_name":"Techter","full_name":"Techter, Jan","first_name":"Jan"}],"external_id":{"arxiv":["1908.00856"],"isi":["000564488500002"]},"article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.","ieee":"A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” Discrete and Computational Geometry, vol. 66. Springer Nature, pp. 938–976, 2021.","apa":"Akopyan, A., Bobenko, A. I., Schief, W. K., & Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00240-w","ama":"Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 2021;66:938-976. doi:10.1007/s00454-020-00240-w","mla":"Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete and Computational Geometry, vol. 66, Springer Nature, 2021, pp. 938–76, doi:10.1007/s00454-020-00240-w.","ista":"Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 66, 938–976.","chicago":"Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00240-w."},"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"doi":"10.1007/s00454-020-00240-w","date_published":"2021-10-01T00:00:00Z","date_created":"2020-09-06T22:01:13Z","page":"938-976","day":"01","publication":"Discrete and Computational Geometry","isi":1,"year":"2021","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"This research was supported by the DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by the Australian Research Council (DP1401000851). A.V.A. was also supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha).","department":[{"_id":"HeEd"}],"date_updated":"2024-03-07T14:51:11Z","status":"public","type":"journal_article","article_type":"original","_id":"8338","volume":66,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"publication_status":"published","month":"10","intvolume":" 66","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.00856"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces of Blaschke type generated by asymptotic and characteristic lines that are diagonally related to lines of curvature is proved theoretically and established constructively. Appropriate samplings (grids) of these webs lead to three-dimensional extensions of non-planar IC nets. Three-dimensional octahedral grids composed of planes and spatially extending (checkerboard) IC-nets are shown to arise in connection with systems of confocal quadrics in Minkowski space. In this context, the Laguerre geometric notion of conical octahedral grids of planes is introduced. The latter generalise the octahedral grids derived from systems of confocal quadrics in Minkowski space. An explicit construction of conical octahedral grids is presented. The results are accompanied by various illustrations which are based on the explicit formulae provided by the theory."}]},{"date_updated":"2024-03-07T14:43:39Z","department":[{"_id":"DaAl"}],"_id":"7939","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0452"],"issn":["0178-2770"]},"publication_status":"published","volume":34,"related_material":{"record":[{"id":"6933","status":"public","relation":"earlier_version"}]},"oa_version":"Published Version","abstract":[{"text":"We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include:\r\n A (2+ϵ)-approximation for all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√) sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in O~(n1/6) rounds. ","lang":"eng"}],"month":"12","intvolume":" 34","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1007/s00446-020-00380-5","open_access":"1"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing. Springer Nature, 2021. https://doi.org/10.1007/s00446-020-00380-5.","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.","ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” Distributed Computing, vol. 34. Springer Nature, pp. 463–487, 2021.","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-020-00380-5","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. Distributed Computing. 2021;34:463-487. doi:10.1007/s00446-020-00380-5","mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing, vol. 34, Springer Nature, 2021, pp. 463–87, doi:10.1007/s00446-020-00380-5."},"title":"Fast approximate shortest paths in the congested clique","author":[{"last_name":"Censor-Hillel","full_name":"Censor-Hillel, Keren","first_name":"Keren"},{"first_name":"Michal","full_name":"Dory, Michal","last_name":"Dory"},{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne","last_name":"Korhonen"},{"full_name":"Leitersdorf, Dean","last_name":"Leitersdorf","first_name":"Dean"}],"external_id":{"isi":["000556444600001"],"arxiv":["1903.05956"]},"article_processing_charge":"Yes (via OA deal)","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"day":"01","publication":"Distributed Computing","isi":1,"year":"2021","doi":"10.1007/s00446-020-00380-5","date_published":"2021-12-01T00:00:00Z","date_created":"2020-06-07T22:00:54Z","page":"463-487","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful discussions. This project has received funding from the European Union’s Horizon 2020 Research And Innovation Program under Grant Agreement No. 755839.","quality_controlled":"1","publisher":"Springer Nature","oa":1},{"oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"Open access funding provided by the Institute of Science and Technology (IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India.\r\nThis work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). The third author is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","date_created":"2020-08-11T07:11:51Z","date_published":"2021-09-01T00:00:00Z","doi":"10.1007/s00454-020-00233-9","page":"666-686","publication":"Discrete and Computational Geometry","day":"01","year":"2021","has_accepted_license":"1","isi":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"title":"Local conditions for triangulating submanifolds of Euclidean space","external_id":{"isi":["000558119300001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"last_name":"Dyer","full_name":"Dyer, Ramsay","first_name":"Ramsay"},{"first_name":"Arijit","full_name":"Ghosh, Arijit","last_name":"Ghosh"},{"first_name":"Andre","last_name":"Lieutier","full_name":"Lieutier, Andre"},{"last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” Discrete and Computational Geometry, vol. 66, Springer Nature, 2021, pp. 666–86, doi:10.1007/s00454-020-00233-9.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., & Wintraecken, M. (2021). Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00233-9","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local conditions for triangulating submanifolds of Euclidean space,” Discrete and Computational Geometry, vol. 66. Springer Nature, pp. 666–686, 2021.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00233-9.","ista":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 66, 666–686."},"intvolume":" 66","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-020-00233-9"}],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We consider the following setting: suppose that we are given a manifold M in Rd with positive reach. Moreover assume that we have an embedded simplical complex A without boundary, whose vertex set lies on the manifold, is sufficiently dense and such that all simplices in A have sufficient quality. We prove that if, locally, interiors of the projection of the simplices onto the tangent space do not intersect, then A is a triangulation of the manifold, that is, they are homeomorphic.","lang":"eng"}],"ec_funded":1,"volume":66,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"8248","department":[{"_id":"HeEd"}],"ddc":["510"],"date_updated":"2024-03-07T14:54:59Z"},{"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1557-9654"],"issn":["0018-9448"]},"volume":67,"issue":"9","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"6665"}]},"oa_version":"Preprint","abstract":[{"lang":"eng","text":" We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but do so under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding. Our proof is based on the construction and analysis of binary polar codes with large kernels. When communicating reliably at rates within ε>0 of capacity, the code length n often scales as O(1/εμ), where the constant μ is called the scaling exponent. It is known that the optimal scaling exponent is μ=2, and it is achieved by random linear codes. The scaling exponent of conventional polar codes (based on the 2×2 kernel) on the BEC is μ=3.63. This falls far short of the optimal scaling guaranteed by random codes. Our main contribution is a rigorous proof of the following result: for the BEC, there exist ℓ×ℓ binary kernels, such that polar codes constructed from these kernels achieve scaling exponent μ(ℓ) that tends to the optimal value of 2 as ℓ grows. We furthermore characterize precisely how large ℓ needs to be as a function of the gap between μ(ℓ) and 2. The resulting binary codes maintain the recursive structure of conventional polar codes, and thereby achieve construction complexity O(n) and encoding/decoding complexity O(nlogn)."}],"intvolume":" 67","month":"09","scopus_import":"1","date_updated":"2024-03-07T12:18:50Z","department":[{"_id":"MaMo"}],"_id":"9002","status":"public","type":"journal_article","article_type":"original","publication":"IEEE Transactions on Information Theory","day":"01","year":"2021","date_created":"2021-01-10T23:01:18Z","doi":"10.1109/TIT.2020.3038806","date_published":"2021-09-01T00:00:00Z","page":"5693-5710","quality_controlled":"1","publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” IEEE Transactions on Information Theory. IEEE, 2021. https://doi.org/10.1109/TIT.2020.3038806.","ista":"Fazeli A, Hassani H, Mondelli M, Vardy A. 2021. Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. 67(9), 5693–5710.","mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” IEEE Transactions on Information Theory, vol. 67, no. 9, IEEE, 2021, pp. 5693–710, doi:10.1109/TIT.2020.3038806.","apa":"Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2021). Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2020.3038806","ama":"Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. 2021;67(9):5693-5710. doi:10.1109/TIT.2020.3038806","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, IEEE Transactions on Information Theory 67 (2021) 5693–5710.","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” IEEE Transactions on Information Theory, vol. 67, no. 9. IEEE, pp. 5693–5710, 2021."},"title":"Binary linear codes with optimal scaling: Polar codes with large kernels","external_id":{"arxiv":["1711.01339"]},"article_processing_charge":"No","author":[{"full_name":"Fazeli, Arman","last_name":"Fazeli","first_name":"Arman"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"full_name":"Vardy, Alexander","last_name":"Vardy","first_name":"Alexander"}]},{"status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"7883","file_date_updated":"2020-11-24T13:11:39Z","department":[{"_id":"AnKi"}],"ddc":["570"],"date_updated":"2024-03-07T15:03:00Z","month":"04","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"text":"All vertebrates have a spinal cord with dimensions and shape specific to their species. Yet how species‐specific organ size and shape are achieved is a fundamental unresolved question in biology. The formation and sculpting of organs begins during embryonic development. As it develops, the spinal cord extends in anterior–posterior direction in synchrony with the overall growth of the body. The dorsoventral (DV) and apicobasal lengths of the spinal cord neuroepithelium also change, while at the same time a characteristic pattern of neural progenitor subtypes along the DV axis is established and elaborated. At the basis of these changes in tissue size and shape are biophysical determinants, such as the change in cell number, cell size and shape, and anisotropic tissue growth. These processes are controlled by global tissue‐scale regulators, such as morphogen signaling gradients as well as mechanical forces. Current challenges in the field are to uncover how these tissue‐scale regulatory mechanisms are translated to the cellular and molecular level, and how regulation of distinct cellular processes gives rise to an overall defined size. Addressing these questions will help not only to achieve a better understanding of how size is controlled, but also of how tissue size is coordinated with the specification of pattern.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"14323","relation":"dissertation_contains"}]},"ec_funded":1,"file":[{"file_size":2527276,"date_updated":"2020-11-24T13:11:39Z","creator":"dernst","file_name":"2020_WIREs_DevBio_KuzmiczKowalska.pdf","date_created":"2020-11-24T13:11:39Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"f0a7745d48afa09ea7025e876a0145a8","file_id":"8800"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["17597684"],"eissn":["17597692"]},"publication_status":"published","project":[{"grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425"},{"name":"The role of morphogens in the regulation of neural tube growth","_id":"267AF0E4-B435-11E9-9278-68D0E5697425"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F07802","name":"Morphogen control of growth and pattern in the spinal cord"}],"article_number":"e383","title":"Regulation of size and scale in vertebrate spinal cord development","author":[{"id":"4CED352A-F248-11E8-B48F-1D18A9856A87","first_name":"Katarzyna","last_name":"Kuzmicz-Kowalska","full_name":"Kuzmicz-Kowalska, Katarzyna"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","last_name":"Kicheva","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna"}],"external_id":{"pmid":["32391980"],"isi":["000531419400001"]},"article_processing_charge":"Yes (via OA deal)","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kuzmicz-Kowalska K, Kicheva A. 2021. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology., e383.","chicago":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental Biology. Wiley, 2021. https://doi.org/10.1002/wdev.383.","short":"K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental Biology (2021).","ieee":"K. Kuzmicz-Kowalska and A. Kicheva, “Regulation of size and scale in vertebrate spinal cord development,” Wiley Interdisciplinary Reviews: Developmental Biology. Wiley, 2021.","ama":"Kuzmicz-Kowalska K, Kicheva A. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology. 2021. doi:10.1002/wdev.383","apa":"Kuzmicz-Kowalska, K., & Kicheva, A. (2021). Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology. Wiley. https://doi.org/10.1002/wdev.383","mla":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental Biology, e383, Wiley, 2021, doi:10.1002/wdev.383."},"quality_controlled":"1","publisher":"Wiley","oa":1,"acknowledgement":"Austrian Academy of Sciences, Grant/Award Number: DOC fellowship for Katarzyna Kuzmicz-Kowalska; Austrian Science Fund, Grant/Award Number: F78 (Stem Cell Modulation); H2020 European Research Council, Grant/Award Number: 680037","doi":"10.1002/wdev.383","date_published":"2021-04-15T00:00:00Z","date_created":"2020-05-24T22:01:00Z","day":"15","publication":"Wiley Interdisciplinary Reviews: Developmental Biology","isi":1,"has_accepted_license":"1","year":"2021"},{"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"external_id":{"arxiv":["1712.07734"],"isi":["000536324700001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam","last_name":"Brown","full_name":"Brown, Adam"},{"full_name":"Wang, Bei","last_name":"Wang","first_name":"Bei"}],"title":"Sheaf-theoretic stratification learning from geometric and topological perspectives","citation":{"chicago":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00206-y.","ista":"Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.","mla":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:10.1007/s00454-020-00206-y.","ieee":"A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” Discrete and Computational Geometry, vol. 65. Springer Nature, pp. 1166–1198, 2021.","short":"A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.","apa":"Brown, A., & Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00206-y","ama":"Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198. doi:10.1007/s00454-020-00206-y"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375. The authors would like to thank the anonymous referees for their insightful comments.","page":"1166-1198","date_created":"2020-05-30T10:26:04Z","doi":"10.1007/s00454-020-00206-y","date_published":"2021-06-01T00:00:00Z","year":"2021","has_accepted_license":"1","isi":1,"publication":"Discrete and Computational Geometry","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"7905","department":[{"_id":"HeEd"}],"file_date_updated":"2020-11-25T09:06:41Z","date_updated":"2024-03-07T15:01:58Z","ddc":["510"],"scopus_import":"1","intvolume":" 65","month":"06","abstract":[{"lang":"eng","text":"We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2), 195–222, 2020). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms."}],"oa_version":"Published Version","volume":65,"publication_status":"published","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"487a84ea5841b75f04f66d7ebd71b67e","file_id":"8803","creator":"dernst","file_size":1013730,"date_updated":"2020-11-25T09:06:41Z","file_name":"2020_DiscreteCompGeometry_Brown.pdf","date_created":"2020-11-25T09:06:41Z"}]},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"doi":"10.1007/s00440-020-01003-7","date_published":"2021-02-01T00:00:00Z","date_created":"2020-10-04T22:01:37Z","has_accepted_license":"1","isi":1,"year":"2021","day":"01","publication":"Probability Theory and Related Fields","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"author":[{"first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","last_name":"Cipolloni"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"external_id":{"arxiv":["1908.00969"],"isi":["000572724600002"]},"article_processing_charge":"Yes (via OA deal)","title":"Edge universality for non-Hermitian random matrices","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Edge Universality for Non-Hermitian Random Matrices.” Probability Theory and Related Fields. Springer Nature, 2021. https://doi.org/10.1007/s00440-020-01003-7.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2021. Edge universality for non-Hermitian random matrices. Probability Theory and Related Fields.","mla":"Cipolloni, Giorgio, et al. “Edge Universality for Non-Hermitian Random Matrices.” Probability Theory and Related Fields, Springer Nature, 2021, doi:10.1007/s00440-020-01003-7.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (2021).","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Edge universality for non-Hermitian random matrices,” Probability Theory and Related Fields. Springer Nature, 2021.","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2021). Edge universality for non-Hermitian random matrices. Probability Theory and Related Fields. Springer Nature. https://doi.org/10.1007/s00440-020-01003-7","ama":"Cipolloni G, Erdös L, Schröder DJ. Edge universality for non-Hermitian random matrices. Probability Theory and Related Fields. 2021. doi:10.1007/s00440-020-01003-7"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","month":"02","abstract":[{"lang":"eng","text":"We consider large non-Hermitian real or complex random matrices X with independent, identically distributed centred entries. We prove that their local eigenvalue statistics near the spectral edge, the unit circle, coincide with those of the Ginibre ensemble, i.e. when the matrix elements of X are Gaussian. This result is the non-Hermitian counterpart of the universality of the Tracy–Widom distribution at the spectral edges of the Wigner ensemble."}],"oa_version":"Published Version","ec_funded":1,"publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"publication_status":"published","file":[{"success":1,"checksum":"611ae28d6055e1e298d53a57beb05ef4","file_id":"8612","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_ProbTheory_Cipolloni.pdf","date_created":"2020-10-05T14:53:40Z","file_size":497032,"date_updated":"2020-10-05T14:53:40Z","creator":"dernst"}],"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"8601","file_date_updated":"2020-10-05T14:53:40Z","department":[{"_id":"LaEr"}],"date_updated":"2024-03-07T15:07:53Z","ddc":["510"]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” Optimization Letters, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:10.1007/s11590-020-01603-1.","short":"Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.","ieee":"Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” Optimization Letters, vol. 15. Springer Nature, pp. 2109–2126, 2021.","apa":"Shehu, Y., & Gibali, A. (2021). New inertial relaxed method for solving split feasibilities. Optimization Letters. Springer Nature. https://doi.org/10.1007/s11590-020-01603-1","ama":"Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. Optimization Letters. 2021;15:2109-2126. doi:10.1007/s11590-020-01603-1","chicago":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” Optimization Letters. Springer Nature, 2021. https://doi.org/10.1007/s11590-020-01603-1.","ista":"Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126."},"title":"New inertial relaxed method for solving split feasibilities","external_id":{"isi":["000537342300001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Shehu","full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","first_name":"Yekini"},{"full_name":"Gibali, Aviv","last_name":"Gibali","first_name":"Aviv"}],"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication":"Optimization Letters","day":"01","year":"2021","isi":1,"has_accepted_license":"1","date_created":"2020-06-04T11:28:33Z","date_published":"2021-09-01T00:00:00Z","doi":"10.1007/s11590-020-01603-1","page":"2109-2126","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are grateful to the referees for their insightful comments which have improved the earlier version of the manuscript greatly. The first author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","oa":1,"publisher":"Springer Nature","quality_controlled":"1","ddc":["510"],"date_updated":"2024-03-07T15:00:43Z","file_date_updated":"2024-03-07T14:58:51Z","department":[{"_id":"VlKo"}],"_id":"7925","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"63c5f31cd04626152a19f97a2476281b","file_id":"15089","file_size":2148882,"date_updated":"2024-03-07T14:58:51Z","creator":"kschuh","file_name":"2021_OptimizationLetters_Shehu.pdf","date_created":"2024-03-07T14:58:51Z"}],"publication_status":"published","publication_identifier":{"eissn":["1862-4480"],"issn":["1862-4472"]},"ec_funded":1,"volume":15,"oa_version":"Published Version","abstract":[{"text":"In this paper, we introduce a relaxed CQ method with alternated inertial step for solving split feasibility problems. We give convergence of the sequence generated by our method under some suitable assumptions. Some numerical implementations from sparse signal and image deblurring are reported to show the efficiency of our method.","lang":"eng"}],"intvolume":" 15","month":"09","scopus_import":"1"},{"department":[{"_id":"PeJo"}],"file_date_updated":"2021-12-02T23:30:05Z","date_updated":"2023-08-10T22:30:51Z","ddc":["570"],"type":"journal_article","article_type":"original","status":"public","_id":"9438","ec_funded":1,"volume":16,"issue":"6","publication_status":"published","publication_identifier":{"issn":["17542189"],"eissn":["17502799"]},"language":[{"iso":"eng"}],"file":[{"file_id":"9639","checksum":"7eb580abd8893cdb0b410cf41bc8c263","embargo":"2021-12-01","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2021-07-08T12:27:55Z","file_name":"VandaeletalAuthorVersion2021.pdf","creator":"cziletti","date_updated":"2021-12-02T23:30:05Z","file_size":38574802}],"scopus_import":"1","intvolume":" 16","month":"06","acknowledged_ssus":[{"_id":"M-Shop"}],"abstract":[{"lang":"eng","text":"Rigorous investigation of synaptic transmission requires analysis of unitary synaptic events by simultaneous recording from presynaptic terminals and postsynaptic target neurons. However, this has been achieved at only a limited number of model synapses, including the squid giant synapse and the mammalian calyx of Held. Cortical presynaptic terminals have been largely inaccessible to direct presynaptic recording, due to their small size. Here, we describe a protocol for improved subcellular patch-clamp recording in rat and mouse brain slices, with the synapse in a largely intact environment. Slice preparation takes ~2 h, recording ~3 h and post hoc morphological analysis 2 d. Single presynaptic hippocampal mossy fiber terminals are stimulated minimally invasively in the bouton-attached configuration, in which the cytoplasmic content remains unperturbed, or in the whole-bouton configuration, in which the cytoplasmic composition can be precisely controlled. Paired pre–postsynaptic recordings can be integrated with biocytin labeling and morphological analysis, allowing correlative investigation of synapse structure and function. Paired recordings can be obtained from mossy fiber terminals in slices from both rats and mice, implying applicability to genetically modified synapses. Paired recordings can also be performed together with axon tract stimulation or optogenetic activation, allowing comparison of unitary and compound synaptic events in the same target cell. Finally, paired recordings can be combined with spontaneous event analysis, permitting collection of miniature events generated at a single identified synapse. In conclusion, the subcellular patch-clamp techniques detailed here should facilitate analysis of biophysics, plasticity and circuit function of cortical synapses in the mammalian central nervous system."}],"oa_version":"Submitted Version","pmid":1,"article_processing_charge":"No","external_id":{"pmid":["33990799"],"isi":["000650528700003"]},"author":[{"first_name":"David H","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676","full_name":"Vandael, David H","last_name":"Vandael"},{"orcid":"0000-0003-0408-6094","full_name":"Okamoto, Yuji","last_name":"Okamoto","first_name":"Yuji","id":"3337E116-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Carolina","id":"4305C450-F248-11E8-B48F-1D18A9856A87","last_name":"Borges Merjane","orcid":"0000-0003-0005-401X","full_name":"Borges Merjane, Carolina"},{"full_name":"Vargas Barroso, Victor M","last_name":"Vargas Barroso","id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87","first_name":"Victor M"},{"first_name":"Benjamin","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","last_name":"Suter","orcid":"0000-0002-9885-6936","full_name":"Suter, Benjamin"},{"last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"title":"Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses","citation":{"ama":"Vandael DH, Okamoto Y, Borges Merjane C, Vargas Barroso VM, Suter B, Jonas PM. Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. 2021;16(6):2947–2967. doi:10.1038/s41596-021-00526-0","apa":"Vandael, D. H., Okamoto, Y., Borges Merjane, C., Vargas Barroso, V. M., Suter, B., & Jonas, P. M. (2021). Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. Springer Nature. https://doi.org/10.1038/s41596-021-00526-0","short":"D.H. Vandael, Y. Okamoto, C. Borges Merjane, V.M. Vargas Barroso, B. Suter, P.M. Jonas, Nature Protocols 16 (2021) 2947–2967.","ieee":"D. H. Vandael, Y. Okamoto, C. Borges Merjane, V. M. Vargas Barroso, B. Suter, and P. M. Jonas, “Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses,” Nature Protocols, vol. 16, no. 6. Springer Nature, pp. 2947–2967, 2021.","mla":"Vandael, David H., et al. “Subcellular Patch-Clamp Techniques for Single-Bouton Stimulation and Simultaneous Pre- and Postsynaptic Recording at Cortical Synapses.” Nature Protocols, vol. 16, no. 6, Springer Nature, 2021, pp. 2947–2967, doi:10.1038/s41596-021-00526-0.","ista":"Vandael DH, Okamoto Y, Borges Merjane C, Vargas Barroso VM, Suter B, Jonas PM. 2021. Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. 16(6), 2947–2967.","chicago":"Vandael, David H, Yuji Okamoto, Carolina Borges Merjane, Victor M Vargas Barroso, Benjamin Suter, and Peter M Jonas. “Subcellular Patch-Clamp Techniques for Single-Bouton Stimulation and Simultaneous Pre- and Postsynaptic Recording at Cortical Synapses.” Nature Protocols. Springer Nature, 2021. https://doi.org/10.1038/s41596-021-00526-0."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","grant_number":"692692"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z00312"},{"call_identifier":"FWF","_id":"2696E7FE-B435-11E9-9278-68D0E5697425","grant_number":"V00739","name":"Structural plasticity at mossy fiber-CA3 synapses"}],"page":"2947–2967","date_created":"2021-05-30T22:01:24Z","date_published":"2021-06-01T00:00:00Z","doi":"10.1038/s41596-021-00526-0","year":"2021","has_accepted_license":"1","isi":1,"publication":"Nature Protocols","day":"01","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J., V 739-B27 to C.B.M.). We are grateful to F. Marr and C. Altmutter for excellent technical assistance and cell reconstruction, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria, especially T. Asenov and Miba machine shop, for maximally efficient support."},{"project":[{"name":"RNA-directed DNA methylation in plant development","grant_number":"P29988","call_identifier":"FWF","_id":"262EF96E-B435-11E9-9278-68D0E5697425"},{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"}],"title":"Wound healing in the Arabidopsis root meristem","author":[{"last_name":"Hörmayer","full_name":"Hörmayer, Lukas","orcid":"0000-0001-8295-2926","first_name":"Lukas","id":"2EEE7A2A-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Hörmayer L. 2021. Wound healing in the Arabidopsis root meristem. Institute of Science and Technology Austria.","chicago":"Hörmayer, Lukas. “Wound Healing in the Arabidopsis Root Meristem.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9992.","apa":"Hörmayer, L. (2021). Wound healing in the Arabidopsis root meristem. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9992","ama":"Hörmayer L. Wound healing in the Arabidopsis root meristem. 2021. doi:10.15479/at:ista:9992","short":"L. Hörmayer, Wound Healing in the Arabidopsis Root Meristem, Institute of Science and Technology Austria, 2021.","ieee":"L. Hörmayer, “Wound healing in the Arabidopsis root meristem,” Institute of Science and Technology Austria, 2021.","mla":"Hörmayer, Lukas. Wound Healing in the Arabidopsis Root Meristem. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9992."},"publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2021-09-13T00:00:00Z","doi":"10.15479/at:ista:9992","date_created":"2021-09-09T07:37:20Z","page":"168","day":"13","has_accepted_license":"1","year":"2021","status":"public","type":"dissertation","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"9992","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"file_date_updated":"2021-09-15T22:30:26Z","ddc":["575"],"supervisor":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml"}],"date_updated":"2023-09-07T13:38:33Z","month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"abstract":[{"text":"Blood – this is what animals use to heal wounds fast and efficient. Plants do not have blood circulation and their cells cannot move. However, plants have evolved remarkable capacities to regenerate tissues and organs preventing further damage. In my PhD research, I studied the wound healing in the Arabidopsis root. I used a UV laser to ablate single cells in the root tip and observed the consequent wound healing. Interestingly, the inner adjacent cells induced a\r\ndivision plane switch and subsequently adopted the cell type of the killed cell to replace it. We termed this form of wound healing “restorative divisions”. This initial observation triggered the questions of my PhD studies: How and why do cells orient their division planes, how do they feel the wound and why does this happen only in inner adjacent cells.\r\nFor answering these questions, I used a quite simple experimental setup: 5 day - old seedlings were stained with propidium iodide to visualize cell walls and dead cells; ablation was carried out using a special laser cutter and a confocal microscope. Adaptation of the novel vertical microscope system made it possible to observe wounds in real time. This revealed that restorative divisions occur at increased frequency compared to normal divisions. Additionally,\r\nthe major plant hormone auxin accumulates in wound adjacent cells and drives the expression of the wound-stress responsive transcription factor ERF115. Using this as a marker gene for wound responses, we found that an important part of wound signalling is the sensing of the collapse of the ablated cell. The collapse causes a radical pressure drop, which results in strong tissue deformations. These deformations manifest in an invasion of the now free spot specifically by the inner adjacent cells within seconds, probably because of higher pressure of the inner tissues. Long-term imaging revealed that those deformed cells continuously expand towards the wound hole and that this is crucial for the restorative division. These wound-expanding cells exhibit an abnormal, biphasic polarity of microtubule arrays\r\nbefore the division. Experiments inhibiting cell expansion suggest that it is the biphasic stretching that induces those MT arrays. Adapting the micromanipulator aspiration system from animal scientists at our institute confirmed the hypothesis that stretching influences microtubule stability. In conclusion, this shows that microtubules react to tissue deformation\r\nand this facilitates the observed division plane switch. This puts mechanical cues and tensions at the most prominent position for explaining the growth and wound healing properties of plants. Hence, it shines light onto the importance of understanding mechanical signal transduction. ","lang":"eng"}],"related_material":{"record":[{"id":"6351","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"6943","status":"public"},{"relation":"part_of_dissertation","id":"8002","status":"public"}]},"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file":[{"relation":"source_file","access_level":"closed","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"c763064adaa720e16066c1a4f9682bbb","file_id":"9993","creator":"lhoermaye","file_size":25179004,"date_updated":"2021-09-15T22:30:26Z","file_name":"Thesis_vupload.docx","date_created":"2021-09-09T07:29:48Z"},{"file_id":"9996","checksum":"53911b06e93d7cdbbf4c7f4c162fa70f","embargo":"2021-09-09","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-09-09T14:25:08Z","file_name":"Thesis_vfinal_pdfa.pdf","date_updated":"2021-09-15T22:30:26Z","file_size":6246900,"creator":"lhoermaye"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published"},{"project":[{"name":"Biophysics and circuit function of a giant cortical glumatergic synapse","grant_number":"692692","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00312","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"}],"citation":{"chicago":"Guzmán, José, Alois Schlögl, Claudia Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” Nature Computational Science. Springer Nature, 2021. https://doi.org/10.1038/s43588-021-00157-1.","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 1(12), 830–842.","mla":"Guzmán, José, et al. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” Nature Computational Science, vol. 1, no. 12, Springer Nature, 2021, pp. 830–42, doi:10.1038/s43588-021-00157-1.","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network,” Nature Computational Science, vol. 1, no. 12. Springer Nature, pp. 830–842, 2021.","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., & Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-021-00157-1","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 2021;1(12):830-842. doi:10.1038/s43588-021-00157-1"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","first_name":"José","last_name":"Guzmán","full_name":"Guzmán, José","orcid":"0000-0003-2209-5242"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl"},{"first_name":"Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","last_name":"Espinoza Martinez","orcid":"0000-0003-4710-2082","full_name":"Espinoza Martinez, Claudia "},{"last_name":"Zhang","full_name":"Zhang, Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","first_name":"Xiaomin"},{"last_name":"Suter","orcid":"0000-0002-9885-6936","full_name":"Suter, Benjamin","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin"},{"last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M"}],"title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","acknowledgement":"We thank A. Aertsen, N. Kopell, W. Maass, A. Roth, F. Stella and T. Vogels for critically reading earlier versions of the manuscript. We are grateful to F. Marr and C. Altmutter for excellent technical assistance, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria for efficient support. Finally, we thank T. Carnevale, L. Erdös, M. Hines, D. Nykamp and D. Schröder for useful discussions, and R. Friedrich and S. Wiechert for sharing unpublished data. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692, P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J. and P 31815 to S.J.G.).","oa":1,"quality_controlled":"1","publisher":"Springer Nature","year":"2021","has_accepted_license":"1","publication":"Nature Computational Science","day":"16","page":"830-842","date_created":"2022-03-04T08:32:36Z","doi":"10.1038/s43588-021-00157-1","date_published":"2021-12-16T00:00:00Z","_id":"10816","type":"journal_article","article_type":"original","keyword":["general medicine"],"status":"public","date_updated":"2023-08-10T22:30:10Z","ddc":["610"],"file_date_updated":"2022-06-18T22:30:03Z","department":[{"_id":"PeJo"}],"acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"lang":"eng","text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks."}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/647800","open_access":"1"}],"scopus_import":"1","intvolume":" 1","month":"12","publication_status":"published","publication_identifier":{"issn":["2662-8457"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2022-06-02T12:51:07Z","file_name":"Guzmanetal2021.pdf","date_updated":"2022-06-18T22:30:03Z","file_size":1699466,"creator":"patrickd","file_id":"11430","checksum":"9fec5b667909ef52be96d502e4f8c2ae","embargo":"2022-06-17","content_type":"application/pdf","access_level":"open_access","relation":"main_file"},{"date_created":"2022-06-02T12:53:47Z","title":"Supplementary Material","file_name":"Guzmanetal2021Suppl.pdf","creator":"patrickd","date_updated":"2022-06-18T22:30:03Z","file_size":3005651,"file_id":"11431","checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","embargo":"2022-06-17","access_level":"open_access","relation":"supplementary_material","content_type":"application/pdf"}],"ec_funded":1,"related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/spot-the-difference/"}],"record":[{"relation":"software","status":"public","id":"10110"}]},"issue":"12","volume":1},{"department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","file_date_updated":"2021-10-08T08:46:04Z","author":[{"last_name":"Guzmán","full_name":"Guzmán, José","orcid":"0000-0003-2209-5242","first_name":"José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl"},{"id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","full_name":"Espinoza Martinez, Claudia ","orcid":"0000-0003-4710-2082","last_name":"Espinoza Martinez"},{"last_name":"Zhang","full_name":"Zhang, Xiaomin","first_name":"Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9885-6936","full_name":"Suter, Benjamin","last_name":"Suter","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin"},{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"ddc":["005"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2024-03-27T23:30:11Z","citation":{"mla":"Guzmán, José, et al. How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network. IST Austria, 2021, doi:10.15479/AT:ISTA:10110.","apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., & Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. IST Austria. https://doi.org/10.15479/AT:ISTA:10110","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. 2021. doi:10.15479/AT:ISTA:10110","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, (2021).","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network.” IST Austria, 2021.","chicago":"Guzmán, José, Alois Schlögl, Claudia Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” IST Austria, 2021. https://doi.org/10.15479/AT:ISTA:10110.","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network, IST Austria, 10.15479/AT:ISTA:10110."},"status":"public","tmp":{"name":"GNU General Public License 3.0","legal_code_url":"https://www.gnu.org/licenses/gpl-3.0.en.html","short":"GPL 3.0"},"type":"software","_id":"10110","date_created":"2021-10-08T06:44:22Z","license":"https://opensource.org/licenses/GPL-3.0","doi":"10.15479/AT:ISTA:10110","related_material":{"link":[{"url":"https://ist.ac.at/en/news/spot-the-difference/","relation":"press_release","description":"News on IST Webpage"}],"record":[{"relation":"used_for_analysis_in","id":"10816","status":"public"}]},"date_published":"2021-12-16T00:00:00Z","file":[{"file_name":"patternseparation-main (1).zip","date_created":"2021-10-08T08:46:04Z","file_size":332990101,"date_updated":"2021-10-08T08:46:04Z","creator":"cchlebak","success":1,"checksum":"f92f8931cad0aa7e411c1715337bf408","file_id":"10114","content_type":"application/x-zip-compressed","relation":"main_file","access_level":"open_access"}],"day":"16","year":"2021","has_accepted_license":"1","month":"12","oa":1,"publisher":"IST Austria","abstract":[{"text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.","lang":"eng"}]},{"status":"public","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"257A4776-B435-11E9-9278-68D0E5697425","grant_number":"281511","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex"},{"grant_number":"P34015","name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"type":"preprint","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"10077","title":"The structure of hippocampal CA1 interactions optimizes spatial coding across experience","department":[{"_id":"GradSch"},{"_id":"JoCs"},{"_id":"GaTk"}],"author":[{"full_name":"Nardin, Michele","orcid":"0000-0001-8849-6570","last_name":"Nardin","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","first_name":"Michele"},{"last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L"},{"full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Savin, Cristina","last_name":"Savin","first_name":"Cristina","id":"3933349E-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2024-03-27T23:30:16Z","citation":{"mla":"Nardin, Michele, et al. “The Structure of Hippocampal CA1 Interactions Optimizes Spatial Coding across Experience.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2021.09.28.460602.","ama":"Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv. doi:10.1101/2021.09.28.460602","apa":"Nardin, M., Csicsvari, J. L., Tkačik, G., & Savin, C. (n.d.). The structure of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.09.28.460602","ieee":"M. Nardin, J. L. Csicsvari, G. Tkačik, and C. Savin, “The structure of hippocampal CA1 interactions optimizes spatial coding across experience,” bioRxiv. Cold Spring Harbor Laboratory.","short":"M. Nardin, J.L. Csicsvari, G. Tkačik, C. Savin, BioRxiv (n.d.).","chicago":"Nardin, Michele, Jozsef L Csicsvari, Gašper Tkačik, and Cristina Savin. “The Structure of Hippocampal CA1 Interactions Optimizes Spatial Coding across Experience.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.09.28.460602.","ista":"Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv, 10.1101/2021.09.28.460602."},"month":"09","publisher":"Cold Spring Harbor Laboratory","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/2021.09.28.460602"}],"oa":1,"oa_version":"Preprint","acknowledgement":"We thank Peter Baracskay, Karola Kaefer and Hugo Malagon-Vina for the acquisition of the data. We thank Federico Stella for comments on an earlier version of the manuscript. MN was supported by European Union Horizon 2020 grant 665385, JC was supported by European Research Council consolidator grant 281511, GT was supported by the Austrian Science Fund (FWF) grant P34015, CS was supported by an IST fellow grant, National Institute of Mental Health Award 1R01MH125571-01, by the National Science Foundation under NSF Award No. 1922658 and a Google faculty award.","abstract":[{"text":"Although much is known about how single neurons in the hippocampus represent an animal’s position, how cell-cell interactions contribute to spatial coding remains poorly understood. Using a novel statistical estimator and theoretical modeling, both developed in the framework of maximum entropy models, we reveal highly structured cell-to-cell interactions whose statistics depend on familiar vs. novel environment. In both conditions the circuit interactions optimize the encoding of spatial information, but for regimes that differ in the signal-to-noise ratio of their spatial inputs. Moreover, the topology of the interactions facilitates linear decodability, making the information easy to read out by downstream circuits. These findings suggest that the efficient coding hypothesis is not applicable only to individual neuron properties in the sensory periphery, but also to neural interactions in the central brain.","lang":"eng"}],"doi":"10.1101/2021.09.28.460602","related_material":{"record":[{"id":"11932","status":"public","relation":"dissertation_contains"}]},"date_published":"2021-09-29T00:00:00Z","ec_funded":1,"date_created":"2021-10-04T06:23:34Z","day":"29","publication":"bioRxiv","language":[{"iso":"eng"}],"year":"2021","publication_status":"submitted"}]