New proofs of h-principles in contact 3-manifolds.
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
We use the generalized Pontryagin-Thom construction to analyze the effect of attaching a bypass on the homotopy class of the contact structure. In particular, given a 3-dimensional contact manifold with convex boundary, we show that the bypass triangle attachment changes the homotopy class of the contact structure rela…
We give a necessary and sufficient condition for the addition of a collection of disjoint bypasses to a convex surface to be universally tight -- namely the nonexistence of a polygonal region which we call a virtual pinwheel.
We study b-arc foliation change and exchange move of open book foliations which generalize the corresponding operations in braid foliation theory. We also define a bypass move as an analogue of Honda's bypass attachment operation. As applications, we study how open book foliations change under a stabilization of the op…
Feature Squeezing is a recently proposed defense method which reduces the search space available to an adversary by coalescing samples that correspond to many different feature vectors in the original space into a single sample. It has been shown that feature squeezing defenses can be combined in a joint detection fram…
Visual spoofing bypasses spam filters and plagiarism detection.
Cross-domain collaborative filtering (CF) aims to alleviate data sparsity in single-domain CF by leveraging knowledge transferred from related domains. Many traditional methods focus on enriching compared neighborhood relations in CF directly to address the sparsity problem. In this paper, we propose superhighway const…
Systematic and multifactor risk models are revisited via methods which were already successfully developed in signal processing and in automatic control. The results, which bypass the usual criticisms on those risk modeling, are illustrated by several successful computer experiments.
Discrete Flow Maps bypass sequential prediction limits for parallel text generation.
In 1989, Y. Eliashberg proved that two overtwisted contact structures on a closed oriented 3-manifold are isotopic if and only if they are homotopic as 2-plane fields. We provide an alternative proof of this theorem using the convex surface theory and bypasses.
New dynamic backdoor attacks bypass current defenses.
Deep learning models are vulnerable to various adversarial manipulations of their training data, parameters, and input sample. In particular, an adversary can modify the training data and model parameters to embed backdoors into the model, so the model behaves according to the adversary's objective if the input contain…
Simple attack bypasses state-of-the-art DNN watermarking.
A new meta-learning BO approach that bypasses surrogate models and directly learns task utility.
We give a new proof of the isoperimetric inequality in the plane, based on Steiner's formula for the area of a convex neighborhood. This proof establishes the isoperimetric inequality directly, without requiring that we separately establish the existence of an optimal domain. In doing so, this proof bypasses the main d…
SLS optimizes minimum-volume regions for conditional quantiles, bypassing density estimation.
Deep learning classifiers are known to be vulnerable to adversarial examples. A recent paper presented at ICML 2019 proposed a statistical test detection method based on the observation that logits of noisy adversarial examples are biased toward the true class. The method is evaluated on CIFAR-10 dataset and is shown t…
Simplified proof for Frank and Lieb's inequality on Heisenberg group.
Short proof shows how ridge regression works with random data.
We review Giroux's contact handles and contact handle attachments in dimension three and show that a bypass attachment consists of a pair of contact 1 and 2-handles. As an application we describe explicit contact handle decompositions of infinitely many pairwise non-isotopic overtwisted 3-spheres. We also give an alter…
ABI bypasses likelihood intractability with nonparametric distribution matching.
We prove that Khovanov homology detects the trefoils. Our proof incorporates an array of ideas in Floer homology and contact geometry. It uses open books; the contact invariants we defined in the instanton Floer setting; a bypass exact triangle in sutured instanton homology, proven here; and Kronheimer and Mrowka's spe…
Proposes a variational approach to shallow neural networks, bypassing optimization.
Deep neural networks are vulnerable to adversarial examples, i.e., carefully-perturbed inputs aimed to mislead classification. This work proposes a detection method based on combining non-linear dimensionality reduction and density estimation techniques. Our empirical findings show that the proposed approach is able to…
Algorithm compares Legendrian knots efficiently in some cases.
Uniform bounds derived for fully non-linear equations.
Proposes a new method to approximate Bayesian predictive uncertainty.
Machine learning-based IDSs in ICS are vulnerable to adversarial attacks that can bypass them.
A new approach for instance-optimal learning that bypasses impossibility results.
Develops a new method for financial term structure modeling.
In this paper we show how to bypass the usual difficulties in the analysis of elliptic integrals that arise when solving period problems for minimal surfaces. The method consists of replacing period problems with ordinary Sturm-Liouville problems involving the support function. We give a practical application by provin…
Derives a new objective to learn from human preferences without approximations.
In recent years, defending adversarial perturbations to natural examples in order to build robust machine learning models trained by deep neural networks (DNNs) has become an emerging research field in the conjunction of deep learning and security. In particular, MagNet consisting of an adversary detector and a data re…
New train tracks for complex homeomorphisms found.
In this paper we adopt an alternative, analytical approach to Arnol'd problem \cite{A1} about the existence of closed and embedded -magnetic geodesics in the round -sphere , where is a smooth scalar function. In particular, we use Lyapunov-Schmidt finite-dimensi…
Hospital Readmissions within 30 days after discharge following Coronary Artery Bypass Graft (CABG) Surgery are substantial contributors to healthcare costs. Many predictive models were developed to identify risk factors for readmissions. However, majority of the existing models use statistical analysis techniques with …
Mouse dynamics is a potential means of authenticating users. Typically, the authentication process is based on classical machine learning techniques, but recently, deep learning techniques have been introduced for this purpose. Although prior research has demonstrated how machine learning and deep learning algorithms c…
Very few results are known about the topology of the strata of the moduli space of quadratic differentials. In this paper, we prove that any connected component of such strata has only one topological end. A typical flat surface in a neighborhood of the boundary is naturally split by a collection of parallel short sadd…
These notes aim to shed light on the recently proposed structured projected intermediate gradient optimization technique (SPIGOT, Peng et al., 2018). SPIGOT is a variant of the straight-through estimator (Bengio et al., 2013) which bypasses gradients of the argmax function by back-propagating a surrogate "gradient." We…
A new VAE approach solves inverse problems without explicit inverse mapping.
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the monotonic simplification theorem for the unknot is given. It is shown that a mi…
New method bypasses global fit for LISA's Galactic binaries, extracting population parameters directly.
Despite their accuracy, neural network-based classifiers are still prone to manipulation through adversarial perturbations. Those perturbations are designed to be misclassified by the neural network, while being perceptually identical to some valid input. The vast majority of attack methods rely on white-box conditions…
Metrics on Lie groupoids and differentiable stacks have been introduced recently, extending the Riemannian geometry of manifolds and orbifolds to more general singular spaces. Here we continue that theory, studying stacky curves on Riemannian stacks, measuring their length using stacky metrics, and introducing stacky g…
We give an explicit algorithm and source code for extracting expected returns for stocks from expected returns for alphas. Our algorithm altogether bypasses combining alphas with weights into "alpha combos". Simply put, we have developed a new method for trading alphas which does not involve combining them. This yields…
We propose to learn a kernel-based message operator which takes as input all expectation propagation (EP) incoming messages to a factor node and produces an outgoing message. In ordinary EP, computing an outgoing message involves estimating a multivariate integral which may not have an analytic expression. Learning suc…
In structured prediction problems where we have indirect supervision of the output, maximum marginal likelihood faces two computational obstacles: non-convexity of the objective and intractability of even a single gradient computation. In this paper, we bypass both obstacles for a class of what we call linear indirectl…
Paper proposes bypassing implicit assumption in GM-based AD methods.