Martin Aumüller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Martin Aumüller has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Martin Dietzfelbinger
Technische Universität Ilmenau
8 shared publications - Rasmus Pagh
BARC, University of Copenhagen, Copenhagen, Denmark
6 shared publications - Eric Sadit Tellez
Conacyt Consejo Nacional de Ciencia y Tecnología Av. Insurgentes Sur 1582 Col. Crédito Constructor. 03940 CDMX Mexico
4 shared publications - Matteo Ceccarello
University of Padua, Padova, Italy
4 shared publications - Arthur Zimek
University of Southern Denmark
3 shared publications - Camilla Birch Okkels
IT University of Copenhagen
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7684-7690
Recovering Graph ANN Search on Attention-Derived Workloads via a Query-Agnostic Spherical Transformation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7684-7690
Open AccessRecovering Graph ANN Search on Attention-Derived Workloads via a Query-Agnostic Spherical Transformation
- 11 October 2026
- Published by Springer Nature
- p. 353-368
Overview of the SISAP 2026 Indexing Challenge: k-NN Graphs, LLM Workloads, and Sparse Embeddings
- 11 October 2026
- Published by Springer Nature
- p. 353-368
Overview of the SISAP 2026 Indexing Challenge: k-NN Graphs, LLM Workloads, and Sparse Embeddings
- Open Access
- 14 June 2026
- Published by Elsevier in Information Systems
- Vol. 142
Approximate hierarchical density-based clustering using graph-based search indexes
- 14 June 2026
- Published by Elsevier in Information Systems
- Vol. 142
Open AccessApproximate hierarchical density-based clustering using graph-based search indexes
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-25
Mathematical Foundations of Poisoning Attacks on Linear Regression over Cumulative Distribution Functions
Learned indexes are a class of index data structures that enable fast search by approximating the cumulative distribution function (CDF) using machine learning models (Kraska et al., SIGMOD'18). However, recent studies have shown that learned indexes are vulnerable to poisoning attacks, where injecting a small number of poison keys into the training data can significantly degrade model accuracy and reduce index performance (Kornaropoulos et al., SIGMOD'22). In this work, we provide a rigorous theoretical analysis of poisoning attacks targeting linear regression models over CDFs, one of the most basic regression models and a core component in many advanced learned indexes. Our main contributions are as follows: (i) We present a theoretical proof characterizing the optimal single-point poisoning attack and show that the existing method yields the optimal attack. (ii) We show that in multi-point attacks, the existing greedy approach is not always optimal, and we rigorously derive the key properties that an optimal attack should satisfy. (iii) We propose a method to compute an upper bound of the multi-point poisoning attack's impact and empirically demonstrate that the loss under the greedy approach is often close to this bound. Our study deepens the theoretical understanding of attack strategies against linear regression models on CDFs and provides a foundation for the theoretical evaluation of attacks and defenses on learned indexes.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-25
Open AccessMathematical Foundations of Poisoning Attacks on Linear Regression over Cumulative Distribution Functions
Learned indexes are a class of index data structures that enable fast search by approximating the cumulative distribution function (CDF) using machine learning models (Kraska et al., SIGMOD'18). However, recent studies have shown that learned indexes are vulnerable to poisoning attacks, where injecting a small number of poison keys into the training data can significantly degrade model accuracy and reduce index performance (Kornaropoulos et al., SIGMOD'22). In this work, we provide a rigorous theoretical analysis of poisoning attacks targeting linear regression models over CDFs, one of the most basic regression models and a core component in many advanced learned indexes. Our main contributions are as follows: (i) We present a theoretical proof characterizing the optimal single-point poisoning attack and show that the existing method yields the optimal attack. (ii) We show that in multi-point attacks, the existing greedy approach is not always optimal, and we rigorously derive the key properties that an optimal attack should satisfy. (iii) We propose a method to compute an upper bound of the multi-point poisoning attack's impact and empirically demonstrate that the loss under the greedy approach is often close to this bound. Our study deepens the theoretical understanding of attack strategies against linear regression models on CDFs and provides a foundation for the theoretical evaluation of attacks and defenses on learned indexes.
- 8 October 2025
- Published by Springer Nature
- p. 233-247
Approximate Single-Linkage Clustering Using Graph-Based Indexes: MST-Based Approaches and Incremental Searchers
- 8 October 2025
- Published by Springer Nature
- p. 233-247
Approximate Single-Linkage Clustering Using Graph-Based Indexes: MST-Based Approaches and Incremental Searchers
- 25 October 2024
- Published by Springer Nature
- p. 170-184
On the Design of Scalable Outlier Detection Methods Using Approximate Nearest Neighbor Graphs
- 25 October 2024
- Published by Springer Nature
- p. 170-184
On the Design of Scalable Outlier Detection Methods Using Approximate Nearest Neighbor Graphs
- 25 October 2024
- Published by Springer Nature
- p. 155-169
An Empirical Evaluation of Search Strategies for Locality-Sensitive Hashing: Lookup, Voting, and Natural Classifier Search
- 25 October 2024
- Published by Springer Nature
- p. 155-169
An Empirical Evaluation of Search Strategies for Locality-Sensitive Hashing: Lookup, Voting, and Natural Classifier Search
- Open Access
Results of the Big ANN: NeurIPS'23 competition
The 2023 Big ANN Challenge, held at NeurIPS 2023, focused on advancing the state-of-the-art in indexing data structures and search algorithms for practical variants of Approximate Nearest Neighbor (ANN) search that reflect the growing complexity and diversity of workloads. Unlike prior challenges that emphasized scaling up classical ANN search ~\cite{DBLP:conf/nips/SimhadriWADBBCH21}, this competition addressed filtered search, out-of-distribution data, sparse and streaming variants of ANNS. Participants developed and submitted innovative solutions that were evaluated on new standard datasets with constrained computational resources. The results showcased significant improvements in search accuracy and efficiency over industry-standard baselines, with notable contributions from both academic and industrial teams. This paper summarizes the competition tracks, datasets, evaluation metrics, and the innovative approaches of the top-performing submissions, providing insights into the current advancements and future directions in the field of approximate nearest neighbor search.
Open AccessResults of the Big ANN: NeurIPS'23 competition
The 2023 Big ANN Challenge, held at NeurIPS 2023, focused on advancing the state-of-the-art in indexing data structures and search algorithms for practical variants of Approximate Nearest Neighbor (ANN) search that reflect the growing complexity and diversity of workloads. Unlike prior challenges that emphasized scaling up classical ANN search ~\cite{DBLP:conf/nips/SimhadriWADBBCH21}, this competition addressed filtered search, out-of-distribution data, sparse and streaming variants of ANNS. Participants developed and submitted innovative solutions that were evaluated on new standard datasets with constrained computational resources. The results showcased significant improvements in search accuracy and efficiency over industry-standard baselines, with notable contributions from both academic and industrial teams. This paper summarizes the competition tracks, datasets, evaluation metrics, and the innovative approaches of the top-performing submissions, providing insights into the current advancements and future directions in the field of approximate nearest neighbor search.