Andreea Nica

Ms. Andreea Nica

École Polytechnique Fédérale de Lausanne, Lausanne, Vaud, Switzerland

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
31 August 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
OGOctavian Grigorescu
Octavian Grigorescu
ANAndreea Nica
Andreea Nica
MDMihai Dascalu
Mihai Dascalu
RRRazvan Rughinis
Razvan Rughinis
Since cyber-attacks are ever-increasing in number, intensity, and variety, a strong need for a global, standardized cyber-security knowledge database has emerged as a means to prevent and fight cybercrime. Attempts already exist in this regard. The Common Vulnerabilities and Exposures (CVE) list documents numerous reported software and hardware vulnerabilities, thus building a community-based dictionary of existing threats. The MITRE ATT&CK Framework describes adversary behavior and offers mitigation strategies for each reported attack pattern. While extremely powerful on their own, the tremendous extra benefit gained when linking these tools cannot be overlooked. This paper introduces a dataset of 1813 CVEs annotated with all corresponding MITRE ATT&CK techniques and proposes models to automatically link a CVE to one or more techniques based on the text description from the CVE metadata. We establish a strong baseline that considers classical machine learning models and state-of-the-art pre-trained BERT-based language models while counteracting the highly imbalanced training set with data augmentation strategies based on the TextAttack framework. We obtain promising results, as the best model achieved an F1-score of 47.84%. In addition, we perform a qualitative analysis that uses Lime explanations to point out limitations and potential inconsistencies in CVE descriptions. Our model plays a critical role in finding kill chain scenarios inside complex infrastructures and enables the prioritization of CVE patching by the threat level. We publicly release our code together with the dataset of annotated CVEs.

22 September 2024
Verified
Book Chapter
Closed access
PDF file
HNHamish Nicholson
Hamish Nicholson
ANAndreea Nica
Andreea Nica
ARAunn Raza
Aunn Raza
VSViktor Sanca
Viktor Sanca
AAAnastasia Ailamaki
Anastasia Ailamaki

24 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
ANAndreea Nica
Andreea Nica
IZIvan Zakazov
Ivan Zakazov
NBNicolas Mario Baldwin
Nicolas Mario Baldwin
SGSaibo Geng
Saibo Geng
RWRobert West
Robert West
Prompt optimization improves the reasoning abilities of large language models (LLMs) without requiring parameter updates to the target model. Following heuristic-based "Think step by step" approaches, the field has evolved in two main directions: while one group of methods uses textual feedback to elicit improved prompts from general-purpose LLMs in a training-free way, a concurrent line of research relies on numerical rewards to train a special prompt model, tailored for providing optimal prompts to the target model. In this paper, we introduce the Textual Reward Prompt framework (TRPrompt), which unifies these approaches by directly incorporating textual feedback into training of the prompt model. Our framework does not require prior dataset collection and is being iteratively improved with the feedback on the generated prompts. When coupled with the capacity of an LLM to internalize the notion of what a "good" prompt is, the high-resolution signal provided by the textual rewards allows us to train a prompt model yielding state-of-the-art query-specific prompts for the problems from the challenging math datasets GSMHard and MATH.