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

Trend · papers per month

36912 · May 202619922001200920172026
48 results for bypass

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.

2005-01-21abs ↗pdf ↗

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…

2013-09-17abs ↗pdf ↗

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…

2018-03-27abs ↗pdf ↗

Visual spoofing bypasses spam filters and plagiarism detection.

problem Vulnerability in spam filters that can be exploited by visually similar but differently encoded characters.
method Replaces characters with visually similar but differently encoded characters from a different alphabet.
result Spammers can create messages that bypass existing spam filters.

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…

2018-08-28abs ↗pdf ↗

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.

2013-12-18abs ↗pdf ↗

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…

2019-05-31abs ↗pdf ↗

Simple attack bypasses state-of-the-art DNN watermarking.

problem Protecting DNN models from watermark removal attacks.
method Combining imperceptible pattern embedding and spatial-level transformations for a simple yet effective watermark removal.
result Our attack bypasses state-of-the-art watermarking solutions with high success rates.

A new meta-learning BO approach that bypasses surrogate models and directly learns task utility.

problem Scalability issues and sensitivity to task similarity in existing meta-learning BO methods.
method Directly learns the utility of queries across tasks, models task uncertainty, and includes an auxiliary model for robust adaptation.
result Demonstrates strong anytime performance and outperforms state-of-the-art methods in various benchmarks.

SLS optimizes minimum-volume regions for conditional quantiles, bypassing density estimation.

problem Constructing minimum-volume prediction regions that satisfy conditional coverage.
method Super-level-set regression (SLS) directly optimizes geometric boundaries of conditional level sets.
result SLS optimizes regions directly, capturing complex conditional structures end-to-end.

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…

2009-01-29abs ↗pdf ↗

ABI bypasses likelihood intractability with nonparametric distribution matching.

problem Approximate Bayesian computation's inefficiency in high-dimensional settings and under diffuse priors.
method Adaptive Bayesian Inference (ABI) compares posterior distributions directly using nonparametric distribution matching and MSW distance.
result ABI significantly outperforms other methods in high-dimensional or dependent observation regimes.

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…

2018-01-23abs ↗pdf ↗

Proposes a variational approach to shallow neural networks, bypassing optimization.

problem Theoretical understanding and optimization of shallow neural networks.
method Replaces discrete training with a continuum variational surrogate, proving global well-posedness and regularity.
result Optimal parameter density can be obtained by solving a single linear system, achieving O(1/N)O(1/N) generalization error.

Proposes a new method to approximate Bayesian predictive uncertainty.

problem Bayesian uncertainty quantification in model predictions.
method Self-supervised learning approach to approximate posterior predictive distribution.
result SSLA and ASSLA outperform classical Laplace approximations in predictive calibration.

Machine learning-based IDSs in ICS are vulnerable to adversarial attacks that can bypass them.

problem Adversarial attacks on machine learning-based IDSs in ICS can lead to undetected cyber attacks.
method Used Jacobian-based Saliency Map attack to generate adversarial samples and explored adversarial training to improve model robustness.
result Classification performance of supervised models decreased by 16-20 percentage points with adversarial samples, but improved with adversarial training.

A new approach for instance-optimal learning that bypasses impossibility results.

problem Impossibility of achieving marginal-by-marginal guarantees for all marginals.
method Introduces relatively smart learning, which requires competition only with certifiable semi-supervised guarantees.
result One-Inclusion Graph learner is relatively smart up to squaring the sample complexity.

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…

2008-06-25abs ↗pdf ↗

Derives a new objective to learn from human preferences without approximations.

problem Learning from human preferences through RLHF relies on approximations that can lead to pitfalls.
method Derives a new general objective ΨΨPO that bypasses both approximations.
result Demonstrates the superiority of the new objective to Direct Preference Optimisation (DPO) empirically.

In this paper we adopt an alternative, analytical approach to Arnol'd problem \cite{A1} about the existence of closed and embedded KK-magnetic geodesics in the round 22-sphere S2\mathbb S^2, where K:S2RK: \mathbb S^2 \rightarrow \mathbb R is a smooth scalar function. In particular, we use Lyapunov-Schmidt finite-dimensi…

2018-11-11abs ↗pdf ↗

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…

2010-04-19abs ↗pdf ↗

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…

2019-07-24abs ↗pdf ↗

A new VAE approach solves inverse problems without explicit inverse mapping.

problem Solving inverse problems without explicit inverse mapping.
method Discarding the encoder in VAE architecture, directly optimizing latent variables.
result The latent variables can exhibit mutually independent properties without an encoding process.

New method bypasses global fit for LISA's Galactic binaries, extracting population parameters directly.

problem Disentangling LISA's Galactic binary sources from backgrounds in a computationally intensive process.
method Simulation-based approach using normalizing flow to infer population parameters.
result Direct inference of population parameters from LISA's frequency strain series.

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…

2019-06-08abs ↗pdf ↗

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…

2017-08-09abs ↗pdf ↗

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…

2015-01-02abs ↗pdf ↗

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…

2016-08-10abs ↗pdf ↗

Paper proposes bypassing implicit assumption in GM-based AD methods.

problem Lack of anomalous data and implicit assumption in GM-based AD methods.
method Integrating Discriminative idea to GMM for AD tasks (DiGMM).
result Establishes a connection between generative and discriminative models for AD.