LSLuis Salamanca

Luis Salamanca

*This is an algorithmically generated author record based on publicly available information.

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


Luis Salamanca has a total of 57 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    AIXD: AI-eXtended Design Toolbox for data-driven and inverse design

    by Alessandro Maissen, Aleksandra Anna Apolinarska, Sophia V. Kuhn, Luis Salamanca, Michael A. Kraus, Konstantinos Tatsis, Gonzalo Casas, Rafael Bischof, Romana Rust, Walter Kaufmann, et al.


  • Open Access

    Graph Neural Network-Based Predictive Modeling for Robotic Plaster Printing

    by Diego Machain Rivera, Selen Ercan Jenny, Ping Hsun Tsai, Ena Lloret-Fritschi, Luis Salamanca, Fernando Perez-Cruz, Konstantinos E. Tatsis

    This work proposes a Graph Neural Network (GNN) modeling approach to predict the resulting surface from a particle based fabrication process. The latter consists of spray-based printing of cementitious plaster on a wall and is facilitated with the use of a robotic arm. The predictions are computed using the robotic arm trajectory features, such as position, velocity and direction, as well as the printing process parameters. The proposed approach, based on a particle representation of the wall domain and the end effector, allows for the adoption of a graph-based solution. The GNN model consists of an encoder-processor-decoder architecture and is trained using data from laboratory tests, while the hyperparameters are optimized by means of a Bayesian scheme. The aim of this model is to act as a simulator of the printing process, and ultimately used for the generation of the robotic arm trajectory and the optimization of the printing parameters, towards the materialization of an autonomous plastering process. The performance of the proposed model is assessed in terms of the prediction error against unseen ground truth data, which shows its generality in varied scenarios, as well as in comparison with the performance of an existing benchmark model. The results demonstrate a significant improvement over the benchmark model, with notably better performance and enhanced error scaling across prediction steps.

  • ARA - Grasshopper Plugin for AI-Augmented Inverse Design

    by Aleksandra Anna Apolinarska, Gonzalo Casas, Luis Salamanca, Matthias Kohler

  • Open Access

    Introducing embed2discover: A tool for semi-automated, dictionary-based content-analysis

    by Laurence Brandenberger, Oleg Bakhteev, Jorge M. Fernandes, Sophia Schlosser, Luis Salamanca

    We introduce embed2discover, a new tool for dictionary-based content analysis. The tool combines state-of-the-art machine learning and language model methodologies with manual inputs from coders to ensure high efficiency, replication, and user control over the annotation process. The tool comes with a four-part training setup and a user-friendly interface.Step 1 expands the dictionary using word embeddings.Step 2 clusters sentences, allowing the user to perform a first coarse classification to speed up the learning process of the classification model.Step 3 uses active learning to refine the classification, and step 4 applies the model to classify the full corpus.We detail the inner workings of \texttt{embed2discover}, provide a user-friendly introduction, and showcase the tool on text data from the Swiss parliament.

  • Open Access

    Design Space Exploration and Explanation via Conditional Variational Autoencoders in Meta-Model-Based Conceptual Design of Pedestrian Bridges

    by Vera Balmer, Sophia V. Kuhn, Rafael Bischof, Luis Salamanca, Walter Kaufmann, Fernando Perez-Cruz, Michael A. Kraus


  • Open Access

    Processing Large‐Scale Archival Records: The Case of the Swiss Parliamentary Records

    by Luis Salamanca, Laurence Brandenberger, Lilian Gasser, Sophia Schlosser, Marta Balode, Vincent Jung, Fernando Perez‐Cruz, Frank Schweitzer

    Legislative bodies generally keep records of their activities. While the digitization wave spurred the availability of archival documents, their processing remains a challenge. The Swiss parliamentary records are no exception.In this paper we present a supervised pipeline for extracting and structuring of content of archival records. Our pipeline consists of five steps, starting with an assessment of which elements need extraction and how they relate to each other. Step two involves general pre‐processing to prepare the PDF documents and is followed by an element classification step. Step four involves post‐processing and the final step is a validation of the extracted information. With our supervised approach, we are able to process over 200,000 pages of Swiss parliamentary records (spanning the years 1891–1995), a feat that would exceed the budget of most projects using manual curation. We discuss validation of individual steps and offer guidance to researchers engaged in similar data processing efforts.


  • Open Access

    Bridging the Gap: Addressing Discrepancies in Diffusion Model Training for Classifier-Free Guidance

    by Niket Patel, Luis Salamanca, Luis Barba

    Diffusion models have emerged as a pivotal advancement in generative models, setting new standards to the quality of the generated instances. In the current paper we aim to underscore a discrepancy between conventional training methods and the desired conditional sampling behavior of these models. While the prevalent classifier-free guidance technique works well, it's not without flaws. At higher values for the guidance scale parameter $w$, we often get out of distribution samples and mode collapse, whereas at lower values for $w$ we may not get the desired specificity. To address these challenges, we introduce an updated loss function that better aligns training objectives with sampling behaviors. Experimental validation with FID scores on CIFAR-10 elucidates our method's ability to produce higher quality samples with fewer sampling timesteps, and be more robust to the choice of guidance scale $w$. We also experiment with fine-tuning Stable Diffusion on the proposed loss, to provide early evidence that large diffusion models may also benefit from this refined loss function.

  • Open Access

    KG-FRUS: a Novel Graph-based Dataset of 127 Years of US Diplomatic Relations

    by Gökberk Özsoy, Luis Salamanca, Matthew Connelly, Raymond Hicks, Fernando Pérez-Cruz

    In the current paper, we present the KG-FRUS dataset, comprised of more than 300,000 US government diplomatic documents encoded in a Knowledge Graph (KG). We leverage the data of the Foreign Relations of the United States (FRUS) (available as XML files) to extract information about the documents and the individuals and countries mentioned within them. We use the extracted entities, and associated metadata, to create a graph-based dataset. Further, we supplement the created KG with additional entities and relations from Wikidata. The relations in the KG capture the synergies and dynamics required to study and understand the complex fields of diplomacy, foreign relations, and politics. This goes well beyond a simple collection of documents which neglects the relations between entities in the text. We showcase a range of possibilities of the current dataset by illustrating different approaches to probe the KG. In the paper, we exemplify how to use a query language to answer simple research questions and how to use graph algorithms such as Node2Vec and PageRank, that benefit from the complete graph structure. More importantly, the chosen structure provides total flexibility for continuously expanding and enriching the graph. Our solution is general, so the proposed pipeline for building the KG can encode other original corpora of time-dependent and complex phenomena. Overall, we present a mechanism to create KG databases providing a more versatile representation of time-dependent related text data and a particular application to the all-important FRUS database.