[{"external_id":{"isi":["000521077300057"]},"day":"01","date_published":"2017-03-01T00:00:00Z","oa_version":"Submitted Version","status":"public","author":[{"first_name":"Maciej","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski"}],"doi":"10.4230/LIPIcs.STACS.2017.57","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:32Z","volume":66,"year":"2017","project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"}],"oa":1,"publication_identifier":{"issn":["18688969"]},"title":"Lower bounds on key derivation for square-friendly applications","article_processing_charge":"No","date_updated":"2023-09-20T11:23:15Z","_id":"1174","conference":{"location":"Hannover, Germany","name":"STACS: Symposium on Theoretical Aspects of Computer Science","end_date":"2017-03-11","start_date":"2017-03-08"},"abstract":[{"lang":"eng","text":"Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the &quot;RT-bound&quot;, extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a &quot;weak&quot; key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for &quot;weak&quot; keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\\'13, CRYPTO\\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices."}],"language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"publist_id":"6180","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","quality_controlled":"1","alternative_title":["LIPIcs"],"citation":{"ista":"Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.","ieee":"M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.","short":"M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Skórski, Maciej. <i>Lower Bounds on Key Derivation for Square-Friendly Applications</i>. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>.","ama":"Skórski M. Lower bounds on key derivation for square-friendly applications. In: Vol 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>","chicago":"Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>.","apa":"Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>"},"publication_status":"published","intvolume":"        66","article_number":"57","isi":1,"month":"03","ec_funded":1,"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/volltexte/2017/6976"}],"type":"conference"},{"conference":{"start_date":"2017-01-09","end_date":"2017-01-11","name":"ITCS: Innovations in Theoretical Computer Science","location":"Berkeley, CA, United States"},"date_updated":"2021-01-12T06:48:51Z","_id":"1175","title":"Cumulative space in black-white pebbling and resolution","publication_identifier":{"issn":["18688969"]},"oa":1,"has_accepted_license":"1","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:50:33Z","volume":67,"doi":"10.4230/LIPIcs.ITCS.2017.38","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen"},{"full_name":"De Rezende, Susanna","first_name":"Susanna","last_name":"De Rezende"},{"last_name":"Nordstrom","full_name":"Nordstrom, Jakob","first_name":"Jakob"},{"first_name":"Marc","full_name":"Vinyals, Marc","last_name":"Vinyals"}],"status":"public","oa_version":"Published Version","date_published":"2017-01-01T00:00:00Z","day":"01","ddc":["005","600"],"type":"conference","page":"38:1-38-21","month":"01","intvolume":"        67","pubrep_id":"927","publication_status":"published","quality_controlled":"1","alternative_title":["LIPIcs"],"citation":{"ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","mla":"Alwen, Joel F., et al. <i>Cumulative Space in Black-White Pebbling and Resolution</i>. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>.","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., &#38; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>"},"file_date_updated":"2020-07-14T12:44:37Z","file":[{"access_level":"open_access","creator":"system","content_type":"application/pdf","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_id":"5263","relation":"main_file","date_updated":"2020-07-14T12:44:37Z","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","date_created":"2018-12-12T10:17:11Z","file_size":557769}],"scopus_import":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"publist_id":"6179","language":[{"iso":"eng"}],"editor":[{"full_name":"Papadimitriou, Christos","first_name":"Christos","last_name":"Papadimitriou"}],"abstract":[{"lang":"eng","text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation.  Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure."}]},{"external_id":{"isi":["000424197300011"]},"date_published":"2017-07-03T00:00:00Z","day":"03","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F"},{"last_name":"Blocki","full_name":"Blocki, Jeremiah","first_name":"Jeremiah"}],"status":"public","oa_version":"Submitted Version","date_created":"2018-12-11T11:50:33Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1109/EuroSP.2017.47","year":"2017","publication_identifier":{"isbn":["978-150905761-0"]},"oa":1,"title":"Towards practical attacks on Argon2i and balloon hashing","article_processing_charge":"No","conference":{"end_date":"2017-04-28","start_date":"2017-04-26","location":"Paris, France","name":"EuroS&P: European Symposium on Security and Privacy"},"date_updated":"2023-09-20T11:22:25Z","_id":"1176","publist_id":"6178","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"abstract":[{"lang":"eng","text":"The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the \"paranoid\" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A."}],"scopus_import":"1","publisher":"IEEE","quality_controlled":"1","citation":{"ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>","chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>.","apa":"Alwen, J. F., &#38; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France: IEEE. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>","ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&#38;P: European Symposium on Security and Privacy, 7961977.","ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France, 2017.","mla":"Alwen, Joel F., and Jeremiah Blocki. <i>Towards Practical Attacks on Argon2i and Balloon Hashing</i>. 7961977, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>.","short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017."},"publication_status":"published","isi":1,"month":"07","article_number":"7961977","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/759"}],"type":"conference"},{"publication_identifier":{"issn":["00018708"]},"oa":1,"year":"2017","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"_id":"1180","date_updated":"2023-09-20T11:21:27Z","article_processing_charge":"No","title":"Algebraic vertices of non-convex polyhedra","date_published":"2017-02-21T00:00:00Z","day":"21","external_id":{"isi":["000409292900015"]},"volume":308,"date_created":"2018-12-11T11:50:34Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1016/j.aim.2016.12.026","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"full_name":"Bárány, Imre","first_name":"Imre","last_name":"Bárány"},{"last_name":"Robins","first_name":"Sinai","full_name":"Robins, Sinai"}],"status":"public","oa_version":"Submitted Version","ec_funded":1,"page":"627 - 644","month":"02","isi":1,"intvolume":"       308","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1508.07594","open_access":"1"}],"publication":"Advances in Mathematics","scopus_import":"1","publisher":"Academic Press","publist_id":"6173","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform."}],"publication_status":"published","citation":{"ama":"Akopyan A, Bárány I, Robins S. Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. 2017;308:627-644. doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>","chicago":"Akopyan, Arseniy, Imre Bárány, and Sinai Robins. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>.","apa":"Akopyan, A., Bárány, I., &#38; Robins, S. (2017). Algebraic vertices of non-convex polyhedra. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">https://doi.org/10.1016/j.aim.2016.12.026</a>","ieee":"A. Akopyan, I. Bárány, and S. Robins, “Algebraic vertices of non-convex polyhedra,” <i>Advances in Mathematics</i>, vol. 308. Academic Press, pp. 627–644, 2017.","ista":"Akopyan A, Bárány I, Robins S. 2017. Algebraic vertices of non-convex polyhedra. Advances in Mathematics. 308, 627–644.","short":"A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.","mla":"Akopyan, Arseniy, et al. “Algebraic Vertices of Non-Convex Polyhedra.” <i>Advances in Mathematics</i>, vol. 308, Academic Press, 2017, pp. 627–44, doi:<a href=\"https://doi.org/10.1016/j.aim.2016.12.026\">10.1016/j.aim.2016.12.026</a>."},"quality_controlled":"1"},{"related_material":{"record":[{"status":"public","id":"3238","relation":"earlier_version"}]},"_id":"1187","date_updated":"2023-09-20T11:20:58Z","title":"Efficient authentication from hard learning problems","article_processing_charge":"No","oa":1,"has_accepted_license":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"},{"call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"year":"2017","volume":30,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:37Z","doi":"10.1007/s00145-016-9247-3","author":[{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"first_name":"Daniele","full_name":"Venturi, Daniele","last_name":"Venturi"},{"last_name":"Cash","first_name":"David","full_name":"Cash, David"},{"last_name":"Jain","first_name":"Abhishek","full_name":"Jain, Abhishek"}],"status":"public","oa_version":"Submitted Version","date_published":"2017-10-01T00:00:00Z","day":"01","external_id":{"isi":["000410788600007"]},"type":"journal_article","ddc":["000"],"issue":"4","ec_funded":1,"page":"1238 - 1275","isi":1,"month":"10","intvolume":"        30","publication_status":"published","article_type":"original","citation":{"mla":"Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>.","short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.","ista":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.","ieee":"E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” <i>Journal of Cryptology</i>, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.","apa":"Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &#38; Jain, A. (2017). Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>.","ama":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. 2017;30(4):1238-1275. doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>"},"quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:44:37Z","file_name":"2017_JournalCrypto_Kiltz.pdf","file_size":516959,"date_created":"2020-05-14T16:30:17Z","relation":"main_file","file_id":"7843","access_level":"open_access","creator":"dernst","content_type":"application/pdf","checksum":"c647520d115b772a1682fc06fa273eb1"}],"publication":"Journal of Cryptology","file_date_updated":"2020-07-14T12:44:37Z","scopus_import":"1","publisher":"Springer","department":[{"_id":"KrPi"}],"publist_id":"6166","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol."}]},{"doi":"10.1007/s11538-016-0244-3","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:50:38Z","volume":79,"oa_version":"Preprint","author":[{"last_name":"Kollár","first_name":"Richard","full_name":"Kollár, Richard"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","last_name":"Novak","first_name":"Sebastian","full_name":"Novak, Sebastian","orcid":"0000-0002-2519-824X"}],"status":"public","day":"01","date_published":"2017-03-01T00:00:00Z","date_updated":"2025-05-28T11:42:46Z","_id":"1191","title":"Existence of traveling waves for the generalized F–KPP equation","oa":1,"acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","year":"2017","project":[{"call_identifier":"FP7","grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"publication_status":"published","quality_controlled":"1","citation":{"short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>.","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” <i>Bulletin of Mathematical Biology</i>, vol. 79, no. 3. Springer, pp. 525–559, 2017.","ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” <i>Bulletin of Mathematical Biology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>.","apa":"Kollár, R., &#38; Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11538-016-0244-3\">https://doi.org/10.1007/s11538-016-0244-3</a>","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. <i>Bulletin of Mathematical Biology</i>. 2017;79(3):525-559. doi:<a href=\"https://doi.org/10.1007/s11538-016-0244-3\">10.1007/s11538-016-0244-3</a>"},"publisher":"Springer","scopus_import":1,"publication":"Bulletin of Mathematical Biology","abstract":[{"text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.","lang":"eng"}],"publist_id":"6160","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1607.00944","open_access":"1"}],"page":"525-559","ec_funded":1,"issue":"3","intvolume":"        79","month":"03"},{"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"page":"307 - 326","ec_funded":1,"isi":1,"month":"01","publication_status":"published","quality_controlled":"1","citation":{"apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>","mla":"Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326."},"publisher":"SIAM","abstract":[{"text":"The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"VlKo"}],"publist_id":"6159","date_updated":"2023-09-20T11:20:26Z","_id":"1192","related_material":{"record":[{"status":"public","relation":"later_version","id":"6032"}]},"conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Barcelona, Spain","start_date":"2017-01-16","end_date":"2017-01019"},"title":"Even delta-matroids and the complexity of planar Boolean CSPs","article_processing_charge":"No","oa":1,"publication_identifier":{"isbn":["978-161197478-2"]},"project":[{"call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"year":"2017","doi":"10.1137/1.9781611974782.20","date_created":"2018-12-11T11:50:38Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","author":[{"full_name":"Kazda, Alexandr","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","last_name":"Kazda"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal","first_name":"Michal"}],"status":"public","day":"01","date_published":"2017-01-01T00:00:00Z","external_id":{"isi":["000426965800020"]}},{"page":"145 - 160","ec_funded":1,"issue":"1","intvolume":"        52","month":"01","isi":1,"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1611.01063","open_access":"1"}],"publisher":"ACM","scopus_import":"1","abstract":[{"lang":"eng","text":"Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples. "}],"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"publist_id":"6157","publication_status":"published","alternative_title":["ACM SIGPLAN Notices"],"quality_controlled":"1","citation":{"chicago":"Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>.","apa":"Chatterjee, K., Novotný, P., &#38; Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. <a href=\"https://doi.org/10.1145/3009837.3009873\">https://doi.org/10.1145/3009837.3009873</a>","ama":"Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic termination. In: Vol 52. ACM; 2017:145-160. doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Invariants for Probabilistic Termination</i>. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:<a href=\"https://doi.org/10.1145/3009837.3009873\">10.1145/3009837.3009873</a>.","short":"K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.","ista":"Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52, 145–160.","ieee":"K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160."},"oa":1,"publication_identifier":{"issn":["07308566"]},"year":"2017","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-07-14T09:09:58Z","_id":"1194","related_material":{"record":[{"id":"14539","relation":"dissertation_contains","status":"public"}]},"conference":{"start_date":"2017-01-15","end_date":"2017-01-21","location":"Paris, France","name":"POPL: Principles of Programming Languages"},"article_processing_charge":"No","title":"Stochastic invariants for probabilistic termination","day":"01","date_published":"2017-01-01T00:00:00Z","external_id":{"isi":["000408311200013"]},"doi":"10.1145/3009837.3009873","date_created":"2018-12-11T11:50:39Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":52,"oa_version":"Submitted Version","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Petr","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"last_name":"Zikelic","first_name":"Djordje","full_name":"Zikelic, Djordje"}],"status":"public"},{"day":"01","date_published":"2017-02-01T00:00:00Z","external_id":{"isi":["000390637000011"]},"doi":"10.1016/j.nahs.2016.09.001","volume":23,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:39Z","oa_version":"None","status":"public","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund1 (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.\r\nA Technical Report of this article is available via: https://repository.ist.ac.at/171/","year":"2017","_id":"1196","date_updated":"2023-09-20T11:18:50Z","title":"Model measuring for discrete and hybrid systems","article_processing_charge":"No","publisher":"Elsevier","scopus_import":"1","publication":"Nonlinear Analysis: Hybrid Systems","abstract":[{"lang":"eng","text":"We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model."}],"publist_id":"6154","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publication_status":"published","citation":{"ista":"Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190.","ieee":"T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23. Elsevier, pp. 166–190, 2017.","short":"T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.","mla":"Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 23, Elsevier, 2017, pp. 166–90, doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>.","ama":"Henzinger TA, Otop J. Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. 2017;23:166-190. doi:<a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">10.1016/j.nahs.2016.09.001</a>","apa":"Henzinger, T. A., &#38; Otop, J. (2017). Model measuring for discrete and hybrid systems. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>","chicago":"Henzinger, Thomas A, and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.nahs.2016.09.001\">https://doi.org/10.1016/j.nahs.2016.09.001</a>."},"quality_controlled":"1","ec_funded":1,"page":"166 - 190","intvolume":"        23","isi":1,"month":"02","type":"journal_article"},{"external_id":{"isi":["000394280200007"]},"date_published":"2017-03-01T00:00:00Z","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","author":[{"full_name":"Moser, Thomas","first_name":"Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","last_name":"Moser"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:40Z","volume":107,"doi":"10.1007/s11005-016-0915-x","has_accepted_license":"1","year":"2017","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","project":[{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","call_identifier":"FWF"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication_identifier":{"issn":["03779017"]},"oa":1,"article_processing_charge":"Yes (via OA deal)","title":"Triviality of a model of particles with point interactions in the thermodynamic limit","related_material":{"record":[{"relation":"dissertation_contains","id":"52","status":"public"}]},"date_updated":"2023-09-20T11:18:13Z","_id":"1198","publist_id":"6152","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"abstract":[{"text":"We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles.","lang":"eng"}],"publication":"Letters in Mathematical Physics","file":[{"date_created":"2018-12-12T10:17:40Z","file_size":587207,"date_updated":"2020-07-14T12:44:38Z","file_name":"IST-2016-723-v1+1_s11005-016-0915-x.pdf","relation":"main_file","file_id":"5296","checksum":"c0c835def162c1bc52f978fad26e3c2f","content_type":"application/pdf","access_level":"open_access","creator":"system"}],"file_date_updated":"2020-07-14T12:44:38Z","scopus_import":"1","publisher":"Springer","quality_controlled":"1","citation":{"apa":"Moser, T., &#38; Seiringer, R. (2017). Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>","chicago":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s11005-016-0915-x\">https://doi.org/10.1007/s11005-016-0915-x</a>.","ama":"Moser T, Seiringer R. Triviality of a model of particles with point interactions in the thermodynamic limit. <i>Letters in Mathematical Physics</i>. 2017;107(3):533-552. doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>","short":"T. Moser, R. Seiringer, Letters in Mathematical Physics 107 (2017) 533–552.","mla":"Moser, Thomas, and Robert Seiringer. “Triviality of a Model of Particles with Point Interactions in the Thermodynamic Limit.” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3, Springer, 2017, pp. 533–52, doi:<a href=\"https://doi.org/10.1007/s11005-016-0915-x\">10.1007/s11005-016-0915-x</a>.","ieee":"T. Moser and R. Seiringer, “Triviality of a model of particles with point interactions in the thermodynamic limit,” <i>Letters in Mathematical Physics</i>, vol. 107, no. 3. Springer, pp. 533–552, 2017.","ista":"Moser T, Seiringer R. 2017. Triviality of a model of particles with point interactions in the thermodynamic limit. Letters in Mathematical Physics. 107(3), 533–552."},"publication_status":"published","isi":1,"month":"03","pubrep_id":"723","intvolume":"       107","issue":"3","page":" 533 - 552","ddc":["510","539"],"type":"journal_article"},{"external_id":{"isi":["000392229100011"]},"date_published":"2017-01-01T00:00:00Z","day":"01","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"status":"public","oa_version":"Submitted Version","volume":118,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:40Z","doi":"10.1038/hdy.2016.109","project":[{"grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"year":"2017","oa":1,"article_processing_charge":"No","title":"How does epistasis influence the response to selection?","related_material":{"record":[{"id":"9710","status":"public","relation":"research_data"}]},"_id":"1199","date_updated":"2025-05-28T11:42:47Z","department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"publist_id":"6151","abstract":[{"text":"Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects.","lang":"eng"}],"scopus_import":"1","publication":"Heredity","publisher":"Nature Publishing Group","citation":{"ama":"Barton NH. How does epistasis influence the response to selection? <i>Heredity</i>. 2017;118:96-109. doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>","apa":"Barton, N. H. (2017). How does epistasis influence the response to selection? <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>","chicago":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2016.109\">https://doi.org/10.1038/hdy.2016.109</a>.","ista":"Barton NH. 2017. How does epistasis influence the response to selection? Heredity. 118, 96–109.","ieee":"N. H. Barton, “How does epistasis influence the response to selection?,” <i>Heredity</i>, vol. 118. Nature Publishing Group, pp. 96–109, 2017.","mla":"Barton, Nicholas H. “How Does Epistasis Influence the Response to Selection?” <i>Heredity</i>, vol. 118, Nature Publishing Group, 2017, pp. 96–109, doi:<a href=\"https://doi.org/10.1038/hdy.2016.109\">10.1038/hdy.2016.109</a>.","short":"N.H. Barton, Heredity 118 (2017) 96–109."},"quality_controlled":"1","publication_status":"published","isi":1,"month":"01","intvolume":"       118","ec_funded":1,"page":"96 - 109","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5176114/"}],"type":"journal_article"},{"citation":{"ama":"Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. 2017;349(3):947-990. doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2017). Local law of addition of random matrices on optimal scale. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00220-016-2805-6\">https://doi.org/10.1007/s00220-016-2805-6</a>.","ista":"Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices on optimal scale. Communications in Mathematical Physics. 349(3), 947–990.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices on optimal scale,” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3. Springer, pp. 947–990, 2017.","short":"Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349 (2017) 947–990.","mla":"Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>, vol. 349, no. 3, Springer, 2017, pp. 947–90, doi:<a href=\"https://doi.org/10.1007/s00220-016-2805-6\">10.1007/s00220-016-2805-6</a>."},"quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"publist_id":"6141","department":[{"_id":"LaEr"}],"abstract":[{"text":"The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix.","lang":"eng"}],"publication":"Communications in Mathematical Physics","file":[{"relation":"main_file","file_size":1033743,"date_created":"2018-12-12T10:14:47Z","file_name":"IST-2016-722-v1+1_s00220-016-2805-6.pdf","date_updated":"2020-07-14T12:44:39Z","checksum":"ddff79154c3daf27237de5383b1264a9","content_type":"application/pdf","creator":"system","access_level":"open_access","file_id":"5102"}],"file_date_updated":"2020-07-14T12:44:39Z","scopus_import":"1","publisher":"Springer","type":"journal_article","ddc":["530"],"month":"02","isi":1,"pubrep_id":"722","intvolume":"       349","issue":"3","ec_funded":1,"page":"947 - 990","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","last_name":"Bao","first_name":"Zhigang","full_name":"Bao, Zhigang","orcid":"0000-0003-3036-1475"},{"first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"full_name":"Schnelli, Kevin","first_name":"Kevin","orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli"}],"status":"public","oa_version":"Published Version","volume":349,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:43Z","doi":"10.1007/s00220-016-2805-6","external_id":{"isi":["000393696700005"]},"date_published":"2017-02-01T00:00:00Z","day":"01","title":"Local law of addition of random matrices on optimal scale","article_processing_charge":"Yes (via OA deal)","_id":"1207","date_updated":"2023-09-20T11:16:57Z","has_accepted_license":"1","year":"2017","project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"publication_identifier":{"issn":["00103616"]},"oa":1},{"intvolume":"        79","isi":1,"month":"09","page":"1269 - 1292","issue":"4","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.5604"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ&gt;1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd."}],"publist_id":"6142","language":[{"iso":"eng"}],"department":[{"_id":"CaUh"}],"publisher":"Wiley-Blackwell","publication":"Journal of the Royal Statistical Society. Series B: Statistical Methodology","scopus_import":"1","citation":{"ama":"Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society Series B: Statistical Methodology</i>. 2017;79(4):1269-1292. doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>","apa":"Zwiernik, P., Uhler, C., &#38; Richards, D. (2017). Maximum likelihood estimation for linear Gaussian covariance models. <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>","chicago":"Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/rssb.12217\">https://doi.org/10.1111/rssb.12217</a>.","ista":"Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for linear Gaussian covariance models. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 79(4), 1269–1292.","ieee":"P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for linear Gaussian covariance models,” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292, 2017.","short":"P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society. Series B: Statistical Methodology 79 (2017) 1269–1292.","mla":"Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian Covariance Models.” <i>Journal of the Royal Statistical Society. Series B: Statistical Methodology</i>, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:<a href=\"https://doi.org/10.1111/rssb.12217\">10.1111/rssb.12217</a>."},"quality_controlled":"1","publication_status":"published","project":[{"name":"Gaussian Graphical Models: Theory and Applications","_id":"2530CA10-B435-11E9-9278-68D0E5697425","grant_number":"Y 903-N35","call_identifier":"FWF"}],"year":"2017","oa":1,"publication_identifier":{"issn":["13697412"]},"article_processing_charge":"No","title":"Maximum likelihood estimation for linear Gaussian covariance models","_id":"1208","date_updated":"2023-09-20T11:17:21Z","external_id":{"isi":["000411712300012"]},"day":"01","date_published":"2017-09-01T00:00:00Z","oa_version":"Submitted Version","status":"public","author":[{"full_name":"Zwiernik, Piotr","first_name":"Piotr","last_name":"Zwiernik"},{"orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","first_name":"Caroline","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Richards, Donald","first_name":"Donald","last_name":"Richards"}],"doi":"10.1111/rssb.12217","volume":79,"date_created":"2018-12-11T11:50:43Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","date_updated":"2021-01-12T06:49:07Z","_id":"1211","year":"2017","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","has_accepted_license":"1","oa":1,"oa_version":"Submitted Version","status":"public","author":[{"first_name":"Nazmi B","full_name":"Budanur, Nazmi B","orcid":"0000-0003-0423-5010","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur"},{"last_name":"Cvitanović","full_name":"Cvitanović, Predrag","first_name":"Predrag"}],"doi":"10.1007/s10955-016-1672-z","date_created":"2018-12-11T11:50:44Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":167,"day":"01","date_published":"2017-05-01T00:00:00Z","ddc":["530"],"type":"journal_article","pubrep_id":"782","intvolume":"       167","month":"05","page":"636-655","issue":"3-4","quality_controlled":"1","citation":{"ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. 2017;167(3-4):636-655. doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>","apa":"Budanur, N. B., &#38; Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>","chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10955-016-1672-z\">https://doi.org/10.1007/s10955-016-1672-z</a>.","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” <i>Journal of Statistical Physics</i>, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:<a href=\"https://doi.org/10.1007/s10955-016-1672-z\">10.1007/s10955-016-1672-z</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here."}],"publist_id":"6136","language":[{"iso":"eng"}],"department":[{"_id":"BjHo"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:44:39Z","publication":"Journal of Statistical Physics","file":[{"date_created":"2018-12-12T10:18:01Z","file_size":2820207,"file_name":"IST-2017-782-v1+1_BudCvi15.pdf","date_updated":"2020-07-14T12:44:39Z","relation":"main_file","file_id":"5319","content_type":"application/pdf","checksum":"3e971d09eb167761aa0888ed415b0056","creator":"system","access_level":"open_access"}],"scopus_import":1},{"type":"book_chapter","acknowledged_ssus":[{"_id":"Bio"}],"page":"355 - 370","ec_funded":1,"intvolume":"       137","month":"12","isi":1,"publication_status":"published","alternative_title":["Methods in Cell Biology"],"quality_controlled":"1","citation":{"mla":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” <i>Cytokinesis</i>, edited by Arnaud  Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>.","short":"N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press, 2017, pp. 355–370.","ieee":"N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers,” in <i>Cytokinesis</i>, vol. 137, A. Echard, Ed. Academic Press, 2017, pp. 355–370.","ista":"Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol. 137, 355–370.","chicago":"Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In <i>Cytokinesis</i>, edited by Arnaud  Echard, 137:355–70. Academic Press, 2017. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>.","apa":"Baranova, N. S., &#38; Loose, M. (2017). Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), <i>Cytokinesis</i> (Vol. 137, pp. 355–370). Academic Press. <a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">https://doi.org/10.1016/bs.mcb.2016.03.036</a>","ama":"Baranova NS, Loose M. Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. <i>Cytokinesis</i>. Vol 137. Academic Press; 2017:355-370. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2016.03.036\">10.1016/bs.mcb.2016.03.036</a>"},"publisher":"Academic Press","scopus_import":"1","publication":"Cytokinesis","abstract":[{"lang":"eng","text":"Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal structure that assembles at the site of division. Its primary component is FtsZ, a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various models for the role of FtsZ have been suggested. However, important information about the architecture and dynamics of FtsZ filaments during cytokinesis is still missing. One reason for this lack of knowledge has been the small size of bacteria, which has made it difficult to resolve the orientation and dynamics of individual FtsZ filaments in the Z-ring. While superresolution microscopy experiments have helped to gain more information about the organization of the Z-ring in the dividing cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize during assembly and disassembly of the Z-ring. In this chapter, we explain how to use an in vitro reconstitution approach to investigate the self-organization of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor FtsA. We show how to perform single-molecule experiments to study the behavior of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA filament network. We describe how to analyze the dynamics of single molecules and explain why this information can help to shed light onto possible mechanism of Z-ring constriction. We believe that similar experimental approaches will be useful to study the mechanism of membrane-based polymerization of other cytoskeletal systems, not only from prokaryotic but also eukaryotic origin."}],"editor":[{"last_name":"Echard","full_name":"Echard, Arnaud ","first_name":"Arnaud "}],"department":[{"_id":"MaLo"}],"publist_id":"6134","language":[{"iso":"eng"}],"date_updated":"2023-09-20T11:16:30Z","_id":"1213","title":"Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers","article_processing_charge":"No","publication_identifier":{"issn":["0091679X"]},"acknowledgement":"Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell).","year":"2017","project":[{"grant_number":"ALTF 2015-1163","name":"Synthesis of bacterial cell wall","_id":"2596EAB6-B435-11E9-9278-68D0E5697425"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"doi":"10.1016/bs.mcb.2016.03.036","date_created":"2018-12-11T11:50:45Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":137,"oa_version":"None","author":[{"full_name":"Baranova, Natalia","first_name":"Natalia","orcid":"0000-0002-3086-9124","id":"38661662-F248-11E8-B48F-1D18A9856A87","last_name":"Baranova"},{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","full_name":"Loose, Martin","first_name":"Martin","orcid":"0000-0001-7309-9724"}],"status":"public","day":"01","date_published":"2017-12-01T00:00:00Z","external_id":{"isi":["000403542900022"]}},{"volume":75,"date_created":"2018-12-11T11:45:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"}],"oa_version":"Published Version","date_published":"2017-12-27T00:00:00Z","day":"27","external_id":{"arxiv":["1608.04223"]},"conference":{"name":"COLT: Annual Conference on Learning Theory ","start_date":"2018-07-06","end_date":"2018-07-09"},"_id":"274","date_updated":"2023-10-17T12:32:13Z","title":"A faster approximation algorithm for the Gibbs partition function","article_processing_charge":"No","oa":1,"has_accepted_license":"1","project":[{"grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"year":"2017","publication_status":"published","citation":{"ama":"Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: <i>Proceedings of the 31st Conference On Learning Theory</i>. Vol 75. ML Research Press; 2017:228-249.","apa":"Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition function. In <i>Proceedings of the 31st Conference On Learning Theory</i> (Vol. 75, pp. 228–249). ML Research Press.","chicago":"Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” In <i>Proceedings of the 31st Conference On Learning Theory</i>, 75:228–49. ML Research Press, 2017.","ista":"Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory  vol. 75, 228–249.","ieee":"V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in <i>Proceedings of the 31st Conference On Learning Theory</i>, 2017, vol. 75, pp. 228–249.","mla":"Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” <i>Proceedings of the 31st Conference On Learning Theory</i>, vol. 75, ML Research Press, 2017, pp. 228–49.","short":"V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249."},"quality_controlled":"1","file_date_updated":"2020-07-14T12:45:45Z","publication":"Proceedings of the 31st Conference On Learning Theory","file":[{"relation":"main_file","file_name":"2018_PMLR_Kolmogorov.pdf","date_updated":"2020-07-14T12:45:45Z","file_size":408974,"date_created":"2020-05-12T09:23:27Z","creator":"dernst","access_level":"open_access","content_type":"application/pdf","checksum":"89db06a0e8083524449cb59b56bf4e5b","file_id":"7820"}],"publisher":"ML Research Press","language":[{"iso":"eng"}],"publist_id":"7628","department":[{"_id":"VlKo"}],"abstract":[{"lang":"eng","text":"We consider the problem of estimating the partition function Z(β)=∑xexp(−β(H(x)) of a Gibbs distribution with a Hamilton H(⋅), or more precisely the logarithm of the ratio q=lnZ(0)/Z(β). It has been recently shown how to approximate q with high probability assuming the existence of an oracle that produces samples from the Gibbs distribution for a given parameter value in [0,β]. The current best known approach due to Huber [9] uses O(qlnn⋅[lnq+lnlnn+ε−2]) oracle calls on average where ε is the desired accuracy of approximation and H(⋅) is assumed to lie in {0}∪[1,n]. We improve the complexity to O(qlnn⋅ε−2) oracle calls. We also show that the same complexity can be achieved if exact oracles are replaced with approximate sampling oracles that are within O(ε2qlnn) variation distance from exact oracles. Finally, we prove a lower bound of Ω(q⋅ε−2) oracle calls under a natural model of computation."}],"type":"conference","ddc":["510"],"arxiv":1,"ec_funded":1,"page":"228-249","month":"12","intvolume":"        75"},{"arxiv":1,"ddc":["530"],"type":"conference","intvolume":"       999","article_number":"012004","month":"07","issue":"1","quality_controlled":"1","alternative_title":["Journal of Physics: Conference Series"],"citation":{"ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for Wigner’s tunneling time. In: Vol 999. American Physical Society; 2017. doi:<a href=\"https://doi.org/10.1088/1742-6596/999/1/012004\">10.1088/1742-6596/999/1/012004</a>","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Hatsagortsyan, Thomas Pfeifer, Cristoph Keitel, and Robert Moshammer. “Experimental Evidence for Wigner’s Tunneling Time,” Vol. 999. American Physical Society, 2017. <a href=\"https://doi.org/10.1088/1742-6596/999/1/012004\">https://doi.org/10.1088/1742-6596/999/1/012004</a>.","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation: American Physical Society. <a href=\"https://doi.org/10.1088/1742-6596/999/1/012004\">https://doi.org/10.1088/1742-6596/999/1/012004</a>","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan K, Pfeifer T, Keitel C, Moshammer R. 2017. Experimental evidence for Wigner’s tunneling time. Annual International Laser Physics Workshop LPHYS, Journal of Physics: Conference Series, vol. 999, 012004.","ieee":"N. Camus <i>et al.</i>, “Experimental evidence for Wigner’s tunneling time,” presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation, 2017, vol. 999, no. 1.","mla":"Camus, Nicolas, et al. <i>Experimental Evidence for Wigner’s Tunneling Time</i>. Vol. 999, no. 1, 012004, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1088/1742-6596/999/1/012004\">10.1088/1742-6596/999/1/012004</a>.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K. Hatsagortsyan, T. Pfeifer, C. Keitel, R. Moshammer, in:, American Physical Society, 2017."},"publication_status":"published","abstract":[{"text":"Tunneling of a particle through a potential barrier remains one of the most remarkable quantum phenomena. Owing to advances in laser technology, electric fields comparable to those electrons experience in atoms are readily generated and open opportunities to dynamically investigate the process of electron tunneling through the potential barrier formed by the superposition of both laser and atomic fields. Attosecond-time and angstrom-space resolution of the strong laser-field technique allow to address fundamental questions related to tunneling, which are still open and debated: Which time is spent under the barrier and what momentum is picked up by the particle in the meantime? In this combined experimental and theoretical study we demonstrate that for strong-field ionization the leading quantum mechanical Wigner treatment for the time resolved description of tunneling is valid. We achieve a high sensitivity on the tunneling barrier and unambiguously isolate its effects by performing a differential study of two systems with almost identical tunneling geometry. Moreover, working with a low frequency laser, we essentially limit the non-adiabaticity of the process as a major source of uncertainty. The agreement between experiment and theory implies two substantial corrections with respect to the widely employed quasiclassical treatment: In addition to a non-vanishing longitudinal momentum along the laser field-direction we provide clear evidence for a non-zero tunneling time delay. This addresses also the fundamental question how the transition occurs from the tunnel barrier to free space classical evolution of the ejected electron.","lang":"eng"}],"department":[{"_id":"MiLe"}],"publist_id":"7552","language":[{"iso":"eng"}],"publisher":"American Physical Society","scopus_import":1,"file":[{"file_id":"5871","access_level":"open_access","creator":"dernst","checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","content_type":"application/pdf","date_updated":"2020-07-14T12:46:00Z","file_name":"2017_Physics_Camus.pdf","date_created":"2019-01-22T08:34:10Z","file_size":949321,"relation":"main_file"}],"file_date_updated":"2020-07-14T12:46:00Z","title":"Experimental evidence for Wigner's tunneling time","date_updated":"2023-02-23T12:36:07Z","_id":"313","related_material":{"record":[{"status":"public","id":"6013","relation":"later_version"}]},"conference":{"end_date":"2017-08-21","start_date":"2017-08-17","name":"Annual International Laser Physics Workshop LPHYS","location":"Kazan, Russian Federation"},"year":"2017","has_accepted_license":"1","oa":1,"publication_identifier":{"issn":["17426588"]},"oa_version":"Published Version","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"full_name":"Camus, Nicolas","first_name":"Nicolas","last_name":"Camus"},{"last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp","first_name":"Enderalp"},{"first_name":"Lutz","full_name":"Fechner, Lutz","last_name":"Fechner"},{"full_name":"Klaiber, Michael","first_name":"Michael","last_name":"Klaiber"},{"last_name":"Laux","full_name":"Laux, Martin","first_name":"Martin"},{"last_name":"Mi","first_name":"Yonghao","full_name":"Mi, Yonghao"},{"full_name":"Hatsagortsyan, Karen","first_name":"Karen","last_name":"Hatsagortsyan"},{"first_name":"Thomas","full_name":"Pfeifer, Thomas","last_name":"Pfeifer"},{"last_name":"Keitel","full_name":"Keitel, Cristoph","first_name":"Cristoph"},{"first_name":"Robert","full_name":"Moshammer, Robert","last_name":"Moshammer"}],"doi":"10.1088/1742-6596/999/1/012004","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:45:46Z","volume":999,"external_id":{"arxiv":["1611.03701"]},"day":"14","date_published":"2017-07-14T00:00:00Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"publist_id":"7399","abstract":[{"lang":"eng","text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b, d) such that the following holds. If F is a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤ i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced Z2-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these [d/2] first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map C*(K)→C*(Rd)."}],"editor":[{"last_name":"Loebl","full_name":"Loebl, Martin","first_name":"Martin"},{"full_name":"Nešetřil, Jaroslav","first_name":"Jaroslav","last_name":"Nešetřil"},{"last_name":"Thomas","full_name":"Thomas, Robin","first_name":"Robin"}],"scopus_import":1,"publication":"A Journey through Discrete Mathematics: A Tribute to Jiri Matousek","publisher":"Springer","series_title":"A Journey Through Discrete Mathematics","quality_controlled":"1","citation":{"mla":"Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin Loebl et al., Springer, 2017, pp. 407–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">10.1007/978-3-319-44479-6_17</a>.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J. Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, Springer, 2017, pp. 407–447.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. , 407–447.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly numbers via betti numbers,” in <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017, pp. 407–447.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers.” In <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin Loebl, Jaroslav Nešetřil, and Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">https://doi.org/10.1007/978-3-319-44479-6_17</a>.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nešetřil, &#38; R. Thomas (Eds.), <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i> (pp. 407–447). Springer. <a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">https://doi.org/10.1007/978-3-319-44479-6_17</a>","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>. A Journey Through Discrete Mathematics. Springer; 2017:407-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">10.1007/978-3-319-44479-6_17</a>"},"publication_status":"published","month":"10","page":"407 - 447","main_file_link":[{"url":"https://arxiv.org/abs/1310.4613v3","open_access":"1"}],"type":"book_chapter","date_published":"2017-10-06T00:00:00Z","day":"06","status":"public","author":[{"last_name":"Goaoc","first_name":"Xavier","full_name":"Goaoc, Xavier"},{"last_name":"Paták","first_name":"Pavel","full_name":"Paták, Pavel"},{"last_name":"Patakova","first_name":"Zuzana","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683"},{"orcid":"0000-0002-1191-6714","first_name":"Martin","full_name":"Tancer, Martin","last_name":"Tancer"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli"}],"oa_version":"Published Version","date_created":"2018-12-11T11:46:24Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-319-44479-6_17","year":"2017","publication_identifier":{"isbn":["978-331944479-6"]},"oa":1,"title":"Bounding helly numbers via betti numbers","related_material":{"record":[{"id":"1512","relation":"earlier_version","status":"public"}]},"date_updated":"2024-02-28T12:59:37Z","_id":"424"},{"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Grubic, Demjan","first_name":"Demjan","last_name":"Grubic"},{"first_name":"Jerry","full_name":"Li, Jerry","last_name":"Li"},{"last_name":"Tomioka","full_name":"Tomioka, Ryota","first_name":"Ryota"},{"first_name":"Milan","full_name":"Vojnović, Milan","last_name":"Vojnović"}],"status":"public","oa_version":"Submitted Version","date_created":"2018-12-11T11:46:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":2017,"external_id":{"arxiv":["1610.02132"]},"date_published":"2017-01-01T00:00:00Z","day":"01","article_processing_charge":"No","title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","conference":{"end_date":"2017-12-09","start_date":"2017-12-04","name":"NIPS: Neural Information Processing System","location":"Long Beach, CA, United States"},"date_updated":"2023-10-17T11:48:03Z","_id":"431","year":"2017","publication_identifier":{"issn":["10495258"]},"oa":1,"quality_controlled":"1","alternative_title":["Advances in Neural Information Processing Systems"],"citation":{"ieee":"D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.","ista":"Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. 2017. QSGD: Communication-efficient SGD via gradient quantization and encoding. NIPS: Neural Information Processing System, Advances in Neural Information Processing Systems, vol. 2017, 1710–1721.","short":"D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information Processing Systems Foundation, 2017, pp. 1710–1721.","mla":"Alistarh, Dan-Adrian, et al. <i>QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding</i>. Vol. 2017, Neural Information Processing Systems Foundation, 2017, pp. 1710–21.","ama":"Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing Systems Foundation; 2017:1710-1721.","chicago":"Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,” 2017:1710–21. Neural Information Processing Systems Foundation, 2017.","apa":"Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., &#38; Vojnović, M. (2017). QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol. 2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States: Neural Information Processing Systems Foundation."},"publication_status":"published","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"publist_id":"7392","abstract":[{"text":"Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanks to its excellent scalability properties. A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating gradient updates between nodes; consequently, several lossy compresion heuristics have been proposed, by which nodes only communicate quantized gradients. Although effective in practice, these heuristics do not always converge. In this paper, we propose Quantized SGD (QSGD), a family of compression schemes with convergence guarantees and good practical performance. QSGD allows the user to smoothly trade off communication bandwidth and convergence time: nodes can adjust the number of bits sent per iteration, at the cost of possibly higher variance. We show that this trade-off is inherent, in the sense that improving it past some threshold would violate information-theoretic lower bounds. QSGD guarantees convergence for convex and non-convex objectives, under asynchrony, and can be extended to stochastic variance-reduced techniques. When applied to training deep neural networks for image classification and automated speech recognition, QSGD leads to significant reductions in end-to-end training time. For instance, on 16GPUs, we can train the ResNet-152 network to full accuracy on ImageNet 1.8 × faster than the full-precision variant. ","lang":"eng"}],"publisher":"Neural Information Processing Systems Foundation","main_file_link":[{"url":"https://arxiv.org/abs/1610.02132","open_access":"1"}],"arxiv":1,"type":"conference","month":"01","intvolume":"      2017","page":"1710-1721"},{"publication_status":"published","quality_controlled":"1","alternative_title":["PMLR Press"],"citation":{"mla":"Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” <i>Proceedings of Machine Learning Research</i>, vol. 70, ML Research Press, 2017, pp. 4035–43.","short":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.","ieee":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning,” in <i>Proceedings of Machine Learning Research</i>, Sydney, Australia, 2017, vol. 70, pp. 4035–4043.","ista":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. Proceedings of Machine Learning Research. ICML: International  Conference  on  Machine Learning, PMLR Press, vol. 70, 4035–4043.","chicago":"Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” In <i>Proceedings of Machine Learning Research</i>, 70:4035–43. ML Research Press, 2017.","apa":"Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., &#38; Zhang, C. (2017). ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In <i>Proceedings of Machine Learning Research</i> (Vol. 70, pp. 4035–4043). Sydney, Australia: ML Research Press.","ama":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In: <i>Proceedings of Machine Learning Research</i>. Vol 70. ML Research Press; 2017:4035-4043."},"file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:26Z","file_name":"2017_ICML_Zhang.pdf","date_created":"2019-01-22T08:23:58Z","file_size":849345,"access_level":"open_access","creator":"dernst","content_type":"application/pdf","checksum":"86156ba7f4318e47cef3eb9092593c10","file_id":"5869"}],"scopus_import":"1","publication":"Proceedings of Machine Learning Research","file_date_updated":"2020-07-14T12:46:26Z","publisher":"ML Research Press","publist_id":"7391","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"abstract":[{"text":"Recently there has been significant interest in training machine-learning models at low precision: by reducing precision, one can reduce computation and communication by one order of magnitude. We examine training at reduced precision, both from a theoretical and practical perspective, and ask: is it possible to train models at end-to-end low precision with provable guarantees? Can this lead to consistent order-of-magnitude speedups? We mainly focus on linear models, and the answer is yes for linear models. We develop a simple framework called ZipML based on one simple but novel strategy called double sampling. Our ZipML framework is able to execute training at low precision with no bias, guaranteeing convergence, whereas naive quanti- zation would introduce significant bias. We val- idate our framework across a range of applica- tions, and show that it enables an FPGA proto- type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision. We further de- velop a variance-optimal stochastic quantization strategy and show that it can make a significant difference in a variety of settings. When applied to linear models together with double sampling, we save up to another 1.7 × in data movement compared with uniform quantization. When training deep networks with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. ","lang":"eng"}],"ddc":["000"],"type":"conference","page":"4035 - 4043","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:26Z","volume":" 70","status":"public","author":[{"last_name":"Zhang","full_name":"Zhang, Hantian","first_name":"Hantian"},{"full_name":"Li, Jerry","first_name":"Jerry","last_name":"Li"},{"last_name":"Kara","full_name":"Kara, Kaan","first_name":"Kaan"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"first_name":"Ji","full_name":"Liu, Ji","last_name":"Liu"},{"first_name":"Ce","full_name":"Zhang, Ce","last_name":"Zhang"}],"oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","day":"01","conference":{"end_date":"2017-08-11","start_date":"2017-08-06","location":"Sydney, Australia","name":"ICML: International  Conference  on  Machine Learning"},"date_updated":"2023-10-17T12:31:15Z","_id":"432","title":"ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning","article_processing_charge":"No","publication_identifier":{"isbn":["978-151085514-4"]},"oa":1,"has_accepted_license":"1","year":"2017"}]