[{"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"The Journal of chemical physics","file_date_updated":"2024-10-07T11:25:00Z","supplementarymaterial":"yes","isi":1,"author":[{"full_name":"Wassermair, Michael","id":"23d132c4-4e98-11ef-b275-9e8d4cd8c917","orcid":"0009-0003-6339-4051","last_name":"Wassermair","first_name":"Michael"},{"full_name":"Kahl, Gerhard","first_name":"Gerhard","last_name":"Kahl"},{"full_name":"Roth, Roland","first_name":"Roland","last_name":"Roth"},{"full_name":"Archer, Andrew J.","first_name":"Andrew J.","last_name":"Archer"}],"das_tickbox":"1","publication_status":"published","doi":"10.1063/5.0226954","abstract":[{"text":"We investigate the phase ordering (pattern formation) of systems of two-dimensional core–shell particles using Monte Carlo (MC) computer simulations and classical density functional theory (DFT). The particles interact via a pair potential having a hard core and a repulsive square shoulder. Our simulations show that on cooling, the liquid state structure becomes increasingly characterized by long wavelength density modulations and on further cooling forms a variety of other phases, including clustered, striped, and other patterned phases. In DFT, the hard core part of the potential is treated using either fundamental measure theory or a simple local density approximation, whereas the soft shoulder is treated using the random phase approximation. The different DFTs are benchmarked using large-scale grand-canonical-MC and Gibbs-ensemble-MC simulations, demonstrating their predictive capabilities and shortcomings. We find that having the liquid state static structure factor S(k) for wavenumber k is sufficient to identify the Fourier modes governing both the liquid and solid phases. This allows us to identify from easier-to-obtain liquid state data the wavenumbers relevant to the periodic phases and to predict roughly where in the phase diagram these patterned phases arise.","lang":"eng"}],"quality_controlled":"1","volume":161,"publisher":"AIP Publishing","article_processing_charge":"Yes (in subscription journal)","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","license":"https://creativecommons.org/licenses/by/4.0/","file":[{"relation":"main_file","access_level":"open_access","creator":"dernst","file_size":15009000,"checksum":"f3874e64ef94e94b2376f00a1fee24c3","success":1,"content_type":"application/pdf","date_created":"2024-10-07T11:25:00Z","file_id":"18185","date_updated":"2024-10-07T11:25:00Z","file_name":"2024_JourChemicalPhysics_Wassermair.pdf"}],"department":[{"_id":"GradSch"}],"issue":"12","type":"journal_article","date_updated":"2026-10-02T11:10:03Z","language":[{"iso":"eng"}],"intvolume":"       161","status":"public","arxiv":1,"has_accepted_license":"1","external_id":{"pmid":["39344889"],"isi":["001325268300004"],"arxiv":["2409.06447"]},"researchdata_availability":"upon request","date_published":"2024-09-28T00:00:00Z","title":"Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system","oa":1,"year":"2024","month":"09","acknowledgement":"The computational results presented here were enabled via a generous share of CPU time, offered by the Vienna Scientific Cluster (VSC) under Project No. 71263. The authors thank Ms. Katrin Muck for her guidance related to the use of HPC. A.J.A. gratefully acknowledges support from the EPSRC under Grant No. EP/P015689/1.","pmid":1,"ddc":["530"],"citation":{"ieee":"M. Wassermair, G. Kahl, R. Roth, and A. J. Archer, “Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system,” <i>The Journal of chemical physics</i>, vol. 161, no. 12. AIP Publishing, 2024.","ama":"Wassermair M, Kahl G, Roth R, Archer AJ. Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of chemical physics</i>. 2024;161(12). doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>","apa":"Wassermair, M., Kahl, G., Roth, R., &#38; Archer, A. J. (2024). Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>","chicago":"Wassermair, Michael, Gerhard Kahl, Roland Roth, and Andrew J. Archer. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>.","ista":"Wassermair M, Kahl G, Roth R, Archer AJ. 2024. Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. The Journal of chemical physics. 161(12), 124503.","mla":"Wassermair, Michael, et al. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>, vol. 161, no. 12, 124503, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>.","short":"M. Wassermair, G. Kahl, R. Roth, A.J. Archer, The Journal of Chemical Physics 161 (2024)."},"article_number":"124503 ","oa_version":"Published Version","publication_identifier":{"eissn":["1089-7690"]},"date_created":"2024-10-06T22:01:12Z","fulldoi":"https://doi.org/10.1063/5.0226954","corr_author":"1","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","day":"28","_id":"18174"},{"month":"01","acknowledgement":"We would like to thank Marco Sealey Cardona, PhD for help with the mouse brain samples and acknowledge the financial support by 1669 Förderkreis of the University of Innsbruck, Austria Wirtschaftsservice (AWS), D. Swarovski KG and Tyrolean Science Fund (TWF).","ddc":["540"],"publication_identifier":{"issn":["1387-3806"]},"article_number":"117168","oa_version":"Published Version","citation":{"short":"F. Kluibenschedl, A. Ploner, C. Meisenbichler, R. Konrat, T. Müller, International Journal of Mass Spectrometry 495 (2024).","mla":"Kluibenschedl, Florian, et al. “Advanced Motion Tracking for Interactive Mass Spectrometry Imaging (IMSI).” <i>International Journal of Mass Spectrometry</i>, vol. 495, 117168, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">10.1016/j.ijms.2023.117168</a>.","ista":"Kluibenschedl F, Ploner A, Meisenbichler C, Konrat R, Müller T. 2024. Advanced motion tracking for interactive mass spectrometry imaging (IMSI). International Journal of Mass Spectrometry. 495, 117168.","chicago":"Kluibenschedl, Florian, Anna Ploner, Christina Meisenbichler, Robert Konrat, and Thomas Müller. “Advanced Motion Tracking for Interactive Mass Spectrometry Imaging (IMSI).” <i>International Journal of Mass Spectrometry</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">https://doi.org/10.1016/j.ijms.2023.117168</a>.","apa":"Kluibenschedl, F., Ploner, A., Meisenbichler, C., Konrat, R., &#38; Müller, T. (2024). Advanced motion tracking for interactive mass spectrometry imaging (IMSI). <i>International Journal of Mass Spectrometry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">https://doi.org/10.1016/j.ijms.2023.117168</a>","ieee":"F. Kluibenschedl, A. Ploner, C. Meisenbichler, R. Konrat, and T. Müller, “Advanced motion tracking for interactive mass spectrometry imaging (IMSI),” <i>International Journal of Mass Spectrometry</i>, vol. 495. Elsevier, 2024.","ama":"Kluibenschedl F, Ploner A, Meisenbichler C, Konrat R, Müller T. Advanced motion tracking for interactive mass spectrometry imaging (IMSI). <i>International Journal of Mass Spectrometry</i>. 2024;495. doi:<a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">10.1016/j.ijms.2023.117168</a>"},"date_created":"2023-12-10T23:00:57Z","fulldoi":"https://doi.org/10.1016/j.ijms.2023.117168","dataavailabilitystatement":"Data will be made available on request.","day":"01","_id":"14653","status":"public","external_id":{"isi":["001125054400001"]},"has_accepted_license":"1","date_published":"2024-01-01T00:00:00Z","researchdata_availability":"upon request","title":"Advanced motion tracking for interactive mass spectrometry imaging (IMSI)","oa":1,"year":"2024","scopus_import":"1","department":[{"_id":"GradSch"}],"file":[{"access_level":"open_access","creator":"dernst","file_size":3003139,"checksum":"6c5eb6dc07af70a59251d2c6fed38894","relation":"main_file","file_id":"17256","date_updated":"2024-07-16T08:27:34Z","file_name":"2024_IJMS_Kluibenschedl.pdf","success":1,"content_type":"application/pdf","date_created":"2024-07-16T08:27:34Z"}],"type":"journal_article","intvolume":"       495","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:07:09Z","supplementarymaterial":"yes","file_date_updated":"2024-07-16T08:27:34Z","publication":"International Journal of Mass Spectrometry","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"first_name":"Florian","last_name":"Kluibenschedl","orcid":"0000-0003-4695-5526","id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9","full_name":"Kluibenschedl, Florian"},{"first_name":"Anna","last_name":"Ploner","full_name":"Ploner, Anna"},{"last_name":"Meisenbichler","first_name":"Christina","full_name":"Meisenbichler, Christina"},{"full_name":"Konrat, Robert","first_name":"Robert","last_name":"Konrat"},{"full_name":"Müller, Thomas","first_name":"Thomas","last_name":"Müller"}],"isi":1,"das_tickbox":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Mass spectrometry imaging (MSI) is a powerful analytical technique for the two-dimensional (2D) localization of chemicals on surfaces. Conventional MSI experiments require to predefine the surface of interest based on photographic or microscopic images. Typically, these boundaries can no longer be changed or adjusted once the experiment has been started. In terms of a more interactive approach we recently developed a pen-like ionization interface which is directly connected to the mass spectrometer. The device allows the user to ionize chemicals by desorption electrospray ionization (DESI) and to freely move the interface over a surface of interest. A mini camera, which is mounted on the tip of the pen, magnifies the desorption area and enables a simple positioning of the pen. The combination of optical data from the camera module and chemical data obtained by mass analysis facilitates a novel type of imaging experiment: interactive mass spectrometry imaging (IMSI). For this application, we present a novel approach for a robust, optical flow-based motion detection. While the live video stream from the camera is used to track the pen's motion across the surface a post-acquisition algorithm correlates the coordinates of the pen trajectory with respective mass spectra obtained from a simultaneous mass spectrometric data acquisition. This algorithm is no longer dependent on a single, manually applied optical marker on the sample surface, which has to be visible on all video frames throughout the analysis. The advanced DESI-IMSI method was successfully tested on inkjet-printed letters as well as mouse brain tissue samples. Validation of the results was done by comparing DESI-IMSI with standard DESI-MSI data."}],"doi":"10.1016/j.ijms.2023.117168","volume":495,"quality_controlled":"1","publisher":"Elsevier","article_type":"original","article_processing_charge":"Yes (in subscription journal)","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"scopus_import":"1","type":"journal_article","issue":"2","file":[{"file_size":2016085,"checksum":"76bdf0b4dc06d59d073a57bd6957a96c","access_level":"open_access","creator":"dernst","relation":"main_file","file_name":"2024_PRXQuantum_Finzgar.pdf","file_id":"15409","date_updated":"2024-05-21T09:35:14Z","content_type":"application/pdf","date_created":"2024-05-21T09:35:14Z","success":1}],"department":[{"_id":"GradSch"}],"intvolume":"         5","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:07:49Z","author":[{"last_name":"Finžgar","first_name":"Jernej Rudi","full_name":"Finžgar, Jernej Rudi"},{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","orcid":"0009-0002-2370-8661","last_name":"Kerschbaumer","first_name":"Aron","full_name":"Kerschbaumer, Aron"},{"first_name":"Martin J.A.","last_name":"Schuetz","full_name":"Schuetz, Martin J.A."},{"last_name":"Mendl","first_name":"Christian B.","full_name":"Mendl, Christian B."},{"full_name":"Katzgraber, Helmut G.","first_name":"Helmut G.","last_name":"Katzgraber"}],"supplementarymaterial":"yes","file_date_updated":"2024-05-21T09:35:14Z","publication":"PRX Quantum","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1103/PRXQuantum.5.020327","abstract":[{"lang":"eng","text":"We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for combinatorial optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps that recursively simplify the problem. These reduction steps address the limitations of the quantum component (e.g., locality) and ensure solution feasibility in constrained optimization problems. Additionally, we use backtracking techniques to further improve the performance of the algorithm without increasing the requirements on the quantum hardware. We showcase the capabilities of our approach by informing QIRO with correlations from classical simulations of shallow circuits of the quantum approximate optimization algorithm, solving instances of maximum independent set and maximum satisfiability problems with hundreds of variables. We also demonstrate how QIRO can be deployed on a neutral atom quantum processor to find large independent sets of graphs. In summary, our scheme achieves results comparable to classical heuristics even with relatively weak quantum resources. Furthermore, enhancing the quality of these quantum resources improves the performance of the algorithms. Notably, the modular nature of QIRO offers various avenues for modifications, positioning our work as a template for a broader class of hybrid quantum-classical algorithms for combinatorial optimization."}],"publication_status":"published","das_tickbox":"0","publisher":"American Physical Society","volume":5,"quality_controlled":"1","DOAJ_listed":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","article_processing_charge":"Yes","acknowledgement":"J.R.F. and A.K. thank Libor Caha and Alexander Kliesch for insightful discussions. The authors thank Lilly Palackal, Maximilian Passek, Carlos Riofrío, and Gili Rosenberg for thorough reviews of the manuscript, and the Amazon Braket, BMW, and QuEra teams for their support. C.M. thanks the Munich Quantum Valley initiative, which is supported by the Bavarian State Government with funds from the Hightech Agenda Bayern Plus. H.G.K. would like to thank Am Platzl 1A for providing the necessary environment for creative thinking. An open-source implementation of QIRO is available online [60].","month":"05","publication_identifier":{"eissn":["2691-3399"]},"article_number":"020327","oa_version":"Published Version","citation":{"ama":"Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. Quantum-informed recursive optimization algorithms. <i>PRX Quantum</i>. 2024;5(2). doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">10.1103/PRXQuantum.5.020327</a>","ieee":"J. R. Finžgar, A. Kerschbaumer, M. J. A. Schuetz, C. B. Mendl, and H. G. Katzgraber, “Quantum-informed recursive optimization algorithms,” <i>PRX Quantum</i>, vol. 5, no. 2. American Physical Society, 2024.","apa":"Finžgar, J. R., Kerschbaumer, A., Schuetz, M. J. A., Mendl, C. B., &#38; Katzgraber, H. G. (2024). Quantum-informed recursive optimization algorithms. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">https://doi.org/10.1103/PRXQuantum.5.020327</a>","chicago":"Finžgar, Jernej Rudi, Aron Kerschbaumer, Martin J.A. Schuetz, Christian B. Mendl, and Helmut G. Katzgraber. “Quantum-Informed Recursive Optimization Algorithms.” <i>PRX Quantum</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">https://doi.org/10.1103/PRXQuantum.5.020327</a>.","ista":"Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. 2024. Quantum-informed recursive optimization algorithms. PRX Quantum. 5(2), 020327.","mla":"Finžgar, Jernej Rudi, et al. “Quantum-Informed Recursive Optimization Algorithms.” <i>PRX Quantum</i>, vol. 5, no. 2, 020327, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">10.1103/PRXQuantum.5.020327</a>.","short":"J.R. Finžgar, A. Kerschbaumer, M.J.A. Schuetz, C.B. Mendl, H.G. Katzgraber, PRX Quantum 5 (2024)."},"ddc":["530"],"corr_author":"1","date_created":"2024-05-19T22:01:13Z","fulldoi":"https://doi.org/10.1103/PRXQuantum.5.020327","_id":"15407","day":"01","external_id":{"arxiv":["2308.13607"]},"has_accepted_license":"1","status":"public","OA_place":"publisher","arxiv":1,"date_published":"2024-05-01T00:00:00Z","researchdata_availability":"no","oa":1,"title":"Quantum-informed recursive optimization algorithms","OA_type":"gold","year":"2024"},{"author":[{"id":"530a7320-5355-11ee-ae5a-82a46997aaa7","orcid":"0000-0002-8612-8202","last_name":"Kolisnyk","first_name":"Dmytro","full_name":"Kolisnyk, Dmytro"},{"full_name":"Queißer, Friedemann","last_name":"Queißer","first_name":"Friedemann"},{"first_name":"Gernot","last_name":"Schaller","full_name":"Schaller, Gernot"},{"full_name":"Schützhold, Ralf","last_name":"Schützhold","first_name":"Ralf"}],"isi":1,"supplementarymaterial":"yes","publication":"Physical Review Applied","doi":"10.1103/PhysRevApplied.21.044050","abstract":[{"lang":"eng","text":"We investigate superradiant enhancements in the refrigeration performance of a set of N three-level systems that are collectively coupled to a hot and a cold thermal reservoir and are additionally subject to collective periodic (circular) driving. Assuming the system-reservoir coupling to be weak, we explore the regime of stronger periodic driving strengths by comparing collective weak driving, Floquet-Lindblad, and Floquet-Redfield master equations. We identify regimes where the power injected by the periodic driving is used to pump heat from the cold to the hot reservoir and derive analytic sufficient conditions for them based on a cycle analysis of the Floquet-Lindblad master equation. In those regimes, we also argue for which parameters collective enhancements like a quadratic scaling of the cooling current with N can be expected and support our arguments by numerical simulations."}],"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.18126","open_access":"1"}],"das_tickbox":"0","publisher":"American Physical Society","volume":21,"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","article_type":"original","scopus_import":"1","type":"journal_article","issue":"4","department":[{"_id":"GradSch"}],"intvolume":"        21","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:07:26Z","external_id":{"isi":["001226579400001"],"arxiv":["2310.18126"]},"arxiv":1,"status":"public","date_published":"2024-04-26T00:00:00Z","researchdata_availability":"no","oa":1,"title":"Floquet analysis of a superradiant many-qutrit refrigerator","year":"2024","acknowledgement":"Financial support by the DFG (project ID 278162697 – SFB 1242) is gratefully acknowledged.\r\n","month":"04","article_number":"044050","oa_version":"Preprint","publication_identifier":{"eissn":["2331-7019"]},"citation":{"apa":"Kolisnyk, D., Queißer, F., Schaller, G., &#38; Schützhold, R. (2024). Floquet analysis of a superradiant many-qutrit refrigerator. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">https://doi.org/10.1103/PhysRevApplied.21.044050</a>","ieee":"D. Kolisnyk, F. Queißer, G. Schaller, and R. Schützhold, “Floquet analysis of a superradiant many-qutrit refrigerator,” <i>Physical Review Applied</i>, vol. 21, no. 4. American Physical Society, 2024.","ama":"Kolisnyk D, Queißer F, Schaller G, Schützhold R. Floquet analysis of a superradiant many-qutrit refrigerator. <i>Physical Review Applied</i>. 2024;21(4). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">10.1103/PhysRevApplied.21.044050</a>","chicago":"Kolisnyk, Dmytro, Friedemann Queißer, Gernot Schaller, and Ralf Schützhold. “Floquet Analysis of a Superradiant Many-Qutrit Refrigerator.” <i>Physical Review Applied</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">https://doi.org/10.1103/PhysRevApplied.21.044050</a>.","mla":"Kolisnyk, Dmytro, et al. “Floquet Analysis of a Superradiant Many-Qutrit Refrigerator.” <i>Physical Review Applied</i>, vol. 21, no. 4, 044050, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">10.1103/PhysRevApplied.21.044050</a>.","ista":"Kolisnyk D, Queißer F, Schaller G, Schützhold R. 2024. Floquet analysis of a superradiant many-qutrit refrigerator. Physical Review Applied. 21(4), 044050.","short":"D. Kolisnyk, F. Queißer, G. Schaller, R. Schützhold, Physical Review Applied 21 (2024)."},"date_created":"2024-05-05T22:01:04Z","fulldoi":"https://doi.org/10.1103/PhysRevApplied.21.044050","day":"26","_id":"15360"},{"type":"journal_article","issue":"6","department":[{"_id":"GradSch"}],"intvolume":"        85","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:10:45Z","scopus_import":"1","publisher":"Springer Nature","volume":85,"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","article_processing_charge":"No","author":[{"full_name":"Arkhipov, Pavel","first_name":"Pavel","last_name":"Arkhipov","id":"b25f2ab2-1fed-11ee-8599-fe02d211784f"}],"isi":1,"supplementarymaterial":"no","publication":"Automation and Remote Control","doi":"10.1134/S0005117924060031","publication_status":"published","abstract":[{"lang":"eng","text":"This paper is dedicated to an optimization problem. Let A, B ⊂ Rn be compact convex sets. Consider the minimal number t0 > 0 such that t0B covers A after a shift to a vector x0 ∈ \r\nRn. The goal is to find t0 and x0. In the special case of B being a unit ball centered at zero, x0 and t0 are known as the Chebyshev center and the Chebyshev radius of A. This paper focuses on the case in which A and B are defined with their black-box support functions. An algorithm for solving such problems efficiently is suggested. The algorithm has a superlinear convergence rate, and it can solve hundred-dimensional test problems in a reasonable time, but some additional conditions on A and B are required to guarantee the presence of convergence. Additionally, the behavior of the algorithm for a simple special case is investigated, which leads to a number of theoretical results. Perturbations of this special case are also studied."}],"das_tickbox":"0","corr_author":"1","fulldoi":"https://doi.org/10.1134/S0005117924060031","date_created":"2024-10-27T23:01:45Z","page":"522-532","day":"01","_id":"18482","acknowledgement":"The author is grateful to Maxim Balashov for setting the problem, providing useful literature, important discussions and text review. Also, I thank Dmitry Tsarev and Kseniia Petukhova for meaningful talks and support.","month":"06","oa_version":"None","publication_identifier":{"eissn":["1608-3032"],"issn":["0005-1179"]},"citation":{"chicago":"Arkhipov, Pavel. “An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.” <i>Automation and Remote Control</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1134/S0005117924060031\">https://doi.org/10.1134/S0005117924060031</a>.","ieee":"P. Arkhipov, “An algorithm for finding the generalized Chebyshev center of sets defined via their support functions,” <i>Automation and Remote Control</i>, vol. 85, no. 6. Springer Nature, pp. 522–532, 2024.","ama":"Arkhipov P. An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. <i>Automation and Remote Control</i>. 2024;85(6):522-532. doi:<a href=\"https://doi.org/10.1134/S0005117924060031\">10.1134/S0005117924060031</a>","apa":"Arkhipov, P. (2024). An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. <i>Automation and Remote Control</i>. Springer Nature. <a href=\"https://doi.org/10.1134/S0005117924060031\">https://doi.org/10.1134/S0005117924060031</a>","short":"P. Arkhipov, Automation and Remote Control 85 (2024) 522–532.","ista":"Arkhipov P. 2024. An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. Automation and Remote Control. 85(6), 522–532.","mla":"Arkhipov, Pavel. “An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.” <i>Automation and Remote Control</i>, vol. 85, no. 6, Springer Nature, 2024, pp. 522–32, doi:<a href=\"https://doi.org/10.1134/S0005117924060031\">10.1134/S0005117924060031</a>."},"title":"An algorithm for finding the generalized Chebyshev center of sets defined via their support functions","OA_type":"closed access","year":"2024","external_id":{"isi":["001338721700007"]},"status":"public","date_published":"2024-06-01T00:00:00Z","researchdata_availability":"no"},{"day":"27","_id":"18450","fulldoi":"https://doi.org/10.1109/OMN61224.2024.10685279","date_created":"2024-10-20T22:02:07Z","citation":{"ista":"Quintero S, Relvas M, Aranda M, Nodal F, Dieguez L, Abalde-Cela S. 2024. Portable Raman platform for SERS droplets microfludics. 2024 International Conference on Optical MEMS and Nanophotonics. OMN: Conference on Optical MEMS and Nanophotonics.","mla":"Quintero, Sergio, et al. “Portable Raman Platform for SERS Droplets Microfludics.” <i>2024 International Conference on Optical MEMS and Nanophotonics</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">10.1109/OMN61224.2024.10685279</a>.","short":"S. Quintero, M. Relvas, M. Aranda, F. Nodal, L. Dieguez, S. Abalde-Cela, in:, 2024 International Conference on Optical MEMS and Nanophotonics, IEEE, 2024.","ama":"Quintero S, Relvas M, Aranda M, Nodal F, Dieguez L, Abalde-Cela S. Portable Raman platform for SERS droplets microfludics. In: <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">10.1109/OMN61224.2024.10685279</a>","ieee":"S. Quintero, M. Relvas, M. Aranda, F. Nodal, L. Dieguez, and S. Abalde-Cela, “Portable Raman platform for SERS droplets microfludics,” in <i>2024 International Conference on Optical MEMS and Nanophotonics</i>, San Sebastian, Spain, 2024.","apa":"Quintero, S., Relvas, M., Aranda, M., Nodal, F., Dieguez, L., &#38; Abalde-Cela, S. (2024). Portable Raman platform for SERS droplets microfludics. In <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. San Sebastian, Spain: IEEE. <a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">https://doi.org/10.1109/OMN61224.2024.10685279</a>","chicago":"Quintero, Sergio, Maria Relvas, Marta Aranda, Fernando Nodal, Lorena Dieguez, and Sara Abalde-Cela. “Portable Raman Platform for SERS Droplets Microfludics.” In <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">https://doi.org/10.1109/OMN61224.2024.10685279</a>."},"oa_version":"None","publication_identifier":{"eissn":["2160-5041"],"isbn":["9798350384925"],"issn":["2160-5033"]},"month":"09","acknowledgement":"The authors acknowledge the financial support of the project HfPT – Health from Portugal, with the reference n.° C644937233-00000047, co-funded by Component C5 – Capitalisation and Business Innovation under the Portuguese Resilience and Recovery Plan, through the NextGenerationEU Fund.","year":"2024","OA_type":"closed access","title":"Portable Raman platform for SERS droplets microfludics","researchdata_availability":"no","date_published":"2024-09-27T00:00:00Z","status":"public","external_id":{"isi":["001327768000060"]},"language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:10:28Z","department":[{"_id":"GradSch"}],"type":"conference","scopus_import":"1","conference":{"start_date":"2024-07-28","name":"OMN: Conference on Optical MEMS and Nanophotonics","end_date":"2024-08-01","location":"San Sebastian, Spain"},"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","publisher":"IEEE","das_tickbox":"0","abstract":[{"text":"In this work we present the engineering of a portable platform for sensing SERS signals in droplets microfluidics. This system comprised not only the read-out platform but also a design for the microfluidic devices optimized to enhanced the obtained SERS signals.","lang":"eng"}],"doi":"10.1109/OMN61224.2024.10685279","publication_status":"published","publication":"2024 International Conference on Optical MEMS and Nanophotonics","supplementarymaterial":"no","isi":1,"author":[{"full_name":"Quintero, Sergio","first_name":"Sergio","last_name":"Quintero"},{"full_name":"Relvas, Maria","first_name":"Maria","last_name":"Relvas"},{"full_name":"Aranda, Marta","first_name":"Marta","last_name":"Aranda"},{"full_name":"Nodal, Fernando","last_name":"Nodal","first_name":"Fernando","id":"8ad43d5a-1ffe-11ee-8b67-8176f59de781","orcid":"0009-0006-4119-4376"},{"full_name":"Dieguez, Lorena","last_name":"Dieguez","first_name":"Lorena"},{"last_name":"Abalde-Cela","first_name":"Sara","full_name":"Abalde-Cela, Sara"}]},{"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"date_updated":"2026-10-02T11:11:44Z","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"}],"file":[{"success":1,"content_type":"application/pdf","date_created":"2024-11-28T12:50:32Z","date_updated":"2024-11-28T12:50:32Z","file_id":"18597","file_name":"Cecelia Mweka Master Thesis.pdf","relation":"main_file","creator":"cmweka","access_level":"open_access","file_size":3836671,"checksum":"054ed7a5e5ae6e7220e6bb37ea57a3c3"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2024-11-28T12:51:43Z","file_name":"Cecelia Mweka Master Thesis.docx","file_id":"18598","date_updated":"2024-12-13T11:30:53Z","relation":"source_file","file_size":7068210,"checksum":"7d7d9299f090d83e628d65d93116e8c2","access_level":"closed","creator":"cmweka"}],"type":"dissertation","das_tickbox":"0","publication_status":"published","doi":"10.15479/at:ista:18588","abstract":[{"text":"This thesis is an experimental work about two distinct research projects that evolved from a single project: non-equilibrium dynamics of an acoustically vibrated particle and microfabrication of particles with nano-scale 3D printing. The first project explores non equilibrium dynamics of a particle driven by ultrasonic vibrations. We design an experimental system consisting of an electromechanical vibration scheme to drive the particle’s vibrations and an imaging scheme to track its trajectories. We study the trajectories to determine how the particle’s dynamics evolve under the driven conditions, considering out of equilibrium systems in the context of equilibrium statistical mechanics. Using a Langevin framework and the Boltzmann factor, we characterize the particle’s dynamics as complex; the particle motion\r\nis not purely diffusive. We extract physical parameters like spring constant, effective temperature, damping coefficient and resonance frequency.\r\n\r\nIn the second project, we explore and develop techniques in the design and microfabrication of particles across scales. Microfabrication involves building structures at the micron or submicron scale. These designed miniaturized patterns, objects, or devices are useful in biophysics, pharmacology, medical biology, and nanotechnology. We specifically apply two-photon polymerization, a form of 3D nano printing. We print millimetric particles, characterizing different designs to evaluate and showcase the resolution, aspect ratio integrity and print quality of the printing process. We also design and fabricate a microsensor to deflect under applicable force of order 0.1 pN. We present fundamental concepts needed to design the microsensor, showcasing 3D printing at considerably smaller scales down to the µm or below.","lang":"eng"}],"file_date_updated":"2024-12-13T11:30:53Z","supplementarymaterial":"no","author":[{"full_name":"Mweka, Cecelia N","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21","first_name":"Cecelia N","last_name":"Mweka"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supervisor":[{"full_name":"Waitukaitis, Scott R","first_name":"Scott R","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","first_name":"Jérémie A","last_name":"Palacci"}],"publisher":"Institute of Science and Technology Austria","ddc":["530"],"doi_confirm":"1","citation":{"short":"C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales, Institute of Science and Technology Austria, 2024.","ista":"Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria.","mla":"Mweka, Cecelia N. <i>Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>.","chicago":"Mweka, Cecelia N. “Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>.","ama":"Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing across scales. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>","ieee":"C. N. Mweka, “Non equilibrium dynamics of driven individual particles and 3D printing across scales,” Institute of Science and Technology Austria, 2024.","apa":"Mweka, C. N. (2024). <i>Non equilibrium dynamics of driven individual particles and 3D printing across scales</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>"},"oa_version":"Published Version","publication_identifier":{"issn":["2791-4585"]},"month":"11","degree_awarded":"MS","acknowledgement":"I would like to acknowledge Scott Waitukaitis and Jérémie Palacci, for their supervision, and their extensive support of my learning. \r\n\r\nFor the beautiful characterization images used in this work, I would like to thank Dr. Daniel Grober, Samuel Hajek and Felix Pertl.\r\n\r\nThe Palacci group, particularly Malina Strugaru and Dan Grober, for their continuous guidance in decoding and following my streams of thought.\r\n\r\nTo the Waitukaitis group, for helping me find my footing in science, and making me feel at\r\nhome.\r\n\r\nTo the Nanofabrication Facility (NFF) at ISTA, for training me in significant aspects of my research. The MIBA Facility, and particularly Todor Asenov for consistently picking up the phone for my machining and designing needs.\r\n\r\nTo my friends, Mariana, Lenka, Aaron, Rebecca, Eavan who provided an ear, wine, and a lot more when I needed to vent, talk through my crises as well as experiment. For the walks, for the coffees, for reading through my work and providing edits, for dinners to take me out of blocks and binds and for cheering me on when it felt insurmountable. \r\n\r\nFinally, I am grateful to Griff and Fletcher, whose music helped me through several blocks, especially with my writing.\r\n\r\nMy science would not have been possible without the guidance, support and contributions of\r\nall these people, and more.","day":"29","_id":"18588","page":"61","fulldoi":"https://doi.org/10.15479/at:ista:18588","date_created":"2024-11-27T09:12:02Z","corr_author":"1","researchdata_availability":"no","alternative_title":["ISTA Master's Thesis"],"date_published":"2024-11-29T00:00:00Z","status":"public","OA_place":"publisher","has_accepted_license":"1","year":"2024","title":"Non equilibrium dynamics of driven individual particles and 3D printing across scales","oa":1},{"date_published":"2024-01-02T00:00:00Z","keyword":["sex chromosome evolution","genome assembly","dosage compensation"],"project":[{"_id":"34ae1506-11ca-11ed-8bc3-c14f4c474396","grant_number":"F8810","name":"The highjacking of meiosis for asexual reproduction"}],"status":"public","has_accepted_license":"1","year":"2024","title":"Data from \"Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation\"","oa":1,"doi_confirm":"1","ddc":["576"],"oa_version":"Published Version","citation":{"chicago":"Elkrewi, Marwan N. “Data from ‘Chromosome-Level Assembly of Artemia Franciscana Sheds Light on Sex-Chromosome Differentiation.’” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:14705\">https://doi.org/10.15479/AT:ISTA:14705</a>.","ama":"Elkrewi MN. Data from “Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation.” 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14705\">10.15479/AT:ISTA:14705</a>","ieee":"M. N. Elkrewi, “Data from ‘Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation.’” Institute of Science and Technology Austria, 2024.","apa":"Elkrewi, M. N. (2024). Data from “Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14705\">https://doi.org/10.15479/AT:ISTA:14705</a>","short":"M.N. Elkrewi, (2024).","ista":"Elkrewi MN. 2024. Data from ‘Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14705\">10.15479/AT:ISTA:14705</a>.","mla":"Elkrewi, Marwan N. <i>Data from “Chromosome-Level Assembly of Artemia Franciscana Sheds Light on Sex-Chromosome Differentiation.”</i> Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14705\">10.15479/AT:ISTA:14705</a>."},"month":"01","related_material":{"record":[{"id":"15009","status":"public","relation":"used_in_publication"}]},"_id":"14705","day":"02","date_created":"2023-12-22T13:40:48Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:14705","corr_author":"1","abstract":[{"lang":"eng","text":"Since the commercialization of brine shrimp (genus Artemia) in the 1950s, this lineage, and in particular the model species Artemia franciscana, has been the subject of extensive research. However, our understanding of the genetic mechanisms underlying various aspects of their reproductive biology, including sex determination, are still lacking. This is partly due to the scarcity of genomic resources for Artemia species and crustaceans in general. Here, we present a chromosome-level genome assembly of Artemia franciscana (Kellogg 1906), from the Great Salt Lake, USA. The genome is 1GB, and the majority of the genome (81%) is scaffolded into 21 linkage groups using a previously published high-density linkage map. We performed coverage and FST analyses using male and female genomic and transcriptomic reads to quantify the extent of differentiation between the Z and W chromosomes. Additionally, we quantified the expression levels in male and female heads and gonads and found further evidence for dosage compensation in this species."}],"doi":"10.15479/AT:ISTA:14705","file_date_updated":"2023-12-22T14:14:06Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Elkrewi, Marwan N","orcid":"0000-0002-5328-7231","id":"0B46FACA-A8E1-11E9-9BD3-79D1E5697425","first_name":"Marwan N","last_name":"Elkrewi"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","contributor":[{"contributor_type":"researcher","id":"57854184-AAE0-11E9-8D04-98D6E5697425","first_name":"Vincent K","last_name":"Bett"},{"first_name":"Ariana","last_name":"Macon","id":"2A0848E2-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member"},{"contributor_type":"supervisor","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","last_name":"Vicoso","first_name":"Beatriz"},{"first_name":"Marwan N","last_name":"Elkrewi","orcid":"0000-0002-5328-7231","id":"0B46FACA-A8E1-11E9-9BD3-79D1E5697425","contributor_type":"researcher"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-10-02T11:13:43Z","file":[{"creator":"melkrewi","access_level":"open_access","checksum":"bdaf1392867786634ec5466d528c36ca","file_size":847,"relation":"main_file","date_updated":"2023-12-22T13:54:21Z","file_id":"14707","file_name":"readme.txt.txt","success":1,"date_created":"2023-12-22T13:54:21Z","content_type":"text/plain"},{"file_id":"14708","date_updated":"2023-12-22T14:14:06Z","file_name":"data_artemia_franciscana_genome.zip","success":1,"content_type":"application/x-zip-compressed","date_created":"2023-12-22T14:14:06Z","access_level":"open_access","creator":"melkrewi","file_size":343632753,"checksum":"973e1cbdab923a71709782177980829f","relation":"main_file"}],"department":[{"_id":"GradSch"},{"_id":"BeVi"}],"type":"research_data"},{"scopus_import":"1","date_updated":"2026-10-02T11:16:26Z","language":[{"iso":"eng"}],"file":[{"relation":"main_file","creator":"yichen","access_level":"open_access","checksum":"b8b203ed09e3995ba0d7e6a76288663a","file_size":47309472,"success":1,"date_created":"2024-07-10T11:03:14Z","content_type":"application/pdf","date_updated":"2024-07-10T11:03:14Z","file_id":"17215","file_name":"sig24_friction_authors.pdf"},{"checksum":"89d81b397b4b6469d828808a68b70820","file_size":10518286,"creator":"yichen","access_level":"open_access","relation":"main_file","file_name":"sig24_friction_supplementary.pdf","file_id":"17216","date_updated":"2024-07-10T11:03:12Z","date_created":"2024-07-10T11:03:12Z","content_type":"application/pdf","success":1},{"file_name":"friction_paper_extra_video_finished.mp4","file_id":"17217","date_updated":"2024-07-10T11:03:51Z","date_created":"2024-07-10T11:03:51Z","content_type":"video/mp4","success":1,"checksum":"7123deed34a5456810e7b5336a31c657","file_size":71789192,"creator":"yichen","access_level":"open_access","relation":"main_file"},{"date_created":"2024-07-10T11:03:58Z","content_type":"video/mp4","success":1,"file_name":"friction_paper_video_finished.mp4","date_updated":"2024-07-10T11:03:58Z","file_id":"17218","relation":"main_file","checksum":"e606fc1ae8f2610ce3b4421566800b45","file_size":280610763,"access_level":"open_access","creator":"yichen"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"type":"conference","das_tickbox":"0","publication_status":"published","doi":"10.1145/3641519.3657485","abstract":[{"lang":"eng","text":"Current numerical algorithms for simulating friction fall in one of two camps: smooth solvers sacrifice the stable treatment of static friction in exchange for fast convergence, and non-smooth solvers accurately compute friction at convergence rates that are often prohibitive for large graphics applications. We introduce a novel bridge between these two ideas that computes static and dynamic friction stably and efficiently. Our key idea is to convert the highly constrained non-smooth problem into an unconstrained smooth problem using logarithmic barriers that converges to the exact solution as accuracy increases. We phrase the problem as an interior point primal-dual problem that can be solved efficiently with Newton iteration. We observe quadratic convergence despite the non-smooth nature of the original problem, and our method is well-suited for large systems of tightly packed objects with many contact points. We demonstrate the efficacy of our method with stable piles of grains and stacks of objects, complex granular flows, and robust interlocking assemblies of rigid bodies."}],"file_date_updated":"2024-07-10T11:03:58Z","supplementarymaterial":"yes","publication":"Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers '24","author":[{"orcid":"0009-0005-0723-0655","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","first_name":"Yi-Lu","last_name":"Chen","full_name":"Chen, Yi-Lu"},{"first_name":"Mickaël","last_name":"Ly","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","last_name":"Wojtan"}],"isi":1,"article_processing_charge":"Yes (via OA deal)","conference":{"location":"Denver, United States","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","start_date":"2024-07-28","end_date":"2024-08-01"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","publisher":"Association for Computing Machinery","ddc":["621","531","006"],"oa_version":"Published Version","publication_identifier":{"isbn":["9798400705250"]},"citation":{"short":"Y.-L. Chen, M. Ly, C. Wojtan, in:, Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Association for Computing Machinery, 2024.","mla":"Chen, Yi-Lu, et al. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3641519.3657485\">10.1145/3641519.3657485</a>.","ista":"Chen Y-L, Ly M, Wojtan C. 2024. Primal-dual non-smooth friction for rigid body animation. Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. SIGGRAPH: Computer Graphics and Interactive Techniques Conference.","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” In <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3641519.3657485\">https://doi.org/10.1145/3641519.3657485</a>.","apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2024). Primal-dual non-smooth friction for rigid body animation. In <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>. Denver, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3641519.3657485\">https://doi.org/10.1145/3641519.3657485</a>","ama":"Chen Y-L, Ly M, Wojtan C. Primal-dual non-smooth friction for rigid body animation. In: <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>. Association for Computing Machinery; 2024. doi:<a href=\"https://doi.org/10.1145/3641519.3657485\">10.1145/3641519.3657485</a>","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Primal-dual non-smooth friction for rigid body animation,” in <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>, Denver, United States, 2024."},"month":"07","acknowledgement":"We thank Vincent Acary for his help with Siconos, as well as the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","_id":"17214","day":"01","date_created":"2024-07-10T11:06:20Z","fulldoi":"https://doi.org/10.1145/3641519.3657485","corr_author":"1","date_published":"2024-07-01T00:00:00Z","keyword":["physical simulation","frictional contact","rigid body mechanics","non-smooth dynamics"],"researchdata_availability":"no","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"status":"public","external_id":{"isi":["001282218200091"]},"has_accepted_license":"1","year":"2024","title":"Primal-dual non-smooth friction for rigid body animation","oa":1},{"language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:16:04Z","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"type":"conference","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2024-06-16","end_date":"2024-06-22","location":"Seattle, WA, United States"},"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","publisher":"Computer Vision Foundation","das_tickbox":"0","abstract":[{"text":"The robustness of neural networks against input perturbations with bounded\r\nmagnitude represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical systems. Recently, the scientific community has\r\nfocused on enhancing certifiable robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods have been proposed in the literature to achieve this\r\ngoal, understanding the performance of such methods is not straightforward,\r\nsince different metrics can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness) for different applications. For this reason,\r\nthis work provides a thorough theoretical and empirical comparison between\r\nmethods by evaluating them in terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also provides some guidelines and recommendations to\r\nsupport the user in selecting the methods that work best depending on the\r\navailable resources. We provide code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.16833","open_access":"1"}],"publication_status":"published","doi":"10.1109/CVPR52733.2024.02320","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","supplementarymaterial":"no","isi":1,"author":[{"full_name":"Prach, Bernd","first_name":"Bernd","last_name":"Prach","id":"2D561D42-C427-11E9-89B4-9C1AE6697425"},{"first_name":"Fabio","last_name":"Brau","full_name":"Brau, Fabio"},{"full_name":"Buttazzo, Giorgio","last_name":"Buttazzo","first_name":"Giorgio"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}],"day":"01","_id":"17426","page":"24574-24583","fulldoi":"https://doi.org/10.1109/CVPR52733.2024.02320","date_created":"2024-08-14T08:42:32Z","corr_author":"1","citation":{"ama":"Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In: <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. Computer Vision Foundation; 2024:24574-24583. doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>","ieee":"B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared: Memory, speed, and certifiable robustness,” in <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Seattle, WA, United States, 2024, pp. 24574–24583.","apa":"Prach, B., Brau, F., Buttazzo, G., &#38; Lampert, C. (2024). 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 24574–24583). Seattle, WA, United States: Computer Vision Foundation. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>","chicago":"Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 24574–83. Computer Vision Foundation, 2024. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>.","ista":"Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24574–24583.","mla":"Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Computer Vision Foundation, 2024, pp. 24574–83, doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>.","short":"B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–24583."},"oa_version":"Preprint","month":"06","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19759"}],"link":[{"url":"https://github.com/berndprach/1LipschitzLayersCompared","relation":"software"}]},"acknowledgement":"This work was partially supported by project SERICS (PE00000014) under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU.\r\n","year":"2024","OA_type":"green","title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","oa":1,"researchdata_availability":"no","date_published":"2024-06-01T00:00:00Z","OA_place":"repository","arxiv":1,"status":"public","has_accepted_license":"1","external_id":{"isi":["001344387500055"],"arxiv":["2311.16833"]}},{"day":"05","_id":"18874","date_created":"2025-01-24T16:57:29Z","fulldoi":"https://doi.org/10.48550/arXiv.2412.04245","corr_author":"1","oa_version":"Preprint","article_number":"2412.04245","citation":{"ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, 2412.04245, doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>.","short":"B. Prach, C. Lampert, ArXiv (n.d.).","ama":"Prach B, Lampert C. Intriguing properties of robust classification. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” <i>arXiv</i>. .","apa":"Prach, B., &#38; Lampert, C. (n.d.). Intriguing properties of robust classification. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>."},"related_material":{"record":[{"relation":"later_version","status":"public","id":"20455"},{"status":"public","relation":"dissertation_contains","id":"19759"}]},"month":"12","year":"2024","title":"Intriguing properties of robust classification","oa":1,"date_published":"2024-12-05T00:00:00Z","researchdata_availability":"no","status":"public","OA_place":"repository","arxiv":1,"external_id":{"arxiv":["2412.04245"]},"date_updated":"2026-10-02T11:15:43Z","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"type":"preprint","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","das_tickbox":"0","doi":"10.48550/arXiv.2412.04245","abstract":[{"lang":"eng","text":"Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"publication_status":"draft","supplementarymaterial":"yes","publication":"arXiv","author":[{"full_name":"Prach, Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd","last_name":"Prach"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}]},{"fulldoi":"https://doi.org/10.48550/arXiv.2407.19908","date_created":"2024-08-01T06:34:08Z","day":"29","_id":"17361","month":"07","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20551"},{"id":"21743","relation":"later_version","status":"public"}]},"acknowledgement":"The authors are grateful to Boris Khesin for valuable comments on the MW symplectic structure and S. Ishida thanks Albert Chern for insightful discussions on space curves and Chris Wojtan for his continuous support. M. Bauer was partially supported by NSF grant DMS-1953244 and by the Binational Science Foundation (BSF). S. Ishida was partially supported by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Some figures were generated by the software Houdini and its education license was provided by SideFX.","oa_version":"Preprint","citation":{"mla":"Bauer, Martin, et al. “Symplectic Structures on the Space of Space Curves.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>.","ista":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>.","short":"M. Bauer, S. Ishida, P.W. Michor, ArXiv (n.d.).","apa":"Bauer, M., Ishida, S., &#38; Michor, P. W. (n.d.). Symplectic structures on the space of space curves. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">https://doi.org/10.48550/arXiv.2407.19908</a>","ieee":"M. Bauer, S. Ishida, and P. W. Michor, “Symplectic structures on the space of space curves,” <i>arXiv</i>. .","ama":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>","chicago":"Bauer, Martin, Sadashige Ishida, and Peter W. Michor. “Symplectic Structures on the Space of Space Curves.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">https://doi.org/10.48550/arXiv.2407.19908</a>."},"title":"Symplectic structures on the space of space curves","oa":1,"year":"2024","status":"public","OA_place":"repository","arxiv":1,"external_id":{"arxiv":["2407.19908"]},"keyword":["space of space curves","symplectic stuctures"],"date_published":"2024-07-29T00:00:00Z","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"researchdata_availability":"no","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"type":"preprint","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:16:46Z","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","publication":"arXiv","author":[{"full_name":"Bauer, Martin","first_name":"Martin","last_name":"Bauer"},{"full_name":"Ishida, Sadashige","orcid":"0000-0002-3121-3100","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","last_name":"Ishida"},{"last_name":"Michor","first_name":"Peter W.","full_name":"Michor, Peter W."}],"das_tickbox":"0","publication_status":"draft","abstract":[{"lang":"eng","text":"We present symplectic structures on the shape space of unparameterized space curves that generalize the classical Marsden-Weinstein structure. Our method integrates the Liouville 1-form of the Marsden-Weinstein structure with Riemannian structures that have been introduced in mathematical shape analysis. We also derive Hamiltonian vector fields for several classical Hamiltonian functions with respect to these new symplectic structures."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2407.19908"}],"doi":"10.48550/arXiv.2407.19908"},{"oa":1,"title":"Multi-material mesh-based surface tracking with implicit topology changes","year":"2024","OA_type":"hybrid","has_accepted_license":"1","external_id":{"isi":["001289270900021"]},"OA_place":"publisher","status":"public","researchdata_availability":"no","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"keyword":["surface tracking","topology change","non- manifold meshes","multi-material flows","solid modeling"],"date_published":"2024-07-01T00:00:00Z","corr_author":"1","date_created":"2024-07-10T12:24:00Z","fulldoi":"https://doi.org/10.1145/3658223","_id":"17219","day":"01","acknowledgement":"Peter Heiss-Synak helped conceive the project, helped formulate the algorithm structure, contributed ideas and code to Sections 6 & 8, the mesh data structure, algorithm robustness and benchmarks, helped write the paper, and provided supervision and conceptual solutions throughout the project. Aleksei Kalinov contributed ideas and code to Sections 7, 8.5, and 5, the sparse grid data structure, algorithm robustness and benchmarks, optimized the performance, produced all results, most figures, and the supplementary video, helped write the text, and provided conceptual solutions throughout the project. Malina Strugaru helped implement the mesh data structure and designed re-meshing operations for non-manifold triangle meshes. Arian Etemadi developed early prototypes for ideas in Sections 8.1 and 8.3 and helped write the paper. Huidong Yang developed early prototypes for isosurface extraction and visualization. Chris Wojtan helped conceive the project, helped write the paper, and provided supervision, prototype grid data structure code, and conceptual solutions throughout the project. We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback, Christopher Batty for discussions about LosTopos, and SideFX for the Houdini Education software licenses.  This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","month":"07","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19630"},{"id":"18301","status":"public","relation":"dissertation_contains"}]},"citation":{"short":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, C. Wojtan, ACM Transactions on Graphics 43 (2024).","ista":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. 2024. Multi-material mesh-based surface tracking with implicit topology changes. ACM Transactions on Graphics. 43(4), 54.","mla":"Synak, Peter, et al. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4, 54, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>.","chicago":"Synak, Peter, Aleksei Kalinov, Irina-Malina Strugaru, Arian Etemadi, Huidong Yang, and Chris Wojtan. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>.","ama":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. 2024;43(4). doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>","ieee":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, and C. Wojtan, “Multi-material mesh-based surface tracking with implicit topology changes,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4. Association for Computing Machinery, 2024.","apa":"Synak, P., Kalinov, A., Strugaru, I.-M., Etemadi, A., Yang, H., &#38; Wojtan, C. (2024). Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>"},"oa_version":"Published Version","article_number":"54","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"ddc":["004"],"publisher":"Association for Computing Machinery","quality_controlled":"1","volume":43,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (via OA deal)","article_type":"original","isi":1,"author":[{"full_name":"Synak, Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","last_name":"Synak","first_name":"Peter"},{"last_name":"Kalinov","first_name":"Aleksei","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02","orcid":"0000-0003-2189-3904","full_name":"Kalinov, Aleksei"},{"full_name":"Strugaru, Irina-Malina","first_name":"Irina-Malina","last_name":"Strugaru","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074"},{"full_name":"Etemadihaghighi, Arian","last_name":"Etemadihaghighi","first_name":"Arian","id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f"},{"full_name":"Yang, Huidong","first_name":"Huidong","last_name":"Yang"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"publication":"ACM Transactions on Graphics","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"file_date_updated":"2025-11-11T09:50:52Z","supplementarymaterial":"no","doi":"10.1145/3658223","publication_status":"published","abstract":[{"lang":"eng","text":"We introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts self-intersections into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations with thousands of interacting bubbles, and boolean unions of non-manifold meshes consisting of millions of triangles."}],"das_tickbox":"0","type":"journal_article","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"file":[{"success":1,"content_type":"application/pdf","date_created":"2024-07-23T06:35:15Z","date_updated":"2024-07-23T06:35:15Z","file_id":"17317","file_name":"2024_ACMToG_HeissSynak.pdf","relation":"main_file","access_level":"open_access","creator":"dernst","file_size":48763368,"checksum":"1917067d4b52d7729019b03560004e43"},{"success":1,"content_type":"video/mp4","date_created":"2024-07-10T12:23:44Z","date_updated":"2024-07-10T12:23:44Z","file_id":"17221","file_name":"sdtopofixer_final.mp4","relation":"main_file","creator":"akalinov","access_level":"open_access","file_size":48021463,"checksum":"a4f0e293184bfa034c0c585848806b17"},{"date_updated":"2025-11-11T09:50:52Z","file_id":"20633","file_name":"SuperDuperTopoFixer.pdf","content_type":"application/pdf","title":"Authors' version of the text","date_created":"2025-11-11T09:50:52Z","creator":"akalinov","access_level":"open_access","file_size":48639581,"checksum":"18fc310a78ec91651148c45a8b89fa44","relation":"preprint"}],"issue":"4","date_updated":"2026-10-02T11:19:25Z","language":[{"iso":"eng"}],"intvolume":"        43","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","scopus_import":"1"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J"}],"publication_status":"published","doi":"10.15479/at:ista:18301","abstract":[{"text":"Physics simulation in computer graphics can bring triangle meshes into topologically invalid states. The method in this thesis contributed to Heiss-Synak* and Kalinov* et al. [2024] who devised a non-manifold hybrid surface tracker—a surface tracker that repairs explicit non-manifold triangle meshes with the help of the implicit domain. Specifically, this thesis provides an algorithm for filling the holes that are left after removing problematic parts of the mesh.","lang":"eng"}],"das_tickbox":"0","author":[{"full_name":"Etemadihaghighi, Arian","last_name":"Etemadihaghighi","first_name":"Arian","id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f"}],"file_date_updated":"2024-10-24T14:34:54Z","supplementarymaterial":"no","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png"},"date_updated":"2026-10-02T11:19:26Z","language":[{"iso":"eng"}],"type":"dissertation","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"file":[{"file_name":"thesis-arian-etemadi.pdf","file_id":"18469","date_updated":"2024-10-24T14:34:42Z","content_type":"application/pdf","date_created":"2024-10-24T14:34:42Z","success":1,"file_size":8914218,"checksum":"80fb7923e229ad9d39253d7c8a8083d0","access_level":"open_access","creator":"aetemadi","relation":"main_file"},{"date_created":"2024-10-24T14:34:54Z","content_type":"application/x-zip-compressed","file_id":"18470","date_updated":"2024-10-24T14:34:54Z","file_name":"thesis-arian-etemadi-latex-source.zip","relation":"source_file","access_level":"closed","creator":"aetemadi","checksum":"1c02586ed7d441d5ec441867650568d1","file_size":9802650}],"license":"https://creativecommons.org/licenses/by-sa/4.0/","year":"2024","oa":1,"title":"Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking","date_published":"2024-10-15T00:00:00Z","keyword":["surface tracking","non-manifold","hole-filling","topology change","multi-material","solid-modeling"],"alternative_title":["ISTA Master's Thesis"],"researchdata_availability":"no","has_accepted_license":"1","OA_place":"publisher","status":"public","page":"39","_id":"18301","day":"15","corr_author":"1","date_created":"2024-10-11T19:52:20Z","fulldoi":"https://doi.org/10.15479/at:ista:18301","publication_identifier":{"issn":["2791-4585"]},"oa_version":"Published Version","citation":{"short":"A. Etemadi, Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking, Institute of Science and Technology Austria, 2024.","ista":"Etemadi A. 2024. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. Institute of Science and Technology Austria.","mla":"Etemadi, Arian. <i>Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>.","chicago":"Etemadi, Arian. “Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>.","ama":"Etemadi A. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>","ieee":"A. Etemadi, “Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking,” Institute of Science and Technology Austria, 2024.","apa":"Etemadi, A. (2024). <i>Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>"},"ddc":["000"],"doi_confirm":"1","degree_awarded":"MS","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"17219"}]},"month":"10"},{"intvolume":"         8","date_updated":"2026-10-02T11:17:04Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"3","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","article_type":"original","publisher":"Society for Industrial and Applied Mathematics","volume":8,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2303.14555"}],"doi":"10.1137/23M1565255","abstract":[{"text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons.","lang":"eng"}],"publication_status":"published","das_tickbox":"0","author":[{"last_name":"Chern","first_name":"Albert","full_name":"Chern, Albert"},{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","orcid":"0000-0002-3121-3100","last_name":"Ishida","first_name":"Sadashige","full_name":"Ishida, Sadashige"}],"isi":1,"supplementarymaterial":"no","publication":"SIAM Journal on Applied Algebra and Geometry","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"782-796","day":"23","_id":"12846","corr_author":"1","fulldoi":"https://doi.org/10.1137/23M1565255","date_created":"2023-04-18T19:16:06Z","oa_version":"Preprint","publication_identifier":{"eissn":["2470-6566"]},"citation":{"chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” <i>SIAM Journal on Applied Algebra and Geometry</i>. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/23M1565255\">https://doi.org/10.1137/23M1565255</a>.","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2024;8(3):782-796. doi:<a href=\"https://doi.org/10.1137/23M1565255\">10.1137/23M1565255</a>","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” <i>SIAM Journal on Applied Algebra and Geometry</i>, vol. 8, no. 3. Society for Industrial and Applied Mathematics, pp. 782–796, 2024.","apa":"Chern, A., &#38; Ishida, S. (2024). Area formula for spherical polygons via prequantization. <i>SIAM Journal on Applied Algebra and Geometry</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/23M1565255\">https://doi.org/10.1137/23M1565255</a>","short":"A. Chern, S. Ishida, SIAM Journal on Applied Algebra and Geometry 8 (2024) 782–796.","ista":"Chern A, Ishida S. 2024. Area formula for spherical polygons via prequantization. SIAM Journal on Applied Algebra and Geometry. 8(3), 782–796.","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” <i>SIAM Journal on Applied Algebra and Geometry</i>, vol. 8, no. 3, Society for Industrial and Applied Mathematics, 2024, pp. 782–96, doi:<a href=\"https://doi.org/10.1137/23M1565255\">10.1137/23M1565255</a>."},"ddc":["516"],"acknowledgement":"This work was funded by European Research Council Consolidator grant 101045083 CoDiNA and National Science Foundation CAREER award 2239062. Some figures in the article were generated by the software Houdini and its education license was provided by SideFX. The authors acknowledge anonymous referees for their reviews and insightful suggestions, and Chris Wojtan for his continuous support through discussions. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles.","month":"09","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20551"}]},"OA_type":"green","year":"2024","oa":1,"title":"Area formula for spherical polygons via prequantization","date_published":"2024-09-23T00:00:00Z","researchdata_availability":"no","project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"external_id":{"isi":["001342265800009"],"arxiv":["2303.14555"]},"has_accepted_license":"1","status":"public","OA_place":"repository","arxiv":1},{"title":"Compressing large neural networks: Algorithms, systems and scaling laws","oa":1,"year":"2024","status":"public","OA_place":"publisher","has_accepted_license":"1","ec_funded":1,"alternative_title":["ISTA Thesis"],"date_published":"2024-09-05T00:00:00Z","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"researchdata_availability":"no","fulldoi":"https://doi.org/10.15479/at:ista:17485","date_created":"2024-09-02T11:01:48Z","corr_author":"1","_id":"17485","day":"05","page":"129","related_material":{"record":[{"id":"17378","status":"public","relation":"part_of_dissertation"},{"id":"17087","status":"public","relation":"part_of_dissertation"},{"id":"14458","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18061"},{"id":"18062","relation":"part_of_dissertation","status":"public"}]},"month":"09","degree_awarded":"PhD","doi_confirm":"1","ddc":["000"],"oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"citation":{"ieee":"E. Frantar, “Compressing large neural networks: Algorithms, systems and scaling laws,” Institute of Science and Technology Austria, 2024.","ama":"Frantar E. Compressing large neural networks: Algorithms, systems and scaling laws. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>","apa":"Frantar, E. (2024). <i>Compressing large neural networks: Algorithms, systems and scaling laws</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>","chicago":"Frantar, Elias. “Compressing Large Neural Networks: Algorithms, Systems and Scaling Laws.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>.","ista":"Frantar E. 2024. Compressing large neural networks: Algorithms, systems and scaling laws. Institute of Science and Technology Austria.","mla":"Frantar, Elias. <i>Compressing Large Neural Networks: Algorithms, Systems and Scaling Laws</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>.","short":"E. Frantar, Compressing Large Neural Networks: Algorithms, Systems and Scaling Laws, Institute of Science and Technology Austria, 2024."},"supervisor":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","file_date_updated":"2024-09-06T16:24:59Z","author":[{"full_name":"Frantar, Elias","last_name":"Frantar","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"}],"das_tickbox":"0","abstract":[{"lang":"eng","text":"Large language models (LLMs) have made tremendous progress in the past few years, from being able to generate coherent text to matching or surpassing humans in a wide variety of creative, knowledge or reasoning tasks. Much of this can be attributed to massively increased scale, both in the size of the model as well as the amount of training data, from 100s of millions to 100s of billions, or even trillions. This trend is expected to continue, which, although exciting, also raises major practical concerns. Already today's 100+ billion parameter LLMs require top-of-the-line hardware just to run. Hence, it is clear that sustaining these developments will require significant efficiency advances.\r\n\r\nHistorically, one of the most practical ways of improving model efficiency has been compression, especially in the form of sparsity or quantization. While this has been studied extensively in the past, existing accurate methods are all designed for models around 100 million parameters; scaling them up to ones literally 1000x larger is highly challenging. In this thesis, we introduce a new unified sparsification and quantization approach OBC, which through additional algorithmic enhancements leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity, respectively. Additionally, we show how weight-only quantizion does not just bring space savings but also up to 4.5x faster generation speed, via custom GPU kernels.\r\n\r\nIn fact, we show for the first time that it is possible to develop an FP16 times INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes close to simultaneously maximizing both memory and compute utilization, making weight-only quantization highly practical even for multi-user serving. Further, we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter models, where extreme sub-1-bit compression rates can be achieved without any inference slow-down, by co-designing a bespoke entropy coding scheme together with an efficient kernel.\r\n\r\nFinally, we also study compression from the perspective of someone with access to massive amounts of compute resources for training large models completely from scratch. Here the key questions evolve around the joint scaling behavior between compression, model size, and amount of training data used. Based on extensive experimental results for both vision and text models, we introduce the first scaling law which accurately captures the relationship between weight-sparsity, number of non-zero weights and data. This further allows us to characterize the optimal sparsity, which we find to increase the longer a fixed cost model is being trained.\r\n\r\nOverall, this thesis presents contributions to three different angles of large model efficiency: affordable but accurate algorithms, highly efficient systems implementations, and fundamental scaling laws for compressed training."}],"publication_status":"published","doi":"10.15479/at:ista:17485","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"file":[{"content_type":"application/zip","date_created":"2024-09-05T12:04:11Z","file_name":"thesis-final.zip","file_id":"17570","date_updated":"2024-09-05T12:04:11Z","relation":"source_file","file_size":1615167,"checksum":"5d785645805a78c5b4ce7cc3df557b09","creator":"efrantar","access_level":"closed"},{"relation":"main_file","creator":"efrantar","access_level":"open_access","checksum":"a9dd1c2d23734986924eb44ebb55fd8f","file_size":2376611,"success":1,"date_created":"2024-09-06T16:24:59Z","content_type":"application/pdf","date_updated":"2024-09-06T16:24:59Z","file_id":"17880","file_name":"frantar_thesis_final.pdf"}],"type":"dissertation","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:19:46Z","acknowledged_ssus":[{"_id":"ScienComp"}]},{"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"location":"Vienna, Austria","end_date":"2024-05-07","name":"ICLR: International Conference on Learning Representations","start_date":"2024-05-07"},"article_processing_charge":"No","author":[{"full_name":"Frantar, Elias","first_name":"Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"full_name":"Ruiz, Carlos Riquelme","first_name":"Carlos Riquelme","last_name":"Ruiz"},{"full_name":"Houlsby, Neil","first_name":"Neil","last_name":"Houlsby"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Evci, Utku","last_name":"Evci","first_name":"Utku"}],"publication":"The Twelfth International Conference on Learning Representations","supplementarymaterial":"no","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=i9K2ZWkYIP"}],"publication_status":"published","abstract":[{"text":"We explore the impact of parameter sparsity on the scaling behavior of Transformers trained on massive datasets (i.e., \"foundation models\"), in both vision and language domains. In this setting, we identify the first scaling law describing the relationship between weight sparsity, number of non-zero parameters, and amount of training data, which we validate empirically across model and data scales; on ViT/JFT-4B and T5/C4. These results allow us to characterize the \"optimal sparsity\", the sparsity level which yields the best performance for a given effective model size and training budget. For a fixed number of non-zero parameters, we identify that the optimal sparsity increases with the amount of data used for training. We also extend our study to different sparsity structures (such as the hardware-friendly n:m pattern) and strategies (such as starting from a pretrained dense model). Our findings shed light on the power and limitations of weight sparsity across various parameter and computational settings, offering both theoretical understanding and practical implications for leveraging sparsity towards computational efficiency improvements. We provide pruning and scaling law fitting code at: github.com/google-research/jaxpruner/tree/main/jaxpruner/projects/bigsparse.","lang":"eng"}],"das_tickbox":"0","type":"conference","department":[{"_id":"DaAl"}],"date_updated":"2026-10-02T11:19:46Z","language":[{"iso":"eng"}],"scopus_import":"1","oa":1,"title":"Scaling laws for sparsely-connected foundation models","year":"2024","external_id":{"arxiv":["2309.08520"]},"arxiv":1,"status":"public","researchdata_availability":"no","date_published":"2024-01-16T00:00:00Z","corr_author":"1","date_created":"2024-09-13T10:31:08Z","_id":"18062","day":"16","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"17485"}]},"month":"01","citation":{"short":"E. Frantar, C.R. Ruiz, N. Houlsby, D.-A. Alistarh, U. Evci, in:, The Twelfth International Conference on Learning Representations, 2024.","mla":"Frantar, Elias, et al. “Scaling Laws for Sparsely-Connected Foundation Models.” <i>The Twelfth International Conference on Learning Representations</i>, 2024.","ista":"Frantar E, Ruiz CR, Houlsby N, Alistarh D-A, Evci U. 2024. Scaling laws for sparsely-connected foundation models. The Twelfth International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Frantar, Elias, Carlos Riquelme Ruiz, Neil Houlsby, Dan-Adrian Alistarh, and Utku Evci. “Scaling Laws for Sparsely-Connected Foundation Models.” In <i>The Twelfth International Conference on Learning Representations</i>, 2024.","apa":"Frantar, E., Ruiz, C. R., Houlsby, N., Alistarh, D.-A., &#38; Evci, U. (2024). Scaling laws for sparsely-connected foundation models. In <i>The Twelfth International Conference on Learning Representations</i>. Vienna, Austria.","ama":"Frantar E, Ruiz CR, Houlsby N, Alistarh D-A, Evci U. Scaling laws for sparsely-connected foundation models. In: <i>The Twelfth International Conference on Learning Representations</i>. ; 2024.","ieee":"E. Frantar, C. R. Ruiz, N. Houlsby, D.-A. Alistarh, and U. Evci, “Scaling laws for sparsely-connected foundation models,” in <i>The Twelfth International Conference on Learning Representations</i>, Vienna, Austria, 2024."},"oa_version":"Published Version","ddc":["000"]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","conference":{"end_date":"2024-05-16","name":"MLSys: Machine Learning and Systems","start_date":"2024-05-13","location":"Santa Clara, CA, United States"},"volume":6,"quality_controlled":"1","publication_status":"published","abstract":[{"text":"Mixture-of-Experts (MoE) architectures offer a general solution to the high inference costs of large language models (LLMs) via sparse routing, bringing faster and more accurate models, at the cost of massive parameter counts. For example, the SwitchTransformer-c2048 model has 1.6 trillion parameters, requiring 3.2TB of accelerator memory to run efficiently, which makes practical deployment challenging and expensive. In this paper, we present a solution to this memory problem, in form of a new compression and execution framework called QMoE. Specifically, QMoE consists of a scalable algorithm which accurately compresses trillion-parameter MoEs to less than 1 bit per parameter, in a custom format co-designed with bespoke GPU decoding kernels to facilitate efficient end-to-end compressed inference, with minor runtime overheads relative to uncompressed execution. Concretely, QMoE can compress the 1.6 trillion parameter SwitchTransformer-c2048 model to less than 160GB (20x compression, 0.8 bits per parameter) at only minor accuracy loss, in less than a day on a single GPU. This enables, for the first time, the execution of a trillion-parameter model on affordable commodity hardware, like a single server with 4x NVIDIA A6000 or 8x NVIDIA 3090 GPUs, at less than 5% runtime overhead relative to ideal uncompressed inference. The anonymized code is available at: github.com/mlsys24-qmoe/qmoe.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.mlsys.org/paper_files/paper/2024/hash/c74b624843218d9b6713fcf299d6d5e4-Abstract-Conference.html"}],"das_tickbox":"0","author":[{"full_name":"Frantar, Elias","last_name":"Frantar","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"supplementarymaterial":"no","publication":"Proceedings of Machine Learning and Systems","intvolume":"         6","date_updated":"2026-10-02T11:19:46Z","language":[{"iso":"eng"}],"type":"conference","department":[{"_id":"DaAl"}],"year":"2024","oa":1,"title":"QMoE: Sub-1-bit compression of trillion parameter models","date_published":"2024-05-01T00:00:00Z","researchdata_availability":"yes","status":"public","day":"01","_id":"18061","corr_author":"1","date_created":"2024-09-13T10:01:38Z","oa_version":"Published Version","citation":{"short":"E. Frantar, D.-A. Alistarh, in:, Proceedings of Machine Learning and Systems, 2024.","mla":"Frantar, Elias, and Dan-Adrian Alistarh. “QMoE: Sub-1-Bit Compression of Trillion Parameter Models.” <i>Proceedings of Machine Learning and Systems</i>, vol. 6, 2024.","ista":"Frantar E, Alistarh D-A. 2024. QMoE: Sub-1-bit compression of trillion parameter models. Proceedings of Machine Learning and Systems. MLSys: Machine Learning and Systems vol. 6.","chicago":"Frantar, Elias, and Dan-Adrian Alistarh. “QMoE: Sub-1-Bit Compression of Trillion Parameter Models.” In <i>Proceedings of Machine Learning and Systems</i>, Vol. 6, 2024.","apa":"Frantar, E., &#38; Alistarh, D.-A. (2024). QMoE: Sub-1-bit compression of trillion parameter models. In <i>Proceedings of Machine Learning and Systems</i> (Vol. 6). Santa Clara, CA, United States.","ieee":"E. Frantar and D.-A. Alistarh, “QMoE: Sub-1-bit compression of trillion parameter models,” in <i>Proceedings of Machine Learning and Systems</i>, Santa Clara, CA, United States, 2024, vol. 6.","ama":"Frantar E, Alistarh D-A. QMoE: Sub-1-bit compression of trillion parameter models. In: <i>Proceedings of Machine Learning and Systems</i>. Vol 6. ; 2024."},"ddc":["000"],"month":"05","related_material":{"record":[{"id":"17485","relation":"dissertation_contains","status":"public"}]}},{"OA_place":"publisher","status":"public","ec_funded":1,"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"date_published":"2024-09-04T00:00:00Z","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"researchdata_availability":"no","title":"Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective","oa":1,"year":"2024","month":"09","related_material":{"record":[{"id":"14461","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"12780"},{"id":"17456","status":"public","relation":"part_of_dissertation"}]},"degree_awarded":"PhD","ddc":["000"],"doi_confirm":"1","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","citation":{"chicago":"Markov, Ilia. “Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>.","ama":"Markov I. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>","ieee":"I. Markov, “Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective,” Institute of Science and Technology Austria, 2024.","apa":"Markov, I. (2024). <i>Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>","short":"I. Markov, Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective, Institute of Science and Technology Austria, 2024.","ista":"Markov I. 2024. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. Institute of Science and Technology Austria.","mla":"Markov, Ilia. <i>Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>."},"date_created":"2024-09-04T08:51:11Z","fulldoi":"https://doi.org/10.15479/at:ista:17490","corr_author":"1","_id":"17490","day":"04","page":"102","file_date_updated":"2024-09-04T08:36:06Z","supplementarymaterial":"no","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"author":[{"full_name":"Markov, Ilia","last_name":"Markov","first_name":"Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"}],"das_tickbox":"0","doi":"10.15479/at:ista:17490","publication_status":"published","abstract":[{"text":"Deep learning is essential in numerous applications nowadays, with many recent advancements made possible by training very large models. Despite their broad applicability, training neural networks is often time-intensive, and it is usually impractical to manage large models and datasets on a single machine. To address these issues, distributed deep learning training has become increasingly important. However, distributed training requires synchronization among nodes, and the mini-batch stochastic gradient descent algorithm places a significant load on network connections. A possible solution to tackle the synchronization bottleneck is to reduce a message size by lossy compression.\r\n\r\nIn this thesis, we investigate systems and algorithmic approaches to communication compression during training. From the systems perspective, we demonstrate that a common approach of expensive hardware overprovisioning can be replaced through a thorough system design. We introduce a framework that introduces efficient software support for compressed communication in machine learning applications, applicable to both multi-GPU single-node training and larger-scale multi-node training. Our framework integrates with popular ML frameworks, providing up to 3x speedups for multi-GPU nodes based on commodity hardware and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy.\r\n\r\nAlso, we consider an application of our framework to different communication schemes, such as Fully Sharded Data Parallel. We provide strong convergence guarantees for the compression in such a setup. Empirical validation shows that our method preserves model accuracy for GPT-family models with up to 1.3 billion parameters, while completely removing the communication bottlenecks of non-compressed alternatives, providing up to 2.2x speedups end-to-end.\r\n\r\nFrom the algorithmic side, we propose a general framework that dynamically adjusts the degree of compression across a model's layers during training. This approach enhances overall compression and results in significant speedups without compromising accuracy. Our algorithm utilizes an adaptive algorithm that automatically selects the optimal compression parameters for model layers, ensuring the best compression ratio while adhering to an error constraint. Our method is effective across all existing families of compression methods. It achieves up to 2.5x faster training and up to a 5x improvement in compression compared to efficient implementations of current approaches. Additionally, LGreCo can complement existing adaptive algorithms.\r\n","lang":"eng"}],"supervisor":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"file":[{"date_created":"2024-09-04T08:35:35Z","content_type":"application/x-zip-compressed","file_name":"Thesis.zip","file_id":"17491","date_updated":"2024-09-04T08:35:35Z","relation":"source_file","checksum":"77609f4835d2730e46fa0d42d9134ed9","file_size":43327753,"creator":"imarkov","access_level":"closed"},{"file_name":"Thesis_final_version_pdfa2.pdf","file_id":"17492","date_updated":"2024-09-04T08:36:06Z","date_created":"2024-09-04T08:36:06Z","content_type":"application/pdf","success":1,"checksum":"9e68f7217570f756ceb8f70b980938cd","file_size":2756082,"access_level":"open_access","creator":"imarkov","relation":"main_file"}],"type":"dissertation","language":[{"iso":"eng"}],"date_updated":"2026-10-02T11:20:06Z"},{"day":"01","_id":"17456","corr_author":"1","date_created":"2024-08-22T08:29:25Z","oa_version":"Published Version","citation":{"chicago":"Markov, Ilia, Kaveh Alimohammadi, Elias Frantar, and Dan-Adrian Alistarh. “L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient Data-Parallel Deep Learning.” In <i>Proceedings of Machine Learning and Systems </i>, edited by P. Gibbons, G. Pekhimenko, and C. De Sa, Vol. 6. Association for Computing Machinery, 2024.","ieee":"I. Markov, K. Alimohammadi, E. Frantar, and D.-A. Alistarh, “L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning,” in <i>Proceedings of Machine Learning and Systems </i>, Athens, Greece, 2024, vol. 6.","ama":"Markov I, Alimohammadi K, Frantar E, Alistarh D-A. L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. In: Gibbons P, Pekhimenko G, De Sa C, eds. <i>Proceedings of Machine Learning and Systems </i>. Vol 6. Association for Computing Machinery; 2024.","apa":"Markov, I., Alimohammadi, K., Frantar, E., &#38; Alistarh, D.-A. (2024). L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. In P. Gibbons, G. Pekhimenko, &#38; C. De Sa (Eds.), <i>Proceedings of Machine Learning and Systems </i> (Vol. 6). Athens, Greece: Association for Computing Machinery.","short":"I. Markov, K. Alimohammadi, E. Frantar, D.-A. Alistarh, in:, P. Gibbons, G. Pekhimenko, C. De Sa (Eds.), Proceedings of Machine Learning and Systems , Association for Computing Machinery, 2024.","ista":"Markov I, Alimohammadi K, Frantar E, Alistarh D-A. 2024. L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning. Proceedings of Machine Learning and Systems . MLSys: Machine Learning and Systems vol. 6.","mla":"Markov, Ilia, et al. “L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient Data-Parallel Deep Learning.” <i>Proceedings of Machine Learning and Systems </i>, edited by P. Gibbons et al., vol. 6, Association for Computing Machinery, 2024."},"ddc":["000"],"month":"04","related_material":{"record":[{"id":"17490","relation":"dissertation_contains","status":"public"}]},"year":"2024","oa":1,"title":"L-GreCo: Layerwise-adaptive gradient compression for efficient data-parallel deep learning","date_published":"2024-04-01T00:00:00Z","researchdata_availability":"no","external_id":{"arxiv":["2210.17357"]},"arxiv":1,"status":"public","intvolume":"         6","date_updated":"2026-10-02T11:20:05Z","language":[{"iso":"eng"}],"editor":[{"last_name":"Gibbons","first_name":"P.","full_name":"Gibbons, P."},{"full_name":"Pekhimenko, G.","last_name":"Pekhimenko","first_name":"G."},{"full_name":"De Sa, C.","first_name":"C.","last_name":"De Sa"}],"type":"conference","department":[{"_id":"DaAl"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","conference":{"end_date":"2024-04-22","name":"MLSys: Machine Learning and Systems","start_date":"2024-04-22","location":"Athens, Greece"},"publisher":"Association for Computing Machinery","volume":6,"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Data-parallel distributed training of deep neural networks (DNN) has gained very widespread adoption, but can still experience communication bottlenecks. To address this issue, entire families of compression mechanisms have been developed, including quantization, sparsification, and low-rank approximation, some of which are seeing significant practical adoption. Despite this progress, almost all known compression schemes apply compression uniformly across DNN layers, although layers are heterogeneous in terms of parameter count and their impact on model accuracy.In this work, we provide a general framework for adapting the degree of compression across the model's layers dynamically during training, improving the overall compression, while leading to substantial speedups, without sacrificing accuracy. Our framework, called L-GreCo, is based on an adaptive algorithm, which automatically picks the optimal compression parameters for model layers guaranteeing the best compression ratio while satisfying an error constraint. Extensive experiments over image classification and language modeling tasks shows that L-GreCo is effective across all existing families of compression methods, and achieves up to 2.5\r\n×\r\n training speedup and up to 5\r\n×\r\n compression improvement over efficient implementations of existing approaches, while recovering full accuracy. Moreover, L-GreCo is complementary to existing adaptive algorithms, improving their compression ratio by 50\\% and practical throughput by 66\\%. An anonymized implementation is available at https://github.com/LGrCo/L-GreCo."}],"main_file_link":[{"url":"https://proceedings.mlsys.org/paper_files/paper/2024/hash/9069a8976ff06f6443e7f4172990a580-Abstract-Conference.html","open_access":"1"}],"das_tickbox":"0","author":[{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","first_name":"Ilia","full_name":"Markov, Ilia"},{"full_name":"Alimohammadi, Kaveh","first_name":"Kaveh","last_name":"Alimohammadi"},{"full_name":"Frantar, Elias","last_name":"Frantar","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"}],"supplementarymaterial":"no","publication":"Proceedings of Machine Learning and Systems "}]
