Florian Beck

Florian Beck

Auto-generated profile, based on publicly available information

Florian Beck

LIT Artificial Intelligence Lab

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 August 2024 in Nature
Verified
Journal Article
Open access
PDF file
JWJonathan Wagner
Jonathan Wagner
ACAlonso I. Carvajal
Alonso I. Carvajal
ABAndreas Bracher
Andreas Bracher
FBFlorian Beck
Florian Beck
WWWilliam Wan
William Wan
FHF. Ulrich Hartl
F. Ulrich Hartl
Chaperonins are large barrel-shaped complexes that mediate ATP-dependent protein folding1–3. The bacterial chaperonin GroEL forms juxtaposed rings that bind unfolded protein and the lid-shaped cofactor GroES at their apertures. In vitro analyses of the chaperonin reaction have shown that substrate protein folds, unimpaired by aggregation, while transiently encapsulated in the GroEL central cavity by GroES4–6. To determine the functional stoichiometry of GroEL, GroES and client protein in situ, here we visualized chaperonin complexes in their natural cellular environment using cryo-electron tomography. We find that, under various growth conditions, around 55–70% of GroEL binds GroES asymmetrically on one ring, with the remainder populating symmetrical complexes. Bound substrate protein is detected on the free ring of the asymmetrical complex, defining the substrate acceptor state. In situ analysis of GroEL–GroES chambers, validated by high-resolution structures obtained in vitro, showed the presence of encapsulated substrate protein in a folded state before release into the cytosol. Based on a comprehensive quantification and conformational analysis of chaperonin complexes, we propose a GroEL–GroES reaction cycle that consists of linked asymmetrical and symmetrical subreactions mediating protein folding. Our findings illuminate the native conformational and functional chaperonin cycle directly within cells.

23 January 2023 in Machine Learning
Verified
Journal Article
Open access
PDF file
VHVan Quoc Phuong Huynh
Van Quoc Phuong Huynh
JFJohannes Fürnkranz
Johannes Fürnkranz
FBFlorian Beck
Florian Beck
Conventional rule learning algorithms aim at finding a set of simple rules, where each rule covers as many examples as possible. In this paper, we argue that the rules found in this way may not be the optimal explanations for each of the examples they cover. Instead, we propose an efficient algorithm that aims at finding the best rule covering each training example in a greedy optimization consisting of one specialization and one generalization loop. These locally optimal rules are collected and then filtered for a final rule set, which is much larger than the sets learned by conventional rule learning algorithms. A new example is classified by selecting the best among the rules that cover this example. In our experiments on small to very large datasets, the approach’s average classification accuracy is higher than that of state-of-the-art rule learning algorithms. Moreover, the algorithm is highly efficient and can inherently be processed in parallel without affecting the learned rule set and so the classification accuracy. We thus believe that it closes an important gap for large-scale classification rule induction.

22 October 2021 in Frontiers in Artificial Intelligence
Verified
Journal Article
Open access
FBFlorian Beck
Florian Beck
JFJohannes Fürnkranz
Johannes Fürnkranz
Inductive rule learning is arguably among the most traditional paradigms in machine learning. Although we have seen considerable progress over the years in learning rule-based theories, all state-of-the-art learners still learn descriptions that directly relate the input features to the target concept. In the simplest case, concept learning, this is a disjunctive normal form (DNF) description of the positive class. While it is clear that this is sufficient from a logical point of view because every logical expression can be reduced to an equivalent DNF expression, it could nevertheless be the case that more structured representations, which form deep theories by forming intermediate concepts, could be easier to learn, in very much the same way as deep neural networks are able to outperform shallow networks, even though the latter are also universal function approximators. However, there are several non-trivial obstacles that need to be overcome before a sufficiently powerful deep rule learning algorithm could be developed and be compared to the state-of-the-art in inductive rule learning. In this paper, we therefore take a different approach: we empirically compare deep and shallow rule sets that have been optimized with a uniform general mini-batch based optimization algorithm. In our experiments on both artificial and real-world benchmark data, deep rule networks outperformed their shallow counterparts, which we take as an indication that it is worth-while to devote more efforts to learning deep rule structures from data.

1 August 2005 in Microscopy and Microanalysis
Verified
Journal Article
Open access
PDF file
ASA Sartori
A Sartori
RGR Gatz
R Gatz
FBF Beck
F Beck
AKA Kossel
A Kossel
ALA Leis
A Leis
JPJ M Plitzko
J M Plitzko
Extended abstract of a paper presented at Microscopy and Microanalysis 2005 in Honolulu, Hawaii, USA, July 31--August 4, 2005

15 October 2023
Verified
Book Chapter
Closed access
PDF file
FBFlorian Beck
Florian Beck
JFJohannes Fürnkranz
Johannes Fürnkranz
VHVan Quoc Phuong Huynh
Van Quoc Phuong Huynh

28 January 2025
Verified
Book Chapter
Closed access
PDF file
FBFlorian Beck
Florian Beck
JFJohannes Fürnkranz
Johannes Fürnkranz
VHVan Quoc Phuong Huynh
Van Quoc Phuong Huynh