Filip Koprivec

Mr. Filip Koprivec

Faculty of Mathematics and Physics, University of ljubljana
+1
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
15 October 2021 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
GKGeorgios Karachalias
Georgios Karachalias
FKFilip Koprivec
Filip Koprivec
MPMatija Pretnar
Matija Pretnar
TSTom Schrijvers
Tom Schrijvers
The popularity of algebraic effect handlers as a programming language feature for user-defined computational effects is steadily growing. Yet, even though efficient runtime representations have already been studied, most handler-based programs are still much slower than hand-written code. This paper shows that the performance gap can be drastically narrowed (in some cases even closed) by means of type-and-effect directed optimising compilation. Our approach consists of source-to-source transformations in two phases of the compilation pipeline. Firstly, elementary rewrites, aided by judicious function specialisation, exploit the explicit type and effect information of the compiler’s core language to aggressively reduce handler applications. Secondly, after erasing the effect information further rewrites in the backend of the compiler emit tight code. This work comes with a practical implementation: an optimising compiler from Eff, an ML style language with algebraic effect handlers, to OCaml. Experimental evaluation with this implementation demonstrates that in a number of benchmarks, our approach eliminates much of the overhead of handlers, outperforms capability-passing style compilation and yields competitive performance compared to hand-written OCaml code as well Multicore OCaml’s dedicated runtime support.

3 August 2018 in Proceedings
Verified
Conference Paper
Open access
PDF file
Klemen KendaKlemen Kenda
Klemen Kenda
FKFilip Koprivec
Filip Koprivec
DMDunja_Mladenic Mladenic
Dunja_Mladenic Mladenic
In this study an algorithm for missing data imputation is presented. The algorithm uses measurements from neighboring sensors to estimate the missing values. Data-driven approach is used and methodology chooses the optimal available combination of modeling algorithm and available measurements to produce an estimate from the model with lowest error. The methodology was tested on Ljubljana polje aquifer data and has produced close to perfect results.

24 December 2021
Verified
Book Chapter
Open access
PDF file
FKFilip Koprivec
Filip Koprivec
GKGregor Kržmanc
Gregor Kržmanc
MŠMaja Škrjanc
Maja Škrjanc
Klemen KendaKlemen Kenda
Klemen Kenda
ENErik Novak
Erik Novak
Efficient screening of transactions provides an empowering tool for anti-money laundering procedures and actions. Automatic classification and detection of anomalous behaviours and transaction structures enable faster and more effective action on the side of the supervisory authority. This chapter introduces research achievements and tools developed to streamline transaction monitoring and ease domain experts with automatic and semi-automatic filtering of risky transaction typologies. Presented tools are integrated as part of PAMLS (Platform for Anti-Money Laundering Supervision) to streamline and automate the discovery of risky behaviours in bank transaction data enriched with relevant company information. Enriched transactional data is pseudo-anonymized with respect to the legal and regulatory framework. Screening tool as a part of PAMLS platform automatically detects and marks specific predefined scenarios using newly developed state-of-the-art AI method tailored specifically to time-evolving transaction graphs in transaction data. Easy-to-use tools, early warning system and subsequent parameterized queries with additional white-listed scenarios provide domain experts with additional data to easily explore suggested dangerous transaction groups and make more informed decisions and further action, be it at a level of a specific financial institution or a cluster of them.

23 October 2020 in Entropy
Verified
Journal Article
Open access
PDF file
FKFilip Koprivec
Filip Koprivec
Klemen KendaKlemen Kenda
Klemen Kenda
BŠBeno Šircelj
Beno Šircelj
In this paper, a novel feature selection algorithm for inference from high-dimensional data (FASTENER) is presented. With its multi-objective approach, the algorithm tries to maximize the accuracy of a machine learning algorithm with as few features as possible. The algorithm exploits entropy-based measures, such as mutual information in the crossover phase of the iterative genetic approach. FASTENER converges to a (near) optimal subset of features faster than other multi-objective wrapper methods, such as POSS, DT-forward and FS-SDS, and achieves better classification accuracy than similarity and information theory-based methods currently utilized in earth observation scenarios. The approach was primarily evaluated using the earth observation data set for land-cover classification from ESA’s Sentinel-2 mission, the digital elevation model and the ground truth data of the Land Parcel Identification System from Slovenia. For land cover classification, the algorithm gives state-of-the-art results. Additionally, FASTENER was tested on open feature selection data sets and compared to the state-of-the-art methods. With fewer model evaluations, the algorithm yields comparable results to DT-forward and is superior to FS-SDS. FASTENER can be used in any supervised machine learning scenario.