← Search

Mikkel N. Schmidt

9 accepted papers

2025

Kinetic Langevin Diffusion for Crystalline Materials Generation

ICML 2025poster

Generative modeling of crystalline materials using diffusion models presents a series of challenges: the data distribution is characterized by inherent symmetries and involves multiple modalities, with some defined on specific manifolds. Notably, the treatment of fractional coordinates representing…

Cited by 1SourcePDFScholar
2025

On Local Posterior Structure in Deep Ensembles

AISTATS 2025poster

Bayesian Neural Networks (BNNs) often improve model calibration and predictive uncertainty quantification compared to point estimators such as maximum-a-posteriori (MAP). Similarly, deep ensembles (DEs) are also known to improve calibration, and therefore, it is natural to hypothesize that deep ense…

Cited by 0SourcecodeScholar
2024

An improved analysis of per-sample and per-update clipping in federated learning

ICLR 2024poster

Gradient clipping is key mechanism that is essential to differentially private training techniques in Federated learning. Two popular strategies are per-sample clipping, which clips the mini-batch gradient, and per-update clipping, which clips each user's model update. However, there has not been a…

Cited by 4SourcePDFScholar
2024

Equivariant Neural Diffusion for Molecule Generation

NeurIPS 2024poster

We introduce Equivariant Neural Diffusion (END), a novel diffusion model for molecule generation in 3D that is equivariant to Euclidean transformations. Compared to current state-of-the-art equivariant diffusion models, the key innovation in END lies in its learnable forward process for enhanced gen…

2023

On the Effectiveness of Partial Variance Reduction in Federated Learning With Heterogeneous Data

CVPR 2023highlight

Data heterogeneity across clients is a key challenge in federated learning. Prior works address this by either aligning client and server models or using control variates to correct client model drift. Although these methods achieve fast convergence in convex or simple non-convex problems, the perfo…

2019

Peak Detection and Baseline Correction Using a Convolutional Neural Network

ICASSP 2019accepted

Peak detection and localization in a noisy signal with an unknown baseline is a fundamental task in signal processing applications such as spectroscopy. A current trend in signal processing is to reformulate traditional processing pipelines as (deep) neural networks that can be trained end-to-end. A…

Cited by 0SourceScholar
2017

A pseudo-Voigt component model for high-resolution recovery of constituent spectra in Raman spectroscopy

ICASSP 2017accepted

Raman spectroscopy is a well-known analytical technique for identifying and analyzing chemical species. Since Raman scattering is a weak effect, surface-enhanced Raman spectroscopy (SERS) is often employed to amplify the signal. SERS signal surface mapping is a common method for detecting trace amou…

Cited by 0SourceScholar
2017

Scalable group level probabilistic sparse factor analysis

ICASSP 2017accepted

Many data-driven approaches exist to extract neural representations of functional magnetic resonance imaging (fMRI) data, but most of them lack a proper probabilistic formulation. We propose a scalable group level probabilistic sparse factor analysis (psFA) allowing spatially sparse maps, component…

Cited by 0SourceScholar
2016

Completely random measures for modelling block-structured sparse networks

NeurIPS 2016poster

Statistical methods for network data often parameterize the edge-probability by attributing latent traits such as block structure to the vertices and assume exchangeability in the sense of the Aldous-Hoover representation theorem. These assumptions are however incompatible with traits found in real-…

Cited by 42SourcePDFScholar