[{"publication":"31st International Workshop on Machine Learning for Signal Processing","abstract":[{"text":"Multiple-input multiple-output (MIMO) radar is one of the leading depth sensing modalities. However, the usage of multiple receive channels lead to relative high costs and prevent the penetration of MIMOs in many areas such as the automotive industry. Over the last years, few studies concentrated on designing reduced measurement schemes and image reconstruction schemes for MIMO radars, however these problems have been so far addressed separately. On the other hand, recent works in optical computational imaging have demonstrated growing success of simultaneous learning-based design of the acquisition and reconstruction schemes, manifesting significant improvement in the reconstruction quality. Inspired by these successes, in this work, we propose to learn MIMO acquisition parameters in the form of receive (Rx) antenna elements locations jointly with an image neural-network based reconstruction. To this end, we propose an algorithm for training the combined acquisition-reconstruction pipeline end-to-end in a differentiable way. We demonstrate the significance of using our learned acquisition parameters with and without the neural-network reconstruction. Code and datasets will be released upon publication.","lang":"eng"}],"publication_status":"published","extern":"1","doi":"10.1109/mlsp52302.2021.9596168","oa_version":"Preprint","publication_identifier":{"eisbn":["9781728163383"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-08T13:03:09Z","publisher":"Institute of Electrical and Electronics Engineers","intvolume":"         4","day":"01","OA_place":"repository","citation":{"ieee":"T. Weiss, N. Peretz, S. Vedula, A. Feuer, and A. M. Bronstein, “Joint optimization of system design and reconstruction in MIMO radar imaging,” in <i>31st International Workshop on Machine Learning for Signal Processing</i>, Gold Coast, Australia, 2021, vol. 4.","apa":"Weiss, T., Peretz, N., Vedula, S., Feuer, A., &#38; Bronstein, A. M. (2021). Joint optimization of system design and reconstruction in MIMO radar imaging. In <i>31st International Workshop on Machine Learning for Signal Processing</i> (Vol. 4). Gold Coast, Australia: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/mlsp52302.2021.9596168\">https://doi.org/10.1109/mlsp52302.2021.9596168</a>","ista":"Weiss T, Peretz N, Vedula S, Feuer A, Bronstein AM. 2021. Joint optimization of system design and reconstruction in MIMO radar imaging. 31st International Workshop on Machine Learning for Signal Processing. MLSP: Machine Learning for Signal Processing vol. 4.","mla":"Weiss, Tomer, et al. “Joint Optimization of System Design and Reconstruction in MIMO Radar Imaging.” <i>31st International Workshop on Machine Learning for Signal Processing</i>, vol. 4, Institute of Electrical and Electronics Engineers, 2021, doi:<a href=\"https://doi.org/10.1109/mlsp52302.2021.9596168\">10.1109/mlsp52302.2021.9596168</a>.","chicago":"Weiss, Tomer, Nissim Peretz, Sanketh Vedula, Arie Feuer, and Alex M. Bronstein. “Joint Optimization of System Design and Reconstruction in MIMO Radar Imaging.” In <i>31st International Workshop on Machine Learning for Signal Processing</i>, Vol. 4. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/mlsp52302.2021.9596168\">https://doi.org/10.1109/mlsp52302.2021.9596168</a>.","short":"T. Weiss, N. Peretz, S. Vedula, A. Feuer, A.M. Bronstein, in:, 31st International Workshop on Machine Learning for Signal Processing, Institute of Electrical and Electronics Engineers, 2021.","ama":"Weiss T, Peretz N, Vedula S, Feuer A, Bronstein AM. Joint optimization of system design and reconstruction in MIMO radar imaging. In: <i>31st International Workshop on Machine Learning for Signal Processing</i>. Vol 4. Institute of Electrical and Electronics Engineers; 2021. doi:<a href=\"https://doi.org/10.1109/mlsp52302.2021.9596168\">10.1109/mlsp52302.2021.9596168</a>"},"article_processing_charge":"No","type":"conference","oa":1,"OA_type":"green","author":[{"full_name":"Weiss, Tomer","last_name":"Weiss","first_name":"Tomer"},{"first_name":"Nissim","full_name":"Peretz, Nissim","last_name":"Peretz"},{"last_name":"Vedula","full_name":"Vedula, Sanketh","first_name":"Sanketh"},{"full_name":"Feuer, Arie","last_name":"Feuer","first_name":"Arie"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","last_name":"Bronstein"}],"scopus_import":"1","external_id":{"arxiv":["2110.03218"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2110.03218","open_access":"1"}],"_id":"18241","date_published":"2021-10-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-10-16T09:41:11Z","year":"2021","conference":{"start_date":"2021-10-25","name":"MLSP: Machine Learning for Signal Processing","end_date":"2021-10-28","location":"Gold Coast, Australia"},"month":"10","status":"public","arxiv":1,"volume":4,"title":"Joint optimization of system design and reconstruction in MIMO radar imaging"},{"publication":"Computational Diffusion MRI","abstract":[{"lang":"eng","text":"Fiber tractography is an important tool of computational neuroscience that enables reconstructing the spatial connectivity and organization of white matter of the brain. Fiber tractography takes advantage of diffusion Magnetic Resonance Imaging (dMRI) which allows measuring the apparent diffusivity of cerebral water along different spatial directions. Unfortunately, collecting such data comes at the price of reduced spatial resolution and substantially elevated acquisition times, which limits the clinical applicability of dMRI. This problem has been thus far addressed using two principal strategies. Most of the efforts have been extended towards improving the quality of signal estimation for any, yet fixed sampling scheme (defined through the choice of diffusion-encoding gradients). On the other hand, optimization over the sampling scheme has also proven to be effective. Inspired by the previous results, the present work consolidates the above strategies into a unified estimation framework, in which the optimization is carried out with respect to both estimation model and sampling design concurrently. The proposed solution offers substantial improvements in the quality of signal estimation as well as the accuracy of ensuing analysis by means of fiber tractography. While proving the optimality of the learned estimation models would probably need more extensive evaluation, we nevertheless claim that the learned sampling schemes can be of immediate use, offering a way to improve the dMRI analysis without the necessity of deploying the neural network used for their estimation. We present a comprehensive comparative analysis based on the Human Connectome Project data. Code and learned sampling designs available at https://github.com/tomer196/Learned_dMRI."}],"publication_status":"published","extern":"1","doi":"10.1007/978-3-030-73018-5_2","oa_version":"Preprint","publication_identifier":{"issn":["1612-3786"],"isbn":["9783030730178"],"eisbn":["9783030730185"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-08T13:03:26Z","place":"Cham","publisher":"Springer Nature","day":"30","OA_place":"repository","citation":{"apa":"Weiss, T., Vedula, S., Senouf, O., Michailovich, O., &#38; Bronstein, A. M. (2021). Towards learned optimal q-space sampling in diffusion MRI. In N. Gyori, J. Hutter, V. Nath, M. Palombo, M. Pizzolato, &#38; F. Zhang (Eds.), <i>Computational Diffusion MRI</i> (pp. 13–28). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">https://doi.org/10.1007/978-3-030-73018-5_2</a>","ista":"Weiss T, Vedula S, Senouf O, Michailovich O, Bronstein AM. 2021.Towards learned optimal q-space sampling in diffusion MRI. In: Computational Diffusion MRI. Mathematics and Visualization, , 13–28.","mla":"Weiss, Tomer, et al. “Towards Learned Optimal Q-Space Sampling in Diffusion MRI.” <i>Computational Diffusion MRI</i>, edited by Noemi Gyori et al., Springer Nature, 2021, pp. 13–28, doi:<a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">10.1007/978-3-030-73018-5_2</a>.","ieee":"T. Weiss, S. Vedula, O. Senouf, O. Michailovich, and A. M. Bronstein, “Towards learned optimal q-space sampling in diffusion MRI,” in <i>Computational Diffusion MRI</i>, N. Gyori, J. Hutter, V. Nath, M. Palombo, M. Pizzolato, and F. Zhang, Eds. Cham: Springer Nature, 2021, pp. 13–28.","ama":"Weiss T, Vedula S, Senouf O, Michailovich O, Bronstein AM. Towards learned optimal q-space sampling in diffusion MRI. In: Gyori N, Hutter J, Nath V, Palombo M, Pizzolato M, Zhang F, eds. <i>Computational Diffusion MRI</i>. Cham: Springer Nature; 2021:13-28. doi:<a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">10.1007/978-3-030-73018-5_2</a>","short":"T. Weiss, S. Vedula, O. Senouf, O. Michailovich, A.M. Bronstein, in:, N. Gyori, J. Hutter, V. Nath, M. Palombo, M. Pizzolato, F. Zhang (Eds.), Computational Diffusion MRI, Springer Nature, Cham, 2021, pp. 13–28.","chicago":"Weiss, Tomer, Sanketh Vedula, Ortal Senouf, Oleg Michailovich, and Alex M. Bronstein. “Towards Learned Optimal Q-Space Sampling in Diffusion MRI.” In <i>Computational Diffusion MRI</i>, edited by Noemi Gyori, Jana Hutter, Vishwesh Nath, Marco Palombo, Marco Pizzolato, and Fan Zhang, 13–28. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">https://doi.org/10.1007/978-3-030-73018-5_2</a>."},"type":"book_chapter","article_processing_charge":"No","oa":1,"OA_type":"green","author":[{"full_name":"Weiss, Tomer","last_name":"Weiss","first_name":"Tomer"},{"first_name":"Sanketh","full_name":"Vedula, Sanketh","last_name":"Vedula"},{"full_name":"Senouf, Ortal","last_name":"Senouf","first_name":"Ortal"},{"first_name":"Oleg","last_name":"Michailovich","full_name":"Michailovich, Oleg"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"}],"scopus_import":"1","external_id":{"arxiv":["2009.03008"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2009.03008","open_access":"1"}],"_id":"18242","date_published":"2021-09-30T00:00:00Z","alternative_title":["Mathematics and Visualization"],"quality_controlled":"1","date_updated":"2024-10-16T09:51:45Z","language":[{"iso":"eng"}],"editor":[{"first_name":"Noemi","full_name":"Gyori, Noemi","last_name":"Gyori"},{"first_name":"Jana","last_name":"Hutter","full_name":"Hutter, Jana"},{"last_name":"Nath","full_name":"Nath, Vishwesh","first_name":"Vishwesh"},{"first_name":"Marco","full_name":"Palombo, Marco","last_name":"Palombo"},{"first_name":"Marco","full_name":"Pizzolato, Marco","last_name":"Pizzolato"},{"first_name":"Fan","full_name":"Zhang, Fan","last_name":"Zhang"}],"year":"2021","conference":{"location":"Lima, Peru/Virtual","start_date":"2020-10-08","name":"MICCAI: Conference on Medical Image Computing and Computer-Assisted Intervention","end_date":"2020-10-08"},"month":"09","related_material":{"link":[{"relation":"software","url":"https://github.com/tomer196/Learned_dMRI"}]},"status":"public","arxiv":1,"page":"13-28","title":"Towards learned optimal q-space sampling in diffusion MRI"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-08T13:03:44Z","publisher":"Springer Nature","publication_status":"published","abstract":[{"lang":"eng","text":"What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Existing solutions either require auxiliary information such as node attributes, or provide a single-scale view of the graph by translating the problem into aligning node embeddings.\r\n\r\nIn this paper, we transfer the shape-analysis concept of functional maps from the continuous to the discrete case, and treat the graph alignment problem as a special case of the problem of finding a mapping between functions on graphs. We present GRASP, a method that captures multiscale structural characteristics from the eigenvectors of the graph’s Laplacian and uses this information to align two graphs.Our experimental study, featuring noise levels higher than anything used in previous studies, shows that GRASP outperforms state-of-the-art methods for graph alignment across noise levels and graph types."}],"publication":"International Joint Conference on Asia-Pacific Web and Web-Age Information Management","doi":"10.1007/978-3-030-85896-4_4","extern":"1","publication_identifier":{"isbn":["9783030858957","9783030858964"],"issn":["0302-9743","1611-3349"]},"oa_version":"None","issue":"Part I","author":[{"full_name":"Hermanns, Judith","last_name":"Hermanns","first_name":"Judith"},{"first_name":"Anton","full_name":"Tsitsulin, Anton","last_name":"Tsitsulin"},{"first_name":"Marina","full_name":"Munkhoeva, Marina","last_name":"Munkhoeva"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"full_name":"Mottin, Davide","last_name":"Mottin","first_name":"Davide"},{"last_name":"Karras","full_name":"Karras, Panagiotis","first_name":"Panagiotis"}],"scopus_import":"1","intvolume":"     12858","day":"19","citation":{"ieee":"J. Hermanns, A. Tsitsulin, M. Munkhoeva, A. M. Bronstein, D. Mottin, and P. Karras, “GRASP: Graph alignment through spectral signatures,” in <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>, Guangzhou, China, 2021, vol. 12858, no. Part I, pp. 44–52.","ista":"Hermanns J, Tsitsulin A, Munkhoeva M, Bronstein AM, Mottin D, Karras P. 2021. GRASP: Graph alignment through spectral signatures. International Joint Conference on Asia-Pacific Web and Web-Age Information Management. APWeb-WAIM: International Joint Conference on Asia-Pacific Web and Web-Age Information Management, LNCS, vol. 12858, 44–52.","apa":"Hermanns, J., Tsitsulin, A., Munkhoeva, M., Bronstein, A. M., Mottin, D., &#38; Karras, P. (2021). GRASP: Graph alignment through spectral signatures. In <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i> (Vol. 12858, pp. 44–52). Guangzhou, China: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">https://doi.org/10.1007/978-3-030-85896-4_4</a>","mla":"Hermanns, Judith, et al. “GRASP: Graph Alignment through Spectral Signatures.” <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>, vol. 12858, no. Part I, Springer Nature, 2021, pp. 44–52, doi:<a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">10.1007/978-3-030-85896-4_4</a>.","chicago":"Hermanns, Judith, Anton Tsitsulin, Marina Munkhoeva, Alex M. Bronstein, Davide Mottin, and Panagiotis Karras. “GRASP: Graph Alignment through Spectral Signatures.” In <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>, 12858:44–52. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">https://doi.org/10.1007/978-3-030-85896-4_4</a>.","short":"J. Hermanns, A. Tsitsulin, M. Munkhoeva, A.M. Bronstein, D. Mottin, P. Karras, in:, International Joint Conference on Asia-Pacific Web and Web-Age Information Management, Springer Nature, 2021, pp. 44–52.","ama":"Hermanns J, Tsitsulin A, Munkhoeva M, Bronstein AM, Mottin D, Karras P. GRASP: Graph alignment through spectral signatures. In: <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>. Vol 12858. Springer Nature; 2021:44-52. doi:<a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">10.1007/978-3-030-85896-4_4</a>"},"type":"conference","article_processing_charge":"No","conference":{"name":"APWeb-WAIM: International Joint Conference on Asia-Pacific Web and Web-Age Information Management","start_date":"2021-08-23","end_date":"2021-08-25","location":"Guangzhou, China"},"year":"2021","month":"08","date_published":"2021-08-19T00:00:00Z","_id":"18243","alternative_title":["LNCS"],"quality_controlled":"1","date_updated":"2025-01-29T09:57:31Z","language":[{"iso":"eng"}],"volume":12858,"title":"GRASP: Graph alignment through spectral signatures","status":"public","page":"44 - 52"},{"title":"Do we need depth in state-uf-the-art face authentication?","status":"public","arxiv":1,"year":"2021","conference":{"end_date":"2020-11-28","start_date":"2020-11-25","name":"8th International Conference on 3D Vision","location":"Fukuoka, Japan"},"month":"01","_id":"18244","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2003.10895","open_access":"1"}],"date_published":"2021-01-19T00:00:00Z","date_updated":"2024-12-12T10:10:29Z","language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":"1","article_number":"9320359","external_id":{"arxiv":["2003.10895"]},"author":[{"full_name":"Livne, Amir","last_name":"Livne","first_name":"Amir"},{"full_name":"Aviv, Ziv","last_name":"Aviv","first_name":"Ziv"},{"last_name":"Grofit","full_name":"Grofit, Shahaf","first_name":"Shahaf"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"day":"19","article_processing_charge":"No","type":"conference","oa":1,"citation":{"ista":"Livne A, Aviv Z, Grofit S, Bronstein AM, Kimmel R. 2021. Do we need depth in state-uf-the-art face authentication? 2020 International Conference on 3D Vision (3DV). 8th International Conference on 3D Vision, 9320359.","apa":"Livne, A., Aviv, Z., Grofit, S., Bronstein, A. M., &#38; Kimmel, R. (2021). Do we need depth in state-uf-the-art face authentication? In <i>2020 International Conference on 3D Vision (3DV)</i>. Fukuoka, Japan: IEEE. <a href=\"https://doi.org/10.1109/3dv50981.2020.00099\">https://doi.org/10.1109/3dv50981.2020.00099</a>","mla":"Livne, Amir, et al. “Do We Need Depth in State-Uf-the-Art Face Authentication?” <i>2020 International Conference on 3D Vision (3DV)</i>, 9320359, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/3dv50981.2020.00099\">10.1109/3dv50981.2020.00099</a>.","ieee":"A. Livne, Z. Aviv, S. Grofit, A. M. Bronstein, and R. Kimmel, “Do we need depth in state-uf-the-art face authentication?,” in <i>2020 International Conference on 3D Vision (3DV)</i>, Fukuoka, Japan, 2021.","ama":"Livne A, Aviv Z, Grofit S, Bronstein AM, Kimmel R. Do we need depth in state-uf-the-art face authentication? In: <i>2020 International Conference on 3D Vision (3DV)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/3dv50981.2020.00099\">10.1109/3dv50981.2020.00099</a>","short":"A. Livne, Z. Aviv, S. Grofit, A.M. Bronstein, R. Kimmel, in:, 2020 International Conference on 3D Vision (3DV), IEEE, 2021.","chicago":"Livne, Amir, Ziv Aviv, Shahaf Grofit, Alex M. Bronstein, and Ron Kimmel. “Do We Need Depth in State-Uf-the-Art Face Authentication?” In <i>2020 International Conference on 3D Vision (3DV)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/3dv50981.2020.00099\">https://doi.org/10.1109/3dv50981.2020.00099</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","date_created":"2024-10-08T13:04:02Z","extern":"1","doi":"10.1109/3dv50981.2020.00099","publication":"2020 International Conference on 3D Vision (3DV)","abstract":[{"lang":"eng","text":"Some face recognition methods are designed to utilize geometric information extracted from depth sensors to overcome the weaknesses of single-image based recognition technologies. However, the accurate acquisition of the depth profile is an expensive and challenging process. Here, we introduce a novel method that learns to recognize faces from stereo camera systems without the need to explicitly compute the facial surface or depth map. The raw face stereo images along with the location in the image from which the face is extracted allow the proposed CNN to improve the recognition task while avoiding the need to explicitly handle the geometric structure of the face. This way, we keep the simplicity and cost efficiency of identity authentication from a single image, while enjoying the benefits of geometric data without explicitly reconstructing it. We demonstrate that the suggested method outperforms both existing single-image and explicit depth based methods on largescale benchmarks, and even capable of recognize spoofing attacks. We also provide an ablation study that shows that the suggested method uses the face locations in the left and right images to encode informative features that improve the overall performance."}],"publication_status":"published","oa_version":"Preprint","publication_identifier":{"eissn":["2475-7888"],"isbn":["9781728181295"]}},{"year":"2021","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/2001.00497","open_access":"1"}],"_id":"7685","date_published":"2021-01-01T00:00:00Z","date_updated":"2025-05-14T10:49:57Z","language":[{"iso":"eng"}],"quality_controlled":"1","title":"The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime","volume":33,"status":"public","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"World Scientific Publishing","article_type":"original","date_created":"2020-04-26T22:00:45Z","doi":"10.1142/S0129055X20600065","publication":"Reviews in Mathematical Physics","abstract":[{"text":"We consider a gas of interacting bosons trapped in a box of side length one in the Gross–Pitaevskii limit. We review the proof of the validity of Bogoliubov’s prediction for the ground state energy and the low-energy excitation spectrum. This note is based on joint work with C. Brennecke, S. Cenatiempo and B. Schlein.","lang":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0129-055X"]},"oa_version":"Preprint","project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"issue":"1","department":[{"_id":"RoSe"}],"ec_funded":1,"article_number":"2060006","scopus_import":"1","external_id":{"arxiv":["2001.00497"],"isi":["000613313200007"]},"isi":1,"author":[{"last_name":"Boccato","full_name":"Boccato, Chiara","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","first_name":"Chiara"}],"day":"01","intvolume":"        33","article_processing_charge":"No","type":"journal_article","oa":1,"citation":{"short":"C. Boccato, Reviews in Mathematical Physics 33 (2021).","ama":"Boccato C. The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime. <i>Reviews in Mathematical Physics</i>. 2021;33(1). doi:<a href=\"https://doi.org/10.1142/S0129055X20600065\">10.1142/S0129055X20600065</a>","chicago":"Boccato, Chiara. “The Excitation Spectrum of the Bose Gas in the Gross-Pitaevskii Regime.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0129055X20600065\">https://doi.org/10.1142/S0129055X20600065</a>.","ista":"Boccato C. 2021. The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime. Reviews in Mathematical Physics. 33(1), 2060006.","apa":"Boccato, C. (2021). The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129055X20600065\">https://doi.org/10.1142/S0129055X20600065</a>","mla":"Boccato, Chiara. “The Excitation Spectrum of the Bose Gas in the Gross-Pitaevskii Regime.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1, 2060006, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/S0129055X20600065\">10.1142/S0129055X20600065</a>.","ieee":"C. Boccato, “The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1. World Scientific Publishing, 2021."}},{"year":"2021","month":"01","_id":"7900","main_file_link":[{"url":"https://arxiv.org/abs/1910.08190","open_access":"1"}],"date_published":"2021-01-01T00:00:00Z","quality_controlled":"1","date_updated":"2025-05-14T10:49:46Z","language":[{"iso":"eng"}],"volume":33,"title":"Bosonic collective excitations in Fermi gases","status":"public","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-05-28T16:47:55Z","publisher":"World Scientific Publishing","article_type":"original","publication":"Reviews in Mathematical Physics","abstract":[{"text":"Hartree–Fock theory has been justified as a mean-field approximation for fermionic systems. However, it suffers from some defects in predicting physical properties, making necessary a theory of quantum correlations. Recently, bosonization of many-body correlations has been rigorously justified as an upper bound on the correlation energy at high density with weak interactions. We review the bosonic approximation, deriving an effective Hamiltonian. We then show that for systems with Coulomb interaction this effective theory predicts collective excitations (plasmons) in accordance with the random phase approximation of Bohm and Pines, and with experimental observation.","lang":"eng"}],"publication_status":"published","doi":"10.1142/s0129055x20600090","oa_version":"Preprint","publication_identifier":{"issn":["0129-055X"],"eissn":["1793-6659"]},"ec_funded":1,"project":[{"grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"department":[{"_id":"RoSe"}],"issue":"1","author":[{"full_name":"Benedikter, Niels P","last_name":"Benedikter","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1071-6091","first_name":"Niels P"}],"article_number":"2060009","scopus_import":"1","external_id":{"isi":["000613313200010"],"arxiv":["1910.08190"]},"isi":1,"intvolume":"        33","day":"01","citation":{"chicago":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600090\">https://doi.org/10.1142/s0129055x20600090</a>.","short":"N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).","ama":"Benedikter NP. Bosonic collective excitations in Fermi gases. <i>Reviews in Mathematical Physics</i>. 2021;33(1). doi:<a href=\"https://doi.org/10.1142/s0129055x20600090\">10.1142/s0129055x20600090</a>","ieee":"N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1. World Scientific Publishing, 2021.","mla":"Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 1, 2060009, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600090\">10.1142/s0129055x20600090</a>.","apa":"Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600090\">https://doi.org/10.1142/s0129055x20600090</a>","ista":"Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 33(1), 2060009."},"type":"journal_article","article_processing_charge":"No","oa":1},{"author":[{"full_name":"Benedikter, Niels P","last_name":"Benedikter","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","first_name":"Niels P","orcid":"0000-0002-1071-6091"},{"first_name":"Phan Thành","last_name":"Nam","full_name":"Nam, Phan Thành"},{"last_name":"Porta","full_name":"Porta, Marcello","first_name":"Marcello"},{"first_name":"Benjamin","full_name":"Schlein, Benjamin","last_name":"Schlein"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer"}],"scopus_import":"1","isi":1,"external_id":{"isi":["000646573600001"],"arxiv":["2005.08933"]},"ec_funded":1,"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"acknowledgement":"We thank Christian Hainzl for helpful discussions and a referee for very careful reading of the paper and many helpful suggestions. NB and RS were supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 694227). Part of the research of NB was conducted on the RZD18 Nice–Milan–Vienna–Moscow. NB thanks Elliott H. Lieb and Peter Otte for explanations about the Luttinger model. PTN has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy (EXC-2111-390814868). MP acknowledges financial support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC StG MaMBoQ, grant agreement No. 802901). BS gratefully acknowledges financial support from the NCCR SwissMAP, from the Swiss National Science Foundation through the Grant “Dynamical and energetic properties of Bose-Einstein condensates” and from the European Research Council through the ERC-AdG CLaQS (grant agreement No. 834782). All authors acknowledge support for workshop participation from Mathematisches Forschungsinstitut Oberwolfach (Leibniz Association). NB, PTN, BS, and RS acknowledge support for workshop participation from Fondation des Treilles.","department":[{"_id":"RoSe"}],"citation":{"ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Correlation energy of a weakly interacting Fermi gas,” <i>Inventiones Mathematicae</i>, vol. 225. Springer, pp. 885–979, 2021.","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Correlation energy of a weakly interacting Fermi gas. Inventiones Mathematicae. 225, 885–979.","apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., &#38; Seiringer, R. (2021). Correlation energy of a weakly interacting Fermi gas. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-021-01041-5\">https://doi.org/10.1007/s00222-021-01041-5</a>","mla":"Benedikter, Niels P., et al. “Correlation Energy of a Weakly Interacting Fermi Gas.” <i>Inventiones Mathematicae</i>, vol. 225, Springer, 2021, pp. 885–979, doi:<a href=\"https://doi.org/10.1007/s00222-021-01041-5\">10.1007/s00222-021-01041-5</a>.","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Correlation Energy of a Weakly Interacting Fermi Gas.” <i>Inventiones Mathematicae</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s00222-021-01041-5\">https://doi.org/10.1007/s00222-021-01041-5</a>.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Inventiones Mathematicae 225 (2021) 885–979.","ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Correlation energy of a weakly interacting Fermi gas. <i>Inventiones Mathematicae</i>. 2021;225:885-979. doi:<a href=\"https://doi.org/10.1007/s00222-021-01041-5\">10.1007/s00222-021-01041-5</a>"},"article_processing_charge":"Yes (via OA deal)","type":"journal_article","oa":1,"intvolume":"       225","day":"03","file_date_updated":"2022-05-16T12:23:40Z","date_created":"2020-05-28T16:48:20Z","article_type":"original","publisher":"Springer","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","publication_identifier":{"eissn":["1432-1297"],"issn":["0020-9910"]},"publication":"Inventiones Mathematicae","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-05-16T12:23:40Z","file_size":1089319,"file_name":"2021_InventMath_Benedikter.pdf","success":1,"checksum":"f38c79dfd828cdc7f49a34b37b83d376","date_updated":"2022-05-16T12:23:40Z","file_id":"11386","creator":"dernst"}],"abstract":[{"lang":"eng","text":"We derive rigorously the leading order of the correlation energy of a Fermi gas in a scaling regime of high density and weak interaction. The result verifies the prediction of the random-phase approximation. Our proof refines the method of collective bosonization in three dimensions. We approximately diagonalize an effective Hamiltonian describing approximately bosonic collective excitations around the Hartree–Fock state, while showing that gapless and non-collective excitations have only a negligible effect on the ground state energy."}],"publication_status":"published","doi":"10.1007/s00222-021-01041-5","volume":225,"title":"Correlation energy of a weakly interacting Fermi gas","arxiv":1,"page":"885-979","status":"public","month":"05","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","ddc":["510"],"year":"2021","quality_controlled":"1","date_updated":"2025-04-14T07:27:00Z","language":[{"iso":"eng"}],"_id":"7901","date_published":"2021-05-03T00:00:00Z"},{"title":"Sheaf-theoretic stratification learning from geometric and topological perspectives","volume":65,"status":"public","page":"1166-1198","arxiv":1,"corr_author":"1","year":"2021","ddc":["510"],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","month":"06","date_published":"2021-06-01T00:00:00Z","_id":"7905","language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:53:15Z","quality_controlled":"1","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.","department":[{"_id":"HeEd"}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"isi":1,"external_id":{"isi":["000536324700001"],"arxiv":["1712.07734"]},"scopus_import":"1","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"}],"file_date_updated":"2020-11-25T09:06:41Z","day":"01","intvolume":"        65","oa":1,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","citation":{"ama":"Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. 2021;65:1166-1198. doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>","short":"A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.","chicago":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>.","ista":"Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.","apa":"Brown, A., &#38; Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>","mla":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>.","ieee":"A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” <i>Discrete and Computational Geometry</i>, vol. 65. Springer Nature, pp. 1166–1198, 2021."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_type":"original","publisher":"Springer Nature","date_created":"2020-05-30T10:26:04Z","doi":"10.1007/s00454-020-00206-y","publication_status":"published","publication":"Discrete and Computational Geometry","file":[{"date_created":"2020-11-25T09:06:41Z","file_size":1013730,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","success":1,"file_name":"2020_DiscreteCompGeometry_Brown.pdf","checksum":"487a84ea5841b75f04f66d7ebd71b67e","file_id":"8803","creator":"dernst","date_updated":"2020-11-25T09:06:41Z"}],"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."}],"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"oa_version":"Published Version"},{"publication_identifier":{"eissn":["1862-4480"],"issn":["1862-4472"]},"oa_version":"Published Version","file":[{"date_created":"2024-03-07T14:58:51Z","file_size":2148882,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","success":1,"file_name":"2021_OptimizationLetters_Shehu.pdf","checksum":"63c5f31cd04626152a19f97a2476281b","file_id":"15089","creator":"kschuh","date_updated":"2024-03-07T14:58:51Z"}],"publication":"Optimization Letters","abstract":[{"lang":"eng","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."}],"publication_status":"published","doi":"10.1007/s11590-020-01603-1","date_created":"2020-06-04T11:28:33Z","publisher":"Springer Nature","article_type":"original","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. 2021;15:2109-2126. doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>","short":"Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.","chicago":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>.","mla":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>.","apa":"Shehu, Y., &#38; Gibali, A. (2021). New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>","ista":"Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126.","ieee":"Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” <i>Optimization Letters</i>, vol. 15. Springer Nature, pp. 2109–2126, 2021."},"type":"journal_article","article_processing_charge":"Yes (via OA deal)","oa":1,"intvolume":"        15","day":"01","file_date_updated":"2024-03-07T14:58:51Z","author":[{"orcid":"0000-0001-9224-7139","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","full_name":"Shehu, Yekini","last_name":"Shehu"},{"last_name":"Gibali","full_name":"Gibali, Aviv","first_name":"Aviv"}],"scopus_import":"1","external_id":{"isi":["000537342300001"]},"isi":1,"ec_funded":1,"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"department":[{"_id":"VlKo"}],"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).","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-11-04T13:52:35Z","_id":"7925","date_published":"2021-09-01T00:00:00Z","month":"09","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2021","ddc":["510"],"corr_author":"1","page":"2109-2126","status":"public","volume":15,"title":"New inertial relaxed method for solving split feasibilities"},{"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"department":[{"_id":"DaAl"}],"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.","scopus_import":"1","external_id":{"arxiv":["1903.05956"],"isi":["000556444600001"]},"isi":1,"author":[{"full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel","first_name":"Keren"},{"full_name":"Dory, Michal","last_name":"Dory","first_name":"Michal"},{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne"},{"last_name":"Leitersdorf","full_name":"Leitersdorf, Dean","first_name":"Dean"}],"day":"01","intvolume":"        34","type":"journal_article","article_processing_charge":"Yes (via OA deal)","oa":1,"citation":{"mla":"Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>, vol. 34, Springer Nature, 2021, pp. 463–87, doi:<a href=\"https://doi.org/10.1007/s00446-020-00380-5\">10.1007/s00446-020-00380-5</a>.","ista":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing. 34, 463–487.","apa":"Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2021). Fast approximate shortest paths in the congested clique. <i>Distributed Computing</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00446-020-00380-5\">https://doi.org/10.1007/s00446-020-00380-5</a>","ieee":"K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” <i>Distributed Computing</i>, vol. 34. Springer Nature, pp. 463–487, 2021.","ama":"Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. <i>Distributed Computing</i>. 2021;34:463-487. doi:<a href=\"https://doi.org/10.1007/s00446-020-00380-5\">10.1007/s00446-020-00380-5</a>","short":"K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing 34 (2021) 463–487.","chicago":"Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” <i>Distributed Computing</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00446-020-00380-5\">https://doi.org/10.1007/s00446-020-00380-5</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publisher":"Springer Nature","date_created":"2020-06-07T22:00:54Z","doi":"10.1007/s00446-020-00380-5","publication":"Distributed Computing","abstract":[{"lang":"eng","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. "}],"publication_status":"published","publication_identifier":{"eissn":["1432-0452"],"issn":["0178-2770"]},"oa_version":"Published Version","title":"Fast approximate shortest paths in the congested clique","volume":34,"status":"public","arxiv":1,"corr_author":"1","page":"463-487","ddc":["000"],"year":"2021","related_material":{"record":[{"relation":"earlier_version","id":"6933","status":"public"}]},"month":"12","_id":"7939","main_file_link":[{"url":"https://doi.org/10.1007/s00446-020-00380-5","open_access":"1"}],"date_published":"2021-12-01T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2026-06-18T19:28:41Z","quality_controlled":"1"},{"title":"Simple multi-color super-resolution by X10 microscopy","volume":161,"status":"public","corr_author":"1","page":"33-56","year":"2021","month":"01","_id":"7941","date_published":"2021-01-01T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2024-10-09T20:59:36Z","quality_controlled":"1","department":[{"_id":"JoDa"}],"scopus_import":"1","external_id":{"pmid":["33478696"]},"author":[{"id":"45812BD4-F248-11E8-B48F-1D18A9856A87","first_name":"Sven M","last_name":"Truckenbrodt","full_name":"Truckenbrodt, Sven M"},{"last_name":"Rizzoli","full_name":"Rizzoli, Silvio O.","first_name":"Silvio O."}],"day":"01","intvolume":"       161","type":"book_chapter","article_processing_charge":"No","citation":{"chicago":"Truckenbrodt, Sven M, and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” In <i>Methods in Cell Biology</i>, 161:33–56. Elsevier, 2021. <a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">https://doi.org/10.1016/bs.mcb.2020.04.016</a>.","short":"S.M. Truckenbrodt, S.O. Rizzoli, in:, Methods in Cell Biology, Elsevier, 2021, pp. 33–56.","ama":"Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy. In: <i>Methods in Cell Biology</i>. Vol 161. Elsevier; 2021:33-56. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">10.1016/bs.mcb.2020.04.016</a>","ieee":"S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution by X10 microscopy,” in <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021, pp. 33–56.","mla":"Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” <i>Methods in Cell Biology</i>, vol. 161, Elsevier, 2021, pp. 33–56, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">10.1016/bs.mcb.2020.04.016</a>.","ista":"Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by X10 microscopy. In: Methods in Cell Biology. vol. 161, 33–56.","apa":"Truckenbrodt, S. M., &#38; Rizzoli, S. O. (2021). Simple multi-color super-resolution by X10 microscopy. In <i>Methods in Cell Biology</i> (Vol. 161, pp. 33–56). Elsevier. <a href=\"https://doi.org/10.1016/bs.mcb.2020.04.016\">https://doi.org/10.1016/bs.mcb.2020.04.016</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","date_created":"2020-06-07T22:00:55Z","doi":"10.1016/bs.mcb.2020.04.016","abstract":[{"lang":"eng","text":"Expansion microscopy is a recently developed super-resolution imaging technique, which provides an alternative to optics-based methods such as deterministic approaches (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion microscopy is to embed the biological sample in a swellable gel, and then to expand it isotropically, thereby increasing the distance between the fluorophores. This approach breaks the diffraction barrier by simply separating the emission point-spread-functions of the fluorophores. The resolution attainable in expansion microscopy is thus directly dependent on the separation that can be achieved, i.e. on the expansion factor. The original implementation of the technique achieved an expansion factor of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique can be implemented with minimal technical requirements on any standard fluorescence microscope, and is more easily applied for multi-color imaging than either deterministic or stochastic super-resolution approaches. This renders X10 expansion microscopy a highly promising tool for new biological discoveries, as discussed here, and as demonstrated by several recent applications."}],"publication":"Methods in Cell Biology","publication_status":"published","publication_identifier":{"isbn":["978012820807-6"],"issn":["0091-679X"]},"oa_version":"None","pmid":1},{"date_created":"2020-08-03T14:29:57Z","article_type":"original","publisher":"Springer Nature","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication_identifier":{"eissn":["1573-2924"],"issn":["1389-4420"]},"publication_status":"published","publication":"Optimization and Engineering","file":[{"creator":"dernst","file_id":"8197","date_updated":"2020-08-03T15:24:39Z","file_name":"2020_OptimizationEngineering_Shehu.pdf","success":1,"file_size":2137860,"date_created":"2020-08-03T15:24:39Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access"}],"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"}],"doi":"10.1007/s11081-020-09544-5","author":[{"id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","first_name":"Yekini","last_name":"Shehu","full_name":"Shehu, Yekini"},{"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"}],"isi":1,"external_id":{"isi":["000559345400001"]},"scopus_import":"1","ec_funded":1,"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.","department":[{"_id":"VlKo"}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"mla":"Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.” <i>Optimization and Engineering</i>, vol. 22, Springer Nature, 2021, pp. 2627–53, doi:<a href=\"https://doi.org/10.1007/s11081-020-09544-5\">10.1007/s11081-020-09544-5</a>.","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.","apa":"Shehu, Y., Dong, Q.-L., Liu, L.-L., &#38; Yao, J.-C. (2021). New strong convergence method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11081-020-09544-5\">https://doi.org/10.1007/s11081-020-09544-5</a>","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,” <i>Optimization and Engineering</i>, vol. 22. Springer Nature, pp. 2627–2653, 2021.","short":"Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering 22 (2021) 2627–2653.","ama":"Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the sum of two maximal monotone operators. <i>Optimization and Engineering</i>. 2021;22:2627-2653. doi:<a href=\"https://doi.org/10.1007/s11081-020-09544-5\">10.1007/s11081-020-09544-5</a>","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.” <i>Optimization and Engineering</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11081-020-09544-5\">https://doi.org/10.1007/s11081-020-09544-5</a>."},"oa":1,"article_processing_charge":"Yes (via OA deal)","type":"journal_article","intvolume":"        22","file_date_updated":"2020-08-03T15:24:39Z","day":"25","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","month":"02","ddc":["510"],"year":"2021","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-11-04T13:52:38Z","date_published":"2021-02-25T00:00:00Z","_id":"8196","volume":22,"title":"New strong convergence method for the sum of two maximal monotone operators","page":"2627-2653","corr_author":"1","status":"public"},{"year":"2021","month":"06","main_file_link":[{"url":"https://arxiv.org/abs/2007.14879","open_access":"1"}],"_id":"8198","date_published":"2021-06-21T00:00:00Z","date_updated":"2026-04-02T14:02:07Z","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Impact of drive harmonics on the stability of Floquet many-body localization","volume":103,"status":"public","arxiv":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_type":"original","publisher":"American Physical Society","date_created":"2020-08-04T13:03:40Z","doi":"10.1103/PhysRevB.103.214204","abstract":[{"lang":"eng","text":"We investigate how the critical driving amplitude at the Floquet many-body localized (MBL) to ergodic phase transition differs between smooth and nonsmooth drives. To this end, we numerically study a disordered spin-1/2 chain which is periodically driven by a sine or square-wave drive over a wide range of driving frequencies. In both cases the critical driving amplitude increases monotonically with the frequency, and at large frequencies it is identical for the two drives. However, at low and intermediate frequencies the critical amplitude of the square-wave drive depends strongly on the frequency, while that of the sinusoidal drive is almost constant over a wide frequency range. By analyzing the density of drive-induced resonances we conclude that this difference is due to resonances induced by the higher harmonics which are present (absent) in the Fourier spectrum of the square-wave (sine) drive. Furthermore, we suggest a numerically efficient method for estimating the frequency dependence of the critical driving amplitudes for different drives which is based on calculating the density of drive-induced resonances. We conclude that delocalization occurs once the density of drive-induced resonances reaches a critical value determined only by the static system."}],"publication":"Physical Review B","publication_status":"published","oa_version":"Preprint","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"acknowledgement":"We thank Y. Bar Lev, T. Biadse, and, particularly, E. Bairey and B. Katzir for illuminating discussions and their many insights and help. The authors thank N. Lindner for his support throughout this project. We are further grateful to M. Serbyn, A. Kamenev, A. Turner, and S. de Nicola for reading the manuscript and providing good feedback and suggestions. We acknowledge financial support from the Defense Advanced Research Projects Agency through the DRINQS program, Grant No. D18AC00025. T.G. was in part supported by an Aly Kaufman Fellowship at the Technion. T.G. acknowledges funding from the Institute of Science and Technology (IST) Austria and from the European Union’s Horizon 2020 research and innovation program under Marie SkłodowskaCurie Grant Agreement No. 754411.under the Marie Skłodowska-Curie Grant Agreement No.754411.","issue":"21","department":[{"_id":"MaSe"}],"ec_funded":1,"scopus_import":"1","article_number":"214204","external_id":{"arxiv":["2007.14879"],"isi":["000664429700005"]},"isi":1,"author":[{"full_name":"Diringer, Asaf A.","last_name":"Diringer","first_name":"Asaf A."},{"first_name":"Tobias","id":"1083E038-9F73-11E9-A4B5-532AE6697425","orcid":"0000-0001-6814-7541","full_name":"Gulden, Tobias","last_name":"Gulden"}],"day":"21","intvolume":"       103","article_processing_charge":"No","type":"journal_article","oa":1,"citation":{"ama":"Diringer AA, Gulden T. Impact of drive harmonics on the stability of Floquet many-body localization. <i>Physical Review B</i>. 2021;103(21). doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">10.1103/PhysRevB.103.214204</a>","short":"A.A. Diringer, T. Gulden, Physical Review B 103 (2021).","chicago":"Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability of Floquet Many-Body Localization.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">https://doi.org/10.1103/PhysRevB.103.214204</a>.","mla":"Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability of Floquet Many-Body Localization.” <i>Physical Review B</i>, vol. 103, no. 21, 214204, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">10.1103/PhysRevB.103.214204</a>.","apa":"Diringer, A. A., &#38; Gulden, T. (2021). Impact of drive harmonics on the stability of Floquet many-body localization. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.103.214204\">https://doi.org/10.1103/PhysRevB.103.214204</a>","ista":"Diringer AA, Gulden T. 2021. Impact of drive harmonics on the stability of Floquet many-body localization. Physical Review B. 103(21), 214204.","ieee":"A. A. Diringer and T. Gulden, “Impact of drive harmonics on the stability of Floquet many-body localization,” <i>Physical Review B</i>, vol. 103, no. 21. American Physical Society, 2021."}},{"external_id":{"isi":["000558119300001"]},"isi":1,"scopus_import":"1","author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"first_name":"Ramsay","full_name":"Dyer, Ramsay","last_name":"Dyer"},{"first_name":"Arijit","last_name":"Ghosh","full_name":"Ghosh, Arijit"},{"last_name":"Lieutier","full_name":"Lieutier, Andre","first_name":"Andre"},{"full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs"}],"department":[{"_id":"HeEd"}],"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.","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"ec_funded":1,"oa":1,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","citation":{"ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local conditions for triangulating submanifolds of Euclidean space,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 666–686, 2021.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., &#38; Wintraecken, M. (2021). Local conditions for triangulating submanifolds of Euclidean space. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00233-9\">https://doi.org/10.1007/s00454-020-00233-9</a>","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.","mla":"Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 666–86, doi:<a href=\"https://doi.org/10.1007/s00454-020-00233-9\">10.1007/s00454-020-00233-9</a>.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00233-9\">https://doi.org/10.1007/s00454-020-00233-9</a>.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. <i>Discrete and Computational Geometry</i>. 2021;66:666-686. doi:<a href=\"https://doi.org/10.1007/s00454-020-00233-9\">10.1007/s00454-020-00233-9</a>"},"day":"01","intvolume":"        66","article_type":"original","publisher":"Springer Nature","date_created":"2020-08-11T07:11:51Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"oa_version":"Published Version","doi":"10.1007/s00454-020-00233-9","publication_status":"published","publication":"Discrete and Computational Geometry","abstract":[{"lang":"eng","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."}],"title":"Local conditions for triangulating submanifolds of Euclidean space","volume":66,"page":"666-686","corr_author":"1","status":"public","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","month":"09","ddc":["510"],"year":"2021","language":[{"iso":"eng"}],"date_updated":"2025-04-14T07:44:05Z","quality_controlled":"1","date_published":"2021-09-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00454-020-00233-9"}],"_id":"8248"},{"corr_author":"1","page":"899-925","status":"public","volume":33,"title":"The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-04-14T09:44:14Z","_id":"8253","date_published":"2021-03-01T00:00:00Z","month":"03","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"ddc":["000","570"],"year":"2021","citation":{"ieee":"F. Zenke and T. P. Vogels, “The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks,” <i>Neural Computation</i>, vol. 33, no. 4. MIT Press, pp. 899–925, 2021.","apa":"Zenke, F., &#38; Vogels, T. P. (2021). The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. <i>Neural Computation</i>. MIT Press. <a href=\"https://doi.org/10.1162/neco_a_01367\">https://doi.org/10.1162/neco_a_01367</a>","ista":"Zenke F, Vogels TP. 2021. The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. Neural Computation. 33(4), 899–925.","mla":"Zenke, Friedemann, and Tim P. Vogels. “The Remarkable Robustness of Surrogate Gradient Learning for Instilling Complex Function in Spiking Neural Networks.” <i>Neural Computation</i>, vol. 33, no. 4, MIT Press, 2021, pp. 899–925, doi:<a href=\"https://doi.org/10.1162/neco_a_01367\">10.1162/neco_a_01367</a>.","chicago":"Zenke, Friedemann, and Tim P Vogels. “The Remarkable Robustness of Surrogate Gradient Learning for Instilling Complex Function in Spiking Neural Networks.” <i>Neural Computation</i>. MIT Press, 2021. <a href=\"https://doi.org/10.1162/neco_a_01367\">https://doi.org/10.1162/neco_a_01367</a>.","short":"F. Zenke, T.P. Vogels, Neural Computation 33 (2021) 899–925.","ama":"Zenke F, Vogels TP. The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks. <i>Neural Computation</i>. 2021;33(4):899-925. doi:<a href=\"https://doi.org/10.1162/neco_a_01367\">10.1162/neco_a_01367</a>"},"article_processing_charge":"No","type":"journal_article","oa":1,"intvolume":"        33","day":"01","file_date_updated":"2022-04-08T06:05:39Z","author":[{"last_name":"Zenke","full_name":"Zenke, Friedemann","first_name":"Friedemann","orcid":"0000-0003-1883-644X"},{"first_name":"Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","full_name":"Vogels, Tim P"}],"scopus_import":"1","isi":1,"external_id":{"pmid":["33513328"],"isi":["000663433900003"]},"ec_funded":1,"project":[{"call_identifier":"H2020","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning."},{"grant_number":"214316/Z/18/Z","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87"}],"department":[{"_id":"TiVo"}],"issue":"4","acknowledgement":"F.Z. was supported by the Wellcome Trust (110124/Z/15/Z) and the Novartis Research Foundation. T.P.V. was supported by a Wellcome Trust Sir Henry Dale Research fellowship (WT100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant SYNAPSEEK.","oa_version":"Published Version","publication_identifier":{"issn":["0899-7667"],"eissn":["1530-888X"]},"pmid":1,"abstract":[{"lang":"eng","text":"Brains process information in spiking neural networks. Their intricate connections shape the diverse functions these networks perform. In comparison, the functional capabilities of models of spiking networks are still rudimentary. This shortcoming is mainly due to the lack of insight and practical algorithms to construct the necessary connectivity. Any such algorithm typically attempts to build networks by iteratively reducing the error compared to a desired output. But assigning credit to hidden units in multi-layered spiking networks has remained challenging due to the non-differentiable nonlinearity of spikes. To avoid this issue, one can employ surrogate gradients to discover the required connectivity in spiking network models. However, the choice of a surrogate is not unique, raising the question of how its implementation influences the effectiveness of the method. Here, we use numerical simulations to systematically study how essential design parameters of surrogate gradients impact learning performance on a range of classification problems. We show that surrogate gradient learning is robust to different shapes of underlying surrogate derivatives, but the choice of the derivative’s scale can substantially affect learning performance. When we combine surrogate gradients with a suitable activity regularization technique, robust information processing can be achieved in spiking networks even at the sparse activity limit. Our study provides a systematic account of the remarkable robustness of surrogate gradient learning and serves as a practical guide to model functional spiking neural networks."}],"file":[{"success":1,"file_name":"2021_NeuralComputation_Zenke.pdf","checksum":"eac5a51c24c8989ae7cf9ae32ec3bc95","date_updated":"2022-04-08T06:05:39Z","file_id":"11131","creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-04-08T06:05:39Z","file_size":1611614}],"publication":"Neural Computation","publication_status":"published","doi":"10.1162/neco_a_01367","date_created":"2020-08-12T12:08:24Z","article_type":"original","publisher":"MIT Press","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"year":"2021","month":"02","related_material":{"record":[{"relation":"shorter_version","id":"6989","status":"public"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1910.09917v3","open_access":"1"}],"_id":"8317","date_published":"2021-02-01T00:00:00Z","quality_controlled":"1","date_updated":"2026-06-18T19:14:36Z","language":[{"iso":"eng"}],"volume":93,"title":"Folding polyominoes with holes into a cube","status":"public","arxiv":1,"corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2020-08-30T22:01:09Z","publisher":"Elsevier","article_type":"original","abstract":[{"lang":"eng","text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability."}],"publication":"Computational Geometry: Theory and Applications","publication_status":"published","doi":"10.1016/j.comgeo.2020.101700","publication_identifier":{"eissn":["1879-081X"],"issn":["0925-7721"]},"oa_version":"Preprint","project":[{"name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"acknowledgement":"This research was performed in part at the 33rd Bellairs Winter Workshop on Computational Geometry. We thank all other participants for a fruitful atmosphere. H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","department":[{"_id":"HeEd"}],"author":[{"first_name":"Oswin","full_name":"Aichholzer, Oswin","last_name":"Aichholzer"},{"first_name":"Hugo A.","full_name":"Akitaya, Hugo A.","last_name":"Akitaya"},{"first_name":"Kenneth C.","last_name":"Cheung","full_name":"Cheung, Kenneth C."},{"full_name":"Demaine, Erik D.","last_name":"Demaine","first_name":"Erik D."},{"full_name":"Demaine, Martin L.","last_name":"Demaine","first_name":"Martin L."},{"last_name":"Fekete","full_name":"Fekete, Sándor P.","first_name":"Sándor P."},{"first_name":"Linda","last_name":"Kleist","full_name":"Kleist, Linda"},{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"full_name":"Löffler, Maarten","last_name":"Löffler","first_name":"Maarten"},{"first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana","last_name":"Masárová"},{"last_name":"Mundilova","full_name":"Mundilova, Klara","first_name":"Klara"},{"first_name":"Christiane","full_name":"Schmidt, Christiane","last_name":"Schmidt"}],"article_number":"101700","scopus_import":"1","isi":1,"external_id":{"arxiv":["1910.09917"],"isi":["000579185100004"]},"intvolume":"        93","day":"01","citation":{"short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, Computational Geometry: Theory and Applications 93 (2021).","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. 2021;93. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>","chicago":"Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>.","apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a cube. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">https://doi.org/10.1016/j.comgeo.2020.101700</a>","ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding polyominoes with holes into a cube. Computational Geometry: Theory and Applications. 93, 101700.","mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>, vol. 93, 101700, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2020.101700\">10.1016/j.comgeo.2020.101700</a>.","ieee":"O. Aichholzer <i>et al.</i>, “Folding polyominoes with holes into a cube,” <i>Computational Geometry: Theory and Applications</i>, vol. 93. Elsevier, 2021."},"type":"journal_article","article_processing_charge":"No","oa":1},{"article_processing_charge":"No","type":"journal_article","oa":1,"citation":{"mla":"Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 938–76, doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>.","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.","apa":"Akopyan, A., Bobenko, A. I., Schief, W. K., &#38; Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>","ieee":"A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 938–976, 2021.","short":"A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.","ama":"Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. 2021;66:938-976. doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>","chicago":"Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>."},"day":"01","intvolume":"        66","scopus_import":"1","external_id":{"arxiv":["1908.00856"],"isi":["000564488500002"]},"isi":1,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","full_name":"Akopyan, Arseniy","last_name":"Akopyan"},{"last_name":"Bobenko","full_name":"Bobenko, Alexander I.","first_name":"Alexander I."},{"first_name":"Wolfgang K.","last_name":"Schief","full_name":"Schief, Wolfgang K."},{"last_name":"Techter","full_name":"Techter, Jan","first_name":"Jan"}],"project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"department":[{"_id":"HeEd"}],"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).","ec_funded":1,"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"oa_version":"Preprint","doi":"10.1007/s00454-020-00240-w","publication":"Discrete and Computational Geometry","abstract":[{"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.","lang":"eng"}],"publication_status":"published","article_type":"original","publisher":"Springer Nature","date_created":"2020-09-06T22:01:13Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","arxiv":1,"page":"938-976","status":"public","title":"On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs","volume":66,"language":[{"iso":"eng"}],"date_updated":"2025-04-14T07:48:36Z","quality_controlled":"1","_id":"8338","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.00856"}],"date_published":"2021-10-01T00:00:00Z","month":"10","year":"2021"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-09-11T08:35:50Z","article_type":"original","publisher":"Elsevier","publication":"Linear Algebra and its Applications","abstract":[{"lang":"eng","text":"It is well known that special Kubo-Ando operator means admit divergence center interpretations, moreover, they are also mean squared error estimators for certain metrics on positive definite operators. In this paper we give a divergence center interpretation for every symmetric Kubo-Ando mean. This characterization of the symmetric means naturally leads to a definition of weighted and multivariate versions of a large class of symmetric Kubo-Ando means. We study elementary properties of these weighted multivariate means, and note in particular that in the special case of the geometric mean we recover the weighted A#H-mean introduced by Kim, Lawson, and Lim."}],"publication_status":"published","doi":"10.1016/j.laa.2020.09.007","publication_identifier":{"issn":["0024-3795"]},"oa_version":"Preprint","ec_funded":1,"project":[{"_id":"26A455A6-B435-11E9-9278-68D0E5697425","grant_number":"846294","name":"Geometric study of Wasserstein spaces and free probability","call_identifier":"H2020"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"acknowledgement":"The authors are grateful to Milán Mosonyi for fruitful discussions on the topic, and to the anonymous referee for his/her comments and suggestions.\r\nJ. Pitrik was supported by the Hungarian Academy of Sciences Lendület-Momentum Grant for Quantum Information Theory, No. 96 141, and by Hungarian National Research, Development and Innovation Office (NKFIH) via grants no. K119442, no. K124152, and no. KH129601. D. Virosztek was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01), by the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 846294, and partially supported by the Hungarian National Research, Development and Innovation Office (NKFIH) via grants no. K124152, and no. KH129601.","department":[{"_id":"LaEr"}],"author":[{"full_name":"Pitrik, József","last_name":"Pitrik","first_name":"József"},{"id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1109-5511","first_name":"Daniel","last_name":"Virosztek","full_name":"Virosztek, Daniel"}],"scopus_import":"1","isi":1,"external_id":{"isi":["000581730500011"],"arxiv":["2002.11678"]},"intvolume":"       609","day":"15","keyword":["Kubo-Ando mean","weighted multivariate mean","barycenter"],"citation":{"ieee":"J. Pitrik and D. Virosztek, “A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means,” <i>Linear Algebra and its Applications</i>, vol. 609. Elsevier, pp. 203–217, 2021.","apa":"Pitrik, J., &#38; Virosztek, D. (2021). A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">https://doi.org/10.1016/j.laa.2020.09.007</a>","ista":"Pitrik J, Virosztek D. 2021. A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. Linear Algebra and its Applications. 609, 203–217.","mla":"Pitrik, József, and Daniel Virosztek. “A Divergence Center Interpretation of General Symmetric Kubo-Ando Means, and Related Weighted Multivariate Operator Means.” <i>Linear Algebra and Its Applications</i>, vol. 609, Elsevier, 2021, pp. 203–17, doi:<a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">10.1016/j.laa.2020.09.007</a>.","chicago":"Pitrik, József, and Daniel Virosztek. “A Divergence Center Interpretation of General Symmetric Kubo-Ando Means, and Related Weighted Multivariate Operator Means.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">https://doi.org/10.1016/j.laa.2020.09.007</a>.","ama":"Pitrik J, Virosztek D. A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means. <i>Linear Algebra and its Applications</i>. 2021;609:203-217. doi:<a href=\"https://doi.org/10.1016/j.laa.2020.09.007\">10.1016/j.laa.2020.09.007</a>","short":"J. Pitrik, D. Virosztek, Linear Algebra and Its Applications 609 (2021) 203–217."},"article_processing_charge":"No","type":"journal_article","oa":1,"year":"2021","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.11678"}],"_id":"8373","date_published":"2021-01-15T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-04-14T07:50:40Z","volume":609,"title":"A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means","status":"public","arxiv":1,"page":"203-217"},{"author":[{"first_name":"Marion","last_name":"Patxot","full_name":"Patxot, Marion"},{"full_name":"Trejo Banos, Daniel","last_name":"Trejo Banos","first_name":"Daniel"},{"first_name":"Athanasios","full_name":"Kousathanas, Athanasios","last_name":"Kousathanas"},{"first_name":"Etienne J","last_name":"Orliac","full_name":"Orliac, Etienne J"},{"last_name":"Ojavee","full_name":"Ojavee, Sven E","first_name":"Sven E"},{"first_name":"Gerhard","last_name":"Moser","full_name":"Moser, Gerhard"},{"full_name":"Sidorenko, Julia","last_name":"Sidorenko","first_name":"Julia"},{"full_name":"Kutalik, Zoltan","last_name":"Kutalik","first_name":"Zoltan"},{"last_name":"Magi","full_name":"Magi, Reedik","first_name":"Reedik"},{"first_name":"Peter M","last_name":"Visscher","full_name":"Visscher, Peter M"},{"first_name":"Lars","last_name":"Ronnegard","full_name":"Ronnegard, Lars"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard","last_name":"Robinson"}],"scopus_import":"1","article_number":"6972","external_id":{"pmid":["34848700"],"isi":["000724450600023"]},"isi":1,"acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). L.R. acknowledges funding from the Kjell & Märta Beijer Foundation (Stockholm, Sweden). We also would like to acknowledge Simone Rubinacci, Oliver Delanau, Alexander Terenin, Eleonora Porcu, and Mike Goddard for their useful comments and suggestions.","department":[{"_id":"MaRo"}],"issue":"1","citation":{"ieee":"M. Patxot <i>et al.</i>, “Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","mla":"Patxot, Marion, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” <i>Nature Communications</i>, vol. 12, no. 1, 6972, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-27258-9\">10.1038/s41467-021-27258-9</a>.","ista":"Patxot M, Trejo Banos D, Kousathanas A, Orliac EJ, Ojavee SE, Moser G, Sidorenko J, Kutalik Z, Magi R, Visscher PM, Ronnegard L, Robinson MR. 2021. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 12(1), 6972.","apa":"Patxot, M., Trejo Banos, D., Kousathanas, A., Orliac, E. J., Ojavee, S. E., Moser, G., … Robinson, M. R. (2021). Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-27258-9\">https://doi.org/10.1038/s41467-021-27258-9</a>","chicago":"Patxot, Marion, Daniel Trejo Banos, Athanasios Kousathanas, Etienne J Orliac, Sven E Ojavee, Gerhard Moser, Julia Sidorenko, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-27258-9\">https://doi.org/10.1038/s41467-021-27258-9</a>.","ama":"Patxot M, Trejo Banos D, Kousathanas A, et al. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-27258-9\">10.1038/s41467-021-27258-9</a>","short":"M. Patxot, D. Trejo Banos, A. Kousathanas, E.J. Orliac, S.E. Ojavee, G. Moser, J. Sidorenko, Z. Kutalik, R. Magi, P.M. Visscher, L. Ronnegard, M.R. Robinson, Nature Communications 12 (2021)."},"article_processing_charge":"No","type":"journal_article","oa":1,"intvolume":"        12","day":"30","file_date_updated":"2021-12-06T07:47:11Z","date_created":"2020-09-17T10:52:38Z","publisher":"Springer Nature","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2041-1723"]},"pmid":1,"oa_version":"Published Version","publication":"Nature Communications","file":[{"creator":"cchlebak","file_id":"10419","date_updated":"2021-12-06T07:47:11Z","checksum":"384681be17aff902c149a48f52d13d4f","file_name":"2021_NatComm_Paxtot.pdf","success":1,"file_size":6519771,"date_created":"2021-12-06T07:47:11Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"abstract":[{"text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only ≤10% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data.","lang":"eng"}],"publication_status":"published","doi":"10.1038/s41467-021-27258-9","volume":12,"title":"Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits","status":"public","month":"11","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"related_material":{"record":[{"status":"public","relation":"research_data","id":"13063"}]},"year":"2021","ddc":["610"],"quality_controlled":"1","date_updated":"2025-06-12T06:54:52Z","language":[{"iso":"eng"}],"_id":"8429","date_published":"2021-11-30T00:00:00Z"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Nature Research","date_created":"2020-09-17T10:53:00Z","doi":"10.1038/s41467-021-22538-w","publication":"Nature Communications","abstract":[{"lang":"eng","text":"While recent advancements in computation and modelling have improved the analysis of complex traits, our understanding of the genetic basis of the time at symptom onset remains limited. Here, we develop a Bayesian approach (BayesW) that provides probabilistic inference of the genetic architecture of age-at-onset phenotypes in a sampling scheme that facilitates biobank-scale time-to-event analyses. We show in extensive simulation work the benefits BayesW provides in terms of number of discoveries, model performance and genomic prediction. In the UK Biobank, we find many thousands of common genomic regions underlying the age-at-onset of high blood pressure (HBP), cardiac disease (CAD), and type-2 diabetes (T2D), and for the genetic basis of onset reflecting the underlying genetic liability to disease. Age-at-menopause and age-at-menarche are also highly polygenic, but with higher variance contributed by low frequency variants. Genomic prediction into the Estonian Biobank data shows that BayesW gives higher prediction accuracy than other approaches."}],"file":[{"file_size":6474239,"date_created":"2021-05-04T15:07:50Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"eca8b9ae713835c5b785211dd08d8a2e","file_name":"2021_nature_communications_Ojavee.pdf","success":1,"creator":"kschuh","file_id":"9372","date_updated":"2021-05-04T15:07:50Z"}],"publication_status":"published","publication_identifier":{"eissn":["2041-1723"]},"oa_version":"Published Version","pmid":1,"project":[{"_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","grant_number":"PCEGP3_181181","name":"Improving estimation and prediction of common complex disease risk"}],"department":[{"_id":"MaRo"}],"acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria and the University of Lausanne; the work of KF was supported by the grant PUT1665 by the Estonian Research Council. We would like to thank Mike Goddard for comments which greatly improved the work, the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support.","issue":"1","article_number":"2337","scopus_import":"1","isi":1,"external_id":{"isi":["000642509600006"],"pmid":["33879782"]},"author":[{"first_name":"Sven E","last_name":"Ojavee","full_name":"Ojavee, Sven E"},{"full_name":"Kousathanas, Athanasios","last_name":"Kousathanas","first_name":"Athanasios"},{"full_name":"Trejo Banos, Daniel","last_name":"Trejo Banos","first_name":"Daniel"},{"last_name":"Orliac","full_name":"Orliac, Etienne J","first_name":"Etienne J"},{"full_name":"Patxot, Marion","last_name":"Patxot","first_name":"Marion"},{"full_name":"Lall, Kristi","last_name":"Lall","first_name":"Kristi"},{"first_name":"Reedik","last_name":"Magi","full_name":"Magi, Reedik"},{"full_name":"Fischer, Krista","last_name":"Fischer","first_name":"Krista"},{"first_name":"Zoltan","last_name":"Kutalik","full_name":"Kutalik, Zoltan"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard","last_name":"Robinson"}],"day":"20","file_date_updated":"2021-05-04T15:07:50Z","intvolume":"        12","type":"journal_article","article_processing_charge":"No","oa":1,"citation":{"mla":"Ojavee, Sven E., et al. “Genomic Architecture and Prediction of Censored Time-to-Event Phenotypes with a Bayesian Genome-Wide Analysis.” <i>Nature Communications</i>, vol. 12, no. 1, 2337, Nature Research, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-22538-w\">10.1038/s41467-021-22538-w</a>.","ista":"Ojavee SE, Kousathanas A, Trejo Banos D, Orliac EJ, Patxot M, Lall K, Magi R, Fischer K, Kutalik Z, Robinson MR. 2021. Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. Nature Communications. 12(1), 2337.","apa":"Ojavee, S. E., Kousathanas, A., Trejo Banos, D., Orliac, E. J., Patxot, M., Lall, K., … Robinson, M. R. (2021). Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. <i>Nature Communications</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41467-021-22538-w\">https://doi.org/10.1038/s41467-021-22538-w</a>","ieee":"S. E. Ojavee <i>et al.</i>, “Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis,” <i>Nature Communications</i>, vol. 12, no. 1. Nature Research, 2021.","ama":"Ojavee SE, Kousathanas A, Trejo Banos D, et al. Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-22538-w\">10.1038/s41467-021-22538-w</a>","short":"S.E. Ojavee, A. Kousathanas, D. Trejo Banos, E.J. Orliac, M. Patxot, K. Lall, R. Magi, K. Fischer, Z. Kutalik, M.R. Robinson, Nature Communications 12 (2021).","chicago":"Ojavee, Sven E, Athanasios Kousathanas, Daniel Trejo Banos, Etienne J Orliac, Marion Patxot, Kristi Lall, Reedik Magi, Krista Fischer, Zoltan Kutalik, and Matthew Richard Robinson. “Genomic Architecture and Prediction of Censored Time-to-Event Phenotypes with a Bayesian Genome-Wide Analysis.” <i>Nature Communications</i>. Nature Research, 2021. <a href=\"https://doi.org/10.1038/s41467-021-22538-w\">https://doi.org/10.1038/s41467-021-22538-w</a>."},"ddc":["570"],"year":"2021","related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/predicting-the-onset-of-diseases/","relation":"press_release"}]},"month":"04","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"8430","date_published":"2021-04-20T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2026-04-03T09:31:17Z","quality_controlled":"1","title":"Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis","volume":12,"status":"public"}]