[{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"T. R. Sokolowski <i>et al.</i>, “eGFRD in all dimensions,” <i>The Journal of Chemical Physics</i>, vol. 150, no. 5. AIP Publishing, 2019.","chicago":"Sokolowski, Thomas R, Joris Paijmans, Laurens Bossen, Thomas Miedema, Martijn Wehrens, Nils B. Becker, Kazunari Kaizu, Koichi Takahashi, Marileen Dogterom, and Pieter Rein ten Wolde. “EGFRD in All Dimensions.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2019. <a href=\"https://doi.org/10.1063/1.5064867\">https://doi.org/10.1063/1.5064867</a>.","ama":"Sokolowski TR, Paijmans J, Bossen L, et al. eGFRD in all dimensions. <i>The Journal of Chemical Physics</i>. 2019;150(5). doi:<a href=\"https://doi.org/10.1063/1.5064867\">10.1063/1.5064867</a>","short":"T.R. Sokolowski, J. Paijmans, L. Bossen, T. Miedema, M. Wehrens, N.B. Becker, K. Kaizu, K. Takahashi, M. Dogterom, P.R. ten Wolde, The Journal of Chemical Physics 150 (2019).","mla":"Sokolowski, Thomas R., et al. “EGFRD in All Dimensions.” <i>The Journal of Chemical Physics</i>, vol. 150, no. 5, 054108, AIP Publishing, 2019, doi:<a href=\"https://doi.org/10.1063/1.5064867\">10.1063/1.5064867</a>.","apa":"Sokolowski, T. R., Paijmans, J., Bossen, L., Miedema, T., Wehrens, M., Becker, N. B., … ten Wolde, P. R. (2019). eGFRD in all dimensions. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5064867\">https://doi.org/10.1063/1.5064867</a>","ista":"Sokolowski TR, Paijmans J, Bossen L, Miedema T, Wehrens M, Becker NB, Kaizu K, Takahashi K, Dogterom M, ten Wolde PR. 2019. eGFRD in all dimensions. The Journal of Chemical Physics. 150(5), 054108."},"author":[{"last_name":"Sokolowski","orcid":"0000-0002-1287-3779","full_name":"Sokolowski, Thomas R","first_name":"Thomas R","id":"3E999752-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Paijmans","first_name":"Joris","full_name":"Paijmans, Joris"},{"last_name":"Bossen","full_name":"Bossen, Laurens","first_name":"Laurens"},{"last_name":"Miedema","first_name":"Thomas","full_name":"Miedema, Thomas"},{"last_name":"Wehrens","full_name":"Wehrens, Martijn","first_name":"Martijn"},{"first_name":"Nils B.","full_name":"Becker, Nils B.","last_name":"Becker"},{"last_name":"Kaizu","first_name":"Kazunari","full_name":"Kaizu, Kazunari"},{"first_name":"Koichi","full_name":"Takahashi, Koichi","last_name":"Takahashi"},{"full_name":"Dogterom, Marileen","first_name":"Marileen","last_name":"Dogterom"},{"last_name":"ten Wolde","full_name":"ten Wolde, Pieter Rein","first_name":"Pieter Rein"}],"oa":1,"date_updated":"2023-09-06T14:59:28Z","oa_version":"Preprint","department":[{"_id":"GaTk"}],"type":"journal_article","external_id":{"isi":["000458109300009"],"arxiv":["1708.09364"]},"_id":"7422","publication":"The Journal of Chemical Physics","volume":150,"article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1708.09364","open_access":"1"}],"year":"2019","date_created":"2020-01-30T10:34:36Z","quality_controlled":"1","title":"eGFRD in all dimensions","date_published":"2019-02-07T00:00:00Z","day":"07","publication_status":"published","isi":1,"month":"02","abstract":[{"lang":"eng","text":"Biochemical reactions often occur at low copy numbers but at once in crowded and diverse environments. Space and stochasticity therefore play an essential role in biochemical networks. Spatial-stochastic simulations have become a prominent tool for understanding how stochasticity at the microscopic level influences the macroscopic behavior of such systems. While particle-based models guarantee the level of detail necessary to accurately describe the microscopic dynamics at very low copy numbers, the algorithms used to simulate them typically imply trade-offs between computational efficiency and biochemical accuracy. eGFRD (enhanced Green’s Function Reaction Dynamics) is an exact algorithm that evades such trade-offs by partitioning the N-particle system into M ≤ N analytically tractable one- and two-particle systems; the analytical solutions (Green’s functions) then are used to implement an event-driven particle-based scheme that allows particles to make large jumps in time and space while retaining access to their state variables at arbitrary simulation times. Here we present “eGFRD2,” a new eGFRD version that implements the principle of eGFRD in all dimensions, thus enabling efficient particle-based simulation of biochemical reaction-diffusion processes in the 3D cytoplasm, on 2D planes representing membranes, and on 1D elongated cylinders representative of, e.g., cytoskeletal tracks or DNA; in 1D, it also incorporates convective motion used to model active transport. We find that, for low particle densities, eGFRD2 is up to 6 orders of magnitude faster than conventional Brownian dynamics. We exemplify the capabilities of eGFRD2 by simulating an idealized model of Pom1 gradient formation, which involves 3D diffusion, active transport on microtubules, and autophosphorylation on the membrane, confirming recent experimental and theoretical results on this system to hold under genuinely stochastic conditions."}],"doi":"10.1063/1.5064867","issue":"5","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"status":"public","language":[{"iso":"eng"}],"arxiv":1,"article_type":"original","article_number":"054108","intvolume":"       150","publisher":"AIP Publishing"},{"date_published":"2019-02-01T00:00:00Z","title":"Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles","quality_controlled":"1","date_created":"2020-01-30T10:36:50Z","year":"2019","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.05224"}],"volume":55,"article_processing_charge":"No","publication":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques","_id":"7423","external_id":{"arxiv":["1704.05224"],"isi":["000456070200013"]},"type":"journal_article","department":[{"_id":"LaEr"}],"oa_version":"Preprint","date_updated":"2023-09-06T14:58:39Z","oa":1,"author":[{"full_name":"Akemann, Gernot","first_name":"Gernot","last_name":"Akemann"},{"first_name":"Tomasz","full_name":"Checinski, Tomasz","last_name":"Checinski"},{"last_name":"Liu","id":"2F947E34-F248-11E8-B48F-1D18A9856A87","first_name":"Dangzheng","full_name":"Liu, Dangzheng"},{"full_name":"Strahov, Eugene","first_name":"Eugene","last_name":"Strahov"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Akemann G, Checinski T, Liu D, Strahov E. 2019. Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 55(1), 441–479.","mla":"Akemann, Gernot, et al. “Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated to Two Wishart Ensembles.” <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>, vol. 55, no. 1, Institute of Mathematical Statistics, 2019, pp. 441–79, doi:<a href=\"https://doi.org/10.1214/18-aihp888\">10.1214/18-aihp888</a>.","apa":"Akemann, G., Checinski, T., Liu, D., &#38; Strahov, E. (2019). Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-aihp888\">https://doi.org/10.1214/18-aihp888</a>","ama":"Akemann G, Checinski T, Liu D, Strahov E. Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>. 2019;55(1):441-479. doi:<a href=\"https://doi.org/10.1214/18-aihp888\">10.1214/18-aihp888</a>","short":"G. Akemann, T. Checinski, D. Liu, E. Strahov, Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 55 (2019) 441–479.","chicago":"Akemann, Gernot, Tomasz Checinski, Dangzheng Liu, and Eugene Strahov. “Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated to Two Wishart Ensembles.” <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>. Institute of Mathematical Statistics, 2019. <a href=\"https://doi.org/10.1214/18-aihp888\">https://doi.org/10.1214/18-aihp888</a>.","ieee":"G. Akemann, T. Checinski, D. Liu, and E. Strahov, “Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles,” <i>Annales de l’Institut Henri Poincaré, Probabilités et Statistiques</i>, vol. 55, no. 1. Institute of Mathematical Statistics, pp. 441–479, 2019."},"publisher":"Institute of Mathematical Statistics","intvolume":"        55","page":"441-479","article_type":"original","language":[{"iso":"eng"}],"arxiv":1,"status":"public","publication_identifier":{"issn":["0246-0203"]},"issue":"1","doi":"10.1214/18-aihp888","abstract":[{"text":"We compare finite rank perturbations of the following three ensembles of complex rectangular random matrices: First, a generalised Wishart ensemble with one random and two fixed correlation matrices introduced by Borodin and Péché, second, the product of two independent random matrices where one has correlated entries, and third, the case when the two random matrices become also coupled through a fixed matrix. The singular value statistics of all three ensembles is shown to be determinantal and we derive double contour integral representations for their respective kernels. Three different kernels are found in the limit of infinite matrix dimension at the origin of the spectrum. They depend on finite rank perturbations of the correlation and coupling matrices and are shown to be integrable. The first kernel (I) is found for two independent matrices from the second, and two weakly coupled matrices from the third ensemble. It generalises the Meijer G-kernel for two independent and uncorrelated matrices. The third kernel (III) is obtained for the generalised Wishart ensemble and for two strongly coupled matrices. It further generalises the perturbed Bessel kernel of Desrosiers and Forrester. Finally, kernel (II), found for the ensemble of two coupled matrices, provides an interpolation between the kernels (I) and (III), generalising previous findings of part of the authors.","lang":"eng"}],"month":"02","isi":1,"publication_status":"published","day":"01"},{"title":"On derived equivalences of k3 surfaces in positive characteristic","date_published":"2019-05-20T00:00:00Z","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2019","volume":24,"article_processing_charge":"No","publication":"Documenta Mathematica","date_created":"2020-02-02T23:01:06Z","ddc":["510"],"external_id":{"isi":["000517806400019"],"arxiv":["1809.08970"]},"scopus_import":"1","file_date_updated":"2020-07-14T12:47:58Z","_id":"7436","department":[{"_id":"TaHa"}],"file":[{"creator":"dernst","checksum":"9a1a64bd49ab03fa4f738fb250fc4f90","relation":"main_file","file_id":"7438","date_created":"2020-02-03T06:26:12Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:58Z","file_size":469730,"file_name":"2019_DocumMath_Srivastava.pdf"}],"date_updated":"2023-10-17T07:42:21Z","oa_version":"Published Version","oa":1,"author":[{"last_name":"Srivastava","first_name":"Tanya K","full_name":"Srivastava, Tanya K","id":"4D046628-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","citation":{"apa":"Srivastava, T. K. (2019). On derived equivalences of k3 surfaces in positive characteristic. <i>Documenta Mathematica</i>. EMS Press. <a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">https://doi.org/10.25537/dm.2019v24.1135-1177</a>","mla":"Srivastava, Tanya K. “On Derived Equivalences of K3 Surfaces in Positive Characteristic.” <i>Documenta Mathematica</i>, vol. 24, EMS Press, 2019, pp. 1135–77, doi:<a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">10.25537/dm.2019v24.1135-1177</a>.","ista":"Srivastava TK. 2019. On derived equivalences of k3 surfaces in positive characteristic. Documenta Mathematica. 24, 1135–1177.","chicago":"Srivastava, Tanya K. “On Derived Equivalences of K3 Surfaces in Positive Characteristic.” <i>Documenta Mathematica</i>. EMS Press, 2019. <a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">https://doi.org/10.25537/dm.2019v24.1135-1177</a>.","ama":"Srivastava TK. On derived equivalences of k3 surfaces in positive characteristic. <i>Documenta Mathematica</i>. 2019;24:1135-1177. doi:<a href=\"https://doi.org/10.25537/dm.2019v24.1135-1177\">10.25537/dm.2019v24.1135-1177</a>","short":"T.K. Srivastava, Documenta Mathematica 24 (2019) 1135–1177.","ieee":"T. K. Srivastava, “On derived equivalences of k3 surfaces in positive characteristic,” <i>Documenta Mathematica</i>, vol. 24. EMS Press, pp. 1135–1177, 2019."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publisher":"EMS Press","language":[{"iso":"eng"}],"arxiv":1,"intvolume":"        24","article_type":"original","page":"1135-1177","license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"For an ordinary K3 surface over an algebraically closed field of positive characteristic we show that every automorphism lifts to characteristic zero. Moreover, we show that the Fourier-Mukai partners of an ordinary K3 surface are in one-to-one correspondence with the Fourier-Mukai partners of the geometric generic fiber of its canonical lift. We also prove that the explicit counting formula for Fourier-Mukai partners of the K3 surfaces with Picard rank two and with discriminant equal to minus of a prime number, in terms of the class number of the prime, holds over a field of positive characteristic as well. We show that the image of the derived autoequivalence group of a K3 surface of finite height in the group of isometries of its crystalline cohomology has index at least two. Moreover, we provide a conditional upper bound on the kernel of this natural cohomological descent map. Further, we give an extended remark in the appendix on the possibility of an F-crystal structure on the crystalline cohomology of a K3 surface over an algebraically closed field of positive characteristic and show that the naive F-crystal structure fails in being compatible with inner product. "}],"doi":"10.25537/dm.2019v24.1135-1177","status":"public","publication_identifier":{"eissn":["1431-0643"],"issn":["1431-0635"]},"publication_status":"published","day":"20","month":"05","isi":1},{"arxiv":1,"language":[{"iso":"eng"}],"page":"12481-12512","publisher":"IMLS","day":"01","publication_status":"published","isi":1,"month":"06","abstract":[{"text":"Most of today's distributed machine learning systems assume reliable networks: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: Can we design machine learning systems that are tolerant to network unreliability during training? With this motivation, we focus on a theoretical problem of independent interest-given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability p of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of parameter servers. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable.","lang":"eng"}],"publication_identifier":{"isbn":["9781510886988"]},"status":"public","publication":"36th International Conference on Machine Learning, ICML 2019","volume":"2019-June","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1810.07766","open_access":"1"}],"year":"2019","date_created":"2020-02-02T23:01:06Z","quality_controlled":"1","title":"Distributed learning over unreliable networks","date_published":"2019-06-01T00:00:00Z","conference":{"start_date":"2019-06-10","location":"Long Beach, CA, United States","end_date":"2019-06-15","name":"ICML: International Conference on Machine Learning"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"C. Yu <i>et al.</i>, “Distributed learning over unreliable networks,” in <i>36th International Conference on Machine Learning, ICML 2019</i>, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.","chicago":"Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In <i>36th International Conference on Machine Learning, ICML 2019</i>, 2019–June:12481–512. IMLS, 2019.","ama":"Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: <i>36th International Conference on Machine Learning, ICML 2019</i>. Vol 2019-June. IMLS; 2019:12481-12512.","short":"C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.","mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” <i>36th International Conference on Machine Learning, ICML 2019</i>, vol. 2019–June, IMLS, 2019, pp. 12481–512.","apa":"Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., … Liu, J. (2019). Distributed learning over unreliable networks. In <i>36th International Conference on Machine Learning, ICML 2019</i> (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.","ista":"Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu J. 2019. Distributed learning over unreliable networks. 36th International Conference on Machine Learning, ICML 2019. ICML: International Conference on Machine Learning vol. 2019–June, 12481–12512."},"oa":1,"author":[{"last_name":"Yu","full_name":"Yu, Chen","first_name":"Chen"},{"last_name":"Tang","first_name":"Hanlin","full_name":"Tang, Hanlin"},{"first_name":"Cedric","full_name":"Renggli, Cedric","last_name":"Renggli"},{"last_name":"Kassing","first_name":"Simon","full_name":"Kassing, Simon"},{"full_name":"Singla, Ankit","first_name":"Ankit","last_name":"Singla"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Zhang","first_name":"Ce","full_name":"Zhang, Ce"},{"full_name":"Liu, Ji","first_name":"Ji","last_name":"Liu"}],"oa_version":"Preprint","date_updated":"2023-09-06T15:21:48Z","department":[{"_id":"DaAl"}],"type":"conference","scopus_import":"1","external_id":{"arxiv":["1810.07766"],"isi":["000684034307036"]},"_id":"7437"},{"abstract":[{"text":"We prove that the observable telegraph signal accompanying the bistability in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings model is the finite-size precursor of what in the thermodynamic limit is a genuine first-order phase transition. We construct a finite-size scaling of the system parameters to a well-defined thermodynamic limit, in which the system remains the same microscopic system, but the telegraph signal becomes macroscopic both in its timescale and intensity. The existence of such a finite-size scaling completes and justifies the classification of the photon-blockade-breakdown effect as a first-order dissipative quantum phase transition.","lang":"eng"}],"doi":"10.22331/q-2019-06-03-150","publication_identifier":{"issn":["2521-327X"]},"status":"public","day":"03","publication_status":"published","isi":1,"month":"06","publisher":"Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften","language":[{"iso":"eng"}],"arxiv":1,"article_type":"original","article_number":"150","intvolume":"         3","file_date_updated":"2020-07-14T12:47:58Z","external_id":{"arxiv":["1809.09737"],"isi":["000469987500004"]},"_id":"7451","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Vukics, A., et al. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” <i>Quantum</i>, vol. 3, 150, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019, doi:<a href=\"https://doi.org/10.22331/q-2019-06-03-150\">10.22331/q-2019-06-03-150</a>.","apa":"Vukics, A., Dombi, A., Fink, J. M., &#38; Domokos, P. (2019). Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. <a href=\"https://doi.org/10.22331/q-2019-06-03-150\">https://doi.org/10.22331/q-2019-06-03-150</a>","ista":"Vukics A, Dombi A, Fink JM, Domokos P. 2019. Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. Quantum. 3, 150.","ieee":"A. Vukics, A. Dombi, J. M. Fink, and P. Domokos, “Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition,” <i>Quantum</i>, vol. 3. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019.","chicago":"Vukics, A., A. Dombi, Johannes M Fink, and P. Domokos. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2019. <a href=\"https://doi.org/10.22331/q-2019-06-03-150\">https://doi.org/10.22331/q-2019-06-03-150</a>.","ama":"Vukics A, Dombi A, Fink JM, Domokos P. Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition. <i>Quantum</i>. 2019;3. doi:<a href=\"https://doi.org/10.22331/q-2019-06-03-150\">10.22331/q-2019-06-03-150</a>","short":"A. Vukics, A. Dombi, J.M. Fink, P. Domokos, Quantum 3 (2019)."},"has_accepted_license":"1","author":[{"full_name":"Vukics, A.","first_name":"A.","last_name":"Vukics"},{"last_name":"Dombi","full_name":"Dombi, A.","first_name":"A."},{"last_name":"Fink","first_name":"Johannes M","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"},{"last_name":"Domokos","first_name":"P.","full_name":"Domokos, P."}],"oa":1,"oa_version":"Published Version","date_updated":"2023-09-07T14:57:39Z","file":[{"relation":"main_file","checksum":"26b9ba8f0155d183f1ee55295934a17f","creator":"dernst","file_name":"2019_Quantum_Vukics.pdf","file_size":5805248,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:58Z","access_level":"open_access","date_created":"2020-02-11T09:25:23Z","file_id":"7483"}],"department":[{"_id":"JoFi"}],"type":"journal_article","quality_controlled":"1","title":"Finite-size scaling of the photon-blockade breakdown dissipative quantum phase transition","date_published":"2019-06-03T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication":"Quantum","article_processing_charge":"No","volume":3,"year":"2019","ddc":["530"],"date_created":"2020-02-05T09:57:57Z"},{"publisher":"Springer Nature","language":[{"iso":"eng"}],"intvolume":"     10000","page":"452-477","doi":"10.1007/978-3-319-91908-9_22","abstract":[{"lang":"eng","text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement."}],"status":"public","publication_identifier":{"eissn":["0302-9743"],"issn":["1611-3349"],"isbn":["9783319919072"],"eisbn":["9783319919089"]},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","publication_status":"published","series_title":"LNCS","day":"05","alternative_title":["Lecture Notes in Computer Science"],"month":"10","date_published":"2019-10-05T00:00:00Z","title":"Continuous-time models for system design and analysis","project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"quality_controlled":"1","year":"2019","main_file_link":[{"url":"https://doi.org/10.1007/978-3-319-91908-9_22","open_access":"1"}],"article_processing_charge":"No","volume":10000,"publication":"Computing and Software Science","date_created":"2020-02-05T10:51:44Z","scopus_import":"1","_id":"7453","editor":[{"full_name":"Steffen, Bernhard","first_name":"Bernhard","last_name":"Steffen"},{"last_name":"Woeginger","first_name":"Gerhard","full_name":"Woeginger, Gerhard"}],"department":[{"_id":"ToHe"}],"date_updated":"2022-09-06T08:25:52Z","oa_version":"Published Version","author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Kim G.","full_name":"Larsen, Kim G.","last_name":"Larsen"},{"last_name":"Mikučionis","first_name":"Marius","full_name":"Mikučionis, Marius"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &#38; Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &#38; G. Woeginger (Eds.), <i>Computing and Software Science</i> (Vol. 10000, pp. 452–477). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>.","short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. <i>Computing and Software Science</i>. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:<a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">10.1007/978-3-319-91908-9_22</a>","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In <i>Computing and Software Science</i>, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-319-91908-9_22\">https://doi.org/10.1007/978-3-319-91908-9_22</a>.","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in <i>Computing and Software Science</i>, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477."},"type":"book_chapter"},{"language":[{"iso":"eng"}],"arxiv":1,"article_number":"11138-11147","publisher":"IEEE","day":"01","ec_funded":1,"publication_status":"published","isi":1,"month":"06","abstract":[{"lang":"eng","text":"We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems."}],"doi":"10.1109/CVPR.2019.01140","publication_identifier":{"isbn":["9781728132938"],"issn":["10636919"]},"status":"public","publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","volume":"2019-June","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05049"}],"year":"2019","date_created":"2020-02-09T23:00:52Z","quality_controlled":"1","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"title":"Map inference via block-coordinate Frank-Wolfe algorithm","date_published":"2019-06-01T00:00:00Z","conference":{"end_date":"2019-06-20","location":"Long Beach, CA, United States","start_date":"2019-06-15","name":"CVPR: Conference on Computer Vision and Pattern Recognition"},"citation":{"apa":"Swoboda, P., &#38; Kolmogorov, V. (2019). Map inference via block-coordinate Frank-Wolfe algorithm. In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i> (Vol. 2019–June). Long Beach, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>","mla":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, vol. 2019–June, 11138–11147, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>.","ista":"Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2019–June, 11138–11147.","ieee":"P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Long Beach, CA, United States, 2019, vol. 2019–June.","chicago":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Vol. 2019–June. IEEE, 2019. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>.","short":"P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019.","ama":"Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>. Vol 2019-June. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"full_name":"Swoboda, Paul","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"}],"oa_version":"Preprint","date_updated":"2023-09-07T14:54:24Z","department":[{"_id":"VlKo"}],"type":"conference","scopus_import":"1","external_id":{"arxiv":["1806.05049"],"isi":["000542649304076"]},"_id":"7468"},{"conference":{"start_date":"2019-10-27","location":"Seoul, Korea","end_date":"2019-11-02","name":"ICCV: International Conference on Computer Vision"},"project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"date_published":"2019-10-01T00:00:00Z","title":"Distillation-based training for multi-exit architectures","quality_controlled":"1","ddc":["000"],"date_created":"2020-02-11T09:06:57Z","year":"2019","publication":"IEEE International Conference on Computer Vision","article_processing_charge":"No","volume":"2019-October","_id":"7479","external_id":{"isi":["000531438101047"]},"file_date_updated":"2020-07-14T12:47:59Z","scopus_import":"1","type":"conference","date_updated":"2023-09-08T11:11:12Z","oa_version":"Submitted Version","file":[{"date_created":"2020-02-11T09:06:39Z","file_id":"7480","access_level":"open_access","file_size":735768,"date_updated":"2020-07-14T12:47:59Z","content_type":"application/pdf","file_name":"main.pdf","creator":"bphuong","relation":"main_file","checksum":"7b77fb5c2d27c4c37a7612ba46a66117"}],"department":[{"_id":"ChLa"}],"citation":{"ista":"Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures. IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision vol. 2019–October, 1355–1364.","mla":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” <i>IEEE International Conference on Computer Vision</i>, vol. 2019–October, IEEE, 2019, pp. 1355–64, doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>.","apa":"Phuong, M., &#38; Lampert, C. (2019). Distillation-based training for multi-exit architectures. In <i>IEEE International Conference on Computer Vision</i> (Vol. 2019–October, pp. 1355–1364). Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>","ieee":"M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,” in <i>IEEE International Conference on Computer Vision</i>, Seoul, Korea, 2019, vol. 2019–October, pp. 1355–1364.","ama":"Phuong M, Lampert C. Distillation-based training for multi-exit architectures. In: <i>IEEE International Conference on Computer Vision</i>. Vol 2019-October. IEEE; 2019:1355-1364. doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>","short":"M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision, IEEE, 2019, pp. 1355–1364.","chicago":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” In <i>IEEE International Conference on Computer Vision</i>, 2019–October:1355–64. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>."},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong","first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"publisher":"IEEE","page":"1355-1364","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["15505499"],"isbn":["9781728148038"]},"abstract":[{"text":"Multi-exit architectures, in which a stack of processing layers is interleaved with early output layers, allow the processing of a test example to stop early and thus save computation time and/or energy.  In this work, we propose a new training procedure for multi-exit architectures based on the principle of knowledge distillation. The method encourage searly exits to mimic later, more accurate exits, by matching their output probabilities.\r\nExperiments  on  CIFAR100  and  ImageNet  show  that distillation-based training significantly improves the accuracy of early exits while maintaining state-of-the-art accuracy  for  late  ones.   The  method  is  particularly  beneficial when  training  data  is  limited  and  it  allows  a  straightforward extension to semi-supervised learning,i.e. making use of unlabeled data at training time. Moreover, it takes only afew lines to implement and incurs almost no computational overhead at training time, and none at all at test time.","lang":"eng"}],"doi":"10.1109/ICCV.2019.00144","isi":1,"month":"10","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9418"}]},"publication_status":"published","day":"01","ec_funded":1},{"external_id":{"isi":["000248989500026"]},"scopus_import":"1","doi":"10.1016/B978-0-12-809633-8.90721-0","abstract":[{"text":"Social insects (i.e., ants, termites and the social bees and wasps) protect their colonies from disease using a combination of individual immunity and collectively performed defenses, termed social immunity. The first line of social immune defense is sanitary care, which is performed by colony members to protect their pathogen-exposed nestmates from developing an infection. If sanitary care fails and an infection becomes established, a second line of social immune defense is deployed to stop disease transmission within the colony and to protect the valuable queens, which together with the males are the reproductive individuals of the colony. Insect colonies are separated into these reproductive individuals and the sterile worker force, forming a superorganismal reproductive unit reminiscent of the differentiated germline and soma in a multicellular organism. Ultimately, the social immune response preserves the germline of the superorganism insect colony and increases overall fitness of the colony in case of disease. ","lang":"eng"}],"_id":"7513","status":"public","editor":[{"last_name":"Choe","first_name":"Jae","full_name":"Choe, Jae"}],"publication_identifier":{"eisbn":["9780128132524"],"isbn":["9780128132517"]},"department":[{"_id":"SyCr"}],"oa_version":"None","date_updated":"2023-09-08T11:12:04Z","publication_status":"published","author":[{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"},{"first_name":"Megan","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","full_name":"Kutzer, Megan","orcid":"0000-0002-8696-6978","last_name":"Kutzer"}],"citation":{"apa":"Cremer, S., &#38; Kutzer, M. (2019). Social immunity. In J. Choe (Ed.), <i>Encyclopedia of Animal Behavior</i> (2nd ed., pp. 747–755). Elsevier. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>","mla":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., Elsevier, 2019, pp. 747–55, doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>.","ista":"Cremer S, Kutzer M. 2019.Social immunity. In: Encyclopedia of Animal Behavior. , 747–755.","chicago":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” In <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., 747–55. Elsevier, 2019. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>.","short":"S. Cremer, M. Kutzer, in:, J. Choe (Ed.), Encyclopedia of Animal Behavior, 2nd ed., Elsevier, 2019, pp. 747–755.","ama":"Cremer S, Kutzer M. Social immunity. In: Choe J, ed. <i>Encyclopedia of Animal Behavior</i>. 2nd ed. Elsevier; 2019:747-755. doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>","ieee":"S. Cremer and M. Kutzer, “Social immunity,” in <i>Encyclopedia of Animal Behavior</i>, 2nd ed., J. Choe, Ed. Elsevier, 2019, pp. 747–755."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"06","month":"02","isi":1,"type":"book_chapter","date_published":"2019-02-06T00:00:00Z","title":"Social immunity","quality_controlled":"1","publisher":"Elsevier","edition":"2","year":"2019","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Encyclopedia of Animal Behavior","date_created":"2020-02-23T23:00:36Z","page":"747-755"},{"abstract":[{"lang":"eng","text":"We prove a lower bound for the free energy (per unit volume) of the two-dimensional Bose gas in the thermodynamic limit. We show that the free energy at density $\\rho$ and inverse temperature $\\beta$ differs from the one of the non-interacting system by the correction term $4 \\pi \\rho^2 |\\ln a^2 \\rho|^{-1} (2 - [1 - \\beta_{\\mathrm{c}}/\\beta]_+^2)$. Here $a$ is the scattering length of the interaction potential, $[\\cdot]_+ = \\max\\{ 0, \\cdot \\}$ and $\\beta_{\\mathrm{c}}$ is the inverse Berezinskii--Kosterlitz--Thouless critical temperature for superfluidity. The result is valid in the dilute limit\r\n$a^2\\rho \\ll 1$ and if $\\beta \\rho \\gtrsim 1$."}],"scopus_import":1,"status":"public","_id":"7524","publication_status":"draft","oa_version":"Preprint","date_updated":"2023-09-07T13:12:41Z","department":[{"_id":"RoSe"}],"day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Deuchert, Andreas, Simon Mayer, and Robert Seiringer. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” <i>ArXiv:1910.03372</i>. ArXiv, n.d.","ama":"Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. <i>arXiv:191003372</i>.","short":"A. Deuchert, S. Mayer, R. Seiringer, ArXiv:1910.03372 (n.d.).","ieee":"A. Deuchert, S. Mayer, and R. Seiringer, “The free energy of the two-dimensional dilute Bose gas. I. Lower bound,” <i>arXiv:1910.03372</i>. ArXiv.","apa":"Deuchert, A., Mayer, S., &#38; Seiringer, R. (n.d.). The free energy of the two-dimensional dilute Bose gas. I. Lower bound. <i>arXiv:1910.03372</i>. ArXiv.","mla":"Deuchert, Andreas, et al. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” <i>ArXiv:1910.03372</i>, ArXiv.","ista":"Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. arXiv:1910.03372, ."},"oa":1,"author":[{"last_name":"Deuchert","orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas","first_name":"Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87"},{"id":"30C4630A-F248-11E8-B48F-1D18A9856A87","full_name":"Mayer, Simon","first_name":"Simon","last_name":"Mayer"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"ec_funded":1,"type":"preprint","related_material":{"record":[{"relation":"later_version","id":"7790","status":"public"},{"status":"public","id":"7514","relation":"dissertation_contains"}]},"month":"10","project":[{"grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"date_published":"2019-10-08T00:00:00Z","title":"The free energy of the two-dimensional dilute Bose gas. I. Lower bound","publisher":"ArXiv","year":"2019","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.03372"}],"publication":"arXiv:1910.03372","language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2020-02-26T08:46:40Z","page":"61"},{"page":"927-938","intvolume":"        32","language":[{"iso":"eng"}],"arxiv":1,"publisher":"Neural Information Processing Systems Foundation","isi":1,"month":"12","day":"01","ec_funded":1,"publication_status":"published","publication_identifier":{"issn":["1049-5258"]},"status":"public","abstract":[{"text":"We present a novel class of convolutional neural networks (CNNs) for set functions,i.e., data indexed with the powerset of a finite set. The convolutions are derivedas linear, shift-equivariant functions for various notions of shifts on set functions.The framework is fundamentally different from graph convolutions based on theLaplacian, as it provides not one but several basic shifts, one for each element inthe ground set. Prototypical experiments with several set function classificationtasks on synthetic datasets and on datasets derived from real-world hypergraphsdemonstrate the potential of our new powerset CNNs.","lang":"eng"}],"date_created":"2020-02-28T10:03:24Z","article_processing_charge":"No","volume":32,"main_file_link":[{"open_access":"1","url":"http://papers.nips.cc/paper/8379-powerset-convolutional-neural-networks"}],"year":"2019","conference":{"name":"NIPS: Conference on Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2019-12-08","end_date":"2019-12-14"},"quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"title":"Powerset convolutional neural networks","date_published":"2019-12-01T00:00:00Z","type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Wendler C, Alistarh D-A, Püschel M. 2019. Powerset convolutional neural networks. NIPS: Conference on Neural Information Processing Systems vol. 32, 927–938.","mla":"Wendler, Chris, et al. <i>Powerset Convolutional Neural Networks</i>. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.","apa":"Wendler, C., Alistarh, D.-A., &#38; Püschel, M. (2019). Powerset convolutional neural networks (Vol. 32, pp. 927–938). Presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938.","ama":"Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.","short":"C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.","chicago":"Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019."},"oa":1,"author":[{"full_name":"Wendler, Chris","first_name":"Chris","last_name":"Wendler"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"last_name":"Püschel","full_name":"Püschel, Markus","first_name":"Markus"}],"oa_version":"Published Version","date_updated":"2023-09-08T11:13:52Z","department":[{"_id":"DaAl"}],"_id":"7542","external_id":{"arxiv":["1909.02253"],"isi":["000534424300084"]}},{"department":[{"_id":"JaMa"}],"date_updated":"2022-06-17T07:52:41Z","oa_version":"Preprint","author":[{"full_name":"Portinale, Lorenzo","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale"},{"last_name":"Stefanelli","first_name":"Ulisse","full_name":"Stefanelli, Ulisse"}],"oa":1,"citation":{"mla":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” <i>Advances in Mathematical Sciences and Applications</i>, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.","apa":"Portinale, L., &#38; Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. <i>Advances in Mathematical Sciences and Applications</i>. Gakko Tosho.","ista":"Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 28(2), 425–447.","ieee":"L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control problems for dissipative evolution,” <i>Advances in Mathematical Sciences and Applications</i>, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.","chicago":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” <i>Advances in Mathematical Sciences and Applications</i>. Gakko Tosho, 2019.","ama":"Portinale L, Stefanelli U. Penalization via global functionals of optimal-control problems for dissipative evolution. <i>Advances in Mathematical Sciences and Applications</i>. 2019;28(2):425-447.","short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","external_id":{"arxiv":["1910.10050"]},"_id":"7550","year":"2019","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1910.10050","open_access":"1"}],"article_processing_charge":"No","volume":28,"publication":"Advances in Mathematical Sciences and Applications","date_created":"2020-02-28T10:54:41Z","title":"Penalization via global functionals of optimal-control problems for dissipative evolution","date_published":"2019-10-22T00:00:00Z","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"quality_controlled":"1","publication_status":"published","acknowledgement":"This work is supported by Vienna Science and Technology Fund (WWTF) through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and I 2375.","day":"22","month":"10","issue":"2","abstract":[{"lang":"eng","text":"We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. "}],"status":"public","publication_identifier":{"issn":["1343-4373"]},"arxiv":1,"language":[{"iso":"eng"}],"intvolume":"        28","article_type":"original","page":"425-447","publisher":"Gakko Tosho"},{"abstract":[{"lang":"eng","text":"There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. "}],"external_id":{"arxiv":["1912.08579"]},"status":"public","_id":"7552","citation":{"ista":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:1912.08579, .","apa":"Bialek, W., Gregor, T., &#38; Tkačik, G. (n.d.). Action at a distance in transcriptional regulation. <i>arXiv:1912.08579</i>. ArXiv.","mla":"Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.” <i>ArXiv:1912.08579</i>, ArXiv.","ieee":"W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional regulation,” <i>arXiv:1912.08579</i>. ArXiv.","ama":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. <i>arXiv:191208579</i>.","short":"W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).","chicago":"Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance in Transcriptional Regulation.” <i>ArXiv:1912.08579</i>. ArXiv, n.d."},"day":"18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"William","full_name":"Bialek, William","last_name":"Bialek"},{"full_name":"Gregor, Thomas","first_name":"Thomas","last_name":"Gregor"},{"last_name":"Tkačik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","full_name":"Tkačik, Gašper"}],"oa":1,"oa_version":"Preprint","publication_status":"submitted","date_updated":"2021-01-12T08:14:09Z","department":[{"_id":"GaTk"}],"type":"preprint","month":"12","project":[{"_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P28844-B27","name":"Biophysics of information processing in gene regulation"}],"date_published":"2019-12-18T00:00:00Z","title":"Action at a distance in transcriptional regulation","publisher":"ArXiv","publication":"arXiv:1912.08579","arxiv":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.08579"}],"year":"2019","page":"5","date_created":"2020-02-28T10:57:08Z"},{"conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15","start_date":"2019-04-15","location":"Montreal, Canada"},"date_published":"2019-05-25T00:00:00Z","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","quality_controlled":"1","date_created":"2020-03-08T23:00:49Z","ddc":["000"],"year":"2019","volume":61,"article_processing_charge":"No","publication":"EPiC Series in Computing","_id":"7576","scopus_import":1,"file_date_updated":"2020-07-14T12:48:00Z","type":"conference","file":[{"relation":"main_file","checksum":"9138977a06fcd6a95976eb4bca875f0c","creator":"dernst","file_name":"2019_ARCH19_Immler.pdf","file_size":1934830,"content_type":"application/pdf","date_updated":"2020-07-14T12:48:00Z","access_level":"open_access","date_created":"2020-03-24T07:36:36Z","file_id":"7617"}],"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:14:17Z","oa_version":"Published Version","author":[{"full_name":"Immler, Fabian","first_name":"Fabian","last_name":"Immler"},{"full_name":"Althoff, Matthias","first_name":"Matthias","last_name":"Althoff"},{"last_name":"Benet","first_name":"Luis","full_name":"Benet, Luis"},{"full_name":"Chapoutot, Alexandre","first_name":"Alexandre","last_name":"Chapoutot"},{"first_name":"Xin","full_name":"Chen, Xin","last_name":"Chen"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"first_name":"Luca","full_name":"Geretti, Luca","last_name":"Geretti"},{"last_name":"Kochdumper","full_name":"Kochdumper, Niklas","first_name":"Niklas"},{"first_name":"David P.","full_name":"Sanders, David P.","last_name":"Sanders"},{"last_name":"Schilling","full_name":"Schilling, Christian","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065"}],"oa":1,"citation":{"chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 61:41–61. EasyChair Publications, 2019. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>.","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair Publications, 2019, pp. 41–61.","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair Publications; 2019:41-61. doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>","ieee":"F. Immler <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 41–61.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>","mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>.","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"EasyChair Publications","intvolume":"        61","page":"41-61","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"eissn":["23987340"]},"doi":"10.29007/m75b","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"month":"05","publication_status":"published","day":"25"},{"conference":{"start_date":"2019-08-25","location":"Visby, Sweden","end_date":"2019-08-28","name":"Information Theory Workshop"},"title":"A tight upper bound on mutual information","date_published":"2019-08-01T00:00:00Z","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"quality_controlled":"1","date_created":"2020-03-22T23:00:47Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.01475"}],"year":"2019","article_processing_charge":"No","publication":"IEEE Information Theory Workshop, ITW 2019","_id":"7606","external_id":{"isi":["000540384500015"],"arxiv":["1812.01475"]},"scopus_import":"1","type":"conference","department":[{"_id":"GaTk"}],"date_updated":"2025-06-30T13:21:05Z","oa_version":"Preprint","oa":1,"author":[{"id":"4171253A-F248-11E8-B48F-1D18A9856A87","full_name":"Hledik, Michal","first_name":"Michal","last_name":"Hledik"},{"id":"3E999752-F248-11E8-B48F-1D18A9856A87","full_name":"Sokolowski, Thomas R","first_name":"Thomas R","orcid":"0000-0002-1287-3779","last_name":"Sokolowski"},{"orcid":"0000-0002-6699-1455","first_name":"Gašper","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in <i>IEEE Information Theory Workshop, ITW 2019</i>, Visby, Sweden, 2019.","chicago":"Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>.","short":"M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019.","ama":"Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>","mla":"Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” <i>IEEE Information Theory Workshop, ITW 2019</i>, 8989292, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>.","apa":"Hledik, M., Sokolowski, T. R., &#38; Tkačik, G. (2019). A tight upper bound on mutual information. In <i>IEEE Information Theory Workshop, ITW 2019</i>. Visby, Sweden: IEEE. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>","ista":"Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information. IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292."},"publisher":"IEEE","article_number":"8989292","arxiv":1,"language":[{"iso":"eng"}],"status":"public","publication_identifier":{"isbn":["9781538669006"]},"doi":"10.1109/ITW44776.2019.8989292","abstract":[{"text":"We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound.","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"15020"}]},"month":"08","isi":1,"publication_status":"published","ec_funded":1,"day":"01"},{"scopus_import":"1","doi":"10.1109/ICCVW.2019.00097","abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) have become increasingly important due to their excellent empirical performance on a wide range of problems. However, regularization is generally achieved by indirect means, largely due to the complex set of functions defined by a network and the difficulty in measuring function complexity. There exists no method in the literature for additive regularization based on a norm of the function, as is classically considered in statistical learning theory. In this work, we study the tractability of function norms for deep neural networks with ReLU activations. We provide, to the best of our knowledge, the first proof in the literature of the NP-hardness of computing function norms of DNNs of 3 or more layers. We also highlight a fundamental difference between shallow and deep networks. In the light on these results, we propose a new regularization strategy based on approximate function norms, and show its efficiency on a segmentation task with a DNN."}],"external_id":{"isi":["000554591600090"]},"publication_identifier":{"isbn":["9781728150239"]},"_id":"7639","status":"public","author":[{"full_name":"Rannen-Triki, Amal","first_name":"Amal","last_name":"Rannen-Triki"},{"last_name":"Berman","full_name":"Berman, Maxim","first_name":"Maxim"},{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matthew B.","full_name":"Blaschko, Matthew B.","last_name":"Blaschko"}],"day":"01","citation":{"ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019.","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>.","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., &#38; Blaschko, M. B. (2019). Function norms for neural networks. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>","mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 748–752, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>.","ista":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"VlKo"}],"publication_status":"published","date_updated":"2023-09-08T11:19:12Z","oa_version":"None","month":"10","type":"conference","isi":1,"quality_controlled":"1","date_published":"2019-10-01T00:00:00Z","title":"Function norms for neural networks","publisher":"IEEE","conference":{"name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28","start_date":"2019-10-27","location":"Seoul, South Korea"},"language":[{"iso":"eng"}],"article_processing_charge":"No","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","year":"2019","date_created":"2020-04-05T22:00:50Z","article_number":"748-752"},{"publisher":"IEEE","article_number":"1749-1753","language":[{"iso":"eng"}],"arxiv":1,"status":"public","publication_identifier":{"isbn":["9781728150239"]},"abstract":[{"text":"We propose a new model for detecting visual relationships, such as \"person riding motorcycle\" or \"bottle on table\". This task is an important step towards comprehensive structured mage understanding, going beyond detecting individual objects. Our main novelty is a Box Attention mechanism that allows to model pairwise interactions between objects using standard object detection pipelines. The resulting model is conceptually clean, expressive and relies on well-justified training and prediction procedures. Moreover, unlike previously proposed approaches, our model does not introduce any additional complex components or hyperparameters on top of those already required by the underlying detection model. We conduct an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating strong quantitative and qualitative results.","lang":"eng"}],"doi":"10.1109/ICCVW.2019.00217","isi":1,"month":"10","publication_status":"published","day":"01","ec_funded":1,"conference":{"name":"ICCVW: International Conference on Computer Vision Workshop","end_date":"2019-10-28","location":"Seoul, South Korea","start_date":"2019-10-27"},"project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"title":"Detecting visual relationships using box attention","date_published":"2019-10-01T00:00:00Z","quality_controlled":"1","date_created":"2020-04-05T22:00:51Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.02136"}],"year":"2019","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","article_processing_charge":"No","_id":"7640","external_id":{"arxiv":["1807.02136"],"isi":["000554591601098"]},"scopus_import":"1","type":"conference","date_updated":"2023-09-08T11:18:37Z","oa_version":"Preprint","department":[{"_id":"ChLa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual relationships using box attention. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 1749–1753.","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 1749–1753, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., &#38; Ferrari, V. (2019). Detecting visual relationships using box attention. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>","ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>.","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019."},"author":[{"last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kuznetsova","first_name":"Alina","full_name":"Kuznetsova, Alina"},{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"},{"full_name":"Ferrari, Vittorio","first_name":"Vittorio","last_name":"Ferrari"}],"oa":1},{"language":[{"iso":"eng"}],"page":"778-806","intvolume":"        99","publisher":"Wiley","day":"01","publication_status":"published","month":"06","isi":1,"doi":"10.1112/jlms.12193","publist_id":"8052","abstract":[{"lang":"eng","text":"In this paper, we introduce a quantum version of the wonderful compactification of a group as a certain noncommutative projective scheme. Our approach stems from the fact that the wonderful compactification encodes the asymptotics of matrix coefficients, and from its realization as a GIT quotient of the Vinberg semigroup. In order to define the wonderful compactification for a quantum group, we adopt a generalized formalism of Proj categories in the spirit of Artin and Zhang. Key to our construction is a quantum version of the Vinberg semigroup, which we define as a q-deformation of a certain Rees algebra, compatible with a standard Poisson structure. Furthermore, we discuss quantum analogues of the stratification of the wonderful compactification by orbits for a certain group action, and provide explicit computations in the case of SL2."}],"issue":"3","status":"public","article_processing_charge":"Yes (via OA deal)","volume":99,"publication":"Journal of the London Mathematical Society","year":"2019","date_created":"2018-12-11T11:44:06Z","ddc":["510"],"quality_controlled":"1","date_published":"2019-06-01T00:00:00Z","title":"The wonderful compactification for quantum groups","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"author":[{"last_name":"Ganev","first_name":"Iordan V","id":"447491B8-F248-11E8-B48F-1D18A9856A87","full_name":"Ganev, Iordan V"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"ista":"Ganev IV. 2019. The wonderful compactification for quantum groups. Journal of the London Mathematical Society. 99(3), 778–806.","mla":"Ganev, Iordan V. “The Wonderful Compactification for Quantum Groups.” <i>Journal of the London Mathematical Society</i>, vol. 99, no. 3, Wiley, 2019, pp. 778–806, doi:<a href=\"https://doi.org/10.1112/jlms.12193\">10.1112/jlms.12193</a>.","apa":"Ganev, I. V. (2019). The wonderful compactification for quantum groups. <i>Journal of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/jlms.12193\">https://doi.org/10.1112/jlms.12193</a>","ieee":"I. V. Ganev, “The wonderful compactification for quantum groups,” <i>Journal of the London Mathematical Society</i>, vol. 99, no. 3. Wiley, pp. 778–806, 2019.","short":"I.V. Ganev, Journal of the London Mathematical Society 99 (2019) 778–806.","ama":"Ganev IV. The wonderful compactification for quantum groups. <i>Journal of the London Mathematical Society</i>. 2019;99(3):778-806. doi:<a href=\"https://doi.org/10.1112/jlms.12193\">10.1112/jlms.12193</a>","chicago":"Ganev, Iordan V. “The Wonderful Compactification for Quantum Groups.” <i>Journal of the London Mathematical Society</i>. Wiley, 2019. <a href=\"https://doi.org/10.1112/jlms.12193\">https://doi.org/10.1112/jlms.12193</a>."},"file":[{"relation":"main_file","checksum":"1be56239b2cd740a0e9a084f773c22f6","creator":"kschuh","file_name":"2019_Wiley_Ganev.pdf","file_size":431754,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","access_level":"open_access","date_created":"2020-01-07T13:31:53Z","file_id":"7238"}],"department":[{"_id":"TaHa"}],"date_updated":"2023-09-19T10:13:08Z","oa_version":"Published Version","type":"journal_article","scopus_import":"1","file_date_updated":"2020-07-14T12:46:35Z","external_id":{"isi":["000470025900008"]},"_id":"5"},{"related_material":{"record":[{"relation":"dissertation_contains","id":"6287","status":"public"}]},"month":"12","isi":1,"ec_funded":1,"day":"01","publication_status":"published","publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"status":"public","doi":"10.1007/s00454-018-0049-2","abstract":[{"text":"The order-k Voronoi tessellation of a locally finite set 𝑋⊆ℝ𝑛 decomposes ℝ𝑛 into convex domains whose points have the same k nearest neighbors in X. Assuming X is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by counting only faces, for which the k nearest points in X are within a given distance threshold.","lang":"eng"}],"issue":"4","page":"865–878","article_type":"original","intvolume":"        62","arxiv":1,"language":[{"iso":"eng"}],"publisher":"Springer","type":"journal_article","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Nikitenko","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"citation":{"ieee":"H. Edelsbrunner and A. Nikitenko, “Poisson–Delaunay Mosaics of Order k,” <i>Discrete and Computational Geometry</i>, vol. 62, no. 4. Springer, pp. 865–878, 2019.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” <i>Discrete and Computational Geometry</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00454-018-0049-2\">https://doi.org/10.1007/s00454-018-0049-2</a>.","short":"H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019) 865–878.","ama":"Edelsbrunner H, Nikitenko A. Poisson–Delaunay Mosaics of Order k. <i>Discrete and Computational Geometry</i>. 2019;62(4):865–878. doi:<a href=\"https://doi.org/10.1007/s00454-018-0049-2\">10.1007/s00454-018-0049-2</a>","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” <i>Discrete and Computational Geometry</i>, vol. 62, no. 4, Springer, 2019, pp. 865–878, doi:<a href=\"https://doi.org/10.1007/s00454-018-0049-2\">10.1007/s00454-018-0049-2</a>.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order k. <i>Discrete and Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-018-0049-2\">https://doi.org/10.1007/s00454-018-0049-2</a>","ista":"Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878."},"has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"HeEd"}],"file":[{"checksum":"f9d00e166efaccb5a76bbcbb4dcea3b4","relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"5932","date_created":"2019-02-06T10:10:46Z","file_name":"2018_DiscreteCompGeometry_Edelsbrunner.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:10Z","file_size":599339}],"date_updated":"2023-09-07T12:07:12Z","oa_version":"Published Version","_id":"5678","scopus_import":"1","file_date_updated":"2020-07-14T12:47:10Z","external_id":{"isi":["000494042900008"],"arxiv":["1709.09380"]},"date_created":"2018-12-16T22:59:20Z","ddc":["516"],"volume":62,"article_processing_charge":"Yes (via OA deal)","publication":"Discrete and Computational Geometry","year":"2019","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","date_published":"2019-12-01T00:00:00Z","title":"Poisson–Delaunay Mosaics of Order k","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}]},{"publisher":"Taylor and Francis","page":"80-92","intvolume":"       166","language":[{"iso":"eng"}],"publication_identifier":{"issn":["23818107"],"eissn":["23818115"]},"status":"public","doi":"10.1080/23818107.2018.1545142","abstract":[{"text":"Pollinators display a remarkable diversity of foraging strategies with flowering plants, from primarily mutualistic interactions to cheating through nectar robbery. Despite numerous studies on the effect of nectar robbing on components of plant fitness, its contribution to reproductive isolation is unclear. We experimentally tested the impact of different pollinator strategies in a natural hybrid zone between two subspecies of Antirrhinum majus with alternate flower colour guides. On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus (magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral visitors at different time points during the flowering season. Using long-run camera surveys, we quantify the impact of nectar robbing on the number of flowers visited per inflorescence and the flower probing time. We further experimentally tested the effect of nectar robbing on female reproductive success by manipulating the intensity of robbing. While robbing increased over time the number of legitimate visitors tended to decrease concomitantly. We found that the number of flowers pollinated on a focal inflorescence decreased with the number of prior robbing events. However, in the manipulative experiment, fruit set and fruit volume did not vary significantly between low robbing and control treatments. Our findings challenge the idea that robbers have a negative impact on plant fitness through female function. This study also adds to our understanding of the components of pollinator-mediated reproductive isolation and the maintenance of Antirrhinum hybrid zones.","lang":"eng"}],"issue":"1","month":"01","isi":1,"day":"01","publication_status":"published","quality_controlled":"1","title":"Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone","date_published":"2019-01-01T00:00:00Z","date_created":"2018-12-16T22:59:20Z","volume":166,"article_processing_charge":"No","publication":"Botany Letters","year":"2019","_id":"5680","scopus_import":"1","external_id":{"isi":["000463802800009"]},"type":"journal_article","author":[{"last_name":"Andalo","first_name":"Christophe","full_name":"Andalo, Christophe"},{"full_name":"Burrus, Monique","first_name":"Monique","last_name":"Burrus"},{"last_name":"Paute","first_name":"Sandrine","full_name":"Paute, Sandrine"},{"full_name":"Lauzeral, Christine","first_name":"Christine","last_name":"Lauzeral"},{"orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David","full_name":"Field, David","last_name":"Field"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. <i>Botany Letters</i>. 2019;166(1):80-92. doi:<a href=\"https://doi.org/10.1080/23818107.2018.1545142\">10.1080/23818107.2018.1545142</a>","short":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, D. Field, Botany Letters 166 (2019) 80–92.","chicago":"Andalo, Christophe, Monique Burrus, Sandrine Paute, Christine Lauzeral, and David Field. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” <i>Botany Letters</i>. Taylor and Francis, 2019. <a href=\"https://doi.org/10.1080/23818107.2018.1545142\">https://doi.org/10.1080/23818107.2018.1545142</a>.","ieee":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, and D. Field, “Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone,” <i>Botany Letters</i>, vol. 166, no. 1. Taylor and Francis, pp. 80–92, 2019.","ista":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. 2019. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. 166(1), 80–92.","apa":"Andalo, C., Burrus, M., Paute, S., Lauzeral, C., &#38; Field, D. (2019). Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. <i>Botany Letters</i>. Taylor and Francis. <a href=\"https://doi.org/10.1080/23818107.2018.1545142\">https://doi.org/10.1080/23818107.2018.1545142</a>","mla":"Andalo, Christophe, et al. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” <i>Botany Letters</i>, vol. 166, no. 1, Taylor and Francis, 2019, pp. 80–92, doi:<a href=\"https://doi.org/10.1080/23818107.2018.1545142\">10.1080/23818107.2018.1545142</a>."},"department":[{"_id":"NiBa"}],"date_updated":"2023-08-24T14:34:12Z","oa_version":"None"}]