59 citations · 214 across the 24 of their papers we have counts for
24 papers
Reliability Scaling Laws for Quantized Large Language Models
Sirine Ayadi, Sándor Daróczi, Stephan Günnemann +1
Quantization is a powerful strategy to build capable and resource-efficient large language models (LLMs) by reducing the bitwidth of the parameters. While quantized LLMs achieve st…
Predictive Feature Caching for Training-free Acceleration of Molecular Geometry Generation
Johanna Sommer, John Rachwan, Nils Fleischmann +2
Flow matching models generate high-fidelity molecular geometries but incur significant computational costs during inference, requiring hundreds of network evaluations. This inferen…
Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE
Florence Regol, Joud Chataoui, Bertrand Charpentier +3
Machine learning models can solve complex tasks but often require significant computational resources during inference. This has led to the development of various post-training com…
Uncertainty for Active Learning on Graphs
Dominik Fuchsgruber, Tom Wollschläger, Bertrand Charpentier +2
Uncertainty Sampling is an Active Learning strategy that aims to improve the data efficiency of machine learning models by iteratively acquiring labels of data points with the high…
Structurally Prune Anything: Any Architecture, Any Framework, Any Time
Xun Wang, John Rachwan, Stephan Günnemann +1
Neural network pruning serves as a critical technique for enhancing the efficiency of deep learning models. Unlike unstructured pruning, which only sets specific parameters to zero…
Shaving Weights with Occam's Razor: Bayesian Sparsification for Neural Networks Using the Marginal Likelihood
Rayen Dhahri, Alexander Immer, Betrand Charpentier +2
Neural network sparsification is a promising avenue to save computational time and memory costs, especially in an age where many successful AI models are becoming too large to naïv…
Uncertainty Estimation for Molecules: Desiderata and Methods
Tom Wollschläger, Nicholas Gao, Bertrand Charpentier +2
Graph Neural Networks (GNNs) are promising surrogates for quantum mechanical calculations as they establish unprecedented low errors on collections of molecular dynamics (MD) traje…
Adversarial Training for Graph Neural Networks: Pitfalls, Solutions, and New Directions
Lukas Gosch, Simon Geisler, Daniel Sturm +3
Despite its success in the image domain, adversarial training did not (yet) stand out as an effective defense for Graph Neural Networks (GNNs) against graph structure perturbations…
Edge Directionality Improves Learning on Heterophilic Graphs
Emanuele Rossi, Bertrand Charpentier, Francesco Di Giovanni +3
Graph Neural Networks (GNNs) have become the de-facto standard tool for modeling relational data. However, while many real-world graphs are directed, the majority of today's GNN mo…
Accuracy is not the only Metric that matters: Estimating the Energy Consumption of Deep Learning Models
Johannes Getzner, Bertrand Charpentier, Stephan Günnemann
Modern machine learning models have started to consume incredible amounts of energy, thus incurring large carbon footprints (Strubell et al., 2019). To address this issue, we have…
Training, Architecture, and Prior for Deterministic Uncertainty Methods
Bertrand Charpentier, Chenxiang Zhang, Stephan Günnemann
Accurate and efficient uncertainty estimation is crucial to build reliable Machine Learning (ML) models capable to provide calibrated uncertainty estimates, generalize and detect O…
On the Robustness and Anomaly Detection of Sparse Neural Networks
Morgane Ayle, Bertrand Charpentier, John Rachwan +3
The robustness and anomaly detection capability of neural networks are crucial topics for their safe adoption in the real-world. Moreover, the over-parameterization of recent netwo…
Winning the Lottery Ahead of Time: Efficient Early Network Pruning
John Rachwan, Daniel Zügner, Bertrand Charpentier +3
Pruning, the task of sparsifying deep neural networks, received increasing attention recently. Although state-of-the-art pruning methods extract highly sparse models, they neglect…
Disentangling Epistemic and Aleatoric Uncertainty in Reinforcement Learning
Bertrand Charpentier, Ransalu Senanayake, Mykel Kochenderfer +1
Characterizing aleatoric and epistemic uncertainty on the predicted rewards can help in building reliable reinforcement learning (RL) systems. Aleatoric uncertainty results from th…
Differentiable DAG Sampling
Bertrand Charpentier, Simon Kibler, Stephan Günnemann
We propose a new differentiable probabilistic model over DAGs (DP-DAG). DP-DAG allows fast and differentiable DAG sampling suited to continuous optimization. To this end, DP-DAG sa…
Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification
Maximilian Stadler, Bertrand Charpentier, Simon Geisler +2
The interdependence between nodes in graphs is key to improve class predictions on nodes and utilized in approaches like Label Propagation (LP) or in Graph Neural Networks (GNN). N…
On Out-of-distribution Detection with Energy-based Models
Sven Elflein, Bertrand Charpentier, Daniel Zügner +1
Several density estimation methods have shown to fail to detect out-of-distribution (OOD) samples by assigning higher likelihoods to anomalous data. Energy-based models (EBMs) are…
Natural Posterior Network: Deep Bayesian Uncertainty for Exponential Family Distributions
Bertrand Charpentier, Oliver Borchert, Daniel Zügner +2
Uncertainty awareness is crucial to develop reliable machine learning models. In this work, we propose the Natural Posterior Network (NatPN) for fast and high-quality uncertainty e…
Evaluating Robustness of Predictive Uncertainty Estimation: Are Dirichlet-based Models Reliable?
Anna-Kathrin Kopetzki, Bertrand Charpentier, Daniel Zügner +2
Dirichlet-based uncertainty (DBU) models are a recent and promising class of uncertainty-aware models. DBU models predict the parameters of a Dirichlet distribution to provide fast…
Scikit-network: Graph Analysis in Python
Thomas Bonald, Nathan de Lara, Quentin Lutz +1
Scikit-network is a Python package inspired by scikit-learn for the analysis of large graphs. Graphs are represented by their adjacency matrix in the sparse CSR format of SciPy. Th…
Posterior Network: Uncertainty Estimation without OOD Samples via Density-Based Pseudo-Counts
Bertrand Charpentier, Daniel Zügner, Stephan Günnemann
Accurate estimation of aleatoric and epistemic uncertainty is crucial to build safe and reliable systems. Traditional approaches, such as dropout and ensemble methods, estimate unc…
Uncertainty on Asynchronous Time Event Prediction
Marin Biloš, Bertrand Charpentier, Stephan Günnemann
Asynchronous event sequences are the basis of many applications throughout different industries. In this work, we tackle the task of predicting the next event (given a history), an…
Learning Graph Representations by Dendrograms
Thomas Bonald, Bertrand Charpentier
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical c…
Hierarchical Graph Clustering using Node Pair Sampling
Thomas Bonald, Bertrand Charpentier, Alexis Galland +1
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between…