Structured learning is appropriate when predicting structured outputs such as trees, graphs, or sequences. Most prior work requires the training set to consist of complete trees, graphs or sequences. Specifying such detailed ground truth can be tedious or infeasible for large outputs. Our main contribution is a large m…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,291 papers · 148 categories
Trend · papers per month
48 results for “Annotation Speedup”
A new method uses CML to speed up social signal annotation.
problem Manual annotation of social signals in large multi-modal corpora is time-consuming and exhausting.
method CML techniques to predict local parts first, followed by a session-independent classification model.
result The method has the potential to significantly reduce human labelling efforts.
Coarse ground truth improves semantic segmentation accuracy for some classes.
problem Efficiently preparing high-quality datasets for autonomous driving.
method Comparative analysis of fine and coarse ground truth annotations on Cityscapes dataset using PSPNet.
result Coarse ground truth annotations can improve semantic segmentation accuracy for some classes without significant loss.
PCA reduces language model embeddings to improve speed and memory efficiency.
problem High-dimensional embeddings in RAG models cause scalability issues.
method Used Principal Component Analysis (PCA) to compress embeddings.
result Reducing from 3,072 to 110 dimensions provides significant speedup and memory reduction.
Study shows annotation instrument design affects model performance in hate speech detection.
problem Impact of annotation instrument design on model performance in hate speech detection.
method Collected annotations from five experimental conditions of an annotation instrument, fine-tuned BERT models on each dataset, evaluated performance on holdout portion.
result Significant differences in model performance and annotations across conditions.
Clearing algorithm improves CT image segmentation accuracy by merging confident annotations.
problem Inaccurate predictions due to noisy annotations from different annotators.
method 3-stage algorithm: scoring annotators, scoring nodules, merging annotations.
result Improves prediction accuracy in CT image segmentation tasks.
New method to estimate doctors' effort in annotating medical images.
problem High effort and expense in annotating medical images.
method Proposes a new criterion to evaluate effort, uses active learning and U-shape network for annotation strategy, and fine annotation platform to reduce effort.
result State-of-the-art segmentation performance achieved with only 60% annotation candidates, reducing effort by 44-47%.
Active learning selects both observations and annotation precision for Gaussian Processes.
problem Costly annotation in supervised learning.
method Proposes an active learning algorithm that selects observations and annotation precision, using a modified BALD objective.
result Empirically shows the benefits of adjusting annotation precision in active learning.
Generative model combines multi-dimensional annotations for more accurate ground truth estimation.
problem Inaccurate ground truth estimation from naive annotators' multi-dimensional annotations.
method Proposes a joint multi-dimensional model for global and time-series annotation fusion using Expectation-Maximization algorithm.
result More accurate ground truth estimates through joint modeling of multiple dimensions.
Survey on AL strategies for cost-effective annotation in classification.
problem Real-world AL challenges due to human annotators' limitations.
method Categorizes 60 real-world AL strategies considering multiple annotators, query types, and cost schemes.
result General real-world AL strategy introduced for categorization of 60 strategies.
Robustness to Subpopulation Shift with Domain Label Noise via Regularized Annotation of Domainscs.LG
RAD improves robustness to domain annotation noise without explicit domain annotations.
problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.
The study challenges the notion that partial data annotation is inferior, suggesting it can sometimes outperform complete annotation.
problem The inefficiency and high cost of completely annotating structured data.
method Information theoretic formulation applied to three diverse structured learning tasks.
result Learning from partial structures can sometimes outperform learning from complete ones.
A new method uses triplet embeddings to improve human annotation for hidden constructs.
problem Improving human annotation for hidden constructs in machine learning.
method Proposes a novel annotation approach using triplet embeddings to lift absolute annotations to relative comparisons.
result Successfully represents synthetic hidden constructs in time under noisy sampling conditions.
PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.
problem Inaccurate and insufficient confusion matrices for annotators in multi-class classification tasks.
method PTBCC (ProtoType learning-driven Bayesian Classifier Combination) uses prototype confusion matrices to capture annotator expertise.
result PTBCC achieves up to 15% accuracy improvement and 3% higher average accuracy compared to existing methods.
ActiveLab improves classifier accuracy with fewer annotations by re-labeling.
problem Imperfect labels from multiple annotators in real-world data.
method ActiveLab automatically decides when to re-label examples for better classifier training.
result ActiveLab trains more accurate classifiers with fewer annotations.
Bayesian methods improve text annotation quality.
problem Inconsistent and unreliable human annotations in natural language processing.
method Two semi-supervised Bayesian methods: a deep learning model and an ensemble method.
result Bayesian methods enhance the reliability and performance of BERT models.
ProxSkip achieves linear speedup in distributed non-convex optimization.
problem Achieving linear speedup in distributed non-convex optimization.
method Unified convergence analysis for stochastic non-convex, convex, and strongly convex problems.
result ProxSkip achieves linear speedup in the number of nodes under stochastic gradients.
The Impact of Annotation Guidelines and Annotated Data on Extracting App Features from App Reviewscs.IR
Study improves app feature extraction models with new annotation guidelines and data.
problem Improving the quality and usefulness of app feature extraction models.
method Exploring the effects of annotation guidelines and annotated data on app feature extraction models.
result New annotation guidelines lead to less noisy and more informative app features.
Paper proposes an efficient method for bounding box annotation in object detection.
problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.
Paper proposes a weak supervision technique for CNN semantic segmentation of lung diseases using partially annotated data.
problem Creating annotated datasets for semantic segmentation of lung diseases is laborious and time-consuming.
method Proposes a weak supervision technique that utilizes partially annotated datasets to improve CNN semantic segmentation accuracy.
result Significantly improved segmentation accuracy using partially annotated datasets.
Paper proposes a method for faster object detection annotation in indoor scenes.
problem Efficiently annotate object detection datasets in indoor scenes.
method Two-stage annotation process: manual annotation of a part of the dataset, followed by automatic annotation of the rest.
result The two-stage method significantly reduces the total workload compared to manual annotation of the entire dataset.
Reduces annotation costs in medical imaging by 50%.
problem Challenges in creating large annotated datasets for medical imaging.
method Integrates active learning and transfer learning into a single framework.
result Reduces annotation efforts by at least half.
A new method for faster data annotation using click-supervision and hierarchical object detection.
problem Data annotation bottleneck in modern data collection.
method Semi-automatic approach combining human and neural network for hierarchical object detection.
result Improved annotation speed and accuracy compared to current methods.
Improves off-policy evaluation with imperfect annotations.
problem Limited dataset coverage for evaluating new policies.
method Doubly robust estimators combining IS and DM, incorporating counterfactual annotations.
result Using annotations within the DM component yields the most desirable theoretical results.
A popular approach for large scale data annotation tasks is crowdsourcing, wherein each data point is labeled by multiple noisy annotators. We consider the problem of inferring ground truth from noisy ordinal labels obtained from multiple annotators of varying and unknown expertise levels. Annotation models for ordinal…
Linear speedup achieved in non-convex optimization for decentralized systems.
problem Achieving optimal performance in decentralized non-convex optimization.
method Examined the dependence of convergence guarantees on spectral properties of combination policies.
result Linear speedup in saddle-point escape time for symmetric combination policies.
Crowdlab uses classifiers to estimate consensus labels and annotator quality.
problem Leveraging multiple annotators for data classification.
method Weighted ensemble approach using any trained classifier.
result Superior estimates for consensus labels and annotator quality.
This study uses partially annotated data to improve TempRel extraction.
problem Lack of fully annotated data for TempRel extraction makes the task labor-intensive and limited in coverage.
method Utilizes partially annotated data (P) for TempRel extraction, even when annotations are missing.
result Partially annotated data (P) can still be a useful supervision signal for TempRel extraction within a constrained learning framework.
Method learns true labels from noisy annotators using regularization.
problem Learning from noisy labels in supervised learning.
method Regularized estimation of annotator confusion matrices.
result Method outperforms state-of-the-art methods in image classification.
Cluster annotation reduces active learning human interactions.
problem Reducing human interactions in active learning.
method Cluster annotation to label multiple samples at once.
result 82% and 87% less human interactions for CIFAR-10 and EuroSAT datasets.
Paper speeds up structured output prediction without sacrificing accuracy.
problem Computational inefficiency in predicting structured outputs.
method Learning to search approach to train a speedup classifier.
result Speedup classifier outperforms greedy search in terms of speed.
Study uses active learning to automate EEG event annotation.
problem Lack of annotated clinical EEG data for machine learning models.
method Active learning algorithm for automated annotation of six types of EEG events.
result Recognition performance improved 2% absolute, capable of auto-annotating.
Quantum computing promises faster finance algorithms.
problem Solving finance problems faster than classical methods.
method Quantum computing applications to finance, including Monte Carlo, portfolio optimization, and machine learning.
result Quantum speedups for finance problems, especially Monte Carlo and portfolio optimization.
The paper proposes incentivizing human annotators with 'golden questions' to improve data quality.
problem Ensuring high-quality human annotations for training large language models.
method A principal-agent model is used to incentivize annotators with bonuses based on the maximum likelihood estimators (MLE) of their annotations. Hypothesis testing is applied to monitor the annotators' performance.
result The hypothesis testing rate for the principal-agent model is of , highlighting the importance of 'golden questions' for monitoring annotators.
The paper proposes EM algorithms for inferring object rankings from noisy judgments.
problem Inferring ground truth rankings from noisy pairwise comparisons.
method Expectation-Maximization (EM) algorithms that learn object attributes and annotator probabilities.
result The algorithms improve accuracy by considering object attributes and annotator quality.
Paper proposes active learning for sound event detection with reduced annotation effort.
problem Reducing annotation effort for sound event detection.
method Change point detection for candidate selection, mismatch-first farthest-traversal for selection, training with context recordings.
result The proposed system achieves similar performance to full annotation with only 2% of data, reducing annotation effort.
Paper proposes a method to reduce annotation time for 3D object detection.
problem Effort and time required for generating 3D object annotations.
method Combines human supervision with pretrained neural networks for 3D point cloud segmentation and bounding box generation.
result Reduces human annotation time by 30x.
A fast method for Lasso and Logistic Lasso problems.
problem Solving Lasso and Logistic Lasso regression problems efficiently.
method Iterative active set approach using solver updates.
result 31.41 times faster on average for compressed sensing.
Interactive IL beats BC by state-wise annotation cost.
problem Behavior Cloning struggles with annotation cost in sequential decision making.
method Proved Stagger and Warm Stagger algorithms to outperform BC.
result Interactive and hybrid IL methods outperform BC with state-wise annotation.
End-to-end framework learns from imperfect annotations directly.
problem Training machine learning models on imperfect human annotations.
method End-to-end framework merging aggregation with model training and modeling annotator competencies.
result Accuracy gains of up to 25% over state-of-the-art annotation aggregation methods.
Leveraging Crowdsourcing Data For Deep Active Learning - An Application: Learning Intents in Alexacs.LG
Unified framework for deep learning with crowdsourced data.
problem Learning true labels from noisy, sparse, and uncontrolled crowdsourced annotations.
method Bayesian deep learning framework that learns annotator expertise and optimizes model training.
result Framework reduces annotation and training time for deep learning models.
Learning algorithms normally assume that there is at most one annotation or label per data point. However, in some scenarios, such as medical diagnosis and on-line collaboration,multiple annotations may be available. In either case, obtaining labels for data points can be expensive and time-consuming (in some circumsta…
Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updatescs.LG
New insights explain speedup saturation in distributed learning with large batches and delays.
problem Understanding and optimizing speedup in distributed learning with large batches and delays.
method Theoretical analysis of strongly convex, convex, and non-convex settings, considering data sparsity.
result Identification of a data-dependent parameter explaining speedup saturation in both batch size and gradient staleness.
Proposes ALRL for single shot active learning with pseudo annotators.
problem Real-world applications where human experts are not always available.
method Substitutes human annotators with pseudo annotators providing random labels.
result ALRL outperforms state-of-the-art approaches in real-world datasets.
Quantum computing offers a quadratic speedup for estimating non-linear functionals.
problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.
Bayesian model improves truth inference from highly redundant crowd annotations.
problem Inferring true annotations from highly redundant crowd annotations.
method Bayesian graphical model with conjugate priors and iterative expectation-maximisation inference.
result Our technique significantly outperforms majority vote heuristic at one-sided level 0.025.
Meta-learning method for accurate classifier from noisy annotators' data.
problem Accurate learning from noisy labels provided by multiple annotators.
method Meta-learning neural network to embed examples in latent space and estimate annotators' abilities, then adapt classifiers using EM algorithm.
result Meta-learning method improves classifier performance with minimal labeled data.
New method uses image-level and pixel-level annotations for brain tumor segmentation.
problem Challenges in obtaining pixel-level annotations for brain tumor segmentation.
method Proposes a learning-based framework that combines both pixel- and image-level annotations.
result Method's performance in segmentation quality is competitive with traditional fully-supervised approach.