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

Trend · papers per month

5791,1571,7362,314 · Jun 202019922001200920172026
48 results for competition for pixels

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.

Pixel-space diffusion models outperform latent models on high-resolution image synthesis.

problem Efficiency and quality trade-off in high-resolution image synthesis.
method Sigmoid loss-weighting, simplified architecture, and resolution scaling.
result Achieved 1.5 FID on ImageNet512, new SOTA results on other datasets.

The Jacobian-based Saliency Map Attack is a family of adversarial attack methods for fooling classification models, such as deep neural networks for image classification tasks. By saturating a few pixels in a given image to their maximum or minimum values, JSMA can cause the model to misclassify the resulting adversari…

2018-08-23abs ↗pdf ↗

State of the art methods in astronomical image reconstruction rely on the resolution of a regularized or constrained optimization problem. Solving this problem can be computationally intensive and usually leads to a quadratic or at least superlinear complexity w.r.t. the number of pixels in the image. We investigate in…

2016-12-14abs ↗pdf ↗

Variational autoencoders (VAEs), that are built upon deep neural networks have emerged as popular generative models in computer vision. Most of the work towards improving variational autoencoders has focused mainly on making the approximations to the posterior flexible and accurate, leading to tremendous progress. Howe…

2016-11-16abs ↗pdf ↗

This paper presents the first two editions of Visual Doom AI Competition, held in 2016 and 2017. The challenge was to create bots that compete in a multi-player deathmatch in a first-person shooter (FPS) game, Doom. The bots had to make their decisions based solely on visual information, i.e., a raw screen buffer. To p…

2018-09-10abs ↗pdf ↗

The Madry Lab recently hosted a competition designed to test the robustness of their adversarially trained MNIST model. Attacks were constrained to perturb each pixel of the input image by a scaled maximal LL_\infty distortion εε = 0.3. This discourages the use of attacks which are not optimized on the LL_\infty dis…

2017-10-30abs ↗pdf ↗

Proposes a new model for unsupervised clustering with latent variables.

problem The challenge of unsupervised clustering in machine learning.
method Clustered Generator Model with continuous and discrete latent variables.
result Achieves competitive unsupervised clustering accuracy and disentangled latent representations.

Despite recent advances in training recurrent neural networks (RNNs), capturing long-term dependencies in sequences remains a fundamental challenge. Most approaches use backpropagation through time (BPTT), which is difficult to scale to very long sequences. This paper proposes a simple method that improves the ability …

2018-03-01abs ↗pdf ↗

In this paper, we analyze different preconditionings designed to enhance robustness of pure-pixel search algorithms, which are used for blind hyperspectral unmixing and which are equivalent to near-separable nonnegative matrix factorization algorithms. Our analysis focuses on the successive projection algorithm (SPA), …

2014-06-20abs ↗pdf ↗

Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by Morse Theory, we algorithmically produce a PL approximation of the original shape …

2011-05-13abs ↗pdf ↗

We develop a method for user-controllable semantic image inpainting: Given an arbitrary set of observed pixels, the unobserved pixels can be imputed in a user-controllable range of possibilities, each of which is semantically coherent and locally consistent with the observed pixels. We achieve this using a deep generat…

2018-06-15abs ↗pdf ↗

Deep learning improves PS pixel selection in SAR interferometry.

problem Selecting persistent scatterer pixels for geophysical parameter estimation in multi-temporal SAR interferometry.
method Proposed two deep learning architectures: CNN-ISS and CLSTM-ISS trained on phase history to classify PS and non-PS pixels.
result CLSTM-ISS outperforms conventional methods in PS pixel selection and classification accuracy.

We adapt the ideas underlying the success of Deep Q-Learning to the continuous action domain. We present an actor-critic, model-free algorithm based on the deterministic policy gradient that can operate over continuous action spaces. Using the same learning algorithm, network architecture and hyper-parameters, our algo…

2015-09-09abs ↗pdf ↗

Herein, we present a system for hyperspectral image segmentation that utilizes multiple class--based denoising autoencoders which are efficiently trained. Moreover, we present a novel hyperspectral data augmentation method for labelled HSI data using linear mixtures of pixels from each class, which helps the system wit…

2018-07-11abs ↗pdf ↗

Semantic inpainting is the task of inferring missing pixels in an image given surrounding pixels and high level image semantics. Most semantic inpainting algorithms are deterministic: given an image with missing regions, a single inpainted image is generated. However, there are often several plausible inpaintings for a…

2018-10-08abs ↗pdf ↗

B-REX efficiently learns Atari game policies from pixel inputs using Bayesian methods.

problem Learning reward functions from visual inputs with uncertainty and safety considerations.
method Bayesian Reward Extrapolation (B-REX) using successor features and preferences.
result B-REX generates posterior samples efficiently, enabling high-confidence performance bounds.

Evolutionary algorithm finds optimal pixel perturbations to improve neural network generalization.

problem Minimal data corruption by pixel modifications causes overfitting in neural networks.
method Evolutionary algorithm with a novel cost function to maximize generalization gap and domain divergence.
result Method outperforms previous pixel-based data distribution shift methods on CNNs.

Study shows various pixel p-norm measures do not match human perception of adversarial attacks.

problem Understanding human perception of adversarial attacks on image classification systems.
method Performed a behavioral study comparing different p-norm measures and alternative metrics.
result Human perception of adversarial attacks does not align with pixel p-norm measures and other metrics.

We propose a new approach to the problem of optimizing autoencoders for lossy image compression. New media formats, changing hardware technology, as well as diverse requirements and content types create a need for compression algorithms which are more flexible than existing codecs. Autoencoders have the potential to ad…

2017-03-01abs ↗pdf ↗

DEceit constructs effective universal pixel-restricted perturbations for deep image classifiers.

problem Creating effective universal pixel-restricted perturbations for deep neural networks.
method DEceit algorithm for black-box feedback, targeting 10% of pixels in images.
result Perturbing only 10% of pixels achieves high Fooling Rate and visual similarity.

SRTC model for background/foreground separation with missing pixels.

problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.

New method certifies robustness to sparse adversarial attacks.

problem Ensuring robustness of classifiers to sparse adversarial attacks.
method Randomized ablation of input features to provide robustness guarantees.
result Certifies robustness to sparse adversarial attacks with up to 31 pixels of distortion.

Data-efficient learning in continuous state-action spaces using very high-dimensional observations remains a key challenge in developing fully autonomous systems. In this paper, we consider one instance of this challenge, the pixels to torques problem, where an agent must learn a closed-loop control policy from pixel i…

2015-02-08abs ↗pdf ↗