[{"title":"Open Access at IST Austria 2009-2017","ddc":["020"],"publication_status":"published","status":"public","department":[{"_id":"E-Lib"}],"publisher":"IST Austria","_id":"6459","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-07-14T23:06:21Z","date_created":"2019-05-16T07:27:14Z","file":[{"access_level":"open_access","file_name":"Poster_Beitrag_125_Petritsch.pdf","file_size":1967778,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"6460","checksum":"9063ab4d10ea93353c3a03bbf53fbcf1","date_created":"2019-05-16T07:26:25Z","date_updated":"2020-07-14T12:47:30Z"}],"oa_version":"Published Version","author":[{"last_name":"Petritsch","first_name":"Barbara","orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87","full_name":"Petritsch, Barbara"}],"type":"conference_poster","file_date_updated":"2020-07-14T12:47:30Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"citation":{"chicago":"Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018. https://doi.org/10.5281/zenodo.1410279.","short":"B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.","mla":"Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018, doi:10.5281/zenodo.1410279.","ieee":"B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.","apa":"Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented at the Open-Access-Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279","ista":"Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.","ama":"Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018. doi:10.5281/zenodo.1410279"},"language":[{"iso":"eng"}],"conference":{"name":"Open-Access-Tage","end_date":"2018-09-26","start_date":"2018-09-24","location":"Graz, Austria"},"date_published":"2018-09-24T00:00:00Z","doi":"10.5281/zenodo.1410279","keyword":["Open Access","Publication Analysis"],"day":"24","month":"09","has_accepted_license":"1"},{"oa_version":"None","date_updated":"2021-01-12T08:07:52Z","date_created":"2019-06-06T12:42:01Z","author":[{"full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","last_name":"Hausel"},{"last_name":"Mellit","first_name":"Anton","id":"388D3134-F248-11E8-B48F-1D18A9856A87","full_name":"Mellit, Anton"},{"full_name":"Pei, Du","last_name":"Pei","first_name":"Du"}],"publisher":"Oxford University Press","department":[{"_id":"TaHa"}],"publication_status":"published","status":"public","title":"Mirror symmetry with branes by equivariant verlinde formulas","_id":"6525","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2018","abstract":[{"lang":"eng","text":"This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal."}],"type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1093/oso/9780198802013.003.0009","date_published":"2018-01-01T00:00:00Z","page":"189-218","quality_controlled":"1","citation":{"ieee":"T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant verlinde formulas,” in Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","apa":"Hausel, T., Mellit, A., & Pei, D. (2018). Mirror symmetry with branes by equivariant verlinde formulas. In Geometry and Physics: Volume I (pp. 189–218). Oxford University Press. https://doi.org/10.1093/oso/9780198802013.003.0009","ista":"Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.","ama":"Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde formulas. In: Geometry and Physics: Volume I. Oxford University Press; 2018:189-218. doi:10.1093/oso/9780198802013.003.0009","chicago":"Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” In Geometry and Physics: Volume I, 189–218. Oxford University Press, 2018. https://doi.org/10.1093/oso/9780198802013.003.0009.","short":"T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218.","mla":"Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde Formulas.” Geometry and Physics: Volume I, Oxford University Press, 2018, pp. 189–218, doi:10.1093/oso/9780198802013.003.0009."},"publication":"Geometry and Physics: Volume I","publication_identifier":{"isbn":["9780198802013","9780191840500"]},"day":"01","month":"01","scopus_import":1},{"publisher":"Springer","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2018","volume":171,"date_created":"2018-12-11T11:47:56Z","date_updated":"2021-01-12T08:09:33Z","author":[{"last_name":"Lee","first_name":"Jii","full_name":"Lee, Jii"},{"first_name":"Kevin","last_name":"Schnelli","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin"}],"article_number":"543-616","publist_id":"7017","ec_funded":1,"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"external_id":{"arxiv":["1605.08767"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00440-017-0787-8","month":"06","intvolume":" 171","status":"public","title":"Local law and Tracy–Widom limit for sparse random matrices","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"690","oa_version":"Preprint","type":"journal_article","issue":"1-2","abstract":[{"lang":"eng","text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1."}],"citation":{"chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","ista":"Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.","apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8"},"publication":"Probability Theory and Related Fields","date_published":"2018-06-14T00:00:00Z","scopus_import":1,"day":"14"},{"author":[{"first_name":"Alexander","last_name":"Shekhovtsov","full_name":"Shekhovtsov, Alexander"},{"last_name":"Swoboda","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"volume":40,"date_updated":"2021-01-12T08:11:32Z","date_created":"2018-12-11T11:48:01Z","year":"2018","department":[{"_id":"VlKo"}],"publisher":"IEEE","publication_status":"published","publist_id":"6992","doi":"10.1109/TPAMI.2017.2730884","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"external_id":{"arxiv":["1508.07902"]},"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["01628828"]},"month":"07","oa_version":"Preprint","_id":"703","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 40","status":"public","title":"Maximum persistency via iterative relaxed inference with graphical models","issue":"7","abstract":[{"lang":"eng","text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision."}],"type":"journal_article","date_published":"2018-07-01T00:00:00Z","citation":{"chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","apa":"Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884"},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","page":"1668-1682","day":"01","scopus_import":1},{"abstract":[{"lang":"eng","text":"Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights."}],"type":"conference","oa_version":"Published Version","file":[{"file_name":"2018_OpenProceedings_Grubic.pdf","access_level":"open_access","creator":"dernst","file_size":1603204,"content_type":"application/pdf","file_id":"7118","relation":"main_file","date_created":"2019-11-26T14:23:04Z","date_updated":"2020-07-14T12:47:49Z","checksum":"ec979b56abc71016d6e6adfdadbb4afe"}],"_id":"7116","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","status":"public","has_accepted_license":"1","article_processing_charge":"No","day":"26","scopus_import":1,"date_published":"2018-03-26T00:00:00Z","citation":{"short":"D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.","mla":"Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.","chicago":"Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.","ama":"Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14","ieee":"D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in Proceedings of the 21st International Conference on Extending Database Technology, Vienna, Austria, 2018, pp. 145–156.","apa":"Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14","ista":"Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156."},"publication":"Proceedings of the 21st International Conference on Extending Database Technology","page":"145-156","file_date_updated":"2020-07-14T12:47:49Z","author":[{"full_name":"Grubic, Demjan","last_name":"Grubic","first_name":"Demjan"},{"first_name":"Leo","last_name":"Tam","full_name":"Tam, Leo"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Zhang","first_name":"Ce","full_name":"Zhang, Ce"}],"date_created":"2019-11-26T14:19:11Z","date_updated":"2023-02-23T12:59:17Z","year":"2018","publisher":"OpenProceedings","department":[{"_id":"DaAl"}],"publication_status":"published","publication_identifier":{"isbn":["9783893180783"],"issn":["2367-2005"]},"month":"03","doi":"10.5441/002/EDBT.2018.14","conference":{"start_date":"2018-03-26","location":"Vienna, Austria","end_date":"2018-03-29","name":"EDBT: Conference on Extending Database Technology"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"quality_controlled":"1"}]