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,657 papers · 148 categories

Trend · papers per month

162324486648 · Jun 202019922001200920172026
48 results for vision tasks

Real-time uncertainty estimation for computer vision tasks.

problem Real-time inference of uncertainty in deep learning models.
method Uncertainty-Aware Distribution Distillation method for fast inference.
result Significantly reduced inference time with improved uncertainty and predictive performance.

Quantum hybrid vision transformers improve event classification in high energy physics.

problem Excessive computational resources for training and deploying vision transformer models.
method Constructed quantum hybrid vision transformers for high energy physics event classification.
result Quantum hybrid models achieve comparable performance to classical models with fewer parameters.

Plex improves model reliability across vision and language tasks.

problem Improving model reliability in diverse decision-making tasks involving uncertainty and adaptation.
method Developed ViT-Plex and T5-Plex pretrained model extensions to evaluate and improve reliability across 40 datasets.
result Plex greatly improves state-of-the-art across reliability tasks, simplifying evaluation and performance.

Develops methods for training models with few annotations in computer vision tasks.

problem Training models with limited labeled data in computer vision.
method Theoretical, algorithmic, and experimental contributions for Meta-Learning and Semi-Supervised Learning.
result Improves Contrastive Learning and proposes a semi-supervised method for transformer-based object detectors.

ADAPT improves robustness of Vision Transformers without full model fine-tuning.

problem Vulnerability of Vision Transformers to adversarial attacks.
method Parameter-efficient prompt tuning with ADAPT framework for adaptive adversarial training.
result ADAPT achieves robust accuracy of ~40% w.r.t. SOTA methods using only ~1% of the parameters.

The democratization of machine learning (ML) has led to ML-based machine vision systems for autonomous driving, traffic monitoring, and video surveillance. However, true democratization cannot be achieved without greatly simplifying the process of collecting groundtruth for training and testing these systems. This grou…

2018-11-08abs ↗pdf ↗

ViLT is a faster vision-and-language model without convolution or region supervision.

problem Efficiency and expressive power limitations in current VLP models.
method A convolution-free Vision-and-Language Transformer (ViLT) that processes visual inputs similarly to textual inputs.
result ViLT is up to tens of times faster with competitive or better performance.

Proposes deep collective learning to learn inputs and weights together in neural networks.

problem The need to optimize inputs alongside weights in deep neural networks.
method Introduces deep collective learning to learn inputs and weights jointly, using lookup tables.
result Demonstrates advantages and promise of Lookup-VNets and deep collective learning.

This paper improves ensemble learning for vision tasks by encouraging diversity in predictions.

problem Generating effective ensembles of neural networks for multi-modal data.
method Explicitly optimize a diversity inducing adversarial loss for learning stochastic latent variables.
result Significant improvements in classification accuracy and out-of-distribution detection compared to baselines.

Language grounded image understanding tasks have often been proposed as a method for evaluating progress in artificial intelligence. Ideally, these tasks should test a plethora of capabilities that integrate computer vision, reasoning, and natural language understanding. However, rather than behaving as visual Turing t…

2019-04-19abs ↗pdf ↗

Study proposes a statistical test for Vision Transformer's attention mechanisms.

problem ViT's attention mechanisms may focus on irrelevant regions, leading to unreliable evidence.
method Selective inference framework to quantify statistical significance of attentions as p-values.
result Proposed method enables reliable quantification of false positive detection probability of attentions.

As the range of tasks performed by a general vision system expands, executing multiple tasks accurately and efficiently in a single network has become an important and still open problem. Recent computer vision approaches address this problem by branching networks, or by a channel-wise modulation of the network feature…

2020-02-09abs ↗pdf ↗

Vision Transformers show different internal representations compared to CNNs.

problem Understanding how Vision Transformers solve image classification tasks.
method Comparative analysis of ViT and CNN architectures on image classification benchmarks.
result ViT has more uniform representations across all layers, while CNNs have more varied representations.

While frame-independent predictions with deep neural networks have become the prominent solutions to many computer vision tasks, the potential benefits of utilizing correlations between frames have received less attention. Even though probabilistic machine learning provides the ability to encode correlation as prior kn…

2019-12-06abs ↗pdf ↗

Weakly-supervised RL identifies meaningful tasks, improving performance in complex environments.

problem Learning to efficiently explore and distinguish between meaningful and irrelevant tasks.
method Weak supervision to automatically disentangle meaningful tasks from a large space of nonsensical tasks.
result The learned subspace of meaningful tasks leads to substantial performance gains, especially in complex environments.

From a simplified analysis of adaptive methods, we derive AvaGrad, a new optimizer which outperforms SGD on vision tasks when its adaptability is properly tuned. We observe that the power of our method is partially explained by a decoupling of learning rate and adaptability, greatly simplifying hyperparameter search. I…

2019-12-04abs ↗pdf ↗

Paper proposes privacy-preserving learning for images, making them imperceptible to humans but recognizable by machines.

problem Conflict between developing AI systems and protecting sensitive training data.
method Encryption strategies (random shuffling and sub-patch mixing) followed by minimal adaptation to vision transformer.
result Achieves comparable accuracy to competitive methods while ensuring human-imperceptibility of encrypted images.

Mobile V-MoEs scale down ViTs for resource-constrained vision tasks.

problem Scaling down Vision Transformers for resource-constrained applications.
method Sparse Mixture-of-Experts (MoEs) applied to entire images, with a stable training procedure.
result Mobile V-MoEs achieve better performance-efficiency trade-offs than dense ViTs.

We introduce a data-free quantization method for deep neural networks that does not require fine-tuning or hyperparameter selection. It achieves near-original model performance on common computer vision architectures and tasks. 8-bit fixed-point quantization is essential for efficient inference on modern deep learning …

2019-06-11abs ↗pdf ↗

Square loss performs comparably or better than cross-entropy in neural architectures for various tasks.

problem The superiority of cross-entropy loss over square loss in classification tasks is debated.
method Comparison of several neural architectures on NLP, ASR, and computer vision datasets using both loss functions.
result Square loss often produces better results in the majority of tasks, especially in NLP and ASR.

Proposes a method to balance tasks in multitask learning with a single gradient step update.

problem Balancing tasks in multitask learning to avoid imbalance.
method Gradient-based meta-learning to balance tasks at the gradient level, training shared and task-specific layers separately.
result Achieves state-of-the-art performance on various multitask computer vision problems.

Imitation learning allows agents to learn complex behaviors from demonstrations. However, learning a complex vision-based task may require an impractical number of demonstrations. Meta-imitation learning is a promising approach towards enabling agents to learn a new task from one or a few demonstrations by leveraging e…

2019-06-07abs ↗pdf ↗

Task-agnostic data augmentation shows little benefit for pretrained transformers.

problem Evaluating the effectiveness of task-agnostic data augmentation on pretrained transformers.
method Conducted a systematic examination of two data augmentation techniques (Easy Data Augmentation and Back-Translation) across 5 tasks, 6 datasets, and 3 pretrained transformer models.
result Data augmentation techniques previously effective for non-pretrained models fail to consistently improve performance for pretrained transformers, even with limited training data.

Attention networks show promise for both vision and language tasks, by emphasizing relationships between constituent elements through weighting functions. Such elements could be regions in an image output by a region proposal network, or words in a sentence, represented by word embedding. Thus far the learning of atten…

2019-05-27abs ↗pdf ↗

VALAN is a lightweight and scalable software framework for deep reinforcement learning based on the SEED RL architecture. The framework facilitates the development and evaluation of embodied agents for solving grounded language understanding tasks, such as Vision-and-Language Navigation and Vision-and-Dialog Navigation…

2019-12-06abs ↗pdf ↗

Proposes hinge-Wasserstein to improve uncertainty estimation in regression tasks.

problem Estimating multimodal aleatoric uncertainty in regression tasks from images.
method Regression-by-classification paradigm with hinge-Wasserstein loss.
result Hinge-Wasserstein loss improves uncertainty estimation on challenging tasks.

This paper analyzes shallow ViTs, providing sample complexity and SGD behavior insights.

problem Theoretical understanding of shallow ViTs, especially their sample complexity and SGD behavior.
method Data model with label-relevant and label-irrelevant tokens, theoretical analysis of shallow ViT training.
result Characterization of sample complexity for zero generalization error in shallow ViTs.

Improved transfer learning with expert models, reducing compute and speeding up performance.

problem Improving sample efficiency and reducing computational requirements for new tasks.
method Training a diverse set of experts using existing label structures and performance proxies to select the relevant expert for each target task.
result Significant speed-up of 2-3 orders of magnitude compared to competing approaches.