[{"acknowledgement":"M. Mondelli would like to thank László Erdős for helpful discussions. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.\r\n","type":"conference","intvolume":"        35","oa_version":"Preprint","scopus_import":"1","_id":"10593","oa":1,"date_updated":"2025-04-15T07:50:11Z","department":[{"_id":"MaMo"}],"publisher":"Neural Information Processing Systems Foundation","arxiv":1,"date_published":"2021-12-01T00:00:00Z","month":"12","language":[{"iso":"eng"}],"status":"public","day":"01","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"citation":{"apa":"Mondelli, M., &#38; Venkataramanan, R. (2021). PCA initialization for approximate message passing in rotationally invariant models. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 35, pp. 29616–29629). Virtual: Neural Information Processing Systems Foundation.","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate Message Passing in Rotationally Invariant Models.” In <i>35th Conference on Neural Information Processing Systems</i>, 35:29616–29. Neural Information Processing Systems Foundation, 2021.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate Message Passing in Rotationally Invariant Models.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 35, Neural Information Processing Systems Foundation, 2021, pp. 29616–29.","short":"M. Mondelli, R. Venkataramanan, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 29616–29629.","ieee":"M. Mondelli and R. Venkataramanan, “PCA initialization for approximate message passing in rotationally invariant models,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021, vol. 35, pp. 29616–29629.","ista":"Mondelli M, Venkataramanan R. 2021. PCA initialization for approximate message passing in rotationally invariant models. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 35, 29616–29629.","ama":"Mondelli M, Venkataramanan R. PCA initialization for approximate message passing in rotationally invariant models. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 35. Neural Information Processing Systems Foundation; 2021:29616-29629."},"volume":35,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Venkataramanan, Ramji","first_name":"Ramji","last_name":"Venkataramanan"}],"external_id":{"arxiv":["2106.02356"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of estimating a rank-$1$ signal in the presence of rotationally invariant noise-a class of perturbations more general than Gaussian noise. Principal Component Analysis (PCA) provides a natural estimator, and sharp results on its performance have been obtained in the high-dimensional regime. Recently, an Approximate Message Passing (AMP) algorithm has been proposed as an alternative estimator with the potential to improve the accuracy of PCA. However, the existing analysis of AMP requires an initialization that is both correlated with the signal and independent of the noise, which is often unrealistic in practice. In this work, we combine the two methods, and propose to initialize AMP with PCA. Our main result is a rigorous asymptotic characterization of the performance of this estimator. Both the AMP algorithm and its analysis differ from those previously derived in the Gaussian setting: at every iteration, our AMP algorithm requires a specific term to account for PCA initialization, while in the Gaussian case, PCA initialization affects only the first iteration of AMP. The proof is based on a two-phase artificial AMP that first approximates the PCA estimator and then mimics the true AMP. Our numerical simulations show an excellent agreement between AMP results and theoretical predictions, and suggest an interesting open direction on achieving Bayes-optimal performance."}],"article_processing_charge":"No","page":"29616-29629","title":"PCA initialization for approximate message passing in rotationally invariant models","date_created":"2022-01-03T10:50:02Z","year":"2021","publication":"35th Conference on Neural Information Processing Systems","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"quality_controlled":"1","corr_author":"1","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-14"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2106.02356"}]},{"citation":{"apa":"Nguyen, Q., Bréchet, P., &#38; Mondelli, M. (2021). When are solutions connected in deep networks? In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 35). Virtual: Neural Information Processing Systems Foundation.","chicago":"Nguyen, Quynh, Pierre Bréchet, and Marco Mondelli. “When Are Solutions Connected in Deep Networks?” In <i>35th Conference on Neural Information Processing Systems</i>, Vol. 35. Neural Information Processing Systems Foundation, 2021.","mla":"Nguyen, Quynh, et al. “When Are Solutions Connected in Deep Networks?” <i>35th Conference on Neural Information Processing Systems</i>, vol. 35, Neural Information Processing Systems Foundation, 2021.","short":"Q. Nguyen, P. Bréchet, M. Mondelli, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","ieee":"Q. Nguyen, P. Bréchet, and M. Mondelli, “When are solutions connected in deep networks?,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021, vol. 35.","ista":"Nguyen Q, Bréchet P, Mondelli M. 2021. When are solutions connected in deep networks? 35th Conference on Neural Information Processing Systems. 35th Conference on Neural Information Processing Systems vol. 35.","ama":"Nguyen Q, Bréchet P, Mondelli M. When are solutions connected in deep networks? In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 35. Neural Information Processing Systems Foundation; 2021."},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"day":"01","status":"public","date_published":"2021-12-01T00:00:00Z","month":"12","language":[{"iso":"eng"}],"date_updated":"2025-04-15T07:50:11Z","department":[{"_id":"MaMo"}],"arxiv":1,"publisher":"Neural Information Processing Systems Foundation","oa":1,"_id":"10594","intvolume":"        35","oa_version":"Preprint","type":"conference","acknowledgement":"MM was partially supported by the 2019 Lopez-Loreta Prize. QN and PB acknowledge support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).","main_file_link":[{"url":"https://arxiv.org/abs/2102.09671","open_access":"1"}],"conference":{"name":"35th Conference on Neural Information Processing Systems","start_date":"2021-12-06","end_date":"2021-12-14","location":"Virtual"},"corr_author":"1","quality_controlled":"1","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"publication":"35th Conference on Neural Information Processing Systems","date_created":"2022-01-03T10:56:20Z","year":"2021","title":"When are solutions connected in deep networks?","article_processing_charge":"No","publication_status":"published","external_id":{"arxiv":["2102.09671"]},"abstract":[{"lang":"eng","text":"The question of how and why the phenomenon of mode connectivity occurs in training deep neural networks has gained remarkable attention in the research community. From a theoretical perspective, two possible explanations have been proposed: (i) the loss function has connected sublevel sets, and (ii) the solutions found by stochastic gradient descent are dropout stable. While these explanations provide insights into the phenomenon, their assumptions are not always satisfied in practice. In particular, the first approach requires the network to have one layer with order of N neurons (N being the number of training samples), while the second one requires the loss to be almost invariant after removing half of the neurons at each layer (up to some rescaling of the remaining ones). In this work, we improve both conditions by exploiting the quality of the features at every intermediate layer together with a milder over-parameterization condition. More specifically, we show that: (i) under generic assumptions on the features of intermediate layers, it suffices that the last two hidden layers have order of N−−√ neurons, and (ii) if subsets of features at each layer are linearly separable, then no over-parameterization is needed to show the connectivity. Our experiments confirm that the proposed condition ensures the connectivity of solutions found by stochastic gradient descent, even in settings where the previous requirements do not hold."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Nguyen, Quynh","last_name":"Nguyen","first_name":"Quynh"},{"first_name":"Pierre","last_name":"Bréchet","full_name":"Bréchet, Pierre"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli"}],"volume":35},{"abstract":[{"lang":"eng","text":"A recent line of work has analyzed the theoretical properties of deep neural networks via the Neural Tangent Kernel (NTK). In particular, the smallest eigenvalue of the NTK has been related to the memorization capacity, the global convergence of gradient descent algorithms and the generalization of deep nets. However, existing results either provide bounds in the two-layer setting or assume that the spectrum of the NTK matrices is bounded away from 0 for multi-layer networks. In this paper, we provide tight bounds on the smallest eigenvalue of NTK matrices for deep ReLU nets, both in the limiting case of infinite widths and for finite widths. In the finite-width setting, the network architectures we consider are fairly general: we require the existence of a wide layer with roughly order of $N$ neurons, $N$ being the number of data samples; and the scaling of the remaining layer widths is arbitrary (up to logarithmic factors). To obtain our results, we analyze various quantities of independent interest: we give lower bounds on the smallest singular value of hidden feature matrices, and upper bounds on the Lipschitz constant of input-output feature maps."}],"external_id":{"arxiv":["2012.11654"]},"publication_status":"published","page":"8119-8129","article_processing_charge":"No","title":"Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks","editor":[{"full_name":"Meila, Marina","last_name":"Meila","first_name":"Marina"},{"first_name":"Tong","last_name":"Zhang","full_name":"Zhang, Tong"}],"volume":139,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Nguyen","first_name":"Quynh","full_name":"Nguyen, Quynh"},{"first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Montufar, Guido F","first_name":"Guido F","last_name":"Montufar"}],"quality_controlled":"1","ddc":["000"],"conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2021-07-18","end_date":"2021-07-24","location":"Virtual"},"main_file_link":[{"url":"http://proceedings.mlr.press/v139/nguyen21g.html","open_access":"1"}],"year":"2021","date_created":"2022-01-03T10:57:49Z","publication":"Proceedings of the 38th International Conference on Machine Learning","oa":1,"department":[{"_id":"MaMo"}],"arxiv":1,"publisher":"ML Research Press","date_updated":"2026-06-18T08:43:54Z","language":[{"iso":"eng"}],"month":"01","date_published":"2021-01-01T00:00:00Z","acknowledgement":"The authors would like to thank the anonymous reviewers for their helpful comments. MM was partially supported\r\nby the 2019 Lopez-Loreta Prize. QN and GM acknowledge support from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).","type":"conference","oa_version":"Published Version","intvolume":"       139","_id":"10595","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"citation":{"mla":"Nguyen, Quynh, et al. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, edited by Marina Meila and Tong Zhang, vol. 139, ML Research Press, 2021, pp. 8119–29.","chicago":"Nguyen, Quynh, Marco Mondelli, and Guido F Montufar. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, edited by Marina Meila and Tong Zhang, 139:8119–29. ML Research Press, 2021.","apa":"Nguyen, Q., Mondelli, M., &#38; Montufar, G. F. (2021). Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. In M. Meila &#38; T. Zhang (Eds.), <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 8119–8129). Virtual: ML Research Press.","ista":"Nguyen Q, Mondelli M, Montufar GF. 2021. Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. Proceedings of the 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 139, 8119–8129.","ama":"Nguyen Q, Mondelli M, Montufar GF. Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. In: Meila M, Zhang T, eds. <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:8119-8129.","ieee":"Q. Nguyen, M. Mondelli, and G. F. Montufar, “Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 8119–8129.","short":"Q. Nguyen, M. Mondelli, G.F. Montufar, in:, M. Meila, T. Zhang (Eds.), Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 8119–8129."},"day":"01","status":"public","alternative_title":["Proceedings of Machine Learning Research"]},{"quality_controlled":"1","main_file_link":[{"url":"https://proceedings.mlr.press/v130/mondelli21a.html","open_access":"1"}],"conference":{"location":"Virtual, San Diego, CA, United States","end_date":"2021-04-15","name":"AISTATS: Artificial Intelligence and Statistics","start_date":"2021-04-13"},"date_created":"2022-01-03T11:34:22Z","year":"2021","publication_identifier":{"issn":["2640-3498"]},"publication":"Proceedings of The 24th International Conference on Artificial Intelligence and Statistics","article_processing_charge":"Yes (via OA deal)","page":"397-405","external_id":{"arxiv":["2010.03460"]},"publication_status":"published","abstract":[{"text":" We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach. ","lang":"eng"}],"title":"Approximate message passing with spectral initialization for generalized linear models","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"full_name":"Venkataramanan, Ramji","first_name":"Ramji","last_name":"Venkataramanan"}],"volume":130,"editor":[{"full_name":"Banerjee, Arindam","last_name":"Banerjee","first_name":"Arindam"},{"full_name":"Fukumizu, Kenji","first_name":"Kenji","last_name":"Fukumizu"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"12480"}]},"citation":{"chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” In <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, edited by Arindam Banerjee and Kenji Fukumizu, 130:397–405. ML Research Press, 2021.","apa":"Mondelli, M., &#38; Venkataramanan, R. (2021). Approximate message passing with spectral initialization for generalized linear models. In A. Banerjee &#38; K. Fukumizu (Eds.), <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i> (Vol. 130, pp. 397–405). Virtual, San Diego, CA, United States: ML Research Press.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, edited by Arindam Banerjee and Kenji Fukumizu, vol. 130, ML Research Press, 2021, pp. 397–405.","short":"M. Mondelli, R. Venkataramanan, in:, A. Banerjee, K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 397–405.","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” in <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, Virtual, San Diego, CA, United States, 2021, vol. 130, pp. 397–405.","ista":"Mondelli M, Venkataramanan R. 2021. Approximate message passing with spectral initialization for generalized linear models. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 130, 397–405.","ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. In: Banerjee A, Fukumizu K, eds. <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>. Vol 130. ML Research Press; 2021:397-405."},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"alternative_title":["Proceedings of Machine Learning Research"],"status":"public","day":"01","oa":1,"date_published":"2021-04-01T00:00:00Z","month":"04","language":[{"iso":"eng"}],"date_updated":"2025-04-15T07:50:16Z","department":[{"_id":"MaMo"}],"arxiv":1,"publisher":"ML Research Press","oa_version":"Preprint","intvolume":"       130","type":"conference","acknowledgement":"The authors would like to thank Andrea Montanari for helpful discussions. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.","scopus_import":"1","_id":"10598"},{"citation":{"mla":"Godard, Benoit G., et al. “Combined Effect of Cell Geometry and Polarity Domains Determines the Orientation of Unequal Division.” <i>ELife</i>, vol. 10, e75639, eLife Sciences Publications, 2021, doi:<a href=\"https://doi.org/10.7554/eLife.75639\">10.7554/eLife.75639</a>.","chicago":"Godard, Benoit G, Remi Dumollard, Carl-Philipp J Heisenberg, and Alex Mcdougall. “Combined Effect of Cell Geometry and Polarity Domains Determines the Orientation of Unequal Division.” <i>ELife</i>. eLife Sciences Publications, 2021. <a href=\"https://doi.org/10.7554/eLife.75639\">https://doi.org/10.7554/eLife.75639</a>.","apa":"Godard, B. G., Dumollard, R., Heisenberg, C.-P. J., &#38; Mcdougall, A. (2021). Combined effect of cell geometry and polarity domains determines the orientation of unequal division. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.75639\">https://doi.org/10.7554/eLife.75639</a>","ama":"Godard BG, Dumollard R, Heisenberg C-PJ, Mcdougall A. Combined effect of cell geometry and polarity domains determines the orientation of unequal division. <i>eLife</i>. 2021;10. doi:<a href=\"https://doi.org/10.7554/eLife.75639\">10.7554/eLife.75639</a>","ista":"Godard BG, Dumollard R, Heisenberg C-PJ, Mcdougall A. 2021. Combined effect of cell geometry and polarity domains determines the orientation of unequal division. eLife. 10, e75639.","ieee":"B. G. Godard, R. Dumollard, C.-P. J. Heisenberg, and A. Mcdougall, “Combined effect of cell geometry and polarity domains determines the orientation of unequal division,” <i>eLife</i>, vol. 10. eLife Sciences Publications, 2021.","short":"B.G. Godard, R. Dumollard, C.-P.J. Heisenberg, A. Mcdougall, ELife 10 (2021)."},"project":[{"name":"Control of embryonic cleavage pattern","call_identifier":"FWF","grant_number":"I03601","_id":"2646861A-B435-11E9-9278-68D0E5697425"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"21","isi":1,"file_date_updated":"2022-01-10T09:40:37Z","oa":1,"date_published":"2021-12-21T00:00:00Z","language":[{"iso":"eng"}],"month":"12","date_updated":"2025-04-14T12:59:47Z","publisher":"eLife Sciences Publications","department":[{"_id":"CaHe"}],"oa_version":"Published Version","intvolume":"        10","article_type":"original","acknowledgement":"We thank members of the Heisenberg and McDougall groups for technical advice and discussion. We are grateful to the Bioimaging and Nanofabrication facilities of IST Austria and the Imaging Platform (PIM) and animal facility (CRB) of Institut de la Mer de Villefranche (IMEV), which is supported by EMBRC-France, whose French state funds are managed by the ANR within the Investments of the Future program under reference ANR-10-INBS-0, for continuous support. This work was supported by a collaborative grant from the French Government funding agency Agence National de la Recherche to McDougall (ANR 'MorCell': ANR-17-CE 13-0028) and the Austrian Science Fund to Heisenberg (FWF: I 3601-B27).","type":"journal_article","scopus_import":"1","_id":"10606","corr_author":"1","quality_controlled":"1","file":[{"creator":"alisjak","success":1,"date_created":"2022-01-10T09:40:37Z","content_type":"application/pdf","file_name":"2021_eLife_Godard.pdf","checksum":"759c7a873d554c48a6639e6350746ca6","relation":"main_file","access_level":"open_access","date_updated":"2022-01-10T09:40:37Z","file_size":7769934,"file_id":"10611"}],"has_accepted_license":"1","ddc":["570"],"date_created":"2022-01-09T23:01:26Z","year":"2021","article_number":"e75639","doi":"10.7554/eLife.75639","publication_identifier":{"eissn":["2050-084X"]},"publication":"eLife","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by/4.0/","external_id":{"pmid":["34889186"],"isi":["000733610100001"]},"publication_status":"published","abstract":[{"text":"Cell division orientation is thought to result from a competition between cell geometry and polarity domains controlling the position of the mitotic spindle during mitosis. Depending on the level of cell shape anisotropy or the strength of the polarity domain, one dominates the other and determines the orientation of the spindle. Whether and how such competition is also at work to determine unequal cell division (UCD), producing daughter cells of different size, remains unclear. Here, we show that cell geometry and polarity domains cooperate, rather than compete, in positioning the cleavage plane during UCDs in early ascidian embryos. We found that the UCDs and their orientation at the ascidian third cleavage rely on the spindle tilting in an anisotropic cell shape, and cortical polarity domains exerting different effects on spindle astral microtubules. By systematically varying mitotic cell shape, we could modulate the effect of attractive and repulsive polarity domains and consequently generate predicted daughter cell size asymmetries and position. We therefore propose that the spindle position during UCD is set by the combined activities of cell geometry and polarity domains, where cell geometry modulates the effect of cortical polarity domain(s).","lang":"eng"}],"title":"Combined effect of cell geometry and polarity domains determines the orientation of unequal division","author":[{"full_name":"Godard, Benoit G","id":"33280250-F248-11E8-B48F-1D18A9856A87","first_name":"Benoit G","last_name":"Godard"},{"full_name":"Dumollard, Remi","last_name":"Dumollard","first_name":"Remi"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"},{"last_name":"Mcdougall","first_name":"Alex","full_name":"Mcdougall, Alex"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":10,"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"}],"pmid":1},{"citation":{"chicago":"Venezia, Serena, Walter Kaufmann, Gregor K. Wenning, and Nadia Stefanova. “Toll-like Receptor 4 Deficiency Facilitates α-Synuclein Propagation and Neurodegeneration in a Mouse Model of Prodromal Parkinson’s Disease.” <i>Parkinsonism &#38; Related Disorders</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">https://doi.org/10.1016/j.parkreldis.2021.09.007</a>.","apa":"Venezia, S., Kaufmann, W., Wenning, G. K., &#38; Stefanova, N. (2021). Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease. <i>Parkinsonism &#38; Related Disorders</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">https://doi.org/10.1016/j.parkreldis.2021.09.007</a>","mla":"Venezia, Serena, et al. “Toll-like Receptor 4 Deficiency Facilitates α-Synuclein Propagation and Neurodegeneration in a Mouse Model of Prodromal Parkinson’s Disease.” <i>Parkinsonism &#38; Related Disorders</i>, vol. 91, Elsevier, 2021, pp. 59–65, doi:<a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">10.1016/j.parkreldis.2021.09.007</a>.","ieee":"S. Venezia, W. Kaufmann, G. K. Wenning, and N. Stefanova, “Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease,” <i>Parkinsonism &#38; Related Disorders</i>, vol. 91. Elsevier, pp. 59–65, 2021.","short":"S. Venezia, W. Kaufmann, G.K. Wenning, N. Stefanova, Parkinsonism &#38; Related Disorders 91 (2021) 59–65.","ama":"Venezia S, Kaufmann W, Wenning GK, Stefanova N. Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease. <i>Parkinsonism &#38; Related Disorders</i>. 2021;91:59-65. doi:<a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">10.1016/j.parkreldis.2021.09.007</a>","ista":"Venezia S, Kaufmann W, Wenning GK, Stefanova N. 2021. Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease. Parkinsonism &#38; Related Disorders. 91, 59–65."},"day":"01","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_updated":"2023-08-17T06:36:01Z","publisher":"Elsevier","department":[{"_id":"EM-Fac"}],"date_published":"2021-10-01T00:00:00Z","language":[{"iso":"eng"}],"month":"10","file_date_updated":"2022-01-10T13:41:40Z","oa":1,"isi":1,"scopus_import":"1","_id":"10607","type":"journal_article","acknowledgement":"This study was supported by grants of the Austrian Science Fund (FWF) F4414 and W1206-08. Electron microscopy was performed at the Scientific Service Units (SSU) of IST-Austria through resources provided by the Electron Microscopy Facility.","intvolume":"        91","oa_version":"Published Version","article_type":"original","ddc":["610"],"has_accepted_license":"1","file":[{"creator":"alisjak","success":1,"date_created":"2022-01-10T13:41:40Z","content_type":"application/pdf","file_name":"2021_Parkinsonism_Venezia.pdf","relation":"main_file","checksum":"360681585acb51e80d17c6b213c56b55","access_level":"open_access","file_size":6848513,"date_updated":"2022-01-10T13:41:40Z","file_id":"10612"}],"quality_controlled":"1","publication":"Parkinsonism & Related Disorders","publication_identifier":{"eissn":["1873-5126"],"issn":["1353-8020"]},"doi":"10.1016/j.parkreldis.2021.09.007","date_created":"2022-01-09T23:01:26Z","year":"2021","title":"Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson's disease","publication_status":"published","external_id":{"pmid":["34530328"],"isi":["000701142900012"]},"abstract":[{"lang":"eng","text":"The evidence linking innate immunity mechanisms and neurodegenerative diseases is growing, but the specific mechanisms are incompletely understood. Experimental data suggest that microglial TLR4 mediates the uptake and clearance of α-synuclein also termed synucleinophagy. The accumulation of misfolded α-synuclein throughout the brain is central to Parkinson's disease (PD). The distribution and progression of the pathology is often attributed to the propagation of α-synuclein. Here, we apply a classical α-synuclein propagation model of prodromal PD in wild type and TLR4 deficient mice to study the role of TLR4 in the progression of the disease. Our data suggest that TLR4 deficiency facilitates the α-synuclein seed spreading associated with reduced lysosomal activity of microglia. Three months after seed inoculation, more pronounced proteinase K-resistant α-synuclein inclusion pathology is observed in mice with TLR4 deficiency. The facilitated propagation of α-synuclein is associated with early loss of dopamine transporter (DAT) signal in the striatum and loss of dopaminergic neurons in substantia nigra pars compacta of TLR4 deficient mice. These new results support TLR4 signaling as a putative target for disease modification to slow the progression of PD and related disorders."}],"article_processing_charge":"No","page":"59-65","pmid":1,"volume":91,"author":[{"last_name":"Venezia","first_name":"Serena","full_name":"Venezia, Serena"},{"last_name":"Kaufmann","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter"},{"first_name":"Gregor K.","last_name":"Wenning","full_name":"Wenning, Gregor K."},{"first_name":"Nadia","last_name":"Stefanova","full_name":"Stefanova, Nadia"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"citation":{"short":"S. Chakraborty, C. Ganesh, M. Pancholi, P. Sarkar, in:, 27th International Conference on the Theory and Application of Cryptology and Information Security, Springer Nature, 2021, pp. 335–364.","ieee":"S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls for adaptively secure MPC without setup,” in <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, Virtual, Singapore, 2021, vol. 13091, pp. 335–364.","ista":"Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for adaptively secure MPC without setup. 27th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: International Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.","ama":"Chakraborty S, Ganesh C, Pancholi M, Sarkar P. Reverse firewalls for adaptively secure MPC without setup. In: <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>. Vol 13091. Springer Nature; 2021:335-364. doi:<a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">10.1007/978-3-030-92075-3_12</a>","chicago":"Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar. “Reverse Firewalls for Adaptively Secure MPC without Setup.” In <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, 13091:335–64. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">https://doi.org/10.1007/978-3-030-92075-3_12</a>.","apa":"Chakraborty, S., Ganesh, C., Pancholi, M., &#38; Sarkar, P. (2021). Reverse firewalls for adaptively secure MPC without setup. In <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i> (Vol. 13091, pp. 335–364). Virtual, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">https://doi.org/10.1007/978-3-030-92075-3_12</a>","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.” <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">10.1007/978-3-030-92075-3_12</a>."},"ec_funded":1,"day":"01","status":"public","alternative_title":["LNCS"],"oa":1,"isi":1,"publisher":"Springer Nature","department":[{"_id":"KrPi"}],"date_updated":"2025-04-14T07:22:06Z","language":[{"iso":"eng"}],"month":"12","date_published":"2021-12-01T00:00:00Z","type":"conference","intvolume":"     13091","oa_version":"Preprint","_id":"10609","scopus_import":"1","quality_controlled":"1","conference":{"location":"Virtual, Singapore","end_date":"2021-12-10","name":"ASIACRYPT: International Conference on Cryptology in Asia","start_date":"2021-12-06"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1262"}],"year":"2021","date_created":"2022-01-09T23:01:27Z","publication":"27th International Conference on the Theory and Application of Cryptology and Information Security","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-92075-3"],"isbn":["978-3-030-92074-6"]},"doi":"10.1007/978-3-030-92075-3_12","abstract":[{"text":"We study Multi-party computation (MPC) in the setting of subversion, where the adversary tampers with the machines of honest parties. Our goal is to construct actively secure MPC protocols where parties are corrupted adaptively by an adversary (as in the standard adaptive security setting), and in addition, honest parties’ machines are compromised.\r\nThe idea of reverse firewalls (RF) was introduced at EUROCRYPT’15 by Mironov and Stephens-Davidowitz as an approach to protecting protocols against corruption of honest parties’ devices. Intuitively, an RF for a party   P  is an external entity that sits between   P  and the outside world and whose scope is to sanitize   P ’s incoming and outgoing messages in the face of subversion of their computer. Mironov and Stephens-Davidowitz constructed a protocol for passively-secure two-party computation. At CRYPTO’20, Chakraborty, Dziembowski and Nielsen constructed a protocol for secure computation with firewalls that improved on this result, both by extending it to multi-party computation protocol, and considering active security in the presence of static corruptions. In this paper, we initiate the study of RF for MPC in the adaptive setting. We put forward a definition for adaptively secure MPC in the reverse firewall setting, explore relationships among the security notions, and then construct reverse firewalls for MPC in this stronger setting of adaptive security. We also resolve the open question of Chakraborty, Dziembowski and Nielsen by removing the need for a trusted setup in constructing RF for MPC. Towards this end, we construct reverse firewalls for adaptively secure augmented coin tossing and adaptively secure zero-knowledge protocols and obtain a constant round adaptively secure MPC protocol in the reverse firewall setting without setup. Along the way, we propose a new multi-party adaptively secure coin tossing protocol in the plain model, that is of independent interest.","lang":"eng"}],"external_id":{"isi":["000927876200012"]},"publication_status":"published","page":"335-364","article_processing_charge":"No","title":"Reverse firewalls for adaptively secure MPC without setup","volume":13091,"author":[{"full_name":"Chakraborty, Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","first_name":"Suvradip","last_name":"Chakraborty"},{"last_name":"Ganesh","first_name":"Chaya","full_name":"Ganesh, Chaya"},{"full_name":"Pancholi, Mahak","first_name":"Mahak","last_name":"Pancholi"},{"last_name":"Sarkar","first_name":"Pratik","full_name":"Sarkar, Pratik"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"citation":{"ista":"Chen JP, Sau F. 2021. Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. Markov Processes And Related Fields. 27(3), 339–380.","ama":"Chen JP, Sau F. Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. <i>Markov Processes And Related Fields</i>. 2021;27(3):339-380.","short":"J.P. Chen, F. Sau, Markov Processes And Related Fields 27 (2021) 339–380.","ieee":"J. P. Chen and F. Sau, “Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems,” <i>Markov Processes And Related Fields</i>, vol. 27, no. 3. Polymat Publishing, pp. 339–380, 2021.","mla":"Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium Fluctuations of Interacting Particle Systems.” <i>Markov Processes And Related Fields</i>, vol. 27, no. 3, Polymat Publishing, 2021, pp. 339–80.","apa":"Chen, J. P., &#38; Sau, F. (2021). Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. <i>Markov Processes And Related Fields</i>. Polymat Publishing.","chicago":"Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium Fluctuations of Interacting Particle Systems.” <i>Markov Processes And Related Fields</i>. Polymat Publishing, 2021."},"ec_funded":1,"day":"16","status":"public","oa":1,"arxiv":1,"publisher":"Polymat Publishing","department":[{"_id":"JaMa"}],"date_updated":"2025-06-26T11:57:53Z","language":[{"iso":"eng"}],"month":"03","date_published":"2021-03-16T00:00:00Z","acknowledgement":"F.S. would like to thank Mario Ayala and Frank Redig for useful discussions. J.P.C. acknowledges partial financial support from the US National Science Foundation (DMS-1855604). F.S. was financially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.\r\n","type":"journal_article","article_type":"original","oa_version":"Preprint","intvolume":"        27","_id":"10613","quality_controlled":"1","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.13403"}],"year":"2021","date_created":"2022-01-10T14:02:31Z","publication":"Markov Processes And Related Fields","issue":"3","publication_identifier":{"issn":["1024-2953"]},"abstract":[{"text":"Motivated by the recent preprint [\\emph{arXiv:2004.08412}] by Ayala, Carinci, and Redig, we first provide a general framework for the study of scaling limits of higher-order fields. Then, by considering the same class of infinite interacting particle systems as in [\\emph{arXiv:2004.08412}], namely symmetric simple exclusion and inclusion processes in the d-dimensional Euclidean lattice, we prove the hydrodynamic limit, and convergence for the equilibrium fluctuations, of higher-order fields. In particular, the limit fields exhibit a tensor structure. Our fluctuation result differs from that in [\\emph{arXiv:2004.08412}], since we considered-dimensional Euclidean lattice, we prove the hydrodynamic limit, and convergence for the equilibrium fluctuations, of higher-order fields. In particular, the limit fields exhibit a tensor structure. Our fluctuation result differs from that in [\\emph{arXiv:2004.08412}], since we consider a different notion of higher-order fluctuation fields.","lang":"eng"}],"external_id":{"arxiv":["2008.13403"]},"publication_status":"published","page":"339-380","article_processing_charge":"No","title":"Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems","keyword":["interacting particle systems","higher-order fields","hydrodynamic limit","equilibrium fluctuations","duality"],"volume":27,"author":[{"last_name":"Chen","first_name":"Joe P.","full_name":"Chen, Joe P."},{"last_name":"Sau","first_name":"Federico","full_name":"Sau, Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"description":"Link to Abstract on publisher's website","relation":"other","url":"http://math-mprf.org/journal/articles/id1614/"},{"description":"Referred to in Abstract","url":"https://arxiv.org/abs/2004.08412","relation":"used_for_analysis_in"}]}},{"citation":{"mla":"Ghazaryan, Areg, et al. “Shadow Surface States in Topological Kondo Insulators.” <i>New Journal of Physics</i>, vol. 23, no. 12, 123042, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac4124\">10.1088/1367-2630/ac4124</a>.","apa":"Ghazaryan, A., Nica, E. M., Erten, O., &#38; Ghaemi, P. (2021). Shadow surface states in topological Kondo insulators. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/ac4124\">https://doi.org/10.1088/1367-2630/ac4124</a>","chicago":"Ghazaryan, Areg, Emilian M. Nica, Onur Erten, and Pouyan Ghaemi. “Shadow Surface States in Topological Kondo Insulators.” <i>New Journal of Physics</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/1367-2630/ac4124\">https://doi.org/10.1088/1367-2630/ac4124</a>.","ama":"Ghazaryan A, Nica EM, Erten O, Ghaemi P. Shadow surface states in topological Kondo insulators. <i>New Journal of Physics</i>. 2021;23(12). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac4124\">10.1088/1367-2630/ac4124</a>","ista":"Ghazaryan A, Nica EM, Erten O, Ghaemi P. 2021. Shadow surface states in topological Kondo insulators. New Journal of Physics. 23(12), 123042.","short":"A. Ghazaryan, E.M. Nica, O. Erten, P. Ghaemi, New Journal of Physics 23 (2021).","ieee":"A. Ghazaryan, E. M. Nica, O. Erten, and P. Ghaemi, “Shadow surface states in topological Kondo insulators,” <i>New Journal of Physics</i>, vol. 23, no. 12. IOP Publishing, 2021."},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"23","status":"public","isi":1,"oa":1,"file_date_updated":"2022-01-17T10:01:58Z","month":"12","language":[{"iso":"eng"}],"date_published":"2021-12-23T00:00:00Z","publisher":"IOP Publishing","arxiv":1,"department":[{"_id":"MiLe"}],"date_updated":"2025-04-14T07:43:48Z","article_type":"original","intvolume":"        23","oa_version":"Published Version","acknowledgement":"PG acknowledges support from National Science Foundation Awards No. DMR-1824265 for this work. AG acknowledges support from the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. EMN is supported by ASU startup grant. OE is in part supported by NSF-DMR-1904716.","type":"journal_article","_id":"10628","scopus_import":"1","corr_author":"1","file":[{"date_updated":"2022-01-17T10:01:58Z","file_size":2533102,"access_level":"open_access","checksum":"0c3cb6816242fa8afd1cc87a5fe77821","relation":"main_file","file_id":"10632","success":1,"creator":"cchlebak","file_name":"2021_NewJourPhys_Ghazaryan.pdf","content_type":"application/pdf","date_created":"2022-01-17T10:01:58Z"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["530"],"year":"2021","date_created":"2022-01-16T23:01:28Z","article_number":"123042","issue":"12","publication_identifier":{"issn":["1367-2630"]},"doi":"10.1088/1367-2630/ac4124","publication":"New Journal of Physics","article_processing_charge":"No","abstract":[{"text":"The surface states of 3D topological insulators in general have negligible quantum oscillations (QOs) when the chemical potential is tuned to the Dirac points. In contrast, we find that topological Kondo insulators (TKIs) can support surface states with an arbitrarily large Fermi surface (FS) when the chemical potential is pinned to the Dirac point. We illustrate that these FSs give rise to finite-frequency QOs, which can become comparable to the extremal area of the unhybridized bulk bands. We show that this occurs when the crystal symmetry is lowered from cubic to tetragonal in a minimal two-orbital model. We label such surface modes as 'shadow surface states'. Moreover, we show that the sufficient next-nearest neighbor out-of-plane hybridization leading to shadow surface states can be self-consistently stabilized for tetragonal TKIs. Consequently, shadow surface states provide an important example of high-frequency QOs beyond the context of cubic TKIs.","lang":"eng"}],"external_id":{"arxiv":["2012.11625"],"isi":["000734063700001"]},"publication_status":"published","title":"Shadow surface states in topological Kondo insulators","author":[{"last_name":"Ghazaryan","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg"},{"full_name":"Nica, Emilian M.","last_name":"Nica","first_name":"Emilian M."},{"full_name":"Erten, Onur","first_name":"Onur","last_name":"Erten"},{"full_name":"Ghaemi, Pouyan","first_name":"Pouyan","last_name":"Ghaemi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":23},{"corr_author":"1","file":[{"file_id":"10633","access_level":"open_access","relation":"main_file","checksum":"71141acdeffa9056f24d6dbef952d254","file_size":891566,"date_updated":"2022-01-17T10:36:08Z","date_created":"2022-01-17T10:36:08Z","content_type":"application/pdf","file_name":"2021_LIPIcs_Chatterjee.pdf","success":1,"creator":"cchlebak"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["000"],"conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15","end_date":"2021-12-17","location":"Virtual"},"date_created":"2022-01-16T23:01:28Z","year":"2021","article_number":"42","publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.FSTTCS.2021.42","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","article_processing_charge":"No","publication_status":"published","abstract":[{"text":"Product graphs arise naturally in formal verification and program analysis. For example, the analysis of two concurrent threads requires the product of two component control-flow graphs, and for language inclusion of deterministic automata the product of two automata is constructed. In many cases, the component graphs have constant treewidth, e.g., when the input contains control-flow graphs of programs. We consider the algorithmic analysis of products of two constant-treewidth graphs with respect to three classic specification languages, namely, (a) algebraic properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur main contributions are as follows. Consider a graph G that is the product of two constant-treewidth graphs of size n each. First, given an idempotent semiring, we present an algorithm that computes the semiring transitive closure of G in time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time algorithm for deciding whether the value of a starting state is non-negative, improving the previously known O(n⁴) bound. Third, given an initial credit for energy objective, we present an O(n⁵)-time algorithm for computing the minimum initial credit for all nodes of G, improving the previously known O(n⁸) bound. At the heart of our approach lies an algorithm for the efficient construction of strongly-balanced tree decompositions of constant-treewidth graphs. Given a constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm constructs a binary tree decomposition of G' of width O(λ) with the property that the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ}).","lang":"eng"}],"title":"Quantitative verification on product graphs of small treewidth","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas"}],"volume":213,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LIPIcs"],"day":"29","status":"public","file_date_updated":"2022-01-17T10:36:08Z","oa":1,"date_published":"2021-11-29T00:00:00Z","month":"11","language":[{"iso":"eng"}],"date_updated":"2024-10-09T21:01:23Z","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","intvolume":"       213","type":"conference","scopus_import":"1","_id":"10629"},{"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LIPIcs"],"day":"29","status":"public","citation":{"ista":"Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>","ieee":"E. Arrighi <i>et al.</i>, “On the complexity of intersection non-emptiness for star-free language classes,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>.","apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &#38; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>","chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>."},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"intvolume":"       213","oa_version":"Published Version","type":"conference","acknowledgement":"We like to thank Lukas Fleischer and Michael Wehar for our discussions. This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie in der Automatentheorie https://www.dagstuhl.de/20483.\r\n","_id":"10630","scopus_import":"1","oa":1,"file_date_updated":"2022-01-17T10:49:03Z","language":[{"iso":"eng"}],"month":"11","date_published":"2021-11-29T00:00:00Z","arxiv":1,"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2025-05-14T10:53:59Z","year":"2021","date_created":"2022-01-16T23:01:29Z","article_number":"34","doi":"10.4230/LIPIcs.FSTTCS.2021.34","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","corr_author":"1","quality_controlled":"1","file":[{"file_name":"2021_LIPIcs_Arrighi.pdf","content_type":"application/pdf","date_created":"2022-01-17T10:49:03Z","success":1,"creator":"cchlebak","file_id":"10634","file_size":844224,"date_updated":"2022-01-17T10:49:03Z","access_level":"open_access","relation":"main_file","checksum":"d5a82ba893c3bc5da5914edbb3efb92b"}],"has_accepted_license":"1","ddc":["000"],"conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2021-12-15","location":"Virtual","end_date":"2021-12-17"},"author":[{"last_name":"Arrighi","first_name":"Emmanuel","full_name":"Arrighi, Emmanuel"},{"full_name":"Fernau, Henning","first_name":"Henning","last_name":"Fernau"},{"full_name":"Hoffmann, Stefan","last_name":"Hoffmann","first_name":"Stefan"},{"full_name":"Holzer, Markus","first_name":"Markus","last_name":"Holzer"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","first_name":"Ismael R","last_name":"Jecker"},{"full_name":"De Oliveira Oliveira, Mateus","first_name":"Mateus","last_name":"De Oliveira Oliveira"},{"full_name":"Wolf, Petra","last_name":"Wolf","first_name":"Petra"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":213,"article_processing_charge":"No","abstract":[{"text":"In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all automata accept a language from the level B_1. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC^0 when restricted to level L_0; complete for L or NL, depending on the input representation, when restricted to languages in the level L_{1/2}; NP-complete when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally, PSPACE-complete when the input automata accept languages in level L_2 or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation.","lang":"eng"}],"external_id":{"arxiv":["2110.01279"]},"publication_status":"published","title":"On the complexity of intersection non-emptiness for star-free language classes"},{"author":[{"full_name":"Cherepanov, Igor","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","last_name":"Cherepanov","first_name":"Igor"},{"orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","full_name":"Bighin, Giacomo","first_name":"Giacomo","last_name":"Bighin"},{"full_name":"Schouder, Constant A.","first_name":"Constant A.","last_name":"Schouder"},{"last_name":"Chatterley","first_name":"Adam S.","full_name":"Chatterley, Adam S."},{"full_name":"Albrechtsen, Simon H.","last_name":"Albrechtsen","first_name":"Simon H."},{"first_name":"Alberto Viñas","last_name":"Muñoz","full_name":"Muñoz, Alberto Viñas"},{"last_name":"Christiansen","first_name":"Lars","full_name":"Christiansen, Lars"},{"first_name":"Henrik","last_name":"Stapelfeldt","full_name":"Stapelfeldt, Henrik"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":104,"title":"Excited rotational states of molecules in a superfluid","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We combine experimental and theoretical approaches to explore excited rotational states of molecules embedded in helium nanodroplets using CS2 and I2 as examples. Laser-induced nonadiabatic molecular alignment is employed to measure spectral lines for rotational states extending beyond those initially populated at the 0.37 K droplet temperature. We construct a simple quantum-mechanical model, based on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational energy structure in its entirety. The calculated and measured spectral lines are in good agreement. We show that the effect of the surrounding superfluid on molecular rotation can be rationalized by a single quantity, the angular momentum, transferred from the molecule to the droplet."}],"external_id":{"isi":["000739618300001"],"arxiv":["2107.00468"]},"publication_status":"published","issue":"6","doi":"10.1103/PhysRevA.104.L061303","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"publication":"Physical Review A","year":"2021","date_created":"2022-01-16T23:01:29Z","article_number":"L061303","main_file_link":[{"open_access":"1","url":"http://128.84.4.18/abs/2107.00468"}],"corr_author":"1","quality_controlled":"1","_id":"10631","scopus_import":"1","article_type":"original","oa_version":"Preprint","intvolume":"       104","acknowledgement":"I.C. acknowledges the support by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation through a Villum Investigator grant no. 25886.","type":"journal_article","language":[{"iso":"eng"}],"month":"12","date_published":"2021-12-30T00:00:00Z","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"arxiv":1,"date_updated":"2025-03-31T16:00:55Z","isi":1,"oa":1,"day":"30","status":"public","ec_funded":1,"citation":{"ieee":"I. Cherepanov <i>et al.</i>, “Excited rotational states of molecules in a superfluid,” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen, A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104 (2021).","ama":"Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>","ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states of molecules in a superfluid. Physical Review A. 104(6), L061303.","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt, and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>.","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen, S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>","mla":"Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>, vol. 104, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>."},"project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment"},{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"name":"A path-integral approach to composite impurities","call_identifier":"FWF","grant_number":"M02641","_id":"26986C82-B435-11E9-9278-68D0E5697425"}]},{"oa":1,"file_date_updated":"2022-01-17T11:15:26Z","month":"12","language":[{"iso":"eng"}],"date_published":"2021-12-15T00:00:00Z","publisher":"Peer Community In","arxiv":1,"department":[{"_id":"GradSch"},{"_id":"JoCs"}],"date_updated":"2025-05-14T11:23:19Z","article_type":"original","oa_version":"Published Version","intvolume":"         1","acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","type":"journal_article","_id":"10635","scopus_import":"1","citation":{"short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).","ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Peer Community In, 2021.","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>."},"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"15","article_processing_charge":"No","abstract":[{"text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing.","lang":"eng"}],"external_id":{"arxiv":["2009.03857"]},"publication_status":"published","title":"Nonlinear computations in spiking neural networks through multiplicative synapses","author":[{"full_name":"Nardin, Michele","orcid":"0000-0001-8849-6570","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","first_name":"Michele","last_name":"Nardin"},{"first_name":"James W.","last_name":"Phillips","full_name":"Phillips, James W."},{"first_name":"William F.","last_name":"Podlaski","full_name":"Podlaski, William F."},{"full_name":"Keemink, Sander W.","first_name":"Sander W.","last_name":"Keemink"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":1,"corr_author":"1","quality_controlled":"1","file":[{"content_type":"application/pdf","file_name":"10_24072_pcjournal_69.pdf","date_created":"2022-01-17T11:15:26Z","creator":"mnardin","success":1,"file_id":"10636","date_updated":"2022-01-17T11:15:26Z","file_size":3311494,"checksum":"cd9af6b331918608f2e3d1c7940cbf4f","relation":"main_file","access_level":"open_access"}],"has_accepted_license":"1","ddc":["519"],"year":"2021","date_created":"2022-01-17T11:12:40Z","article_number":"e68","publication_identifier":{"eissn":["2804-3871"]},"doi":"10.24072/pcjournal.69","publication":"Peer Community Journal"},{"page":"9","article_processing_charge":"No","oa":1,"abstract":[{"text":"The purpose of this application note is to demonstrate a working example of a superconducting qubit measurement in a Bluefors cryostat using the Keysight quantum control hardware. Our motivation is twofold. First, we provide pre-qualification data that the Bluefors cryostat, including filtering and wiring, can support long-lived qubits. Second, we demonstrate that the Keysight system (controlled using Labber) provides a straightforward solution to perform these characterization measurements. This document is intended as a brief guide for starting an experimental platform for testing superconducting qubits. The setup described here is an immediate jumping off point for a suite of applications including testing quantum logical gates, quantum optics with microwaves, or even using the qubit itself as a sensitive probe of local electromagnetic fields. Qubit measurements rely on high performance of both the physical sample environment and the measurement electronics. An overview of the cryogenic system is shown in Figure 1, and an overview of the integration between the electronics and cryostat (including wiring details) is shown in Figure 2.","lang":"eng"}],"publication_status":"published","month":"04","language":[{"iso":"eng"}],"title":"The Bluefors dilution refrigerator as an integrated quantum measurement system","keyword":["Application note"],"date_published":"2021-04-20T00:00:00Z","publisher":"Bluefors Oy","department":[{"_id":"JoFi"}],"date_updated":"2026-06-18T08:45:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","author":[{"first_name":"Russell","last_name":"Lake","full_name":"Lake, Russell"},{"full_name":"Simbierowicz, Slawomir","last_name":"Simbierowicz","first_name":"Slawomir"},{"full_name":"Krantz, Philip","first_name":"Philip","last_name":"Krantz"},{"first_name":"Farid","last_name":"Hassani","orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","full_name":"Hassani, Farid"},{"full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","last_name":"Fink"}],"type":"other_academic_publication","_id":"10644","citation":{"chicago":"Lake, Russell, Slawomir Simbierowicz, Philip Krantz, Farid Hassani, and Johannes M Fink. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","apa":"Lake, R., Simbierowicz, S., Krantz, P., Hassani, F., &#38; Fink, J. M. (2021). <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","mla":"Lake, Russell, et al. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Bluefors Oy, 2021.","ieee":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, and J. M. Fink, <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","short":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, J.M. Fink, The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","ista":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. 2021. The Bluefors dilution refrigerator as an integrated quantum measurement system, Helsinki, Finland: Bluefors Oy, 9p.","ama":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021."},"quality_controlled":"1","main_file_link":[{"url":"https://bluefors.com/blog/integrated-quantum-measurement-system/","open_access":"1"}],"ddc":["530"],"year":"2021","date_created":"2022-01-19T08:29:57Z","place":"Helsinki, Finland","alternative_title":["Bluefors Blog"],"day":"20","status":"public"},{"publisher":"Bluefors Oy","department":[{"_id":"JoFi"}],"date_updated":"2026-06-18T08:46:15Z","month":"06","language":[{"iso":"eng"}],"title":"Qubit energy-relaxation statistics in the Bluefors quantum measurement system","keyword":["Application note"],"date_published":"2021-06-03T00:00:00Z","abstract":[{"text":"Superconducting qubits have emerged as a highly versatile and useful platform for quantum technological applications [1]. Bluefors and Zurich Instruments have supported the growth of this field from the 2010s onwards by providing well-engineered and reliable measurement infrastructure [2]– [6]. Having a long and stable qubit lifetime is a critical system property. Therefore, considerable effort has already gone into measuring qubit energy-relaxation timescales and their fluctuations, see Refs. [7]–[10] among others. Accurately extracting the statistics of a quantum device requires users to perform time consuming measurements. One measurement challenge is that the detection of the state-dependent\r\nresponse of a superconducting resonator due to a dispersively-coupled qubit requires an inherently low signal level. Consequently, measurements must be performed using a microwave probe that contains only a few microwave photons. Improving the signal-to-noise ratio (SNR) by using near-quantum limited parametric amplifiers as well as the use of optimized signal processing enabled by efficient room temperature instrumentation help to reduce measurement time. An empirical observation for fixed frequency transmons from recent literature is that as the energy-relaxation time 𝑇𝑇1 increases, so do its natural temporal fluctuations [7], [10]. This necessitates many repeated measurements to understand the statistics (see for example, Ref. [10]). In addition, as state-of-the-art qubits increase in lifetime, longer\r\nmeasurement times are expected to obtain accurate statistics. As described below, the scaling of the widths of the qubit energy-relaxation distributions also reveal clues about the origin of the energy-relaxation.","lang":"eng"}],"oa":1,"publication_status":"published","page":"8","article_processing_charge":"No","_id":"10645","type":"other_academic_publication","author":[{"full_name":"Simbierowicz, Slawomir","last_name":"Simbierowicz","first_name":"Slawomir"},{"full_name":"Shi, Chunyan","first_name":"Chunyan","last_name":"Shi"},{"full_name":"Collodo, Michele","last_name":"Collodo","first_name":"Michele"},{"full_name":"Kirste, Moritz","last_name":"Kirste","first_name":"Moritz"},{"first_name":"Farid","last_name":"Hassani","orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","full_name":"Hassani, Farid"},{"orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M"},{"full_name":"Bylander, Jonas","last_name":"Bylander","first_name":"Jonas"},{"last_name":"Perez Lozano","first_name":"Daniel","full_name":"Perez Lozano, Daniel"},{"full_name":"Lake, Russell","first_name":"Russell","last_name":"Lake"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"main_file_link":[{"url":"https://bluefors.com/blog/application-note-qubit-energy-relaxation-statistics-bluefors-quantum-measurement-system/","open_access":"1"}],"quality_controlled":"1","citation":{"ama":"Simbierowicz S, Shi C, Collodo M, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021.","ista":"Simbierowicz S, Shi C, Collodo M, Kirste M, Hassani F, Fink JM, Bylander J, Perez Lozano D, Lake R. 2021. Qubit energy-relaxation statistics in the Bluefors quantum measurement system, Helsinki, Finland: Bluefors Oy, 8p.","short":"S. Simbierowicz, C. Shi, M. Collodo, M. Kirste, F. Hassani, J.M. Fink, J. Bylander, D. Perez Lozano, R. Lake, Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","ieee":"S. Simbierowicz <i>et al.</i>, <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","mla":"Simbierowicz, Slawomir, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Bluefors Oy, 2021.","apa":"Simbierowicz, S., Shi, C., Collodo, M., Kirste, M., Hassani, F., Fink, J. M., … Lake, R. (2021). <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","chicago":"Simbierowicz, Slawomir, Chunyan Shi, Michele Collodo, Moritz Kirste, Farid Hassani, Johannes M Fink, Jonas Bylander, Daniel Perez Lozano, and Russell Lake. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021."},"day":"03","status":"public","alternative_title":["Bluefors Blog"],"place":"Helsinki, Finland","year":"2021","date_created":"2022-01-19T08:41:14Z"},{"isi":1,"oa":1,"file_date_updated":"2022-01-24T07:43:09Z","language":[{"iso":"eng"}],"month":"12","date_published":"2021-12-10T00:00:00Z","publisher":"Elsevier","department":[{"_id":"SaSi"},{"_id":"SiHi"}],"date_updated":"2025-04-14T07:41:46Z","article_type":"original","intvolume":"        23","oa_version":"Published Version","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 715571). The research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Bioimaging Facility, the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger and Michael Schunn for their animal colony management and support. We would also like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally, we would like to thank the Siegert team members for discussion about the manuscript.","type":"journal_article","_id":"10655","scopus_import":"1","citation":{"ama":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. 2021;23:210-224. doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>","ista":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. Molecular Therapy - Methods and Clinical Development. 23, 210–224.","ieee":"M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert, “Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment,” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23. Elsevier, pp. 210–224, 2021.","short":"M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular Therapy - Methods and Clinical Development 23 (2021) 210–224.","mla":"Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23, Elsevier, 2021, pp. 210–24, doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>.","chicago":"Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>.","apa":"Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., &#38; Siegert, S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>"},"project":[{"grant_number":"715571","_id":"25D4A630-B435-11E9-9278-68D0E5697425","name":"Microglia action towards neuronal circuit formation and function in health and disease","call_identifier":"H2020"}],"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"10","page":"210-224","article_processing_charge":"Yes","abstract":[{"text":"Adeno-associated viruses (AAVs) are widely used to deliver genetic material in vivo to distinct cell types such as neurons or glial cells, allowing for targeted manipulation. Transduction of microglia is mostly excluded from this strategy, likely due to the cells’ heterogeneous state upon environmental changes, which makes AAV design challenging. Here, we established the retina as a model system for microglial AAV validation and optimization. First, we show that AAV2/6 transduced microglia in both synaptic layers, where layer preference corresponds to the intravitreal or subretinal delivery method. Surprisingly, we observed significantly enhanced microglial transduction during photoreceptor degeneration. Thus, we modified the AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E, R576Q, K493S, and K459S), resulting in increased microglial transduction in the outer plexiform layer. Finally, to improve microglial-specific transduction, we validated a Cre-dependent transgene delivery cassette for use in combination with the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future studies optimizing AAV-mediated microglia transduction and highlight that environmental conditions influence microglial transduction efficiency.\r\n","lang":"eng"}],"external_id":{"isi":["000748748500019"]},"publication_status":"published","title":"Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Maes","first_name":"Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9642-1085","full_name":"Maes, Margaret E"},{"first_name":"Gabriele M.","last_name":"Wögenstein","full_name":"Wögenstein, Gabriele M."},{"last_name":"Colombo","first_name":"Gloria","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9434-8902","full_name":"Colombo, Gloria"},{"last_name":"Casado Polanco","first_name":"Raquel","full_name":"Casado Polanco, Raquel","id":"15240fc1-dbcd-11ea-9d1d-ac5a786425fd","orcid":"0000-0001-8293-4568"},{"last_name":"Siegert","first_name":"Sandra","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8635-0877","full_name":"Siegert, Sandra"}],"volume":23,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"corr_author":"1","quality_controlled":"1","file":[{"date_updated":"2022-01-24T07:43:09Z","file_size":4794147,"checksum":"77dc540e8011c5475031bdf6ccef20a6","relation":"main_file","access_level":"open_access","file_id":"10657","creator":"cchlebak","success":1,"content_type":"application/pdf","file_name":"2021_MolTherMethodsClinDev_Maes.pdf","date_created":"2022-01-24T07:43:09Z"}],"has_accepted_license":"1","ddc":["570"],"year":"2021","date_created":"2022-01-23T23:01:28Z","publication_identifier":{"eissn":["2329-0501"]},"doi":"10.1016/j.omtm.2021.09.006","publication":"Molecular Therapy - Methods and Clinical Development"},{"oa_version":"Published Version","intvolume":"       139","acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","type":"conference","_id":"10668","file_date_updated":"2022-01-26T07:38:32Z","oa":1,"date_published":"2021-07-01T00:00:00Z","language":[{"iso":"eng"}],"month":"07","date_updated":"2025-05-19T11:28:08Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"ML Research Press","arxiv":1,"tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"alternative_title":["PMLR"],"day":"01","status":"public","citation":{"ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press.","chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89."},"project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Babaiee, Zahra","last_name":"Babaiee","first_name":"Zahra"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":139,"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","article_processing_charge":"No","page":"478-489","external_id":{"arxiv":["2106.07091"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines."}],"title":"On-off center-surround receptive fields for accurate and robust image classification","date_created":"2022-01-25T15:46:33Z","year":"2021","publication_identifier":{"issn":["2640-3498"]},"publication":"Proceedings of the 38th International Conference on Machine Learning","file":[{"file_id":"10681","access_level":"open_access","relation":"main_file","checksum":"d30eae62561bb517d9f978437d7677db","file_size":4246561,"date_updated":"2022-01-26T07:38:32Z","date_created":"2022-01-26T07:38:32Z","file_name":"babaiee21a.pdf","content_type":"application/pdf","success":1,"creator":"mlechner"}],"quality_controlled":"1","has_accepted_license":"1","main_file_link":[{"url":"https://proceedings.mlr.press/v139/babaiee21a","open_access":"1"}],"conference":{"start_date":"2021-07-18","name":"ML: Machine Learning","location":"Virtual","end_date":"2021-07-24"},"ddc":["000"]},{"title":"The Civl verifier","abstract":[{"lang":"eng","text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier."}],"publication_status":"published","page":"143–152","article_processing_charge":"No","volume":2,"editor":[{"full_name":"Ruzica, Piskac","last_name":"Ruzica","first_name":"Piskac"},{"full_name":"Whalen, Michael W.","last_name":"Whalen","first_name":"Michael W."}],"author":[{"last_name":"Kragl","first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"end_date":"2021-10-22","location":"Virtual","start_date":"2021-10-20","name":"FMCAD: Formal Methods in Computer-Aided Design"},"ddc":["000"],"has_accepted_license":"1","quality_controlled":"1","file":[{"file_size":390555,"date_updated":"2022-01-26T08:04:29Z","access_level":"open_access","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","relation":"main_file","file_id":"10689","success":1,"creator":"cchlebak","content_type":"application/pdf","file_name":"2021_FCAD2021_Kragl.pdf","date_created":"2022-01-26T08:04:29Z"}],"corr_author":"1","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","publication_identifier":{"isbn":["978-3-85448-046-4"]},"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","year":"2021","date_created":"2022-01-26T08:01:30Z","department":[{"_id":"ToHe"}],"publisher":"TU Wien Academic Press","date_updated":"2025-04-15T06:25:56Z","language":[{"iso":"eng"}],"month":"10","date_published":"2021-10-01T00:00:00Z","oa":1,"file_date_updated":"2022-01-26T08:04:29Z","_id":"10688","scopus_import":"1","type":"conference","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","oa_version":"Published Version","intvolume":"         2","project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"citation":{"short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"status":"public","day":"01","alternative_title":["Conference Series"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"date_created":"2022-01-27T12:11:23Z","year":"2021","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","doi":"10.1137/1.9781611976465.38","publication_identifier":{"isbn":["978-1-61197-646-5"]},"quality_controlled":"1","corr_author":"1","conference":{"start_date":"2021-01-10","name":"SODA: Symposium on Discrete Algorithms","end_date":"2021-01-13","location":"Virtual"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"editor":[{"full_name":"Marx, Dániel","first_name":"Dániel","last_name":"Marx"}],"author":[{"full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","first_name":"Ismael R","last_name":"Jecker"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","first_name":"Dorde"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["2005.06636"]},"publication_status":"published","abstract":[{"text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.","lang":"eng"}],"article_processing_charge":"No","page":"617-636","title":"Infinite-duration all-pay bidding games","ec_funded":1,"day":"01","status":"public","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"citation":{"ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>"},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","type":"conference","oa_version":"Preprint","scopus_import":"1","_id":"10694","oa":1,"date_updated":"2025-04-15T06:26:15Z","arxiv":1,"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Society for Industrial and Applied Mathematics","date_published":"2021-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01"},{"ec_funded":1,"status":"public","day":"31","project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"citation":{"short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>.","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>."},"type":"preprint","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","oa_version":"Preprint","_id":"10762","oa":1,"date_updated":"2026-04-07T14:20:12Z","arxiv":1,"department":[{"_id":"MiLe"}],"date_published":"2021-05-31T00:00:00Z","language":[{"iso":"eng"}],"month":"05","date_created":"2022-02-17T11:18:57Z","year":"2021","publication":"arXiv","doi":"10.48550/arXiv.2105.15193","corr_author":"1","main_file_link":[{"url":"https://arxiv.org/abs/2105.15193","open_access":"1"}],"author":[{"first_name":"Wojciech","last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech"},{"last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"last_name":"Mentink","first_name":"Johan H.","full_name":"Mentink, Johan H."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"10759","relation":"dissertation_contains"}]},"publication_status":"draft","external_id":{"arxiv":["2105.15193"]},"abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"article_processing_charge":"No","page":"2105.15193","title":"Artificial neural network states for non-additive systems"}]