Search Results for author: Andreea Anghel

Found 9 papers, 2 papers with code

Graph Feature Preprocessor: Real-time Extraction of Subgraph-based Features from Transaction Graphs

no code implementations13 Feb 2024 Jovan Blanuša, Maximo Cravero Baraja, Andreea Anghel, Luc von Niederhäusern, Erik Altman, Haris Pozidis, Kubilay Atasu

In this paper, we present "Graph Feature Preprocessor", a software library for detecting typical money laundering and fraud patterns in financial transaction graphs in real time.

Realistic Synthetic Financial Transactions for Anti-Money Laundering Models

1 code implementation NeurIPS 2023 Erik Altman, Jovan Blanuša, Luc von Niederhäusern, Béni Egressy, Andreea Anghel, Kubilay Atasu

To this end, this paper contributes a synthetic financial transaction dataset generator and a set of synthetically generated AML (Anti-Money Laundering) datasets.

Search-based Methods for Multi-Cloud Configuration

no code implementations20 Apr 2022 Małgorzata Łazuka, Thomas Parnell, Andreea Anghel, Haralampos Pozidis

Our experiments indicate that (a) many state-of-the-art cloud configuration solutions can be adapted to multi-cloud, with best results obtained for adaptations which utilize the hierarchical structure of the multi-cloud configuration domain, (b) hierarchical methods from AutoML can be used for the multi-cloud configuration task and can outperform state-of-the-art cloud configuration solutions and (c) CB achieves competitive or lower regret relative to other tested algorithms, whilst also identifying configurations that have 65% lower median cost and 20% lower median time in production, compared to choosing a random provider and configuration.

AutoML Cloud Computing

What can multi-cloud configuration learn from AutoML?

no code implementations29 Sep 2021 Malgorzata Lazuka, Thomas Parnell, Andreea Anghel, Haralampos Pozidis

Multi-cloud computing has become increasingly popular with enterprises looking to avoid vendor lock-in.

AutoML Cloud Computing

SnapBoost: A Heterogeneous Boosting Machine

2 code implementations NeurIPS 2020 Thomas Parnell, Andreea Anghel, Malgorzata Lazuka, Nikolas Ioannou, Sebastian Kurella, Peshal Agarwal, Nikolaos Papandreou, Haralampos Pozidis

At each boosting iteration, their goal is to find the base hypothesis, selected from some base hypothesis class, that is closest to the Newton descent direction in a Euclidean sense.

Breadth-first, Depth-next Training of Random Forests

no code implementations15 Oct 2019 Andreea Anghel, Nikolas Ioannou, Thomas Parnell, Nikolaos Papandreou, Celestine Mendler-Dünner, Haris Pozidis

In this paper we analyze, evaluate, and improve the performance of training Random Forest (RF) models on modern CPU architectures.

Sampling Acquisition Functions for Batch Bayesian Optimization

no code implementations22 Mar 2019 Alessandro De Palma, Celestine Mendler-Dünner, Thomas Parnell, Andreea Anghel, Haralampos Pozidis

We present Acquisition Thompson Sampling (ATS), a novel technique for batch Bayesian Optimization (BO) based on the idea of sampling multiple acquisition functions from a stochastic process.

Bayesian Optimization Thompson Sampling

Benchmarking and Optimization of Gradient Boosting Decision Tree Algorithms

no code implementations12 Sep 2018 Andreea Anghel, Nikolaos Papandreou, Thomas Parnell, Alessandro De Palma, Haralampos Pozidis

Gradient boosting decision trees (GBDTs) have seen widespread adoption in academia, industry and competitive data science due to their state-of-the-art performance in many machine learning tasks.

Bayesian Optimization Benchmarking

Cannot find the paper you are looking for? You can Submit a new open access paper.