Proposes a probabilistic method for generating semantically-aware adversarial examples.
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.
Trend · papers per month
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…
Segmentation of tumors in brain MRI images is a challenging task, where most recent methods demand large volumes of data with pixel-level annotations, which are generally costly to obtain. In contrast, image-level annotations, where only the presence of lesion is marked, are generally cheap, generated in far larger vol…
Previous works on segmentation of SEM (scanning electron microscope) blood cell image ignore the semantic segmentation approach of whole-slide blood cell segmentation. In the proposed work, we address the problem of whole-slide blood cell segmentation using the semantic segmentation approach. We design a novel convolut…
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…
One crucial aspect of partial domain adaptation (PDA) is how to select the relevant source samples in the shared classes for knowledge transfer. Previous PDA methods tackle this problem by re-weighting the source samples based on their high-level information (deep features). However, since the domain shift between sour…
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…
Injecting adversarial examples during training, known as adversarial training, can improve robustness against one-step attacks, but not for unknown iterative attacks. To address this challenge, we first show iteratively generated adversarial images easily transfer between networks trained with the same strategy. Inspir…
Topology-GS improves 3D GS for better structural and feature integrity.
This work improves testing of machine learning model modifications using novel statistical methods.
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…
New method detects RNA modifications without prior training, revealing novel sites.
We define an operation on homology which we call an -twist annulus modification. We give a new construction of smoothly slice knots and exotically slice knots via -twist annulus modifications. As an application, we present a new example of a smoothly slice knot with non-slice derivatives. Such examples we…
In this paper we describe the problem of painter classification, and propose a novel approach based on deep convolutional autoencoder neural networks. While previous approaches relied on image processing and manual feature extraction from paintings, our approach operates on the raw pixel level, without any preprocessin…
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…
Proposes a new contrastive loss for semi-supervised medical image segmentation.
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 …
Proposes simplified SHAP for faster black-box model explanations.
Behavior modification improves prediction accuracy by nudging user behavior.
Study of unimodular Sasaki and Vaisman Lie groups, determining all modifications explicitly.
We study large-scale classification problems in changing environments where a small part of the dataset is modified, and the effect of the data modification must be quickly incorporated into the classifier. When the entire dataset is large, even if the amount of the data modification is fairly small, the computational …
Deep learning models designed for visual classification tasks on natural images have become prevalent in medical image analysis. However, medical images differ from typical natural images in many ways, such as significantly higher resolutions and smaller regions of interest. Moreover, both the global structure and loca…
Computational methods that predict differential gene expression from histone modification signals are highly desirable for understanding how histone modifications control the functional heterogeneity of cells through influencing differential gene regulation. Recent studies either failed to capture combinatorial effects…
This paper presents a useful method to achieve classification in satellite imagery. The approach is based on pixel level study employing various features such as correlation, homogeneity, energy and contrast. In this study gray-scale images are used for training the classification model. For supervised classification, …
Method explains anomaly detection by generating normal modifications.
We study Khovanov homology classes which have state cycle representatives, and examine how they interact with Jacobsson homomorphisms and Lee's map . As an application, we describe a general procedure, quasipositive modification, for constructing H-thick knots in rational Khovanov homology. Moreover, we show that sp…
This research shows unsupervised GANs can perform object segmentation without labels.
Preserves hyperbolicity in link complements with two moves.
Representing entities and relations in an embedding space is a well-studied approach for machine learning on relational data. Existing approaches, however, primarily focus on improving accuracy and overlook other aspects such as robustness and interpretability. In this paper, we propose adversarial modifications for li…
Artificial intelligence offers the potential to automate challenging data-processing tasks in collider physics. To establish its prospects, we explore to what extent deep learning with convolutional neural networks can discriminate quark and gluon jets better than observables designed by physicists. Our approach builds…
We propose a modification of the three-manifold invariant based on the use of Euclidean metric values ascribed to the elements of manifold triangulation. We thus obtain a nontrivial invariant that can, in particular, distinguish non-homeomorphic lens spaces.
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
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 …
Max-Cut decision tree improves classification accuracy and reduces computation time.
In this paper we suggest a modification of the regression-based variance reduction approach recently proposed in Belomestny et al. This modification is based on the stratification technique and allows for a further significant variance reduction. The performance of the proposed approach is illustrated by several numeri…
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…
Proposes AE for robust PCA, improving robustness to outliers.
Proposes a strategy to train models with minimal labeled data.
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…
In this comment on "Solving Statistical Mechanics Using Variational Autoregressive Networks" by Wu et al., we propose a subtle yet powerful modification of their approach. We show that the inherent sampling error of their method can be corrected by using neural network-based MCMC or importance sampling which leads to a…
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…
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…
For a stratified group , we construct a class of polarised Lie groups, which we call modifications of , that are locally contactomorphic to it. Vice versa, we show that if a polarised group is locally contactomorphic to a stratified group , whose Lie algebra has finite Tanaka prolongation, then it must be a mo…
Despite the great achievements of deep neural networks (DNNs), the vulnerability of state-of-the-art DNNs raises security concerns of DNNs in many application domains requiring high reliability.We propose the fault sneaking attack on DNNs, where the adversary aims to misclassify certain input images into any target lab…
A new bias score method optimizes fairness in classification.
Label smoothing improves model robustness against misspecification.
We will consider locally conformally balanced manifolds. We prove that a locally conformally balanced condition is not stable under a small deformation. We prove that locally conformally balanced condition is stable under any proper modification. We prove that symmetric products of the Kodaira surface can be resolve to…
Forest tree species mapped with high accuracy using satellite data.