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

Lazaros Karydas

dblp:45/7453 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
active learning
0.512021
Batch Active Learning at Scale · NeurIPS 2021
Machine learning › Efficient and distributed learning › active learning
batch active learning
0.512021
Batch Active Learning at Scale · NeurIPS 2021
Machine learning › Efficient and distributed learning › active learning
label complexity
0.512021
Batch Active Learning at Scale · NeurIPS 2021

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

uncertainty sampling · 0.5diversity sampling · 0.5
YearPublicationVenuePosition
2021 Batch Active Learning at Scale
abstract
The ability to train complex and highly effective models often requires an abundance of training data, which can easily become a bottleneck in cost, time, and computational resources. Batch active learning, which adaptively issues batched queries to a labeling oracle, is a common approach for addressing this problem. The practical benefits of batch sampling come with the downside of less adaptivity and the risk of sampling redundant examples within a batch -- a risk that grows with the batch size. In this work, we analyze an efficient active learning algorithm, which focuses on the large batch setting. In particular, we show that our sampling method, which combines notions of uncertainty and diversity, easily scales to batch sizes (100K-1M) several orders of magnitude larger than used in previous studies and provides significant improvements in model training efficiency compared to recent baselines. Finally, we provide an initial theoretical analysis, proving label complexity guarantees for a related sampling method, which we show is approximately equivalent to our sampling method in specific settings.
Gui Citovsky, Giulia DeSalvo, Claudio Gentile, Lazaros Karydas, Anand Rajagopalan, Afshin Rostamizadeh, Sanjiv Kumar
NeurIPS4
2014 Unsupervised Detection of Video Sub-scenes
abstract
The analysis of videos taken by active operators recording human interactions and activities in the field presents a new set of challenges. For brevity in this paper we will call such subject centric field grade videos ad hoc videos of events. Human test subjects readily segment ad hoc videos of events into scene-like segments. These segmentations can not be replicated by the state of the art automatic video segmentation algorithms. We propose and evaluate a method to segment ad hoc videos of events into atomic semantics units. Motivated by [Bel74] we call these units sub-scenes. Our experiments show that the segments detected by human subjects are sequences of sub-scenes. Thus the sub-scenes appear to be a semantic version of the video shots that are used to piece together scenes by state of the art video segmentation algorithms.
George I. Kamberov, Matt Burlick, Lazaros Karydas, Olga Koteoglou
ICPR3