[{"OA_place":"publisher","OA_type":"hybrid","language":[{"iso":"eng"}],"volume":37,"publication_status":"published","type":"journal_article","file_date_updated":"2025-12-30T06:39:11Z","oa":1,"abstract":[{"lang":"eng","text":"Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"fulldoi":"https://doi.org/10.1007/s00521-024-10616-1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","date_created":"2023-02-20T08:23:06Z","day":"01","scopus_import":"1","quality_controlled":"1","arxiv":1,"year":"2025","intvolume":"        37","corr_author":"1","title":"Generalization in multi-objective machine learning","_id":"12662","external_id":{"arxiv":["2208.13499"]},"PlanS_conform":"1","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["0941-0643"],"eissn":["1433-3058"]},"month":"10","doi":"10.1007/s00521-024-10616-1","department":[{"_id":"ChLa"}],"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-10-01T00:00:00Z","has_accepted_license":"1","file":[{"file_size":500213,"file_name":"2025_NeuralCompApplic_Sukenik.pdf","relation":"main_file","date_updated":"2025-12-30T06:39:11Z","checksum":"61ad4591aee16b1e02daf6c164321a42","creator":"dernst","access_level":"open_access","success":1,"file_id":"20877","content_type":"application/pdf","date_created":"2025-12-30T06:39:11Z"}],"oa_version":"Published Version","article_type":"original","publication":"Neural Computing and Applications","license":"https://creativecommons.org/licenses/by/4.0/","citation":{"chicago":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>.","ama":"Súkeník P, Lampert C. Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. 2025;37:24669–24683. doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>","ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 24669–24683.","apa":"Súkeník, P., &#38; Lampert, C. (2025). Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.","ieee":"P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,” <i>Neural Computing and Applications</i>, vol. 37. Springer Nature, pp. 24669–24683, 2025.","mla":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>, vol. 37, Springer Nature, 2025, pp. 24669–24683, doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>."},"publisher":"Springer Nature","date_updated":"2025-12-30T06:39:56Z","author":[{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter","first_name":"Peter","last_name":"Súkeník"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"page":"24669–24683","status":"public"},{"title":"Logic gate neural networks are good for verification","year":"2025","arxiv":1,"intvolume":"       288","corr_author":"1","article_processing_charge":"No","publication_identifier":{"eissn":["2640-3498"]},"month":"06","_id":"20296","external_id":{"arxiv":["2505.19932"]},"file":[{"content_type":"application/pdf","file_id":"20314","date_created":"2025-09-09T08:10:13Z","access_level":"open_access","success":1,"date_updated":"2025-09-09T08:10:13Z","checksum":"90a32defed34787e771a5c1623b6b0d2","creator":"dernst","file_size":295466,"file_name":"2025_NeuS_Kresse.pdf","relation":"main_file"}],"oa_version":"Published Version","department":[{"_id":"ChLa"},{"_id":"ToHe"}],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-06-01T00:00:00Z","has_accepted_license":"1","ec_funded":1,"publisher":"ML Research Press","author":[{"full_name":"Kresse, Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604","first_name":"Fabian","last_name":"Kresse"},{"last_name":"Yu","first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2025-09-09T08:12:44Z","status":"public","publication":"2nd International Conferenceon Neuro-Symbolic Systems","citation":{"chicago":"Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic Gate Neural Networks Are Good for Verification.” In <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, Vol. 288. ML Research Press, 2025.","ista":"Kresse F, Yu E, Lampert C, Henzinger TA. 2025. Logic gate neural networks are good for verification. 2nd International Conferenceon Neuro-Symbolic Systems. NeuS: International Conferenceon Neuro-Symbolic Systems, PMLR, vol. 288, 26.","ama":"Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good for verification. In: <i>2nd International Conferenceon Neuro-Symbolic Systems</i>. Vol 288. ML Research Press; 2025.","apa":"Kresse, F., Yu, E., Lampert, C., &#38; Henzinger, T. A. (2025). Logic gate neural networks are good for verification. In <i>2nd International Conferenceon Neuro-Symbolic Systems</i> (Vol. 288). Philadephia, PA, United States: ML Research Press.","ieee":"F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks are good for verification,” in <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, Philadephia, PA, United States, 2025, vol. 288.","short":"F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, ML Research Press, 2025.","mla":"Kresse, Fabian, et al. “Logic Gate Neural Networks Are Good for Verification.” <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, vol. 288, 26, ML Research Press, 2025."},"OA_type":"diamond","language":[{"iso":"eng"}],"OA_place":"publisher","alternative_title":["PMLR"],"acknowledged_ssus":[{"_id":"ScienComp"}],"file_date_updated":"2025-09-09T08:10:13Z","publication_status":"published","volume":288,"type":"conference","article_number":"26","conference":{"end_date":"2025-05-30","name":"NeuS: International Conferenceon Neuro-Symbolic Systems","location":"Philadephia, PA, United States","start_date":"2025-05-28"},"acknowledgement":"This work is supported in part by the ERC grant under Grant No. ERC-2020-AdG 101020093 and\r\nthe Austrian Science Fund (FWF) [10.55776/COE12]. This research was supported by the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","date_created":"2025-09-07T22:01:34Z","oa":1,"abstract":[{"lang":"eng","text":"Learning-based systems are increasingly deployed across various domains, yet the complexity of traditional neural networks poses significant challenges for formal verification. Unlike conventional neural networks, learned Logic Gate Networks (LGNs) replace multiplications with Boolean logic gates, yielding a sparse, netlist-like architecture that is inherently more amenable to symbolic verification, while still delivering promising performance. In this paper, we introduce a SAT encoding for verifying global robustness and fairness in LGNs. We evaluate our method on five benchmark datasets, including a newly constructed 5-class variant, and find that LGNs are both verification-friendly and maintain strong predictive performance."}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"quality_controlled":"1","day":"01","scopus_import":"1"},{"year":"2025","arxiv":1,"corr_author":"1","title":"Intriguing properties of robust classification","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"18874"}]},"external_id":{"arxiv":["2412.04245"]},"_id":"20455","publication_identifier":{"issn":["2160-7508"],"eissn":["2160-7516"],"isbn":["9798331599942"]},"article_processing_charge":"No","doi":"10.1109/CVPRW67362.2025.00071","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"date_published":"2025-06-15T00:00:00Z","oa_version":"Preprint","publication":"2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops","citation":{"chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, 660–69. IEEE, 2025. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>.","ama":"Prach B, Lampert C. Intriguing properties of robust classification. In: <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>. IEEE; 2025:660-669. doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>","ista":"Prach B, Lampert C. 2025. Intriguing properties of robust classification. 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. CVPR: Conference on Computer Vision and Pattern Recognition, 660–669.","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, IEEE, 2025, pp. 660–69, doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>.","apa":"Prach, B., &#38; Lampert, C. (2025). Intriguing properties of robust classification. In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i> (pp. 660–669). Nashville, TN, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” in <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, Nashville, TN, United States, 2025, pp. 660–669.","short":"B. Prach, C. Lampert, in:, 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2025, pp. 660–669."},"author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach","first_name":"Bernd"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"date_updated":"2025-10-13T07:18:26Z","page":"660-669","publisher":"IEEE","status":"public","OA_place":"repository","OA_type":"green","language":[{"iso":"eng"}],"publication_status":"published","type":"conference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"abstract":[{"lang":"eng","text":"Despite extensive research since the community learned about adversarial examples 10 years ago, we still do not know how to train high-accuracy classifiers that are guaranteed to be robust to small perturbations of their inputs. Previous works often argued that this might be because no classifier exists that is robust and accurate at the same time. However, in computer vision this assumption does not match reality where humans are usually accurate and robust on most tasks of interest. We offer an alternative explanation and show that in certain settings robust generalization is only possible with unrealistically large amounts of data. Specifically, we find a setting where a robust classifier exists, it is easy to learn an accurate classifier, yet it requires an exponential amount of data to learn a robust classifier. Based on this theoretical result, we evaluate the influence of the amount of training data on datasets such as CIFAR10. Our findings indicate that the the amount of training data is the main factor determining the robust performance. Furthermore we show that that there are low magnitude directions in the data which are useful for non-robust generalization but are not available for robust classifiers. This implies that robust classification is a strictly harder tasks than normal classification, thereby providing an explanation why robust classification requires more data."}],"oa":1,"conference":{"start_date":"2025-06-11","location":"Nashville, TN, United States","name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2025-06-12"},"fulldoi":"https://doi.org/10.1109/CVPRW67362.2025.00071","date_created":"2025-10-12T22:01:26Z","day":"15","scopus_import":"1","quality_controlled":"1"},{"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"21198"}]},"title":"Differentially private federated k-means clustering with server-side data","year":"2025","arxiv":1,"intvolume":"       267","corr_author":"1","article_processing_charge":"No","publication_identifier":{"eissn":["2640-3498"]},"month":"05","_id":"20819","external_id":{"arxiv":["2506.05408"]},"file":[{"creator":"dernst","checksum":"815b32b463023ca21e569c2158745c15","date_updated":"2025-12-16T12:38:29Z","relation":"main_file","file_size":746612,"file_name":"2025_ICML_Scott.pdf","date_created":"2025-12-16T12:38:29Z","content_type":"application/pdf","file_id":"20829","success":1,"access_level":"open_access"}],"oa_version":"Published Version","department":[{"_id":"ChLa"},{"_id":"MoHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_published":"2025-05-01T00:00:00Z","has_accepted_license":"1","publisher":"ML Research Press","author":[{"last_name":"Scott","first_name":"Jonathan A","full_name":"Scott, Jonathan A","id":"e499926b-f6e0-11ea-865d-9c63db0031e8"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"},{"last_name":"Saulpic","first_name":"David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","full_name":"Saulpic, David"}],"page":"53757-53790","date_updated":"2026-04-07T11:46:11Z","status":"public","publication":"42nd International Conference on Machine Learning","citation":{"mla":"Scott, Jonathan A., et al. “Differentially Private Federated K-Means Clustering with Server-Side Data.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 53757–90.","apa":"Scott, J. A., Lampert, C., &#38; Saulpic, D. (2025). Differentially private federated k-means clustering with server-side data. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 53757–53790). Vancouver, Canada: ML Research Press.","short":"J.A. Scott, C. Lampert, D. Saulpic, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 53757–53790.","ieee":"J. A. Scott, C. Lampert, and D. Saulpic, “Differentially private federated k-means clustering with server-side data,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 53757–53790.","chicago":"Scott, Jonathan A, Christoph Lampert, and David Saulpic. “Differentially Private Federated K-Means Clustering with Server-Side Data.” In <i>42nd International Conference on Machine Learning</i>, 267:53757–90. ML Research Press, 2025.","ista":"Scott JA, Lampert C, Saulpic D. 2025. Differentially private federated k-means clustering with server-side data. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 53757–53790.","ama":"Scott JA, Lampert C, Saulpic D. Differentially private federated k-means clustering with server-side data. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:53757-53790."},"OA_type":"gold","language":[{"iso":"eng"}],"alternative_title":["PMLR"],"OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"}],"file_date_updated":"2025-12-16T12:38:29Z","volume":267,"publication_status":"published","type":"conference","conference":{"end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","location":"Vancouver, Canada","start_date":"2025-07-13"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"date_created":"2025-12-14T23:02:05Z","acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF) [10.55776/COE12] and supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).\r\n","oa":1,"abstract":[{"lang":"eng","text":"Clustering is a cornerstone of data analysis that is particularly suited to identifying coherent subgroups or substructures in unlabeled data, as are generated continuously in large amounts these days. However, in many cases traditional clustering methods are not applicable, because data are increasingly being produced and stored in a distributed way, e.g. on edge devices, and privacy concerns prevent it from being transferred to a central server. To address this challenge, we present FedDP-KMeans, a new algorithm for \r\n-means clustering that is fully-federated as well as differentially private. Our approach leverages (potentially small and out-of-distribution) server-side data to overcome the primary challenge of differentially private clustering methods: the need for a good initialization. Combining our initialization with a simple federated DP-Lloyds algorithm we obtain an algorithm that achieves excellent results on synthetic and real-world benchmark tasks. We also provide a theoretical analysis of our method that provides bounds on the convergence speed and cluster identification success."}],"quality_controlled":"1","day":"01","scopus_import":"1"},{"OA_place":"repository","language":[{"iso":"eng"}],"OA_type":"green","type":"preprint","publication_status":"draft","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2505.15579","open_access":"1"}],"abstract":[{"text":"Personalized federated learning has emerged as a popular approach to training on devices holding statistically heterogeneous data, known as clients. However, most existing approaches require a client to have labeled data for training or finetuning in order to obtain their own personalized model. In this paper we address this by proposing FLowDUP, a novel method that is able to generate a personalized model using only a forward pass with unlabeled data. The generated model parameters reside in a low-dimensional subspace, enabling efficient communication and computation. FLowDUP's learning objective is theoretically motivated by our new transductive multi-task PAC-Bayesian generalization bound, that provides performance guarantees for unlabeled clients. The objective is structured in such a way that it allows both clients with labeled data and clients with only unlabeled data to contribute to the training process. To supplement our theoretical results we carry out a thorough experimental evaluation of FLowDUP, demonstrating strong empirical performance on a range of datasets with differing sorts of statistically heterogeneous clients. Through numerous ablation studies, we test the efficacy of the individual components of the method.","lang":"eng"}],"oa":1,"date_created":"2026-02-10T08:20:59Z","fulldoi":"https://doi.org/10.48550/ARXIV.2505.15579","article_number":"2505.15579","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"day":"21","corr_author":"1","year":"2025","related_material":{"record":[{"status":"public","id":"21198","relation":"dissertation_contains"}]},"title":"Federated learning with unlabeled clients: Personalization can happen in low dimensions","_id":"21207","doi":"10.48550/ARXIV.2505.15579","month":"05","article_processing_charge":"No","date_published":"2025-05-21T00:00:00Z","department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","das_tickbox":"1","oa_version":"Preprint","citation":{"mla":"Zakerinia, Hossein, et al. “Federated Learning with Unlabeled Clients: Personalization Can Happen in Low Dimensions.” <i>ArXiv</i>, 2505.15579, doi:<a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">10.48550/ARXIV.2505.15579</a>.","short":"H. Zakerinia, J.A. Scott, C. Lampert, ArXiv (n.d.).","ieee":"H. Zakerinia, J. A. Scott, and C. Lampert, “Federated learning with unlabeled clients: Personalization can happen in low dimensions,” <i>arXiv</i>. .","apa":"Zakerinia, H., Scott, J. A., &#38; Lampert, C. (n.d.). Federated learning with unlabeled clients: Personalization can happen in low dimensions. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">https://doi.org/10.48550/ARXIV.2505.15579</a>","ista":"Zakerinia H, Scott JA, Lampert C. Federated learning with unlabeled clients: Personalization can happen in low dimensions. arXiv, 2505.15579.","ama":"Zakerinia H, Scott JA, Lampert C. Federated learning with unlabeled clients: Personalization can happen in low dimensions. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">10.48550/ARXIV.2505.15579</a>","chicago":"Zakerinia, Hossein, Jonathan A Scott, and Christoph Lampert. “Federated Learning with Unlabeled Clients: Personalization Can Happen in Low Dimensions.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">https://doi.org/10.48550/ARXIV.2505.15579</a>."},"publication":"arXiv","status":"public","author":[{"last_name":"Zakerinia","first_name":"Hossein","id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","full_name":"Zakerinia, Hossein","orcid":"0009-0007-3977-6462"},{"full_name":"Scott, Jonathan A","id":"e499926b-f6e0-11ea-865d-9c63db0031e8","first_name":"Jonathan A","last_name":"Scott"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-07-22T06:34:28Z"},{"acknowledged_ssus":[{"_id":"ScienComp"}],"OA_place":"publisher","alternative_title":["Advances in Neural Information Processing Systems"],"language":[{"iso":"eng"}],"OA_type":"free access","type":"conference","volume":38,"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.52202/085713-1450","open_access":"1"}],"oa":1,"abstract":[{"text":"The empirical emergence of neural collapse—a surprising symmetry in the feature representations of the training data in the penultimate layer of deep neural\r\nnetworks—has spurred a line of theoretical research aimed at its understanding.\r\nHowever, existing work focuses on data-agnostic models or, when data structure is\r\ntaken into account, it remains limited to multi-layer perceptrons. Our paper fills\r\nboth these gaps by analyzing modern architectures in a data-aware regime: we\r\nprove that global optima of deep regularized transformers and residual networks\r\n(ResNets) with LayerNorm trained with cross entropy or mean squared error loss\r\nare approximately collapsed, and the approximation gets tighter as the depth grows.\r\nMore generally, we formally reduce any end-to-end large-depth ResNet or transformer training into an equivalent unconstrained features model, thus justifying its\r\nwide use in the literature even beyond data-agnostic settings. Our theoretical results\r\nare supported by experiments on computer vision and language datasets showing\r\nthat, as the depth grows, neural collapse indeed becomes more prominent.","lang":"eng"}],"acknowledgement":"M. M. and P. S. are funded by the European Union (ERC, INF2\r\n, project number 101161364). Views\r\nand opinions expressed are however those of the author(s) only and do not necessarily reflect those\r\nof the European Union or the European Research Council Executive Agency. Neither the European\r\nUnion nor the granting authority can be held responsible for them. This research was supported\r\nby the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","fulldoi":"https://doi.org/10.52202/085713-1450","date_created":"2026-09-06T22:01:59Z","conference":{"start_date":"2025-12-02","location":"San Diego, CA, United States","name":"NeurIPS: Neural Information Processing Systems","end_date":"2025-12-07"},"scopus_import":"1","day":"02","project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf"}],"quality_controlled":"1","corr_author":"1","arxiv":1,"year":"2025","intvolume":"        38","title":"Neural collapse is globally optimal in deep regularized ResNets and transformers","_id":"22825","external_id":{"arxiv":["2505.15239"]},"month":"12","doi":"10.52202/085713-1450","article_processing_charge":"No","publication_identifier":{"isbn":["9798331338275"],"issn":["1049-5258"]},"date_published":"2025-12-02T00:00:00Z","department":[{"_id":"MaMo"},{"_id":"GradSch"},{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"das_tickbox":"0","supplementarymaterial":"no","oa_version":"Published Version","citation":{"ama":"Súkeník P, Lampert C, Mondelli M. Neural collapse is globally optimal in deep regularized ResNets and transformers. In: <i>39th Conference on Neural Information Processing Systems</i>. Vol 38. Neural Information Processing Systems Foundation; 2025:48646-48677. doi:<a href=\"https://doi.org/10.52202/085713-1450\">10.52202/085713-1450</a>","ista":"Súkeník P, Lampert C, Mondelli M. 2025. Neural collapse is globally optimal in deep regularized ResNets and transformers. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 48646–48677.","chicago":"Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse Is Globally Optimal in Deep Regularized ResNets and Transformers.” In <i>39th Conference on Neural Information Processing Systems</i>, 38:48646–77. Neural Information Processing Systems Foundation, 2025. <a href=\"https://doi.org/10.52202/085713-1450\">https://doi.org/10.52202/085713-1450</a>.","mla":"Súkeník, Peter, et al. “Neural Collapse Is Globally Optimal in Deep Regularized ResNets and Transformers.” <i>39th Conference on Neural Information Processing Systems</i>, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 48646–77, doi:<a href=\"https://doi.org/10.52202/085713-1450\">10.52202/085713-1450</a>.","ieee":"P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse is globally optimal in deep regularized ResNets and transformers,” in <i>39th Conference on Neural Information Processing Systems</i>, San Diego, CA, United States, 2025, vol. 38, pp. 48646–48677.","short":"P. Súkeník, C. Lampert, M. Mondelli, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 48646–48677.","apa":"Súkeník, P., Lampert, C., &#38; Mondelli, M. (2025). Neural collapse is globally optimal in deep regularized ResNets and transformers. In <i>39th Conference on Neural Information Processing Systems</i> (Vol. 38, pp. 48646–48677). San Diego, CA, United States: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.52202/085713-1450\">https://doi.org/10.52202/085713-1450</a>"},"publication":"39th Conference on Neural Information Processing Systems","status":"public","researchdata_availability":"no","publisher":"Neural Information Processing Systems Foundation","author":[{"last_name":"Súkeník","first_name":"Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli"}],"date_updated":"2026-09-10T08:11:46Z","page":"48646-48677"},{"acknowledged_ssus":[{"_id":"ScienComp"}],"alternative_title":["Advances in Neural Information Processing Systems"],"OA_place":"publisher","language":[{"iso":"eng"}],"OA_type":"free access","type":"conference","volume":38,"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.52202/085713-0278","open_access":"1"}],"oa":1,"abstract":[{"lang":"eng","text":"We present new fast-rate PAC-Bayesian generalization bounds for multi-task and\r\nmeta-learning in the unbalanced setting, i.e. when the tasks have training sets of\r\ndifferent sizes, as is typically the case in real-world scenarios. Previously, only\r\nstandard-rate bounds were known for this situation, while fast-rate bounds were\r\nlimited to the setting where all training sets are of equal size. Our new bounds\r\nare numerically computable as well as interpretable, and we demonstrate their\r\nflexibility in handling a number of cases where they give stronger guarantees\r\nthan previous bounds. Besides the bounds themselves, we also make conceptual\r\ncontributions: we demonstrate that the unbalanced multi-task setting has different\r\nstatistical properties than the balanced situation, specifically that proofs from\r\nthe balanced situation do not carry over to the unbalanced setting. Additionally,\r\nwe shed light on the fact that the unbalanced situation allows two meaningful\r\ndefinitions of multi-task risk, depending on whether all tasks should be considered\r\nequally important or if sample-rich tasks should receive more weight than samplepoor ones."}],"acknowledgement":"This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","fulldoi":"https://doi.org/10.52202/085713-0278","date_created":"2026-09-06T22:01:59Z","conference":{"end_date":"2025-12-07","name":"NeurIPS: Neural Information Processing Systems","location":"San Diego, CA, United States","start_date":"2025-12-02"},"scopus_import":"1","day":"02","quality_controlled":"1","corr_author":"1","intvolume":"        38","year":"2025","title":"Fast rate bounds for multi-task and meta-learning with different sample sizes","_id":"22824","month":"12","doi":"10.52202/085713-0278","publication_identifier":{"issn":["1049-5258"],"isbn":["9798331338275"]},"article_processing_charge":"No","date_published":"2025-12-02T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"supplementarymaterial":"yes","das_tickbox":"0","oa_version":"Published Version","citation":{"ieee":"H. Zakerinia and C. Lampert, “Fast rate bounds for multi-task and meta-learning with different sample sizes,” in <i>39th Conference on Neural Information Processing Systems</i>, San Diego, CA, United States, 2025, vol. 38, pp. 9062–9093.","short":"H. Zakerinia, C. Lampert, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 9062–9093.","apa":"Zakerinia, H., &#38; Lampert, C. (2025). Fast rate bounds for multi-task and meta-learning with different sample sizes. In <i>39th Conference on Neural Information Processing Systems</i> (Vol. 38, pp. 9062–9093). San Diego, CA, United States: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.52202/085713-0278\">https://doi.org/10.52202/085713-0278</a>","mla":"Zakerinia, Hossein, and Christoph Lampert. “Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes.” <i>39th Conference on Neural Information Processing Systems</i>, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 9062–93, doi:<a href=\"https://doi.org/10.52202/085713-0278\">10.52202/085713-0278</a>.","ista":"Zakerinia H, Lampert C. 2025. Fast rate bounds for multi-task and meta-learning with different sample sizes. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 9062–9093.","ama":"Zakerinia H, Lampert C. Fast rate bounds for multi-task and meta-learning with different sample sizes. In: <i>39th Conference on Neural Information Processing Systems</i>. Vol 38. Neural Information Processing Systems Foundation; 2025:9062-9093. doi:<a href=\"https://doi.org/10.52202/085713-0278\">10.52202/085713-0278</a>","chicago":"Zakerinia, Hossein, and Christoph Lampert. “Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes.” In <i>39th Conference on Neural Information Processing Systems</i>, 38:9062–93. Neural Information Processing Systems Foundation, 2025. <a href=\"https://doi.org/10.52202/085713-0278\">https://doi.org/10.52202/085713-0278</a>."},"publication":"39th Conference on Neural Information Processing Systems","researchdata_availability":"no","status":"public","page":"9062-9093","author":[{"first_name":"Hossein","last_name":"Zakerinia","id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","orcid":"0009-0007-3977-6462","full_name":"Zakerinia, Hossein"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"date_updated":"2026-09-10T08:37:33Z","publisher":"Neural Information Processing Systems Foundation"},{"publication":"Advances in Neural Information Processing Systems","citation":{"mla":"Kalinin, Nikita, et al. “Continual Release Moment Estimation with Differential Privacy.” <i>Advances in Neural Information Processing Systems</i>, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 64002–47, doi:<a href=\"https://doi.org/10.52202/085713-1924\">10.52202/085713-1924</a>.","apa":"Kalinin, N., Upadhyay, J., &#38; Lampert, C. (2025). Continual release moment estimation with differential privacy. In <i>Advances in Neural Information Processing Systems</i> (Vol. 38, pp. 64002–64047). San Diego, CA, United States: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.52202/085713-1924\">https://doi.org/10.52202/085713-1924</a>","ieee":"N. Kalinin, J. Upadhyay, and C. Lampert, “Continual release moment estimation with differential privacy,” in <i>Advances in Neural Information Processing Systems</i>, San Diego, CA, United States, 2025, vol. 38, pp. 64002–64047.","short":"N. Kalinin, J. Upadhyay, C. Lampert, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 64002–64047.","chicago":"Kalinin, Nikita, Jalaj Upadhyay, and Christoph Lampert. “Continual Release Moment Estimation with Differential Privacy.” In <i>Advances in Neural Information Processing Systems</i>, 38:64002–47. Neural Information Processing Systems Foundation, 2025. <a href=\"https://doi.org/10.52202/085713-1924\">https://doi.org/10.52202/085713-1924</a>.","ista":"Kalinin N, Upadhyay J, Lampert C. 2025. Continual release moment estimation with differential privacy. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 64002–64047.","ama":"Kalinin N, Upadhyay J, Lampert C. Continual release moment estimation with differential privacy. In: <i>Advances in Neural Information Processing Systems</i>. Vol 38. Neural Information Processing Systems Foundation; 2025:64002-64047. doi:<a href=\"https://doi.org/10.52202/085713-1924\">10.52202/085713-1924</a>"},"date_updated":"2026-09-10T11:17:06Z","page":"64002-64047","author":[{"full_name":"Kalinin, Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin","first_name":"Nikita"},{"last_name":"Upadhyay","first_name":"Jalaj","full_name":"Upadhyay, Jalaj"},{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"}],"publisher":"Neural Information Processing Systems Foundation","researchdata_availability":"no","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_published":"2025-12-02T00:00:00Z","oa_version":"Published Version","supplementarymaterial":"no","das_tickbox":"0","_id":"22828","publication_identifier":{"issn":["1049-5258"],"isbn":["9798331338275"]},"article_processing_charge":"No","doi":"10.52202/085713-1924","month":"12","intvolume":"        38","year":"2025","corr_author":"1","title":"Continual release moment estimation with differential privacy","day":"02","scopus_import":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"We propose Joint Moment Estimation (JME), a method for continually and privately estimating both the first and second moments of a data stream with reduced noise compared to naive approaches. JME supports the matrix mechanism and exploits a joint sensitivity analysis to identify a privacy regime in which the second-moment estimation incurs no additional privacy cost, thereby improving accuracy while maintaining privacy. We demonstrate JME’s effectiveness in two applications: estimating the running mean and covariance matrix for Gaussian density estimation and model training with DP-Adam."}],"oa":1,"conference":{"location":"San Diego, CA, United States","name":"NeurIPS: Neural Information Processing Systems"},"fulldoi":"https://doi.org/10.52202/085713-1924","acknowledgement":"We thank Monika Henzinger for her valuable feedback and insightful discussions on earlier versions\r\nof this draft. We are also grateful to Mher Safaryan for his contributions to discussions on DP-Adam.\r\nAdditionally, we thank Ryan McKenna for suggesting Joint Clipping as a baseline.\r\nJalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no. 302918, NSF CNS 2433628,\r\nGoogle Research Scholar Award, and Google Seed Fund Grant. A part of this work was done while\r\nvisiting the Institute of Science and Technology Austria (ISTA).\r\nNikita Kalinin’s research was funded in part by the Austrian Science Fund (FWF) [10.55776/COE12]","date_created":"2026-09-06T22:02:00Z","publication_status":"published","volume":38,"type":"conference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.52202/085713-1924"}],"OA_place":"publisher","alternative_title":["Advances in Neural Information Processing Systems"],"OA_type":"free access","language":[{"iso":"eng"}]},{"_id":"18856","doi":"10.5311/JOSIS.2024.29.295","month":"12","article_processing_charge":"Yes","publication_identifier":{"eissn":["1948-660X"]},"corr_author":"1","year":"2024","related_material":{"link":[{"url":"https://github.com/K4TEL/geo-twitter.git","relation":"software"}]},"title":"Predicting the geolocation of tweets using transformer models on customized data","citation":{"ista":"Lutsai K, Lampert C. 2024. Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. (29), 69–99.","ama":"Lutsai K, Lampert C. Predicting the geolocation of tweets using transformer models on customized data. <i>Journal of Spatial Information Science</i>. 2024;(29):69-99. doi:<a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">10.5311/JOSIS.2024.29.295</a>","chicago":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” <i>Journal of Spatial Information Science</i>. University of Maine, 2024. <a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">https://doi.org/10.5311/JOSIS.2024.29.295</a>.","ieee":"K. Lutsai and C. Lampert, “Predicting the geolocation of tweets using transformer models on customized data,” <i>Journal of Spatial Information Science</i>, no. 29. University of Maine, pp. 69–99, 2024.","short":"K. Lutsai, C. Lampert, Journal of Spatial Information Science (2024) 69–99.","apa":"Lutsai, K., &#38; Lampert, C. (2024). Predicting the geolocation of tweets using transformer models on customized data. <i>Journal of Spatial Information Science</i>. University of Maine. <a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">https://doi.org/10.5311/JOSIS.2024.29.295</a>","mla":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” <i>Journal of Spatial Information Science</i>, no. 29, University of Maine, 2024, pp. 69–99, doi:<a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">10.5311/JOSIS.2024.29.295</a>."},"article_type":"original","publication":"Journal of Spatial Information Science","license":"https://creativecommons.org/licenses/by/3.0/","status":"public","publisher":"University of Maine","page":"69-99","author":[{"full_name":"Lutsai, Kateryna","last_name":"Lutsai","first_name":"Kateryna"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"date_updated":"2025-06-05T13:47:12Z","date_published":"2024-12-26T00:00:00Z","has_accepted_license":"1","department":[{"_id":"ChLa"}],"ddc":["500"],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","file":[{"checksum":"b82413f00398ffb5168e8e747571a98d","creator":"dernst","date_updated":"2025-01-20T08:41:10Z","file_size":7250655,"file_name":"2024_JourSpatialInfoScience_Lutsai.pdf","relation":"main_file","content_type":"application/pdf","file_id":"18857","date_created":"2025-01-20T08:41:10Z","access_level":"open_access","success":1}],"oa_version":"Published Version","type":"journal_article","publication_status":"published","file_date_updated":"2025-01-20T08:41:10Z","OA_place":"publisher","language":[{"iso":"eng"}],"OA_type":"gold","scopus_import":"1","issue":"29","day":"26","DOAJ_listed":"1","quality_controlled":"1","oa":1,"abstract":[{"text":"This research is aimed to solve the tweet/user geolocation prediction task and provide a flexible methodology for the geo-tagging of textual big data. The suggested approach implements neural networks for natural language processing (NLP) to estimate the location as coordinate pairs (longitude, latitude) and two-dimensional Gaussian Mixture Models (GMMs). The scope of proposed models has been finetuned on a Twitter dataset using pretrained Bidirectional Encoder Representations from Transformers (BERT) as base models. Performance metrics show a median error of fewer than 30 km on a worldwide-level, and fewer than 15 km on the US-level datasets for the models trained and evaluated on text features of tweets' content and metadata context. Our source code and data are available at https://github.com/K4TEL/geo-twitter.git.","lang":"eng"}],"fulldoi":"https://doi.org/10.5311/JOSIS.2024.29.295","date_created":"2025-01-19T23:01:53Z","acknowledgement":"The authors acknowledge the Institute of Science and Technology (ISTA) for their material support and for granting access to the Twitter database archive, which was essential for the research.","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"}},{"date_created":"2025-01-24T17:58:16Z","conference":{"end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2024-12-16"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"abstract":[{"text":"Current state-of-the-art methods for differentially private model training are based on matrix factorization techniques. However, these methods suffer from high computational overhead because they require numerically solving a demanding optimization problem to determine an approximately optimal factorization prior to the actual model training. In this work, we present a new matrix factorization approach, BSR, which overcomes this computational bottleneck. By exploiting properties of the standard matrix square root, BSR allows to efficiently handle also large-scale problems. For the key scenario of stochastic gradient descent with momentum and weight decay, we even derive analytical expressions for BSR that render the computational overhead negligible. We prove bounds on the approximation quality that hold both in the centralized and in the federated learning setting. Our numerical experiments demonstrate that models trained using BSR perform on par with the best existing methods, while completely avoiding their computational overhead.","lang":"eng"}],"oa":1,"quality_controlled":"1","scopus_import":"1","day":"01","language":[{"iso":"eng"}],"OA_type":"gold","alternative_title":["Advances in Neural Information Processing Systems"],"OA_place":"publisher","file_date_updated":"2025-01-27T09:52:15Z","type":"conference","volume":37,"publication_status":"published","oa_version":"Published Version","file":[{"relation":"main_file","file_size":1144656,"file_name":"2024_NeurIPS_Nikita.pdf","creator":"dernst","checksum":"a216cab8eddc1fe7840aede0e2c0d41e","date_updated":"2025-01-27T09:52:15Z","success":1,"access_level":"open_access","date_created":"2025-01-27T09:52:15Z","file_id":"18888","content_type":"application/pdf"}],"has_accepted_license":"1","date_published":"2024-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"status":"public","author":[{"full_name":"Kalinin, Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin","first_name":"Nikita"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"date_updated":"2025-05-14T11:34:20Z","publisher":"Neural Information Processing Systems Foundation","citation":{"ista":"Kalinin N, Lampert C. 2024. Banded square root matrix factorization for differentially private model training. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ama":"Kalinin N, Lampert C. Banded square root matrix factorization for differentially private model training. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","chicago":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","short":"N. Kalinin, C. Lampert, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ieee":"N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","apa":"Kalinin, N., &#38; Lampert, C. (2024). Banded square root matrix factorization for differentially private model training. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","mla":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024."},"publication":"38th Annual Conference on Neural Information Processing Systems","title":"Banded square root matrix factorization for differentially private model training","corr_author":"1","intvolume":"        37","arxiv":1,"year":"2024","month":"12","publication_identifier":{"eissn":["1049-5258"]},"article_processing_charge":"No","_id":"18875","external_id":{"arxiv":["2405.13763"]}},{"file_date_updated":"2025-02-04T08:11:25Z","type":"conference","volume":37,"publication_status":"published","language":[{"iso":"eng"}],"OA_type":"gold","acknowledged_ssus":[{"_id":"ScienComp"}],"OA_place":"publisher","alternative_title":["Advances in Neural Information Processing Systems"],"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"quality_controlled":"1","day":"01","date_created":"2025-01-27T11:15:18Z","acknowledgement":"Marco Mondelli is partially supported by the 2019 Lopez-Loreta prize. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","conference":{"location":"Vancouver, Canada","start_date":"2024-12-16","end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) exhibit a surprising structure in their final layer\r\nknown as neural collapse (NC), and a growing body of works has currently investigated the propagation of neural collapse to earlier layers of DNNs – a phenomenon\r\ncalled deep neural collapse (DNC). However, existing theoretical results are restricted to special cases: linear models, only two layers or binary classification.\r\nIn contrast, we focus on non-linear models of arbitrary depth in multi-class classification and reveal a surprising qualitative shift. As soon as we go beyond two\r\nlayers or two classes, DNC stops being optimal for the deep unconstrained features\r\nmodel (DUFM) – the standard theoretical framework for the analysis of collapse.\r\nThe main culprit is a low-rank bias of multi-layer regularization schemes: this bias\r\nleads to optimal solutions of even lower rank than the neural collapse. We support\r\nour theoretical findings with experiments on both DUFM and real data, which show\r\nthe emergence of the low-rank structure in the solution found by gradient descent."}],"oa":1,"month":"12","article_processing_charge":"No","external_id":{"arxiv":["2405.14468"]},"_id":"18891","title":"Neural collapse versus low-rank bias: Is deep neural collapse really optimal?","corr_author":"1","arxiv":1,"year":"2024","intvolume":"        37","status":"public","publisher":"Neural Information Processing Systems Foundation","author":[{"first_name":"Peter","last_name":"Súkeník","full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"date_updated":"2025-06-04T07:19:21Z","citation":{"chicago":"Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","ama":"Súkeník P, Lampert C, Mondelli M. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","ista":"Súkeník P, Lampert C, Mondelli M. 2024. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","mla":"Súkeník, Peter, et al. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","apa":"Súkeník, P., Lampert, C., &#38; Mondelli, M. (2024). Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","short":"P. Súkeník, C. Lampert, M. Mondelli, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ieee":"P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse versus low-rank bias: Is deep neural collapse really optimal?,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37."},"publication":"38th Annual Conference on Neural Information Processing Systems","file":[{"file_name":"2024_NeurIPS_Sukenik.pdf","file_size":1784118,"relation":"main_file","checksum":"b7b79f1ea3ac1e9e11b3d91faaeb0780","creator":"dernst","date_updated":"2025-02-04T08:11:25Z","access_level":"open_access","success":1,"content_type":"application/pdf","file_id":"18989","date_created":"2025-02-04T08:11:25Z"}],"oa_version":"Published Version","date_published":"2024-12-01T00:00:00Z","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"MaMo"},{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"]},{"file":[{"relation":"main_file","file_name":"2024_TMLR_Verwimp.pdf","file_size":1367966,"creator":"dernst","checksum":"0714e12f7423cd098976ed9974561155","date_updated":"2025-03-20T09:02:18Z","success":1,"access_level":"open_access","date_created":"2025-03-20T09:02:18Z","file_id":"19426","content_type":"application/pdf"}],"oa_version":"Published Version","date_published":"2024-04-12T00:00:00Z","has_accepted_license":"1","department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"status":"public","publisher":"Transactions on Machine Learning Research","author":[{"last_name":"Verwimp","first_name":"Eli","full_name":"Verwimp, Eli"},{"full_name":"Aljundi, Rahaf","first_name":"Rahaf","last_name":"Aljundi"},{"full_name":"Ben-David, Shai","last_name":"Ben-David","first_name":"Shai"},{"first_name":"Matthias","last_name":"Bethge","full_name":"Bethge, Matthias"},{"last_name":"Cossu","first_name":"Andrea","full_name":"Cossu, Andrea"},{"first_name":"Alexander","last_name":"Gepperth","full_name":"Gepperth, Alexander"},{"full_name":"Hayes, Tyler L.","last_name":"Hayes","first_name":"Tyler L."},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"},{"last_name":"Kanan","first_name":"Christopher","full_name":"Kanan, Christopher"},{"last_name":"Kudithipudi","first_name":"Dhireesha","full_name":"Kudithipudi, Dhireesha"},{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mundt, Martin","first_name":"Martin","last_name":"Mundt"},{"full_name":"Pascanu, Razvan","first_name":"Razvan","last_name":"Pascanu"},{"full_name":"Popescu, Adrian","first_name":"Adrian","last_name":"Popescu"},{"full_name":"Tolias, Andreas S.","last_name":"Tolias","first_name":"Andreas S."},{"full_name":"Van De Weijer, Joost","last_name":"Van De Weijer","first_name":"Joost"},{"last_name":"Liu","first_name":"Bing","full_name":"Liu, Bing"},{"full_name":"Lomonaco, Vincenzo","last_name":"Lomonaco","first_name":"Vincenzo"},{"last_name":"Tuytelaars","first_name":"Tinne","full_name":"Tuytelaars, Tinne"},{"full_name":"Van De Ven, Gido M.","first_name":"Gido M.","last_name":"Van De Ven"}],"date_updated":"2025-03-20T09:21:02Z","citation":{"ieee":"E. Verwimp <i>et al.</i>, “Continual learning: Applications and the road forward,” <i>Transactions on Machine Learning Research</i>, vol. 2024. Transactions on Machine Learning Research, 2024.","short":"E. Verwimp, R. Aljundi, S. Ben-David, M. Bethge, A. Cossu, A. Gepperth, T.L. Hayes, E. Hüllermeier, C. Kanan, D. Kudithipudi, C. Lampert, M. Mundt, R. Pascanu, A. Popescu, A.S. Tolias, J. Van De Weijer, B. Liu, V. Lomonaco, T. Tuytelaars, G.M. Van De Ven, Transactions on Machine Learning Research 2024 (2024).","apa":"Verwimp, E., Aljundi, R., Ben-David, S., Bethge, M., Cossu, A., Gepperth, A., … Van De Ven, G. M. (2024). Continual learning: Applications and the road forward. <i>Transactions on Machine Learning Research</i>. Transactions on Machine Learning Research.","mla":"Verwimp, Eli, et al. “Continual Learning: Applications and the Road Forward.” <i>Transactions on Machine Learning Research</i>, vol. 2024, Transactions on Machine Learning Research, 2024.","ista":"Verwimp E, Aljundi R, Ben-David S, Bethge M, Cossu A, Gepperth A, Hayes TL, Hüllermeier E, Kanan C, Kudithipudi D, Lampert C, Mundt M, Pascanu R, Popescu A, Tolias AS, Van De Weijer J, Liu B, Lomonaco V, Tuytelaars T, Van De Ven GM. 2024. Continual learning: Applications and the road forward. Transactions on Machine Learning Research. 2024.","ama":"Verwimp E, Aljundi R, Ben-David S, et al. Continual learning: Applications and the road forward. <i>Transactions on Machine Learning Research</i>. 2024;2024.","chicago":"Verwimp, Eli, Rahaf Aljundi, Shai Ben-David, Matthias Bethge, Andrea Cossu, Alexander Gepperth, Tyler L. Hayes, et al. “Continual Learning: Applications and the Road Forward.” <i>Transactions on Machine Learning Research</i>. Transactions on Machine Learning Research, 2024."},"publication":"Transactions on Machine Learning Research","article_type":"original","title":"Continual learning: Applications and the road forward","arxiv":1,"year":"2024","intvolume":"      2024","month":"04","article_processing_charge":"No","publication_identifier":{"eissn":["2835-8856"]},"external_id":{"arxiv":["2311.11908"]},"_id":"19408","date_created":"2025-03-16T23:01:25Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"oa":1,"abstract":[{"lang":"eng","text":"Continual learning is a subfield of machine learning, which aims to allow machine learning models to continuously learn on new data, by accumulating knowledge without forgetting what was learned in the past. In this work, we take a step back, and ask: \"Why should one care about continual learning in the first place?\". We set the stage by examining recent continual learning papers published at four major machine learning conferences, and show that memory-constrained settings dominate the field. Then, we discuss five open problems in machine learning, and even though they might seem unrelated to continual learning at first sight, we show that continual learning will inevitably be part of their solution. These problems are model editing, personalization and specialization, on-device learning, faster (re-)training and reinforcement learning. Finally, by comparing the desiderata from these unsolved problems and the current assumptions in continual learning, we highlight and discuss four future directions for continual learning research. We hope that this work offers an interesting perspective on the future of continual learning, while displaying its potential value and the paths we have to pursue in order to make it successful. This work is the result of the many discussions the authors had at the Dagstuhl seminar on Deep Continual Learning, in March 2023."}],"quality_controlled":"1","scopus_import":"1","day":"12","language":[{"iso":"eng"}],"OA_type":"diamond","alternative_title":["TMLR"],"OA_place":"publisher","file_date_updated":"2025-03-20T09:02:18Z","type":"journal_article","publication_status":"published","volume":2024},{"has_accepted_license":"1","date_published":"2024-03-07T00:00:00Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"oa_version":"Published Version","file":[{"success":1,"access_level":"open_access","date_created":"2024-08-12T07:38:06Z","file_id":"17415","content_type":"application/pdf","relation":"main_file","file_name":"2024_ICLR_Scott.pdf","file_size":1029219,"date_updated":"2024-08-12T07:38:06Z","creator":"dernst","checksum":"81b7ea2e667adaf9c7a7b6b376b1f251"}],"citation":{"mla":"Scott, Jonathan A., et al. “PEFLL: Personalized Federated Learning by Learning to Learn.” <i>12th International Conference on Learning Representations</i>, OpenReview, 2024.","short":"J.A. Scott, H. Zakerinia, C. Lampert, in:, 12th International Conference on Learning Representations, OpenReview, 2024.","ieee":"J. A. Scott, H. Zakerinia, and C. Lampert, “PEFLL: Personalized federated learning by learning to learn,” in <i>12th International Conference on Learning Representations</i>, Vienna, Austria, 2024.","apa":"Scott, J. A., Zakerinia, H., &#38; Lampert, C. (2024). PEFLL: Personalized federated learning by learning to learn. In <i>12th International Conference on Learning Representations</i>. Vienna, Austria: OpenReview.","ama":"Scott JA, Zakerinia H, Lampert C. PEFLL: Personalized federated learning by learning to learn. In: <i>12th International Conference on Learning Representations</i>. OpenReview; 2024.","ista":"Scott JA, Zakerinia H, Lampert C. 2024. PEFLL: Personalized federated learning by learning to learn. 12th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Scott, Jonathan A, Hossein Zakerinia, and Christoph Lampert. “PEFLL: Personalized Federated Learning by Learning to Learn.” In <i>12th International Conference on Learning Representations</i>. OpenReview, 2024."},"publication":"12th International Conference on Learning Representations","status":"public","date_updated":"2026-04-07T11:46:11Z","author":[{"first_name":"Jonathan A","last_name":"Scott","id":"e499926b-f6e0-11ea-865d-9c63db0031e8","full_name":"Scott, Jonathan A"},{"id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","full_name":"Zakerinia, Hossein","orcid":"0009-0007-3977-6462","last_name":"Zakerinia","first_name":"Hossein"},{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"publisher":"OpenReview","corr_author":"1","year":"2024","arxiv":1,"title":"PEFLL: Personalized federated learning by learning to learn","related_material":{"record":[{"status":"public","id":"21198","relation":"dissertation_contains"}]},"_id":"17411","external_id":{"arxiv":["2306.05515"]},"month":"03","article_processing_charge":"No","abstract":[{"text":"We present PeFLL, a new personalized federated learning algorithm that improves\r\nover the state-of-the-art in three aspects: 1) it produces more accurate models,\r\nespecially in the low-data regime, and not only for clients present during its\r\ntraining phase, but also for any that may emerge in the future; 2) it reduces the\r\namount of on-client computation and client-server communication by providing\r\nfuture clients with ready-to-use personalized models that require no additional\r\nfinetuning or optimization; 3) it comes with theoretical guarantees that establish\r\ngeneralization from the observed clients to future ones.\r\nAt the core of PeFLL lies a learning-to-learn approach that jointly trains an\r\nembedding network and a hypernetwork. The embedding network is used to\r\nrepresent clients in a latent descriptor space in a way that reflects their similarity\r\nto each other. The hypernetwork takes as input such descriptors and outputs the\r\nparameters of fully personalized client models. In combination, both networks\r\nconstitute a learning algorithm that achieves state-of-the-art performance in several\r\npersonalized federated learning benchmarks","lang":"eng"}],"oa":1,"date_created":"2024-08-11T22:01:12Z","acknowledgement":"This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).\r\n","conference":{"location":"Vienna, Austria","start_date":"2024-03-07","end_date":"2024-03-07","name":"ICLR: International Conference on Learning Representations"},"scopus_import":"1","day":"07","quality_controlled":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"type":"conference","publication_status":"published","file_date_updated":"2024-08-12T07:38:06Z"},{"month":"09","publication_identifier":{"eissn":["2640-3498"]},"article_processing_charge":"No","_id":"18118","external_id":{"arxiv":["2402.04054"]},"title":"More flexible PAC-Bayesian meta-learning by learning learning algorithms","corr_author":"1","intvolume":"       235","arxiv":1,"year":"2024","status":"public","page":"58122-58139","date_updated":"2026-06-18T18:01:36Z","author":[{"first_name":"Hossein","last_name":"Zakerinia","id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","full_name":"Zakerinia, Hossein","orcid":"0009-0007-3977-6462"},{"full_name":"Behjati, Amin","first_name":"Amin","last_name":"Behjati"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"publisher":"ML Research Press","citation":{"chicago":"Zakerinia, Hossein, Amin Behjati, and Christoph Lampert. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:58122–39. ML Research Press, 2024.","ista":"Zakerinia H, Behjati A, Lampert C. 2024. More flexible PAC-Bayesian meta-learning by learning learning algorithms. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 58122–58139.","ama":"Zakerinia H, Behjati A, Lampert C. More flexible PAC-Bayesian meta-learning by learning learning algorithms. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:58122-58139.","mla":"Zakerinia, Hossein, et al. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 58122–39.","apa":"Zakerinia, H., Behjati, A., &#38; Lampert, C. (2024). More flexible PAC-Bayesian meta-learning by learning learning algorithms. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 58122–58139). Vienna, Austria: ML Research Press.","ieee":"H. Zakerinia, A. Behjati, and C. Lampert, “More flexible PAC-Bayesian meta-learning by learning learning algorithms,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 58122–58139.","short":"H. Zakerinia, A. Behjati, C. Lampert, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 58122–58139."},"publication":"Proceedings of the 41st International Conference on Machine Learning","oa_version":"Published Version","date_published":"2024-09-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"department":[{"_id":"ChLa"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2402.04054","open_access":"1"}],"type":"conference","volume":235,"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["PMLR"],"quality_controlled":"1","scopus_import":"1","day":"01","date_created":"2024-09-22T22:01:45Z","conference":{"end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria","start_date":"2024-07-21"},"oa":1,"abstract":[{"text":"We introduce a new framework for studying meta-learning methods using PAC-Bayesian theory. Its main advantage over previous work is that it allows for more flexibility in how the transfer of knowledge between tasks is realized. For previous approaches, this could only happen indirectly, by means of learning prior distributions over models. In contrast, the new generalization bounds that we prove express the process of meta-learning much more directly as learning the learning algorithm that should be used for future tasks. The flexibility of our framework makes it suitable to analyze a wide range of meta-learning mechanisms and even design new mechanisms. Other than our theoretical contributions we also show empirically that our framework improves the prediction quality in practical meta-learning mechanisms.","lang":"eng"}]},{"oa":1,"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"}],"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","fulldoi":"https://doi.org/10.1109/CVPR52733.2024.02320","date_created":"2024-08-14T08:42:32Z","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2024-06-22","start_date":"2024-06-16","location":"Seattle, WA, United States"},"day":"01","quality_controlled":"1","OA_place":"repository","language":[{"iso":"eng"}],"OA_type":"green","type":"conference","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.16833","open_access":"1"}],"has_accepted_license":"1","date_published":"2024-06-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"oa_version":"Preprint","citation":{"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>.","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>","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>.","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>","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.","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."},"isi":1,"publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","status":"public","date_updated":"2026-07-27T12:47:43Z","page":"24574-24583","author":[{"full_name":"Prach, Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd","last_name":"Prach"},{"last_name":"Brau","first_name":"Fabio","full_name":"Brau, Fabio"},{"first_name":"Giorgio","last_name":"Buttazzo","full_name":"Buttazzo, Giorgio"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert"}],"publisher":"Computer Vision Foundation","corr_author":"1","arxiv":1,"year":"2024","title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","related_material":{"record":[{"status":"public","id":"19759","relation":"dissertation_contains"}],"link":[{"relation":"software","url":"https://github.com/berndprach/1LipschitzLayersCompared"}]},"external_id":{"isi":["001344387500055"],"arxiv":["2311.16833"]},"_id":"17426","doi":"10.1109/CVPR52733.2024.02320","month":"06","article_processing_charge":"No"},{"oa_version":"Preprint","article_number":"2412.04245","date_created":"2025-01-24T16:57:29Z","fulldoi":"https://doi.org/10.48550/arXiv.2412.04245","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"abstract":[{"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.","lang":"eng"}],"oa":1,"date_published":"2024-12-05T00:00:00Z","author":[{"last_name":"Prach","first_name":"Bernd","full_name":"Prach, Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"date_updated":"2026-07-27T12:47:43Z","status":"public","day":"05","publication":"arXiv","citation":{"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.).","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>","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>","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","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>."},"title":"Intriguing properties of robust classification","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"20455","relation":"later_version","status":"public"},{"id":"19759","relation":"dissertation_contains","status":"public"}]},"OA_place":"repository","arxiv":1,"year":"2024","corr_author":"1","article_processing_charge":"No","doi":"10.48550/arXiv.2412.04245","month":"12","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.04245","open_access":"1"}],"publication_status":"draft","type":"preprint","_id":"18874","external_id":{"arxiv":["2412.04245"]}},{"day":"01","abstract":[{"text":"Instruction-tuned Large Language Models (LLMs) show impressive results in numerous practical applications, but they lack essential safety features that are common in other areas of computer science, particularly an explicit separation of instructions and data. This makes them vulnerable to manipulations such as indirect prompt injections and generally unsuitable for safety-critical tasks. Surprisingly, there is currently no established definition or benchmark to quantify this phenomenon. In this work, we close this gap by introducing a formal measure for instruction-data separation and an empirical variant that is calculable from a model's outputs. We also present a new dataset, SEP, that allows estimating the measure for real-world models. Our results on various LLMs show that the problem of instruction-data separation is real: all models fail to achieve high separation, and canonical mitigation techniques, such as prompt engineering and fine-tuning, either fail to substantially improve separation or reduce model utility. The source code and SEP dataset are openly accessible at https://github.com/egozverev/Shold-It-Be-Executed-Or-Processed.\r\n","lang":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"article_number":"2403.06833","fulldoi":"https://doi.org/10.48550/arXiv.2403.06833","acknowledgement":"The authors would like to sincerely thank Juan Rocamonde for valuable feedback to our manuscript. We acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). We thank Dan Alistarh for providing us with computational resources. This work was partially funded by the German Federal Ministry of Education and Research (BMBF) under the grant AIgenCY (16KIS2012) and ELSA – European Lighthouse on Secure and Safe AI funded by the European Union under grant agreement No. 101070617. Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or European Commission. Neither the European Union nor the European Commission can be held responsible for them.","date_created":"2025-02-20T10:13:42Z","publication_status":"submitted","type":"preprint","file_date_updated":"2025-02-20T10:11:45Z","OA_place":"repository","acknowledged_ssus":[{"_id":"ScienComp"}],"OA_type":"green","language":[{"iso":"eng"}],"publication":"arXiv","citation":{"mla":"Zverev, Egor, et al. “Can LLMs Separate Instructions from Data? And What Do We Even Mean by That?” <i>ArXiv</i>, 2403.06833, doi:<a href=\"https://doi.org/10.48550/arXiv.2403.06833\">10.48550/arXiv.2403.06833</a>.","ieee":"E. Zverev, S. Abdelnabi, S. Tabesh, M. Fritz, and C. Lampert, “Can LLMs separate instructions from data? And what do we even mean by that?,” <i>arXiv</i>. .","short":"E. Zverev, S. Abdelnabi, S. Tabesh, M. Fritz, C. Lampert, ArXiv (n.d.).","apa":"Zverev, E., Abdelnabi, S., Tabesh, S., Fritz, M., &#38; Lampert, C. (n.d.). Can LLMs separate instructions from data? And what do we even mean by that? <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2403.06833\">https://doi.org/10.48550/arXiv.2403.06833</a>","ista":"Zverev E, Abdelnabi S, Tabesh S, Fritz M, Lampert C. Can LLMs separate instructions from data? And what do we even mean by that? arXiv, 2403.06833.","ama":"Zverev E, Abdelnabi S, Tabesh S, Fritz M, Lampert C. Can LLMs separate instructions from data? And what do we even mean by that? <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2403.06833\">10.48550/arXiv.2403.06833</a>","chicago":"Zverev, Egor, Sahar Abdelnabi, Soroush Tabesh, Mario Fritz, and Christoph Lampert. “Can LLMs Separate Instructions from Data? And What Do We Even Mean by That?” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2403.06833\">https://doi.org/10.48550/arXiv.2403.06833</a>."},"author":[{"id":"05162b19-1340-11ed-8f02-fa94e0e8c3bc","full_name":"Zverev, Egor","first_name":"Egor","last_name":"Zverev"},{"full_name":"Abdelnabi, Sahar","first_name":"Sahar","last_name":"Abdelnabi"},{"last_name":"Tabesh","first_name":"Soroush","id":"06000900-6068-11ef-8d61-c2472ef2e752","full_name":"Tabesh, Soroush","orcid":"0009-0003-4119-6281"},{"last_name":"Fritz","first_name":"Mario","full_name":"Fritz, Mario"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"date_updated":"2026-08-13T07:26:54Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"has_accepted_license":"1","date_published":"2024-03-01T00:00:00Z","oa_version":"Preprint","file":[{"date_created":"2025-02-20T10:11:45Z","content_type":"application/pdf","file_id":"19064","success":1,"access_level":"open_access","creator":"ezverev","checksum":"35eb43968684b87be59144603ef10af0","date_updated":"2025-02-20T10:11:45Z","relation":"main_file","file_size":530972,"file_name":"2403.06833v3.pdf"}],"_id":"19063","external_id":{"arxiv":["2403.06833"]},"article_processing_charge":"No","doi":"10.48550/arXiv.2403.06833","month":"03","year":"2024","arxiv":1,"corr_author":"1","title":"Can LLMs separate instructions from data? And what do we even mean by that?","related_material":{"link":[{"relation":"software","url":" https://github.com/egozverev/Shold-It-Be-Executed-Or-Processed"}]}},{"title":"Cross-client label propagation for transductive and semi-supervised federated learning","related_material":{"link":[{"relation":"software","url":"https://github.com/jonnyascott/xclp"}]},"arxiv":1,"year":"2023","corr_author":"1","publication_identifier":{"issn":["2835-8856"]},"article_processing_charge":"No","month":"11","external_id":{"arxiv":["2210.06434"]},"_id":"12660","oa_version":"Preprint","file":[{"creator":"dernst","checksum":"aa322ad91cbd229f5cafe6733a119bd1","date_updated":"2025-02-04T08:30:05Z","relation":"main_file","file_size":553717,"file_name":"2023_TMLR_Scott.pdf","date_created":"2025-02-04T08:30:05Z","file_id":"18990","content_type":"application/pdf","success":1,"access_level":"open_access"}],"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"has_accepted_license":"1","date_published":"2023-11-27T00:00:00Z","author":[{"id":"e499926b-f6e0-11ea-865d-9c63db0031e8","full_name":"Scott, Jonathan A","first_name":"Jonathan A","last_name":"Scott"},{"full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"date_updated":"2025-02-04T08:32:19Z","publisher":"Curran Associates","status":"public","publication":"Transactions in Machine Learning","citation":{"chicago":"Scott, Jonathan A, Michelle X Yeo, and Christoph Lampert. “Cross-Client Label Propagation for Transductive and Semi-Supervised Federated Learning.” In <i>Transactions in Machine Learning</i>. Curran Associates, 2023.","ama":"Scott JA, Yeo MX, Lampert C. Cross-client label propagation for transductive and semi-supervised federated learning. In: <i>Transactions in Machine Learning</i>. Curran Associates; 2023.","ista":"Scott JA, Yeo MX, Lampert C. 2023. Cross-client label propagation for transductive and semi-supervised federated learning. Transactions in Machine Learning. , TMLR, .","mla":"Scott, Jonathan A., et al. “Cross-Client Label Propagation for Transductive and Semi-Supervised Federated Learning.” <i>Transactions in Machine Learning</i>, Curran Associates, 2023.","apa":"Scott, J. A., Yeo, M. X., &#38; Lampert, C. (2023). Cross-client label propagation for transductive and semi-supervised federated learning. In <i>Transactions in Machine Learning</i>. Curran Associates.","short":"J.A. Scott, M.X. Yeo, C. Lampert, in:, Transactions in Machine Learning, Curran Associates, 2023.","ieee":"J. A. Scott, M. X. Yeo, and C. Lampert, “Cross-client label propagation for transductive and semi-supervised federated learning,” in <i>Transactions in Machine Learning</i>, 2023."},"OA_type":"green","language":[{"iso":"eng"}],"alternative_title":["TMLR"],"OA_place":"repository","file_date_updated":"2025-02-04T08:30:05Z","publication_status":"published","type":"conference","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"date_created":"2023-02-20T08:21:50Z","abstract":[{"lang":"eng","text":"We present Cross-Client Label Propagation(XCLP), a new method for transductive federated learning. XCLP estimates a data graph jointly from the data of multiple clients and computes labels for the unlabeled data by propagating label information across the graph. To avoid clients having to share their data with anyone, XCLP employs two cryptographically secure protocols: secure Hamming distance computation and secure summation. We demonstrate two distinct applications of XCLP within federated learning. In the first, we use it in a one-shot way to predict labels for unseen test points. In the second, we use it to repeatedly pseudo-label unlabeled training data in a federated semi-supervised setting. Experiments on both real federated and standard benchmark datasets show that in both applications XCLP achieves higher classification accuracy than alternative approaches."}],"oa":1,"quality_controlled":"1","day":"27"},{"external_id":{"arxiv":["2207.14200"]},"_id":"13053","article_processing_charge":"No","month":"05","year":"2023","arxiv":1,"corr_author":"1","related_material":{"record":[{"id":"13074","relation":"dissertation_contains","status":"public"}],"link":[{"url":"https://github.com/IST-DASLab/CrAM","relation":"software"}]},"title":"CrAM: A Compression-Aware Minimizer","publication":"11th International Conference on Learning Representations ","citation":{"mla":"Krumes, Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” <i>11th International Conference on Learning Representations </i>, OpenReview, 2023.","short":"A. Krumes, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , OpenReview, 2023.","ieee":"A. Krumes, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A Compression-Aware Minimizer,” in <i>11th International Conference on Learning Representations </i>, Kigali, Rwanda , 2023.","apa":"Krumes, A., Vladu, A., Kurtic, E., Lampert, C., &#38; Alistarh, D.-A. (2023). CrAM: A Compression-Aware Minimizer. In <i>11th International Conference on Learning Representations </i>. Kigali, Rwanda : OpenReview.","ama":"Krumes A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: <i>11th International Conference on Learning Representations </i>. OpenReview; 2023.","ista":"Krumes A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. 2023. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations.","chicago":"Krumes, Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In <i>11th International Conference on Learning Representations </i>. OpenReview, 2023."},"ec_funded":1,"publisher":"OpenReview","date_updated":"2026-04-07T13:30:19Z","author":[{"full_name":"Peste, Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","first_name":"Elena-Alexandra","last_name":"Peste"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"last_name":"Kurtic","first_name":"Eldar","full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"status":"public","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-05-01T00:00:00Z","has_accepted_license":"1","file":[{"relation":"main_file","file_name":"2023_ICLR_Peste.pdf","file_size":458201,"creator":"dernst","checksum":"a6eec897e13a91cdc3eeaf309801752c","date_updated":"2024-07-22T09:09:45Z","success":1,"access_level":"open_access","date_created":"2024-07-22T09:09:45Z","file_id":"17294","content_type":"application/pdf"}],"oa_version":"Published Version","publication_status":"published","type":"conference","main_file_link":[{"url":"https://openreview.net/pdf?id=_eTZBs-yedr","open_access":"1"}],"file_date_updated":"2024-07-22T09:09:45Z","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"day":"01","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL ."}],"oa":1,"conference":{"name":"ICLR: International Conference on Learning Representations","end_date":"2023-05-05","start_date":"2023-05-01","location":"Kigali, Rwanda "},"acknowledgement":"AP, EK, DA received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","date_created":"2023-05-23T11:36:18Z"},{"_id":"14410","month":"08","doi":"10.1007/978-3-031-40773-4_6","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031407727"],"issn":["0302-9743"]},"article_processing_charge":"No","intvolume":"     14068","year":"2023","title":"On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift","citation":{"chicago":"Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.” In <i>International Workshop on Reproducible Research in Pattern Recognition</i>, 14068:67–73. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-40773-4_6\">https://doi.org/10.1007/978-3-031-40773-4_6</a>.","ama":"Tomaszewska P, Lampert C. On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In: <i>International Workshop on Reproducible Research in Pattern Recognition</i>. Vol 14068. Springer Nature; 2023:67-73. doi:<a href=\"https://doi.org/10.1007/978-3-031-40773-4_6\">10.1007/978-3-031-40773-4_6</a>","ista":"Tomaszewska P, Lampert C. 2023. On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. International Workshop on Reproducible Research in Pattern Recognition. RRPR: Reproducible Research in Pattern Recognition, LNCS, vol. 14068, 67–73.","apa":"Tomaszewska, P., &#38; Lampert, C. (2023). On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift. In <i>International Workshop on Reproducible Research in Pattern Recognition</i> (Vol. 14068, pp. 67–73). Montreal, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-40773-4_6\">https://doi.org/10.1007/978-3-031-40773-4_6</a>","ieee":"P. Tomaszewska and C. Lampert, “On the implementation of baselines and lightweight conditional model extrapolation (LIMES) under class-prior shift,” in <i>International Workshop on Reproducible Research in Pattern Recognition</i>, Montreal, Canada, 2023, vol. 14068, pp. 67–73.","short":"P. Tomaszewska, C. Lampert, in:, International Workshop on Reproducible Research in Pattern Recognition, Springer Nature, 2023, pp. 67–73.","mla":"Tomaszewska, Paulina, and Christoph Lampert. “On the Implementation of Baselines and Lightweight Conditional Model Extrapolation (LIMES) under Class-Prior Shift.” <i>International Workshop on Reproducible Research in Pattern Recognition</i>, vol. 14068, Springer Nature, 2023, pp. 67–73, doi:<a href=\"https://doi.org/10.1007/978-3-031-40773-4_6\">10.1007/978-3-031-40773-4_6</a>."},"publication":"International Workshop on Reproducible Research in Pattern Recognition","status":"public","author":[{"full_name":"Tomaszewska, Paulina","last_name":"Tomaszewska","first_name":"Paulina"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"}],"date_updated":"2023-10-09T06:48:02Z","page":"67-73","publisher":"Springer Nature","date_published":"2023-08-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"oa_version":"None","type":"conference","volume":14068,"publication_status":"published","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"scopus_import":"1","day":"20","quality_controlled":"1","abstract":[{"lang":"eng","text":"This paper focuses on the implementation details of the baseline methods and a recent lightweight conditional model extrapolation algorithm LIMES [5] for streaming data under class-prior shift. LIMES achieves superior performance over the baseline methods, especially concerning the minimum-across-day accuracy, which is important for the users of the system. In this work, the key measures to facilitate reproducibility and enhance the credibility of the results are described."}],"date_created":"2023-10-08T22:01:18Z","fulldoi":"https://doi.org/10.1007/978-3-031-40773-4_6","conference":{"end_date":"2022-08-21","name":"RRPR: Reproducible Research in Pattern Recognition","location":"Montreal, Canada","start_date":"2022-08-21"}}]