Pierre Vandergheynst
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Pierre Vandergheynst has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
- Yves Wiaux
Institute of Sensors, Signals and Systems, Heriot-Watt University, Edinburgh EH14 4AS, UK
17 shared publications - Pascal Frossard
EPFL, Lausanne, Switzerland
7 shared publications - Enrique Martinez-Gonzalez
Instituto de Física de Cantabria (IFCA), Avda. Los Castros s/n, 39005 Santander, Spain
5 shared publications - Jason D. McEwen
Mullard Space Science Laboratory (MSSL), University College London (UCL), London, U.K.
5 shared publications - Laurent Jacques
ISPGroup, INMA/ ICTEAM, UCLouvain, Louvain-la-Neuve, Belgium
5 shared publications - Mohan Vamsi Nallapareddy
LTS2 Signal Processing Laboratory, IEL, STI, École Polytechnique Fédérale de Lausanne, Rte Cantonale, 1015, Vaud, Vaud
5 shared publications
Latest Publications
- Open Access
- 14 June 2026
- Published by Elsevier in SSRN Electronic Journal
Dynamic gene network learning without priors
Gene interactions form complex networks that shape disease susceptibility, prognosis, and therapeutic response. Although bulk transcriptomic datasets represent a clinically scalable and widely available resource for studying these interactions, the application of Graph Neural Networks (GNNs) to bulk transcriptomics remains constrained by limited methodological guidance, particularly for constructing biologically meaningful gene interaction graphs. Here, we present REGEN (REconstruction of GEne Networks), a dynamic graph-based framework that simultaneously learns latent gene interaction networks directly from bulk transcriptomic profiles and predicts patient vital status. Across seven cancer types from The Cancer Genome Atlas (TCGA), REGEN outperformed baseline approaches in five datasets while generating robust and interpretable network structures. By systematically evaluating strategies for initializing gene–gene adjacency matrices, we establish practical guidelines for applying GNNs to clinically relevant bulk transcriptomic data. Importantly, analysis of the learned kidney cancer networks identified cancer-associated pathways and candidate biomarkers linked to disease biology and patient outcome, supporting the translational utility of the approach. Together, these findings provide a principled framework for dynamic gene network learning from bulk transcriptomics and highlight the potential of GNN-based models to support biomarker discovery, patient stratification, and future precision oncology applications without requiring predefined interaction priors.
- 14 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDynamic gene network learning without priors
Gene interactions form complex networks that shape disease susceptibility, prognosis, and therapeutic response. Although bulk transcriptomic datasets represent a clinically scalable and widely available resource for studying these interactions, the application of Graph Neural Networks (GNNs) to bulk transcriptomics remains constrained by limited methodological guidance, particularly for constructing biologically meaningful gene interaction graphs. Here, we present REGEN (REconstruction of GEne Networks), a dynamic graph-based framework that simultaneously learns latent gene interaction networks directly from bulk transcriptomic profiles and predicts patient vital status. Across seven cancer types from The Cancer Genome Atlas (TCGA), REGEN outperformed baseline approaches in five datasets while generating robust and interpretable network structures. By systematically evaluating strategies for initializing gene–gene adjacency matrices, we establish practical guidelines for applying GNNs to clinically relevant bulk transcriptomic data. Importantly, analysis of the learned kidney cancer networks identified cancer-associated pathways and candidate biomarkers linked to disease biology and patient outcome, supporting the translational utility of the approach. Together, these findings provide a principled framework for dynamic gene network learning from bulk transcriptomics and highlight the potential of GNN-based models to support biomarker discovery, patient stratification, and future precision oncology applications without requiring predefined interaction priors.
- Open Access
Learning gene interactions from tabular gene expression data using Graph Neural Networks
Gene interactions form complex networks underlying disease susceptibility and therapeutic response. While bulk transcriptomic datasets offer rich resources for studying these interactions, applying Graph Neural Networks (GNNs) to such data remains limited by a lack of methodological guidance, especially for constructing gene interaction graphs. We present REGEN (REconstruction of GEne Networks), a GNN-based framework that simultaneously learns latent gene interaction networks from bulk transcriptomic profiles and predicts patient vital status. Evaluated across seven cancer types in the TCGA cohort, REGEN outperforms baseline models in five datasets and provides robust network inference. By systematically comparing strategies for initializing gene–gene adjacency matrices, we derive practical guidelines for GNN application to bulk transcriptomics. Analysis of the learned kidney cancer gene-network reveals cancer-related pathways and biomarkers, validating the model’s biological relevance. Together, we establish a principled approach for applying GNNs to bulk transcriptomics, enabling improved phenotype prediction and meaningful gene network discovery.
Open AccessLearning gene interactions from tabular gene expression data using Graph Neural Networks
Gene interactions form complex networks underlying disease susceptibility and therapeutic response. While bulk transcriptomic datasets offer rich resources for studying these interactions, applying Graph Neural Networks (GNNs) to such data remains limited by a lack of methodological guidance, especially for constructing gene interaction graphs. We present REGEN (REconstruction of GEne Networks), a GNN-based framework that simultaneously learns latent gene interaction networks from bulk transcriptomic profiles and predicts patient vital status. Evaluated across seven cancer types in the TCGA cohort, REGEN outperforms baseline models in five datasets and provides robust network inference. By systematically comparing strategies for initializing gene–gene adjacency matrices, we derive practical guidelines for GNN application to bulk transcriptomics. Analysis of the learned kidney cancer gene-network reveals cancer-related pathways and biomarkers, validating the model’s biological relevance. Together, we establish a principled approach for applying GNNs to bulk transcriptomics, enabling improved phenotype prediction and meaningful gene network discovery.
- Open Access
- 26 November 2025
- Published by Springer Nature in Communications Biology
- Vol. 8 (1) , 1691
Conditional deep learning model reveals translation elongation determinants during amino acid deprivation
Translation elongation plays a key role in cellular homeostasis, and dysregulation of this process has been implicated in various diseases and metabolic disorders. Uncovering the causes of intragenic heterogeneity of translation, especially in contexts of different amino acid deprivations, could help increase our understanding of these disorders and pave the way for novel therapeutics. Ribosome profiling provides accurate measurements for the genome-wide ribosome footprints, which could be utilized to investigate these mechanisms. Here we present Riboclette, a conditional deep learning model featuring a dual output head that uses the mRNA sequence input to accurately predict the ribosome footprint profiles across six amino acid deprivation conditions. Exploiting standard interpretability methods, we identify specific codons related to deprived amino acids, poly-basic regions, and negatively charged amino acids as the primary drivers of the stalling response. Moreover, we use Riboclette to extract motif level drivers for ribosome stalling by performing in silico perturbation experiments. These motifs precisely explain stalling at different codon positions, allowing for the differentiation between expected determinants of rare stalling events. Our framework offers an accurate and explainable method for understanding the impact of intragenic variations on the regulation of translation elongation under amino acid deprivation.
- 26 November 2025
- Published by Springer Nature in Communications Biology
- Vol. 8 (1) , 1691
Open AccessConditional deep learning model reveals translation elongation determinants during amino acid deprivation
Translation elongation plays a key role in cellular homeostasis, and dysregulation of this process has been implicated in various diseases and metabolic disorders. Uncovering the causes of intragenic heterogeneity of translation, especially in contexts of different amino acid deprivations, could help increase our understanding of these disorders and pave the way for novel therapeutics. Ribosome profiling provides accurate measurements for the genome-wide ribosome footprints, which could be utilized to investigate these mechanisms. Here we present Riboclette, a conditional deep learning model featuring a dual output head that uses the mRNA sequence input to accurately predict the ribosome footprint profiles across six amino acid deprivation conditions. Exploiting standard interpretability methods, we identify specific codons related to deprived amino acids, poly-basic regions, and negatively charged amino acids as the primary drivers of the stalling response. Moreover, we use Riboclette to extract motif level drivers for ribosome stalling by performing in silico perturbation experiments. These motifs precisely explain stalling at different codon positions, allowing for the differentiation between expected determinants of rare stalling events. Our framework offers an accurate and explainable method for understanding the impact of intragenic variations on the regulation of translation elongation under amino acid deprivation.
- Open Access
Conditional Deep Learning Model Reveals Translation Elongation Determinants during Amino Acid Deprivation
Translation elongation plays a key role in cellular homeostasis, and dysregulation of this process has been implicated in various diseases and metabolic disorders. Uncovering the causes of intragenic heterogeneity of translation, especially in contexts of different amino acid deprivations, could help increase our understanding of these disorders and pave the way for novel therapeutics. Ribosome profiling provides accurate measurements for the genome-wide ribosome footprints, which could be utilized to investigate these mechanisms. Here we present Riboclette, a conditional deep learning model featuring a dual output head that uses the mRNA sequence input to accurately predict the ribosome footprint profiles across six amino acid deprivation conditions. Exploiting standard interpretability methods, we identify specific codons related to deprived amino acids, poly-basic regions, and negatively charged amino acids as the primary drivers of the stalling response. Moreover, we use Riboclette to extract motif level drivers for ribosome stalling by performing in silico perturbation experiments. The extracted motifs highlight the cumulative contribution of deprived codons in triggering ribosome stalling, which, depending on the condition, have been identified to affect translation up to ten codons downstream. Moreover, motifs precisely explain stalling at different codon positions, allowing for the differentiation between expected determinants of rare stalling events. Our framework offers an accurate and explainable method for understanding the effect of different amino acid deprivation conditions at a codon resolution to help elucidate the impact of intragenic variations on the regulation of translation elongation.
Open AccessConditional Deep Learning Model Reveals Translation Elongation Determinants during Amino Acid Deprivation
Translation elongation plays a key role in cellular homeostasis, and dysregulation of this process has been implicated in various diseases and metabolic disorders. Uncovering the causes of intragenic heterogeneity of translation, especially in contexts of different amino acid deprivations, could help increase our understanding of these disorders and pave the way for novel therapeutics. Ribosome profiling provides accurate measurements for the genome-wide ribosome footprints, which could be utilized to investigate these mechanisms. Here we present Riboclette, a conditional deep learning model featuring a dual output head that uses the mRNA sequence input to accurately predict the ribosome footprint profiles across six amino acid deprivation conditions. Exploiting standard interpretability methods, we identify specific codons related to deprived amino acids, poly-basic regions, and negatively charged amino acids as the primary drivers of the stalling response. Moreover, we use Riboclette to extract motif level drivers for ribosome stalling by performing in silico perturbation experiments. The extracted motifs highlight the cumulative contribution of deprived codons in triggering ribosome stalling, which, depending on the condition, have been identified to affect translation up to ten codons downstream. Moreover, motifs precisely explain stalling at different codon positions, allowing for the differentiation between expected determinants of rare stalling events. Our framework offers an accurate and explainable method for understanding the effect of different amino acid deprivation conditions at a codon resolution to help elucidate the impact of intragenic variations on the regulation of translation elongation.
- Open Access
Boosting Protein Graph Representations through Static-Dynamic Fusion
Machine learning for protein modeling faces significant challenges due to proteins’ inherently dynamic nature, yet most graph-based machine learning methods rely solely on static structural information. Recently, the growing availability of molecular dynamics trajectories provides new opportunities for understanding the dynamic behavior of proteins; however, computational methods for utilizing this dynamic information remain limited. We propose a novel graph representation that integrates both static structural information and dynamic correlations from molecular dynamics trajectories, enabling more comprehensive modeling of proteins. By applying relational graph neural networks (RGNNs) to process this heterogeneous representation, we demonstrate significant improvements over structure-based approaches across three distinct tasks: atomic adaptability prediction, binding site detection, and binding affinity prediction. Our results validate that combining static and dynamic information provides complementary signals for understanding proteinligand interactions, offering new possibilities for drug design and structural biology applications.
Open AccessBoosting Protein Graph Representations through Static-Dynamic Fusion
Machine learning for protein modeling faces significant challenges due to proteins’ inherently dynamic nature, yet most graph-based machine learning methods rely solely on static structural information. Recently, the growing availability of molecular dynamics trajectories provides new opportunities for understanding the dynamic behavior of proteins; however, computational methods for utilizing this dynamic information remain limited. We propose a novel graph representation that integrates both static structural information and dynamic correlations from molecular dynamics trajectories, enabling more comprehensive modeling of proteins. By applying relational graph neural networks (RGNNs) to process this heterogeneous representation, we demonstrate significant improvements over structure-based approaches across three distinct tasks: atomic adaptability prediction, binding site detection, and binding affinity prediction. Our results validate that combining static and dynamic information provides complementary signals for understanding proteinligand interactions, offering new possibilities for drug design and structural biology applications.
- Open Access
Towards improving full-length ribosome density prediction by bridging sequence and graph-based representations
Translation elongation plays an important role in regulating protein concentrations in the cell, and dysregulation of this process has been linked to several human diseases. In this study, we use data from ribo-seq experiments to model ribosome densities, and in turn, predict the speed of translation. The proposed method, RiboGL, combines graph and recurrent neural networks to account for both graph and sequence-based features. The model takes a graph representing the secondary structure of the mRNA sequence as input, which incorporates both sequence and structural codon neighbors. In our experiments, RiboGL greatly outperforms the state-of-the-art RiboMIMO model for ribosome density prediction. We also conduct ablation studies to justify the design choices made in building the pipeline. Additionally, we use gradient-based interpretability to understand how the codon context and the structural neighbors affect the ribosome density at the A-site. By individually analyzing the genes in the dataset, we elucidate how structural neighbors could also potentially play a role in defining the ribosome density. Importantly, since these neighbors can be far away in the sequence, a recurrent model alone could not easily extract this information. This study lays the foundation for understanding how the mRNA secondary structure can be exploited for ribosome density prediction, and how in the future other graph modalities such as features from the nascent polypeptide can be used to further our understanding of translation in general.
Open AccessTowards improving full-length ribosome density prediction by bridging sequence and graph-based representations
Translation elongation plays an important role in regulating protein concentrations in the cell, and dysregulation of this process has been linked to several human diseases. In this study, we use data from ribo-seq experiments to model ribosome densities, and in turn, predict the speed of translation. The proposed method, RiboGL, combines graph and recurrent neural networks to account for both graph and sequence-based features. The model takes a graph representing the secondary structure of the mRNA sequence as input, which incorporates both sequence and structural codon neighbors. In our experiments, RiboGL greatly outperforms the state-of-the-art RiboMIMO model for ribosome density prediction. We also conduct ablation studies to justify the design choices made in building the pipeline. Additionally, we use gradient-based interpretability to understand how the codon context and the structural neighbors affect the ribosome density at the A-site. By individually analyzing the genes in the dataset, we elucidate how structural neighbors could also potentially play a role in defining the ribosome density. Importantly, since these neighbors can be far away in the sequence, a recurrent model alone could not easily extract this information. This study lays the foundation for understanding how the mRNA secondary structure can be exploited for ribosome density prediction, and how in the future other graph modalities such as features from the nascent polypeptide can be used to further our understanding of translation in general.
- Open Access
- 14 March 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Molecular set representation learning
Computational representation of molecules can take many forms, including graphs, string-encodings of graphs, binary vectors, or learned embeddings in the form of real-valued vectors. These representations are then used in downstream classification and regression tasks using a wide range of machine-learning models. However, existing models come with limitations, such as the requirement for clearly defined chemical bonds, which often do not represent the true underlying nature of a molecule. Here, we propose a framework for molecular machine learning tasks based on set representation learning. We show that learning on sets of atomic invariants alone reaches the performance of state-of-the-art graph-based models on the most-used chemical benchmark data sets and that introducing a set representation layer into graph neural networks can surpass the performance of established methods in the domains of chemistry, biology, and material science. We introduce specialised set representation-based neural network architectures for reaction yield and protein-ligand binding affinity prediction. Overall, we show that the technique we denote molecular set representation learning is both an alternative and an extension to graph neural network architectures for machine learning tasks on molecules, molecule complexes, and chemical reactions.
- 14 March 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessMolecular set representation learning
Computational representation of molecules can take many forms, including graphs, string-encodings of graphs, binary vectors, or learned embeddings in the form of real-valued vectors. These representations are then used in downstream classification and regression tasks using a wide range of machine-learning models. However, existing models come with limitations, such as the requirement for clearly defined chemical bonds, which often do not represent the true underlying nature of a molecule. Here, we propose a framework for molecular machine learning tasks based on set representation learning. We show that learning on sets of atomic invariants alone reaches the performance of state-of-the-art graph-based models on the most-used chemical benchmark data sets and that introducing a set representation layer into graph neural networks can surpass the performance of established methods in the domains of chemistry, biology, and material science. We introduce specialised set representation-based neural network architectures for reaction yield and protein-ligand binding affinity prediction. Overall, we show that the technique we denote molecular set representation learning is both an alternative and an extension to graph neural network architectures for machine learning tasks on molecules, molecule complexes, and chemical reactions.
- Open Access
Generalised Implicit Neural Representations
We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal exists on some unknown topological space from which we sample a discrete graph. In the absence of a coordinate system to identify the sampled nodes, we propose approximating their location with a spectral embedding of the graph. This allows us to train INRs without knowing the underlying continuous domain, which is the case for most graph signals in nature, while also making the INRs independent of any choice of coordinate system. We show experiments with our method on various real-world signals on non-Euclidean domains.
Open AccessGeneralised Implicit Neural Representations
We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal exists on some unknown topological space from which we sample a discrete graph. In the absence of a coordinate system to identify the sampled nodes, we propose approximating their location with a spectral embedding of the graph. This allows us to train INRs without knowing the underlying continuous domain, which is the case for most graph signals in nature, while also making the INRs independent of any choice of coordinate system. We show experiments with our method on various real-world signals on non-Euclidean domains.
- Open Access
- 16 March 2022
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 18 (3) , e1009178
RosettaSurf—A surface-centric computational design approach
Proteins are typically represented by discrete atomic coordinates providing an accessible framework to describe different conformations. However, in some fields proteins are more accurately represented as near-continuous surfaces, as these are imprinted with geometric (shape) and chemical (electrostatics) features of the underlying protein structure. Protein surfaces are dependent on their chemical composition and, ultimately determine protein function, acting as the interface that engages in interactions with other molecules. In the past, such representations were utilized to compare protein structures on global and local scales and have shed light on functional properties of proteins. Here we describe RosettaSurf, a surface-centric computational design protocol, that focuses on the molecular surface shape and electrostatic properties as means for protein engineering, offering a unique approach for the design of proteins and their functions. The RosettaSurf protocol combines the explicit optimization of molecular surface features with a global scoring function during the sequence design process, diverging from the typical design approaches that rely solely on an energy scoring function. With this computational approach, we attempt to address a fundamental problem in protein design related to the design of functional sites in proteins, even when structurally similar templates are absent in the characterized structural repertoire. Surface-centric design exploits the premise that molecular surfaces are, to a certain extent, independent of the underlying sequence and backbone configuration, meaning that different sequences in different proteins may present similar surfaces. We benchmarked RosettaSurf on various sequence recovery datasets and showcased its design capabilities by generating epitope mimics that were biochemically validated. Overall, our results indicate that the explicit optimization of surface features may lead to new routes for the design of functional proteins.
- 16 March 2022
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 18 (3) , e1009178
Open AccessRosettaSurf—A surface-centric computational design approach
Proteins are typically represented by discrete atomic coordinates providing an accessible framework to describe different conformations. However, in some fields proteins are more accurately represented as near-continuous surfaces, as these are imprinted with geometric (shape) and chemical (electrostatics) features of the underlying protein structure. Protein surfaces are dependent on their chemical composition and, ultimately determine protein function, acting as the interface that engages in interactions with other molecules. In the past, such representations were utilized to compare protein structures on global and local scales and have shed light on functional properties of proteins. Here we describe RosettaSurf, a surface-centric computational design protocol, that focuses on the molecular surface shape and electrostatic properties as means for protein engineering, offering a unique approach for the design of proteins and their functions. The RosettaSurf protocol combines the explicit optimization of molecular surface features with a global scoring function during the sequence design process, diverging from the typical design approaches that rely solely on an energy scoring function. With this computational approach, we attempt to address a fundamental problem in protein design related to the design of functional sites in proteins, even when structurally similar templates are absent in the characterized structural repertoire. Surface-centric design exploits the premise that molecular surfaces are, to a certain extent, independent of the underlying sequence and backbone configuration, meaning that different sequences in different proteins may present similar surfaces. We benchmarked RosettaSurf on various sequence recovery datasets and showcased its design capabilities by generating epitope mimics that were biochemically validated. Overall, our results indicate that the explicit optimization of surface features may lead to new routes for the design of functional proteins.
- Open Access
RosettaSurf - a surface-centric computational design approach
Proteins are typically represented by discrete atomic coordinates providing an accessible framework to describe different conformations. However, in some fields proteins are more accurately represented as near-continuous surfaces, as these are imprinted with geometric (shape) and chemical (electrostatics) features of the underlying protein structure. Protein surfaces are dependent on their chemical composition and, ultimately determine protein function, acting as the interface that engages in interactions with other molecules. In the past, such representations were utilized to compare protein structures on global and local scales and have shed light on functional properties of proteins. Here we describe RosettaSurf, a surface-centric computational design protocol, that focuses on the molecular surface shape and electrostatic properties as means for protein engineering, offering a unique approach for the design of proteins and their functions. The RosettaSurf protocol combines the explicit optimization of molecular surface features with a global scoring function during the sequence design process, diverging from the typical design approaches that rely solely on an energy scoring function. With this computational approach, we attempt to address a fundamental problem in protein design related to the design of functional sites in proteins, even when structurally similar templates are absent in the characterized structural repertoire. Surface-centric design exploits the premise that molecular surfaces are, to a certain extent, independent of the underlying sequence and backbone configuration, meaning that different sequences in different proteins may present similar surfaces. We benchmarked RosettaSurf on various sequence recovery datasets and showcased its design capabilities by generating epitope mimics that were biochemically validated. Overall, our results indicate that the explicit optimization of surface features may lead to new routes for the design of functional proteins. Author Summary Finely orchestrated protein-protein interactions are at the heart of virtually all fundamental cellular processes. Altering these processes or encoding new functions in proteins has been a long-standing goal in computational protein design. Protein design methods commonly rely on scoring functions that seek to identify amino acid sequences that optimize structural configurations of atoms while minimizing a variety of physics-based and statistical terms. The objectives of the large majority of computational design protocols have been focused on obtaining a predefined structural conformation. However, routinely introducing a functional aspect on designer proteins has been more challenging. Our results suggest that the molecular surface features can be a useful optimization parameter to guide the design process towards functional surfaces that mimic known protein binding sites and interact with their intended targets. Specifically, we demonstrate that our design method can optimize experimental libraries through computational screening, creating a basis for highly specific protein binders, as well as design a potent immunogen that engages with site-specific antibodies. The ability to create proteins with novel functions will be transformative for biomedical applications, providing many opportunities for the design of novel immunogens, protein components for synthetic biology, and other protein-based biotechnologies.
Open AccessRosettaSurf - a surface-centric computational design approach
Proteins are typically represented by discrete atomic coordinates providing an accessible framework to describe different conformations. However, in some fields proteins are more accurately represented as near-continuous surfaces, as these are imprinted with geometric (shape) and chemical (electrostatics) features of the underlying protein structure. Protein surfaces are dependent on their chemical composition and, ultimately determine protein function, acting as the interface that engages in interactions with other molecules. In the past, such representations were utilized to compare protein structures on global and local scales and have shed light on functional properties of proteins. Here we describe RosettaSurf, a surface-centric computational design protocol, that focuses on the molecular surface shape and electrostatic properties as means for protein engineering, offering a unique approach for the design of proteins and their functions. The RosettaSurf protocol combines the explicit optimization of molecular surface features with a global scoring function during the sequence design process, diverging from the typical design approaches that rely solely on an energy scoring function. With this computational approach, we attempt to address a fundamental problem in protein design related to the design of functional sites in proteins, even when structurally similar templates are absent in the characterized structural repertoire. Surface-centric design exploits the premise that molecular surfaces are, to a certain extent, independent of the underlying sequence and backbone configuration, meaning that different sequences in different proteins may present similar surfaces. We benchmarked RosettaSurf on various sequence recovery datasets and showcased its design capabilities by generating epitope mimics that were biochemically validated. Overall, our results indicate that the explicit optimization of surface features may lead to new routes for the design of functional proteins. Author Summary Finely orchestrated protein-protein interactions are at the heart of virtually all fundamental cellular processes. Altering these processes or encoding new functions in proteins has been a long-standing goal in computational protein design. Protein design methods commonly rely on scoring functions that seek to identify amino acid sequences that optimize structural configurations of atoms while minimizing a variety of physics-based and statistical terms. The objectives of the large majority of computational design protocols have been focused on obtaining a predefined structural conformation. However, routinely introducing a functional aspect on designer proteins has been more challenging. Our results suggest that the molecular surface features can be a useful optimization parameter to guide the design process towards functional surfaces that mimic known protein binding sites and interact with their intended targets. Specifically, we demonstrate that our design method can optimize experimental libraries through computational screening, creating a basis for highly specific protein binders, as well as design a potent immunogen that engages with site-specific antibodies. The ability to create proteins with novel functions will be transformative for biomedical applications, providing many opportunities for the design of novel immunogens, protein components for synthetic biology, and other protein-based biotechnologies.