EDBT 2026 Demo / reviewers in the wild / expert
Anthony Hitchcock Thomas
dblp:282/9866
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Kernel, tree and ensemble methods · 67% Efficient and distributed learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
hyperdimensional computing |
0.9 | 1 | 2025 | Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström Method · AAAI 2025 |
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel approximation |
0.9 | 1 | 2025 | Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström Method · AAAI 2025 |
Machine learning › Kernel, tree and ensemble methods › kernel methods › kernel approximation
nyström method |
0.9 | 1 | 2025 | Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström Method · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
nyström method · 0.9kernel methods · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström MethodabstractHyperdimensional computing (HDC) is an approach from the cognitive science literature for solving information processing tasks using data represented as high-dimensional random vectors. The technique has a rigorous mathematical backing, and is easy to implement in energy-efficient and highly parallel hardware like FPGAs and "processing-in-memory" architectures. The effectiveness of HDC in machine learning largely depends on how raw data is mapped to high-dimensional space. In this work, we propose NysHD, a new method for constructing this mapping that is based on the Nyström method from the literature on kernel approximation. Our approach provides a simple recipe to turn any user-defined positive-semidefinite similarity function into an equivalent mapping in HDC. There is a vast literature on the design of such functions for learning problems. Our approach provides a mechanism to import them into the HDC setting, expanding the types of problems that can be tackled using HDC. Empirical evaluation against existing HDC encoding methods shows that NysHD can achieve, on average, 11% and 17% better classification accuracy on graph and string datasets respectively. Quanling Zhao, Anthony Hitchcock Thomas, Ari Brin, Xiaofan Yu 0001, Tajana Rosing |
AAAI | 2 |
| 2023 | M2D2: Maximum-Mean-Discrepancy Decoder for Temporal Localization of Epileptic Brain ActivitiesabstractRecent years have seen growing interest in leveraging deep learning models for monitoring epilepsy patients based on electroencephalographic (EEG) signals. However, these approaches often exhibit poor generalization when applied outside of the setting in which training data was collected. Furthermore, manual labeling of EEG signals is a time-consuming process requiring expert analysis, making fine-tuning patient-specific models to new settings a costly proposition. In this work, we propose the Maximum-Mean-Discrepancy Decoder (M2D2) for automatic temporal localization and labeling of seizures in long EEG recordings to assist medical experts. We show that M2D2 achieves 76.0% and 70.4% of F1-score for temporal localization when evaluated on EEG data gathered in a different clinical setting than the training data. The results demonstrate that M2D2 yields substantially higher generalization performance than other state-of-the-art deep learning-based approaches. Alireza Amirshahi, Anthony Hitchcock Thomas, Amir Aminifar, Tajana Rosing, David Atienza 0001 |
IEEE J. Biomed. Health Informatics | 2 |
| 2020 | Noise-Resilient and Interpretable Epileptic Seizure DetectionabstractDeep convolutional neural networks have recently emerged as a state-of-the art tool in detection of seizures. Such models offer the ability to extract complex nonlinear representations of an electroencephalogram (EEG) signal which can improve accuracy over methods relying on hand-crafted features. However, neural networks are susceptible to confounding artifacts commonly present in EEG signals and are notoriously difficult to interpret. In this work, we present a neural-network based algorithm for seizure detection which leverages recent advances in information theory to construct a signal representation containing the minimal amount of information necessary to discriminate between seizure and normal brain activity. We show our approach automatically learns representations that ignore common signal artifacts and which encode medically relevant information from the raw signal. Anthony Hitchcock Thomas, Amir Aminifar, David Atienza 0001 |
ISCAS | 1 |