arXiv research

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

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

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

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 …

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…

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…

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…

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…

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…

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 $G$, we construct a class of polarised Lie groups, which we call modifications of $G$, that are locally contactomorphic to it. Vice versa, we show that if a polarised group is locally contactomorphic to a stratified group $G$, 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…

In this paper, we consider a proper modification $f : \tilde M \to M$ between complex manifolds, and study when a generalized $p-$Kähler property goes back from $M$ to $\tilde M$. When $f$ is the blow-up at a point, every generalized $p-$Kähler property is conserved, while when $f$ is the blow-up along a submanifold, t…

Thompson Sampling remains differentially private with minimal modifications.

We establish a Kobayashi-Hitchin correspondence between solutions of the extended Bogomolny equation with a Dirac type singularity and Hecke modifications of Higgs bundles. This correspondence was conjectured by Witten and plays an important role in the physical description of the the geometric Langlands program in ter…

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

We consider constraint-based methods for causal structure learning, such as the PC-, FCI-, RFCI- and CCD- algorithms (Spirtes et al. (2000, 1993), Richardson (1996), Colombo et al. (2012), Claassen et al. (2013)). The first step of all these algorithms consists of the PC-algorithm. This algorithm is known to be order-d…

Modified BFGS and LBFGS++ libraries boost performance for non-parallelizable functions.

We study and provide exposition to several phenomena that are related to the perceptron's compression. One theme concerns modifications of the perceptron algorithm that yield better guarantees on the margin of the hyperplane it outputs. These modifications can be useful in training neural networks as well, and we demon…

MCD automates counterfactual design searches for multi-modal tasks.

We discuss a general framework for cutting constructions and reinterpret in this setting the work on non-Abelian symplectic cuts by Weitsman. We then introduce two analogous non-Abelian modification constructions for hyperkähler manifolds: one modifies the topology significantly, the other gives metric deformations. We…

In this work I propose a new way of using fully convolutional networks for classification while allowing for input of any size. I additionally propose two modifications on the idea of attention and the benefits and detriments of using the modifications. Finally, I show suboptimal results on the ITAmoji 2018 tweet to em…

The two main topics of this text are as follows: Firstly, three modifications of the theorem of Beltrami will be presented for diffeomorphisms between Riemannian manifolds and a space form which preserve the geodesic circles, the geodesic hyperspheres, or the minimal surfaces, respectively. Secondly, it is defined what…

Improved peak detection in ChIP-seq data reduces over-dispersion.

PixelCNNs are a recently proposed class of powerful generative models with tractable likelihood. Here we discuss our implementation of PixelCNNs which we make available at https://github.com/openai/pixel-cnn. Our implementation contains a number of modifications to the original model that both simplify its structure an…

Study shows how to manipulate VAEs for attacks and assess their robustness.

For high dimensional data, some of the standard statistical techniques do not work well. So modification or further development of statistical methods are necessary. In this paper, we explore these modifications. We start with the important problem of estimating high dimensional covariance matrix. Then we explore some …

In this note we show that for the group G = U(N) the space of Hecke modifications of a rank N vector bundle over a Riemann surface C coincides with the moduli space of solutions of certain non-abelian vortex equations over C . Through the recent work of Kapustin and Witten this then leads to an isomorphism between the …

A new method improves continual learning by replaying pseudo data and using orthogonal weight modification.

The paper modifies twistor spaces for Kähler surfaces and finds metrics on the modified spaces.

New technique explains convergence in ML models with data modifications.

Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of…

SurvLIME-Inf simplifies explanation of survival models using a linear programming approach.