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

10213141 · Jun 202019922001200920172026
48 results for pixel-level modifications

Proposes a probabilistic method for generating semantically-aware adversarial examples.

problem Generating adversarial examples that are difficult for humans to detect while preserving semantics.
method Embeds subjective understanding of semantics as a distribution into adversarial example generation.
result Achieves higher success rates in circumventing adversarial defense mechanisms.

Generative Adversarial Networks (GANs) have obtained extraordinary success in the generation of realistic images, a domain where a lower pixel-level accuracy is acceptable. We study the problem, not yet tackled in the literature, of generating semantic images starting from a prior distribution. Intuitively this problem…

2019-06-27abs ↗pdf ↗

In this paper we study deep learning-based music source separation, and explore using an alternative loss to the standard spectrogram pixel-level L2 loss for model training. Our main contribution is in demonstrating that adding a high-level feature loss term, extracted from the spectrograms using a VGG net, can improve…

2019-01-15abs ↗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 ↗

Topology-GS improves 3D GS for better structural and feature integrity.

problem Compromised pixel-level and feature-level integrity in 3D GS.
method Incorporates Local Persistent Voronoi Interpolation (LPVI) and PersLoss based on persistent homology.
result Topology-GS outperforms existing methods in PSNR, SSIM, and LPIPS metrics.

This work improves testing of machine learning model modifications using novel statistical methods.

problem Overfitting and conservative Bonferroni correction when testing multiple model modifications.
method Introduces alpha-recycling and SRGPs to control error rate and approve more beneficial modifications.
result Novel statistical methods approve a higher number of beneficial modifications than previous approaches.

In this paper, we tackle the problem of explanations in a deep-learning based model for recommendations by leveraging the technique of layer-wise relevance propagation. We use a Deep Convolutional Neural Network to extract relevant features from the input images before identifying similarity between the images in featu…

2018-07-17abs ↗pdf ↗

New method detects RNA modifications without prior training, revealing novel sites.

problem Detecting RNA modifications with high accuracy and sensitivity.
method Anomaly detection using nanopore raw ionic current signals and nearest neighbor comparison.
result Detects diverse RNA modifications without prior training, including a novel 2'-O-methylated site in DENV.

We define an operation on homology B4{B}^4 which we call an nn-twist annulus modification. We give a new construction of smoothly slice knots and exotically slice knots via nn-twist annulus modifications. As an application, we present a new example of a smoothly slice knot with non-slice derivatives. Such examples we…

2015-12-01abs ↗pdf ↗

We propose a data-driven framework for optimizing privacy-preserving data release mechanisms to attain the information-theoretically optimal tradeoff between minimizing distortion of useful data and concealing specific sensitive information. Our approach employs adversarially-trained neural networks to implement random…

2017-12-19abs ↗pdf ↗

Proposes a new contrastive loss for semi-supervised medical image segmentation.

problem Lack of labeled data for medical image segmentation.
method Uses pseudo-labels and a local contrastive loss to learn good local representations.
result Achieved high segmentation performance on public cardiac and prostate datasets.

A modification of the confidence screening mechanism based on adaptive weighing of every training instance at each cascade level of the Deep Forest is proposed. The idea underlying the modification is very simple and stems from the confidence screening mechanism idea proposed by Pang et al. to simplify the Deep Forest …

2019-01-04abs ↗pdf ↗

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

Study of unimodular Sasaki and Vaisman Lie groups, determining all modifications explicitly.

problem Classifying unimodular Sasaki and Vaisman Lie groups.
method Applying the technique of modification to determine all homogeneous Sasaki and Vaisman manifolds of unimodular Lie groups explicitly.
result Complete classification of unimodular Sasaki and Vaisman Lie groups.

This research shows unsupervised GANs can perform object segmentation without labels.

problem Performing object segmentation without pixel or image-level labels.
method Used large-scale unsupervised GAN models to differentiate foreground from background.
result Demonstrated high-quality saliency masks and new state-of-the-art performance.

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

We briefly review the approach to optimization of portfolios according to the theory of Markowitz and propose a further modification that can improve the outcome of the optimization process. The modification takes account of the entropic contribution from the time series used to compute the parameters in the Markowitz …

2014-08-01abs ↗pdf ↗

Max-Cut decision tree improves classification accuracy and reduces computation time.

problem Improving decision tree accuracy and efficiency for complex classification tasks.
method Alternative splitting metric (max cut) and PCA-based feature selection at each node.
result 49% improvement in accuracy with 94% reduction in CPU time on CIFAR-100 data.

In this work we present a modification in the conventional flow of information through a LSTM network, which we consider well suited for RNNs in general. The modification leads to a iterative scheme where the computations performed by the LSTM cell are repeated over a constant input and cell state values, while updatin…

2018-07-11abs ↗pdf ↗

Kapustin and Witten associate a Hecke modification of a holomorphic bundle over a Riemann surface to a singular monopole on a Riemannian surface times an interval satisfying prescribed boundary conditions. We prove existence and uniqueness of singular monopoles satisfying prescribed boundary conditions for any given He…

2008-04-23abs ↗pdf ↗

This paper addresses unsupervised domain adaptation, the setting where labeled training data is available on a source domain, but the goal is to have good performance on a target domain with only unlabeled data. Like much of previous work, we seek to align the learned representations of the source and target domains wh…

2019-09-26abs ↗pdf ↗

We present an axiomatic modification of quaternionic quantum mechanics with a possible-worlds semantics capable of predicting essential "nonquantum" features of an observable universe model - the dimensionality and topology of spacetime, the existence, the signature and a specific form of a metric on it, and certain na…

2007-02-28abs ↗pdf ↗

For a stratified group GG, we construct a class of polarised Lie groups, which we call modifications of GG, that are locally contactomorphic to it. Vice versa, we show that if a polarised group is locally contactomorphic to a stratified group GG, whose Lie algebra has finite Tanaka prolongation, then it must be a mo…

2018-07-10abs ↗pdf ↗

Label smoothing improves model robustness against misspecification.

problem Improving model robustness against model misspecification.
method Introducing modified label smoothing (MLSLR) that maintains consistent probability estimation while modifying the loss function.
result MLSLR exhibits higher robustness against model misspecification than conventional label smoothing.

Forest tree species mapped with high accuracy using satellite data.

problem Classifying dominant tree species in Swedish forests.
method Extreme gradient boosting model with Bayesian optimization, combining Sentinel-1/2 satellite data and field observations.
result Overall accuracy of 85%, F1 score of 0.82, Matthews correlation coefficient of 0.81.