Research
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.

168,695 papers · 148 categories

Trend · papers per month

121241362482 · Jun 202019922001200920172026
48 results for bounding box annotation

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%.

This paper proposes an approach for rapid bounding box annotation for object detection datasets. The procedure consists of two stages: The first step is to annotate a part of the dataset manually, and the second step proposes annotations for the remaining samples using a model trained with the first stage annotations. …

2018-07-03abs ↗pdf ↗

New methods detect objects in industrial settings with little training data.

problem Lack of training data limits object detection in industrial settings.
method Adapted Faster R-CNN and Scaled Yolov4-p5 architectures for small training data.
result Both models can distinguish unknown objects from homogeneous backgrounds.

This paper explores object detection in the small data regime, where only a limited number of annotated bounding boxes are available due to data rarity and annotation expense. This is a common challenge today with machine learning being applied to many new tasks where obtaining training data is more challenging, e.g. i…

2019-10-16abs ↗pdf ↗

Domain shift is unavoidable in real-world applications of object detection. For example, in self-driving cars, the target domain consists of unconstrained road environments which cannot all possibly be observed in training data. Similarly, in surveillance applications sufficiently representative training data may be la…

2019-04-04abs ↗pdf ↗

Traditional recognition methods typically require large, artificially-balanced training classes, while few-shot learning methods are tested on artificially small ones. In contrast to both extremes, real world recognition problems exhibit heavy-tailed class distributions, with cluttered scenes and a mix of coarse and fi…

2019-04-09abs ↗pdf ↗

Proposes class-agnostic object detection to handle all objects without class labels.

problem Difficulty and cost in creating annotated datasets limit conventional object detection models to specific object types.
method Proposes class-agnostic object detection as a new problem and proposes training and evaluation protocols. Uses adversarial learning to exclude class-specific information.
result Adversarial learning improves class-agnostic detection efficacy.

This paper studies the problems of vehicle make & model classification. Some of the main challenges are reaching high classification accuracy and reducing the annotation time of the images. To address these problems, we have created a fine-grained database using online vehicle marketplaces of Turkey. A pipeline is prop…

2018-08-23abs ↗pdf ↗

Robust detection and tracking of objects is crucial for the deployment of autonomous vehicle technology. Image based benchmark datasets have driven development in computer vision tasks such as object detection, tracking and segmentation of agents in the environment. Most autonomous vehicles, however, carry a combinatio…

2019-03-26abs ↗pdf ↗

The task of Natural Language Inference (NLI) is widely modeled as supervised sentence pair classification. While there has been a lot of work recently on generating explanations of the predictions of classifiers on a single piece of text, there have been no attempts to generate explanations of classifiers operating on …

2019-04-24abs ↗pdf ↗

Bayesian framework evaluates predictors of subjective visual tasks.

problem Evaluating uncertainty in machine learning predictors for tasks with subjective annotations.
method Bayesian framework to estimate epistemic uncertainty from human labels.
result Framework successfully applied to four image classification tasks.

Two-step conformal prediction method for adaptive bounding box uncertainties in multi-object detection.

problem Quantifying predictive uncertainty for multi-object detection in safety-critical applications.
method Developed a two-step conformal prediction approach to propagate uncertainty in predicted class labels into bounding box uncertainties, ensuring coverage for incorrectly classified objects.
result Desired coverage levels are satisfied with practically tight predictive uncertainty intervals on real-world datasets.

Paper introduces robust learning from feature feedback, even with annotator errors.

problem Learning from human feedback on discriminative features, especially when annotators make mistakes.
method Develops a robust framework for learning with imperfect feedback, deriving regret bounds in adversarial and stochastic settings.
result Regret bounds independent of feature number, showing robust learning is not reducible to non-robust settings.

FactTest assesses LLM factuality with Type I error control.

problem Lack of rigorous factuality verification for LLMs.
method Formulates factuality testing as hypothesis testing, ensuring Type I and II error control.
result Improves model accuracy by over 40% in abstaining from unknown questions.

Novel MOBO method for risk measures under input uncertainty.

problem Efficiently identifying Pareto front for black-box functions with input uncertainty.
method Assumes Gaussian process model and constructs bounding boxes for risk measures.
result The method can return an arbitrary-accurate solution with high probability.

Semantic boundary and edge detection aims at simultaneously detecting object edge pixels in images and assigning class labels to them. Systematic training of predictors for this task requires the labeling of edges in images which is a particularly tedious task. We propose a novel strategy for solving this task, when pi…

2016-06-29abs ↗pdf ↗

Federated learning is a new machine learning paradigm which allows data parties to build machine learning models collaboratively while keeping their data secure and private. While research efforts on federated learning have been growing tremendously in the past two years, most existing works still depend on pre-existin…

2019-10-14abs ↗pdf ↗

Pointwise localization allows more precise localization and accurate interpretability, compared to bounding box, in applications where objects are highly unstructured such as in medical domain. In this work, we focus on weakly supervised localization (WSL) where a model is trained to classify an image and localize regi…

2019-07-25abs ↗pdf ↗

We show that the asymptotic dimension of box spaces behaves (sub)additively with respect to extensions of groups. As a result, we obtain that for an elementary amenable group, the asymptotic dimension of any of its box spaces is bounded above by its Hirsch length. This bound is shown to be an equality for a large subcl…

2015-08-20abs ↗pdf ↗

New guarantees for black-box variational inference methods.

problem Insufficient theoretical guarantees for black-box variational inference.
method Novel convergence guarantees for stochastic optimization of variational inference.
result Provable convergence of proximal and projected stochastic gradient descent for variational inference.

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.

P-BO reduces black-box adversarial attacks by 10x with Bayesian optimization and function prior.

problem Efficiently generating adversarial examples against black-box models.
method Prior-guided Bayesian Optimization (P-BO) with a function prior initialized from a surrogate model.
result Significantly reduces the number of queries needed for adversarial attacks.

Majority Vote is optimal for reliable data labeling under certain conditions.

problem Reliable data labeling requires aggregating multiple annotators' labels, but the optimality of Majority Vote is not well understood.
method Characterized conditions under which Majority Vote achieves the optimal label estimation error.
result Majority Vote optimally recovers labels for a given class distribution under tolerable annotation noise limits.

For many automated driving functions, a highly accurate perception of the vehicle environment is a crucial prerequisite. Modern high-resolution radar sensors generate multiple radar targets per object, which makes these sensors particularly suitable for the 2D object detection task. This work presents an approach to de…

2019-04-17abs ↗pdf ↗

Regression problems assume every instance is annotated (labeled) with a real value, a form of annotation we call \emph{strong guidance}. In order for these annotations to be accurate, they must be the result of a precise experiment or measurement. However, in some cases additional \emph{weak guidance} might be given by…

2018-04-01abs ↗pdf ↗

Analyze and predict complex 3D shape deformations using LSTM autoencoders and oriented bounding boxes.

problem Detecting and predicting patterns in sequences of deforming 3D shapes.
method Use LSTM autoencoders to create low-dimensional representations of 3D shapes, incorporating oriented bounding boxes for structural components.
result The method detects patterns in plastic deformation and predicts future states of 3D shapes with improved accuracy.

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.

Adapts model-based advice to stabilize black-box policies for nonlinear control.

problem Stabilizing machine-learned policies for nonlinear control with limited model information.
method Proposes an adaptive λλ-confident policy to combine black-box and model-based advice.
result Proves the stability of the adaptive λλ-confident policy and its competitive ratio.

One of the problems on the way to successful implementation of neural networks is the quality of annotation. For instance, different annotators can annotate images in a different way and very often their decisions do not match exactly and in extreme cases are even mutually exclusive which results in noisy annotations a…

2018-07-23abs ↗pdf ↗

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.