Roy R. Lederman
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
Roy R. Lederman has a total of 71 co-authors. Here are the top co-authors by number of shared publications:
- Amit Singer
Department of Mathematics and Program in Applied and Computational Mathematics, Princeton University, Princeton, NJ 08544, USA
4 shared publications - Carlos Oscar Sanchez Sorzano
Centro Nacional de Biotecnologia-CSIC, C/ Darwin, 3, 28049, Cantoblanco, Madrid, Spain
4 shared publications - Jose Maria Carazo
Centro Nacional de Biotecnología (CNB-CSIC), Madrid, Spain
4 shared publications - David Herreros
Centro Nacional de Biotecnología-CSIC, Madrid, Spain
3 shared publications - Jiří Filipovič
Masaryk University
3 shared publications - David Strelak
Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic
2 shared publications
Latest Publications
- Open Access
Best for the Eye, Not for the Algorithm: Anisotropy in Fitting Atomic Models in Cryo-EM
Most atomic model refinement methods in cryo-EM fit models to the reconstructed density map and effectively treat Fourier voxels as equally reliable. However, the uncertainty in the estimation of Fourier coefficients is highly anisotropic, primarily due to the common variability in SNR in different frequency shells and the distribution of particle images across viewing directions. First-principles arguments suggest that atomic models should be fitted to particle images rather than volumes; this strategy may be computationally demanding. We show that under certain modeling choices, fitting atomic models to weighted volumes is equivalent to fitting directly to particle images. Furthermore, we argue that various proxies can be used to capture this and other sources of uncertainty and distortions. We propose that the principle can be implemented in most atomic model-fitting software with relative ease, using information readily available in existing pipelines. As a proof of concept, we extracted the necessary information from standard RELION runs and fed it into a modified version of Servalcat in which we implemented a reinterpreted version of the idea.
Open AccessBest for the Eye, Not for the Algorithm: Anisotropy in Fitting Atomic Models in Cryo-EM
Most atomic model refinement methods in cryo-EM fit models to the reconstructed density map and effectively treat Fourier voxels as equally reliable. However, the uncertainty in the estimation of Fourier coefficients is highly anisotropic, primarily due to the common variability in SNR in different frequency shells and the distribution of particle images across viewing directions. First-principles arguments suggest that atomic models should be fitted to particle images rather than volumes; this strategy may be computationally demanding. We show that under certain modeling choices, fitting atomic models to weighted volumes is equivalent to fitting directly to particle images. Furthermore, we argue that various proxies can be used to capture this and other sources of uncertainty and distortions. We propose that the principle can be implemented in most atomic model-fitting software with relative ease, using information readily available in existing pipelines. As a proof of concept, we extracted the necessary information from standard RELION runs and fed it into a modified version of Servalcat in which we implemented a reinterpreted version of the idea.
- Open Access
The Inaugural Flatiron Institute Cryo-EM Conformational Heterogeneity Challenge
Despite the rise of single particle cryo-electron microscopy (cryo-EM) as a premier method for resolving macromolecular structures at atomic resolution, methods to address molecular heterogeneity in vitrified samples have yet to reach maturity. With an increasing number of new methods to analyze the multitude of heterogeneous states captured in single particle images, a systematic approach to validation in this field is needed. With this motivation, we issued a challenge to the community to analyze two cryo-EM particle image sets of thyroglobulin that exhibit continuous conformational heterogeneity. The first dataset was experimental and the second was generated with a simulator, allowing control over the distribution of molecular structures and enabled direct comparison between participants’ submissions and the ground truth molecular structures and distributions. Participants were asked to submit 80 volumes representing the heterogeneous ensemble and estimate their respective populations in the image sets provided. Participation of the research community in the challenge was strong, with submissions from nearly all developers of heterogeneity methods, resulting in 41 submissions across both datasets. Submissions qualitatively exceeded expectations, with the molecular motions identified by methods resembling both each other and the ground truth motion. However, quantitatively assessing these similarities was a challenge in and of itself. In the process of assessing the submissions, we developed several validation metrics, most of which require reference to the underlying ground truth volumes. However, we have also explored the use of metrics that do not necessarily reference ground truth. This is particularly apt for experimental datasets where ground truth is inaccessible. These approaches allowed us to assess the similarity and accuracy in volume quality, molecular motions, and conformational distribution of di!erent submissions. These metrics and the e!orts of all participants help chart a path forward for the improvements of heterogeneity methods for cryo-EM and for future challenges to validate these new methods as they continue to be developed by the community.
Open AccessThe Inaugural Flatiron Institute Cryo-EM Conformational Heterogeneity Challenge
Despite the rise of single particle cryo-electron microscopy (cryo-EM) as a premier method for resolving macromolecular structures at atomic resolution, methods to address molecular heterogeneity in vitrified samples have yet to reach maturity. With an increasing number of new methods to analyze the multitude of heterogeneous states captured in single particle images, a systematic approach to validation in this field is needed. With this motivation, we issued a challenge to the community to analyze two cryo-EM particle image sets of thyroglobulin that exhibit continuous conformational heterogeneity. The first dataset was experimental and the second was generated with a simulator, allowing control over the distribution of molecular structures and enabled direct comparison between participants’ submissions and the ground truth molecular structures and distributions. Participants were asked to submit 80 volumes representing the heterogeneous ensemble and estimate their respective populations in the image sets provided. Participation of the research community in the challenge was strong, with submissions from nearly all developers of heterogeneity methods, resulting in 41 submissions across both datasets. Submissions qualitatively exceeded expectations, with the molecular motions identified by methods resembling both each other and the ground truth motion. However, quantitatively assessing these similarities was a challenge in and of itself. In the process of assessing the submissions, we developed several validation metrics, most of which require reference to the underlying ground truth volumes. However, we have also explored the use of metrics that do not necessarily reference ground truth. This is particularly apt for experimental datasets where ground truth is inaccessible. These approaches allowed us to assess the similarity and accuracy in volume quality, molecular motions, and conformational distribution of di!erent submissions. These metrics and the e!orts of all participants help chart a path forward for the improvements of heterogeneity methods for cryo-EM and for future challenges to validate these new methods as they continue to be developed by the community.
- 23 June 2025
- Published by International Union of Crystallography (IUCr) in Acta Crystallographica Section D Structural Biology
- Vol. 81 (7) , 327-343
Efficient high-resolution refinement in cryo-EM with stochastic gradient descent
Electron cryo-microscopy (cryo-EM) is an imaging technique that is widely used in structural biology to determine the three-dimensional structure of biological molecules from noisy two-dimensional projections with unknown orientations. As the typical pipeline involves processing large amounts of data, efficient algorithms are crucial for fast and reliable results. The stochastic gradient descent (SGD) algorithm has been used to improve the speed of ab initio reconstruction, which results in an initial, low-resolution estimation of the volume representing the molecule of interest, but has yet to be applied successfully in the high-resolution regime, where expectation–maximization algorithms achieve state-of-the-art results, at a high computational cost. In this article, we investigate the conditioning of the optimization problem and show that the large condition number prevents the successful application of gradient descent-based methods at high resolution. Our results include a theoretical analysis of the condition number of the optimization problem in a simplified setting where the individual projection directions are known, an algorithm based on computing a diagonal preconditioner using Hutchinson's diagonal estimator and numerical experiments showing the improvement in the convergence speed when using the estimated preconditioner with SGD. The preconditioned SGD approach can potentially enable a simple and unified approach to ab initio reconstruction and high-resolution refinement with faster convergence speed and higher flexibility, and our results are a promising step in this direction.
- 23 June 2025
- Published by International Union of Crystallography (IUCr) in Acta Crystallographica Section D Structural Biology
- Vol. 81 (7) , 327-343
Efficient high-resolution refinement in cryo-EM with stochastic gradient descent
Electron cryo-microscopy (cryo-EM) is an imaging technique that is widely used in structural biology to determine the three-dimensional structure of biological molecules from noisy two-dimensional projections with unknown orientations. As the typical pipeline involves processing large amounts of data, efficient algorithms are crucial for fast and reliable results. The stochastic gradient descent (SGD) algorithm has been used to improve the speed of ab initio reconstruction, which results in an initial, low-resolution estimation of the volume representing the molecule of interest, but has yet to be applied successfully in the high-resolution regime, where expectation–maximization algorithms achieve state-of-the-art results, at a high computational cost. In this article, we investigate the conditioning of the optimization problem and show that the large condition number prevents the successful application of gradient descent-based methods at high resolution. Our results include a theoretical analysis of the condition number of the optimization problem in a simplified setting where the individual projection directions are known, an algorithm based on computing a diagonal preconditioner using Hutchinson's diagonal estimator and numerical experiments showing the improvement in the convergence speed when using the estimated preconditioner with SGD. The preconditioned SGD approach can potentially enable a simple and unified approach to ab initio reconstruction and high-resolution refinement with faster convergence speed and higher flexibility, and our results are a promising step in this direction.
- Open Access
An Observation on Lloyd's k-Means Algorithm in High Dimensions
Clustering and estimating cluster means are core problems in statistics and machine learning, with k-means and Expectation Maximization (EM) being two widely used algorithms. In this work, we provide a theoretical explanation for the failure of k-means in high-dimensional settings with high noise and limited sample sizes, using a simple Gaussian Mixture Model (GMM). We identify regimes where, with high probability, almost every partition of the data becomes a fixed point of the k-means algorithm. This study is motivated by challenges in the analysis of more complex cases, such as masked GMMs, and those arising from applications in Cryo-Electron Microscopy.
Open AccessAn Observation on Lloyd's k-Means Algorithm in High Dimensions
Clustering and estimating cluster means are core problems in statistics and machine learning, with k-means and Expectation Maximization (EM) being two widely used algorithms. In this work, we provide a theoretical explanation for the failure of k-means in high-dimensional settings with high noise and limited sample sizes, using a simple Gaussian Mixture Model (GMM). We identify regimes where, with high probability, almost every partition of the data becomes a fixed point of the k-means algorithm. This study is motivated by challenges in the analysis of more complex cases, such as masked GMMs, and those arising from applications in Cryo-Electron Microscopy.
- 27 September 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 703, 528-555
Extreme values of the Fiedler vector on trees
- 27 September 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 703, 528-555
Extreme values of the Fiedler vector on trees
- 10 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in ... International Conference on Sampling Theory and Applications (SampTA). International Conference on Sampling Theory and Applications
- Vol. 2023, 1-7
On Manifold Learning in Plato’s Cave: Remarks on Manifold Learning and Physical Phenomena
Many techniques in machine learning attempt explicitly or implicitly to infer a low-dimensional manifold structure of an underlying physical phenomenon from measurements without an explicit model of the phenomenon or the measurement apparatus. This paper presents a cautionary tale regarding the discrepancy between the geometry of measurements and the geometry of the underlying phenomenon in a benign setting. The deformation in the metric illustrated in this paper is mathematically straightforward and unavoidable in the general case, and it is only one of several similar effects. While this is not always problematic, we provide an example of an arguably standard and harmless data processing procedure where this effect leads to an incorrect answer to a seemingly simple question. Although we focus on manifold learning, these issues apply broadly to dimensionality reduction and unsupervised learning.
- 10 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in ... International Conference on Sampling Theory and Applications (SampTA). International Conference on Sampling Theory and Applications
- Vol. 2023, 1-7
On Manifold Learning in Plato’s Cave: Remarks on Manifold Learning and Physical Phenomena
Many techniques in machine learning attempt explicitly or implicitly to infer a low-dimensional manifold structure of an underlying physical phenomenon from measurements without an explicit model of the phenomenon or the measurement apparatus. This paper presents a cautionary tale regarding the discrepancy between the geometry of measurements and the geometry of the underlying phenomenon in a benign setting. The deformation in the metric illustrated in this paper is mathematically straightforward and unavoidable in the general case, and it is only one of several similar effects. While this is not always problematic, we provide an example of an arguably standard and harmless data processing procedure where this effect leads to an incorrect answer to a seemingly simple question. Although we focus on manifold learning, these issues apply broadly to dimensionality reduction and unsupervised learning.
- Open Access
Extreme Values of the Fiedler Vector on Trees
Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$ have been of substantial interest. We investigate the question of when the maxima and minima of $\phi_2$ are assumed at the endpoints of the longest path in $G$. Our results also apply to more general graphs that `behave globally' like a tree but can exhibit more complicated local structure. The crucial new ingredient is a reproducing formula for the eigenvector $\phi_k$.Open AccessExtreme Values of the Fiedler Vector on Trees
Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$ have been of substantial interest. We investigate the question of when the maxima and minima of $\phi_2$ are assumed at the endpoints of the longest path in $G$. Our results also apply to more general graphs that `behave globally' like a tree but can exhibit more complicated local structure. The crucial new ingredient is a reproducing formula for the eigenvector $\phi_k$. - Open Access
- 11 January 2023
- Published by Springer Nature in Nature Communications
- Vol. 14 (1) , 1-10
Estimating conformational landscapes from Cryo-EM particles by 3D Zernike polynomials
The new developments in Cryo-EM Single Particle Analysis are helping us to understand how the macromolecular structure and function meet to drive biological processes. By capturing many states at the particle level, it is possible to address how macromolecules explore different conformations, information that is classically extracted through 3D classification. However, the limitations of classical approaches prevent us from fully understanding the complete conformational landscape due to the reduced number of discrete states accurately reconstructed. To characterize the whole structural spectrum of a macromolecule, we propose an extension of our Zernike3D approach, able to extract per-image continuous flexibility information directly from a particle dataset. Also, our method can be seamlessly applied to images, maps or atomic models, opening integrative possibilities. Furthermore, we introduce the ZART reconstruction algorithm, which considers the Zernike3D deformation fields to revert particle conformational changes during the reconstruction process, thus minimizing the blurring induced by molecular motions.
- 11 January 2023
- Published by Springer Nature in Nature Communications
- Vol. 14 (1) , 1-10
Open AccessEstimating conformational landscapes from Cryo-EM particles by 3D Zernike polynomials
The new developments in Cryo-EM Single Particle Analysis are helping us to understand how the macromolecular structure and function meet to drive biological processes. By capturing many states at the particle level, it is possible to address how macromolecules explore different conformations, information that is classically extracted through 3D classification. However, the limitations of classical approaches prevent us from fully understanding the complete conformational landscape due to the reduced number of discrete states accurately reconstructed. To characterize the whole structural spectrum of a macromolecule, we propose an extension of our Zernike3D approach, able to extract per-image continuous flexibility information directly from a particle dataset. Also, our method can be seamlessly applied to images, maps or atomic models, opening integrative possibilities. Furthermore, we introduce the ZART reconstruction algorithm, which considers the Zernike3D deformation fields to revert particle conformational changes during the reconstruction process, thus minimizing the blurring induced by molecular motions.
- Open Access
Geometric Ergodicity in Modified Variations of Riemannian Manifold and Lagrangian Monte Carlo
Riemannian manifold Hamiltonian (RMHMC) and Lagrangian Monte Carlo (LMC) have emerged as powerful methods of Bayesian inference. Unlike Euclidean Hamiltonian Monte Carlo (EHMC) and the Metropolis-adjusted Langevin algorithm (MALA), the geometric ergodicity of these Riemannian algorithms has not been extensively studied. On the other hand, the manifold Metropolis-adjusted Langevin algorithm (MMALA) has recently been shown to exhibit geometric ergodicity under certain conditions. This work investigates the mixture of the LMC and RMHMC transition kernels with MMALA in order to equip the resulting method with an "inherited" geometric ergodicity theory. We motivate this mixture kernel based on an analogy between single-step HMC and MALA. We then proceed to evaluate the original and modified transition kernels on several benchmark Bayesian inference tasks.
Open AccessGeometric Ergodicity in Modified Variations of Riemannian Manifold and Lagrangian Monte Carlo
Riemannian manifold Hamiltonian (RMHMC) and Lagrangian Monte Carlo (LMC) have emerged as powerful methods of Bayesian inference. Unlike Euclidean Hamiltonian Monte Carlo (EHMC) and the Metropolis-adjusted Langevin algorithm (MALA), the geometric ergodicity of these Riemannian algorithms has not been extensively studied. On the other hand, the manifold Metropolis-adjusted Langevin algorithm (MMALA) has recently been shown to exhibit geometric ergodicity under certain conditions. This work investigates the mixture of the LMC and RMHMC transition kernels with MMALA in order to equip the resulting method with an "inherited" geometric ergodicity theory. We motivate this mixture kernel based on an analogy between single-step HMC and MALA. We then proceed to evaluate the original and modified transition kernels on several benchmark Bayesian inference tasks.
- Open Access
Maximum likelihood for high-noise group orbit estimation and single-particle cryo-EM
Motivated by applications to single-particle cryo-electron microscopy (cryo-EM), we study several problems of function estimation in a high noise regime, where samples are observed after random rotation and possible linear projection of the function domain. We describe a stratification of the Fisher information eigenvalues according to transcendence degrees of graded pieces of the algebra of group invariants, and we relate critical points of the log-likelihood landscape to a sequence of moment optimization problems, extending previous results for a discrete rotation group without projections. We then compute the transcendence degrees and forms of these optimization problems for several examples of function estimation under $SO(2)$ and $SO(3)$ rotations, including a simplified model of cryo-EM as introduced by Bandeira, Blum-Smith, Kileel, Perry, Weed, and Wein. We affirmatively resolve conjectures that $3^\text{rd}$-order moments are sufficient to locally identify a generic signal up to its rotational orbit in these examples. For low-dimensional approximations of the electric potential maps of two small protein molecules, we empirically verify that the noise-scalings of the Fisher information eigenvalues conform with our theoretical predictions over a range of SNR, in a model of $SO(3)$ rotations without projections.Open AccessMaximum likelihood for high-noise group orbit estimation and single-particle cryo-EM
Motivated by applications to single-particle cryo-electron microscopy (cryo-EM), we study several problems of function estimation in a high noise regime, where samples are observed after random rotation and possible linear projection of the function domain. We describe a stratification of the Fisher information eigenvalues according to transcendence degrees of graded pieces of the algebra of group invariants, and we relate critical points of the log-likelihood landscape to a sequence of moment optimization problems, extending previous results for a discrete rotation group without projections. We then compute the transcendence degrees and forms of these optimization problems for several examples of function estimation under $SO(2)$ and $SO(3)$ rotations, including a simplified model of cryo-EM as introduced by Bandeira, Blum-Smith, Kileel, Perry, Weed, and Wein. We affirmatively resolve conjectures that $3^\text{rd}$-order moments are sufficient to locally identify a generic signal up to its rotational orbit in these examples. For low-dimensional approximations of the electric potential maps of two small protein molecules, we empirically verify that the noise-scalings of the Fisher information eigenvalues conform with our theoretical predictions over a range of SNR, in a model of $SO(3)$ rotations without projections.