Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Luka Kolar

dblp:273/6980 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-9617-0271ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Machine learning and data management · 64% Data integration and cleaning · 19% Query processing and optimization · 16%
Artificial intelligence
1 paper
Learning theory · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › classification › classification error analysis
bayes error estimation
0.712023
Automatic Feasibility Study via Data Quality Analysis for ML: A Case-Study on Label Noise · ICDE 2023
Machine learning and data management › data management for machine learning
data quality for machine learning
0.712023
Automatic Feasibility Study via Data Quality Analysis for ML: A Case-Study on Label Noise · ICDE 2023
Data integration and cleaning › data quality
label noise
0.712023
Automatic Feasibility Study via Data Quality Analysis for ML: A Case-Study on Label Noise · ICDE 2023
Machine learning and data management › automated machine learning
model search
0.612022
SHiFT: An Efficient, Flexible Search Engine for Transfer Learning · Proc. VLDB Endow. 2022
Query processing and optimization
query optimization
0.612022
SHiFT: An Efficient, Flexible Search Engine for Transfer Learning · Proc. VLDB Endow. 2022
Machine learning and data management
transfer learning
0.612022
SHiFT: An Efficient, Flexible Search Engine for Transfer Learning · Proc. VLDB Endow. 2022

Methods — techniques the papers use, named apart from their topics

bayes error estimation · 1.3query language · 0.6pre-trained feature transformation · 0.4nearest neighbor classifier · 0.4
YearPublicationVenuePosition
2023 Automatic Feasibility Study via Data Quality Analysis for ML: A Case-Study on Label Noise
abstract
In our experience of working with domain experts who are using today’s AutoML systems, a common problem we encountered is what we call "unrealistic expectations" – when users are facing a very challenging task with a noisy data acquisition process, while being expected to achieve startlingly high accuracy with machine learning (ML). Many of these are predestined to fail from the beginning. In traditional software engineering, this problem is addressed via a feasibility study, an indispensable step before developing any software system. In this paper, we present Snoopy, with the goal of supporting data scientists and machine learning engineers performing a systematic and theoretically founded feasibility study before building ML applications. We approach this problem by estimating the irreducible error of the underlying task, also known as the Bayes error rate (BER), which stems from data quality issues in datasets used to train or evaluate ML models. We design a practical Bayes error estimator that is compared against baseline feasibility study candidates on 6 datasets (with additional real and synthetic noise of different levels) in computer vision and natural language processing. Furthermore, by including our systematic feasibility study with additional signals into the iterative label cleaning process, we demonstrate in end-to-end experiments how users are able to save substantial labeling time and monetary efforts.
Cédric Renggli, Luka Rimanic, Luka Kolar, Wentao Wu 0001, Ce Zhang 0001
ICDE3
2022 SHiFT: An Efficient, Flexible Search Engine for Transfer Learning
abstract
Transfer learning can be seen as a data- and compute-efficient alternative to training models from scratch. The emergence of rich model repositories, such as TensorFlow Hub, enables practitioners and researchers to unleash the potential of these models across a wide range of downstream tasks. As these repositories keep growing exponentially, efficiently selecting a good model for the task at hand becomes paramount. However, a single generic search strategy (e.g., taking the model with the highest linear classifier accuracy) does not lead to optimal model selection for diverse downstream tasks. In fact, using hybrid or mixed strategies can often be beneficial. Therefore, we propose SHiFT, the first downstream task-aware, flexible, and efficient model search engine for transfer learning. Users interface with SHiFT using the SHiFT-QL query language, which gives users the flexibility to customize their search criteria. We optimize SHiFT-QL queries using a cost-based decision maker and evaluate them on a wide rang of tasks. Motivated by the iterative nature of machine learning development, we further support efficient incremental executions of our queries, which requires a special implementation when jointly used with our optimizations.
Cédric Renggli, Xiaozhe Yao, Luka Kolar, Luka Rimanic, Ana Klimovic, Ce Zhang 0001
Proc. VLDB Endow.3
2020 Ease.ml/snoopy in Action: Towards Automatic Feasibility Analysis for Machine Learning Application Development
abstract
We demonstrate ease.ml/snoopy, a data analytics system that performs feasibility analysis for machine learning (ML) applications before they are developed. Given a performance target of an ML application (e.g., accuracy above 0.95), ease.ml/snoopy provides a decisive answer to ML developers regarding whether the target is achievable or not. We formulate the feasibility analysis problem as an instance of Bayes error estimation. That is, for a data (distribution) on which the ML application should be performed, ease.ml/snoopy provides an estimate of the Bayes error - the minimum error rate that can be achieved by any classifier. It is well-known that estimating the Bayes error is a notoriously hard task. In ease.ml/snoopy we explore and employ estimators based on the combination of (1) nearest neighbor (NN) classifiers and (2) pre-trained feature transformations. To the best of our knowledge, this is the first work on Bayes error estimation that combines (1) and (2). In today's cost-driven business world, feasibility of an ML project is an ideal piece of information for ML application developers - ease.ml/snoopy plays the role of a reliable " consultant. "
Cédric Renggli, Luka Rimanic, Luka Kolar, Wentao Wu 0001, Ce Zhang 0001
Proc. VLDB Endow.3