Demo Data from EDBT 2026 / reviewers in the wild / expert
Aaron Palmer
dblp:148/0115
· DBLP profile ↗
5ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1
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 |
Deep learning architectures and training · 50% Probabilistic and Bayesian machine learning · 50% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
autoencoder |
0.7 | 1 | 2023 | Auto-Encoding Goodness of Fit · ICLR 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
goodness-of-fit testing |
0.7 | 1 | 2023 | Auto-Encoding Goodness of Fit · ICLR 2023 |
Bioinformatics and computational biology › sequence analysis
nanopore sequencing |
0.7 | 1 | 2023 | Deep statistical modelling of nanopore sequencing translocation times reveals latent non-B DNA structures · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
novelty detection · 0.7goodness-of-fit test · 0.7autoencoding · 0.7autoencoder · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Certifying Adapters: Enabling and Enhancing the Certification of Classifier Adversarial RobustnessabstractRandomized smoothing is a leading method for achieving certified robustness in deep classifiers against ℓp-norm adversarial perturbations. However, randomized smoothing requires expensive training procedures that tune large models for different Gaussian noise levels from scratch and thus cannot leverage high-performance pre-trained neural networks. In this work, we introduce the certifying adapters framework (CAF) that enables and enhances the certification of classifier adversarial robustness. Our approach makes few assumptions about the underlying training algorithm or feature extractor, and is thus broadly applicable to different feature extractor architectures (e.g., convolutional neural networks or vision transformers) and randomized smoothing algorithms. We show that CAF (a) enables certification in uncertified models pre-trained on clean datasets and (b) substantially improves the performance of classifiers certified using randomized smoothing and SmoothAdv at multiple radii in CIFAR-10 and ImageNet. Classifiers trained with CAF achieve substantially improved certified accuracies compared to random or denoised smoothing methods. Finally, we demonstrate that CAF is insensitive to hyperparameter settings and adapter ensembles enable a single pre-trained feature extractor to defend against a range of noise perturbation scales. Jieren Deng, Hanbin Hong, Aaron Palmer, Xin Zhou 0017, Jinbo Bi, Kaleel Mahmood, Yuan Hong 0001, Derek Aguiar |
IJCNN | 3 |
| 2023 | Auto-Encoding Goodness of Fit
Aaron Palmer, Zhiyi Chi, Derek Aguiar, Jinbo Bi |
ICLR | 1 |
| 2023 | Deep statistical modelling of nanopore sequencing translocation times reveals latent non-B DNA structuresabstractMOTIVATION: Non-canonical (or non-B) DNA are genomic regions whose three-dimensional conformation deviates from the canonical double helix. Non-B DNA play an important role in basic cellular processes and are associated with genomic instability, gene regulation, and oncogenesis. Experimental methods are low-throughput and can detect only a limited set of non-B DNA structures, while computational methods rely on non-B DNA base motifs, which are necessary but not sufficient indicators of non-B structures. Oxford Nanopore sequencing is an efficient and low-cost platform, but it is currently unknown whether nanopore reads can be used for identifying non-B structures. RESULTS: We build the first computational pipeline to predict non-B DNA structures from nanopore sequencing. We formalize non-B detection as a novelty detection problem and develop the GoFAE-DND, an autoencoder that uses goodness-of-fit (GoF) tests as a regularizer. A discriminative loss encourages non-B DNA to be poorly reconstructed and optimizing Gaussian GoF tests allows for the computation of P-values that indicate non-B structures. Based on whole genome nanopore sequencing of NA12878, we show that there exist significant differences between the timing of DNA translocation for non-B DNA bases compared with B-DNA. We demonstrate the efficacy of our approach through comparisons with novelty detection methods using experimental data and data synthesized from a new translocation time simulator. Experimental validations suggest that reliable detection of non-B DNA from nanopore sequencing is achievable. AVAILABILITY AND IMPLEMENTATION: Source code is available at https://github.com/bayesomicslab/ONT-nonb-GoFAE-DND. Marjan Hosseini, Aaron Palmer, William Manka, Patrick G. S. Grady, Venkata Patchigolla, Jinbo Bi, Rachel J. O'Neill, Zhiyi Chi, Derek Aguiar |
Bioinform. | 2 |
| 2018 | Reforming Generative Autoencoders via Goodness-of-Fit Hypothesis Testing
Aaron Palmer, Dipak K. Dey, Jinbo Bi |
UAI | 1 |
| 2017 | VIGAN: Missing view imputation with generative adversarial networksabstractIn an era when big data are becoming the norm, there is less concern with the quantity but more with the quality and completeness of the data. In many disciplines, data are collected from heterogeneous sources, resulting in multi-view or multi-modal datasets. The missing data problem has been challenging to address in multi-view data analysis. Especially, when certain samples miss an entire view of data, it creates the missing view problem. Classic multiple imputations or matrix completion methods are hardly effective here when no information can be based on in the specific view to impute data for such samples. The commonly-used simple method of removing samples with a missing view can dramatically reduce sample size, thus diminishing the statistical power of a subsequent analysis. In this paper, we propose a novel approach for view imputation via generative adversarial networks (GANs), which we name by VIGAN. This approach first treats each view as a separate domain and identifies domain-to-domain mappings via a GAN using randomly-sampled data from each view, and then employs a multi-modal denoising autoencoder (DAE) to reconstruct the missing view from the GAN outputs based on paired data across the views. Then, by optimizing the GAN and DAE jointly, our model enables the knowledge integration for domain mappings and view correspondences to effectively recover the missing view. Empirical results on benchmark datasets validate the VIGAN approach by comparing against the state of the art. The evaluation of VIGAN in a genetic study of substance use disorders further proves the effectiveness and usability of this approach in life science. Aaron Palmer, Jiangwen Sun, Ko-Shin Chen, Jin Lu 0001, Jinbo Bi |
IEEE BigData | 2 |