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

4118221,2331,644 · Jun 202019922001200920172026
48 results for barely robust learning

Boosts barely robust learners to be more adversarially robust.

problem Learning predictors robust to small perturbations on a small fraction of data.
method Oracle-efficient algorithm for robustness with larger perturbation set.
result Qualitative and quantitative equivalence between strongly robust and barely robust learning.

While adversarial training can improve robust accuracy (against an adversary), it sometimes hurts standard accuracy (when there is no adversary). Previous work has studied this tradeoff between standard and robust accuracy, but only in the setting where no predictor performs well on both objectives in the infinite data…

2019-06-14abs ↗pdf ↗

The present paper deals with mirror symmetry aspects of compact ``barely'' G2G_2 manifolds, that is, G2G_2 manifolds of the form (CY×S1)/Z2\times S^1)/\mathbb{Z}_2. We propose that the mirror of any barely G2G_2 manifold is another barely one and which is constructed as a fibration of the \emph{mirror} of the CY base. Also,…

2007-07-10abs ↗pdf ↗

We calculate explicitly the Betti numbers of a class of barely G2 manifolds - that is, G2 manifolds that are realised as a product of a Calabi-Yau manifold and a circle, modulo an involution. The particular class which we consider are those spaces where the Calabi-Yau manifolds are complete intersections of hypersurfac…

2009-09-25abs ↗pdf ↗

We consider in a market model the cooperative emergence of value due to a positive feedback between perception of needs and demand. Here we consider also a negative feedback from production of the traded products, and find that this cooperativity is robust, provided that the production rate is slow. Cooperativity is fo…

2003-09-24abs ↗pdf ↗

After surveying existing proofs that every closed, orientable 3-manifold is parallelizable, we give three proofs using minimal background. In particular, our proofs use neither spin structures nor the theory of Stiefel-Whitney classes.

2018-06-13abs ↗pdf ↗

DIP-FAT improves adversarial training by diversifying perturbations.

problem Adversarial examples fool deep neural networks, leading to overfitting and poor performance.
method DIP-FAT uses random directions to diversify perturbations in adversarial training.
result DIP-FAT reduces overfitting and improves clean data accuracy.

Study on hemisphere threshold for Escobar functional on Riemannian manifolds, revealing mass and boundary invariant behaviors.

problem Analyzing the hemisphere threshold for the Escobar functional on compact Riemannian manifolds.
method Near-threshold landscape organization by boundary invariants, exact evaluation of weighted profile moments, Lyapunov-Schmidt correction, and blow-up analysis.
result At threshold, blow-ups concentrate at umbilic points with vanishing mass and gradient, leading to compactness and hemispherical rigidity.

While deep learning has received a surge of interest in a variety of fields in recent years, major deep learning models barely use complex numbers. However, speech, signal and audio data are naturally complex-valued after Fourier Transform, and studies have shown a potentially richer representation of complex nets. In …

2019-10-22abs ↗pdf ↗

The aggregation of k-ary preferences is a historical and important problem, since it has many real-world applications, such as peer grading, presidential elections and restaurant ranking. Meanwhile, variants of Plackett-Luce model has been applied to aggregate k-ary preferences. However, there are two urgent issues sti…

2018-12-14abs ↗pdf ↗

With the help of transfer entropy, we analyze information flows between communities of complex networks. We show that the transfer entropy provides a coherent description of interactions between communities, including non-linear interactions. To put some flesh on the bare bones, we analyze transfer entropies between co…

2017-06-17abs ↗pdf ↗

Recent advances in visual tracking are based on siamese feature extractors and template matching. For this category of trackers, latest research focuses on better feature embeddings and similarity measures. In this work, we focus on building holistic object representations for tracking. We propose a framework that is d…

2019-07-21abs ↗pdf ↗

CREDIT learns to master pair trading with risk-aware RL, outperforming existing methods.

problem Challenges in applying RL to pair trading due to temporal correlations and risk considerations.
method Risk-aware recurrent reinforcement learning (RL) with bidirectional GRU and temporal attention.
result CREDIT achieves significant profit in pair trading over five years of U.S. stock data.

This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use few literal expressions, equations, functions, etc. We barely suppose that the re…

2013-04-22abs ↗pdf ↗

This text arises from teaching advanced undergraduate courses in differential topology for the master curriculum in Mathematics at the University of Pisa. So it is mainly addressed to motivated and collaborative master undergraduate students, having nevertheless a limited mathematical background. Overall this text is a…

2019-07-24abs ↗pdf ↗

The complex networks approach has been gaining popularity in analysing investor behaviour and stock markets, but within this approach, initial public offerings (IPO) have barely been explored. We fill this gap in the literature by analysing investor clusters in the first two years after the IPO filing in the Helsinki S…

2019-05-31abs ↗pdf ↗

While deep learning is remarkably successful on perceptual tasks, it was also shown to be vulnerable to adversarial perturbations of the input. These perturbations denote noise added to the input that was generated specifically to fool the system while being quasi-imperceptible for humans. More severely, there even exi…

2017-04-19abs ↗pdf ↗

We describe tests validating progress made toward acceleration and automation of hydrodynamic codes in the regime of developed turbulence by three Deep Learning (DL) Neural Network (NN) schemes trained on Direct Numerical Simulations of turbulence. Even the bare DL solutions, which do not take into account any physics …

2018-10-16abs ↗pdf ↗

We introduce a matrix representation of a chord on a tangle which leads us to representing tangle chord diagrams as stacks of matrices that we call books. We show that band sum moves, Reidemeister moves as well as orientation changes are implemented on \widetilde{Z}_f - a framed link invariant constructed from the Kont…

2010-10-14abs ↗pdf ↗

An intriguing property of deep neural networks is their inherent vulnerability to adversarial inputs, which significantly hinders their application in security-critical domains. Most existing detection methods attempt to use carefully engineered patterns to distinguish adversarial inputs from their genuine counterparts…

2017-12-02abs ↗pdf ↗

XCS constitutes the most deeply investigated classifier system today. It bears strong potentials and comes with inherent capabilities for mastering a variety of different learning tasks. Besides outstanding successes in various classification and regression tasks, XCS also proved very effective in certain multi-step en…

2020-02-13abs ↗pdf ↗

Recent studies have introduced end-to-end TTS, which integrates the production of context and acoustic features in statistical parametric speech synthesis. As a result, a single neural network replaced laborious feature engineering with automated feature learning. However, little is known about what types of context in…

2018-11-04abs ↗pdf ↗

This paper studies universal rates of ERM for binary classification under agnostic learning.

problem The challenge of achieving universal rates of ERM for binary classification under agnostic learning.
method The paper explores the agnostic universal rates of ERM for binary classification, revealing three possible rates: ene^{-n}, o(n1/2)o(n^{-1/2}), or arbitrarily slow.
result The paper provides a complete characterization of which concept classes fall into each of the three categories of agnostic universal rates.

This paper studies the problem of parameter learning in probabilistic graphical models having latent variables, where the standard approach is the expectation maximization algorithm alternating expectation (E) and maximization (M) steps. However, both E and M steps are computationally intractable for high dimensional d…

2016-05-26abs ↗pdf ↗

Neural networks enjoy widespread use, but many aspects of their training, representation, and operation are poorly understood. In particular, our view into the training process is limited, with a single scalar loss being the most common viewport into this high-dimensional, dynamic process. We propose a new window into …

2019-09-03abs ↗pdf ↗