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

Trend · papers per month

1.3%2.6%3.9%5.3% · Nov 199419922001200920172026
48 results for Believer

We outline what we believe are the prerequisites and building-blocks for successfully devising trading models and other financial applications based on a complex systems perspective.

2014-05-23abs ↗pdf ↗

Support vector machines (SVMs) rely on the inherent geometry of a data set to classify training data. Because of this, we believe SVMs are an excellent candidate to guide the development of an analytic feature selection algorithm, as opposed to the more commonly used heuristic methods. We propose a filter-based feature…

2013-04-20abs ↗pdf ↗

We study the set of volumes of constant scalar curvature one metrics on an atoroidal three-manifold.The infinum of this set is believed to be attained at a hyperbolic metric. We prove that the supremum of this set is always infinity. The technique is: minimal surfaces, Thurston norm in homology and new conformal invari…

1994-11-07abs ↗pdf ↗

For n4n\geq 4 we show that generic closed Riemannian nn-manifolds have no nontrivial totally geodesic submanifolds, answering a question of Spivak. An immediate consequence is a severe restriction on the isometry group of a generic Riemannian metric. Both results are widely believed to be true, but we are not aware of…

2017-03-27abs ↗pdf ↗

In a talk at the Cornell Topology Festival in 2005, W. Thurston discussed a graph which we call "The Big Dehn Surgery Graph", B. Here we explore this graph, particularly the link of S^3, and prove facts about the geometry and topology of B. We also investigate some interesting subgraphs and pose what we believe are imp…

2013-11-15abs ↗pdf ↗

We prove conjectures of Rene Thom and Vladimir Arnold for C^2 solutions to the degenerate elliptic equation that is the level set equation for motion by mean curvature. We believe these results are the first instances of a general principle: Solutions of many degenerate equations behave as if they are analytic, even wh…

2017-12-14abs ↗pdf ↗

The Minority Game is a generic model of competing adaptive agents, which is often believed to be a model of financial markets. We discuss to which extend this is a reasonable statement, and present minimal modifications that make this model reproduce stylized facts. The resulting model shows that without speculators, p…

2001-03-01abs ↗pdf ↗

It is commonly believed that increasing the interpretability of a machine learning model may decrease its predictive power. However, inspecting input-output relationships of those models using visual analytics, while treating them as black-box, can help to understand the reasoning behind outcomes without sacrificing pr…

2016-06-17abs ↗pdf ↗

This work improves adaptive sampling for multi-fidelity Gaussian processes by considering cost and uncertainty.

problem Adaptive sampling for multi-fidelity Gaussian processes is computationally demanding and complex.
method The authors extend the design of experiment framework by partitioning prediction uncertainty based on fidelity level and cost, and utilize the Believer concept.
result The proposed framework effectively reduces predictive uncertainty in multi-fidelity Gaussian processes.

We prove a structure theorem for 3-manifolds with non-trivial JSJ-decomposition and 2-generated fundamental group. We deduce a variety of Corollaries. Note this is not a complete classification of such manifolds. In particular we believe that one of the families in our list is empty. If you know something about hyperbo…

2001-11-30abs ↗pdf ↗

Almost forty years ago, C.T.C. Wall systematically analyzed the set of "thickenings" of a finite CW complex. Of the results he obtained, probably the most computationally important is the "suspension theorem," which is an exact sequence relating the n-dimensional thickenings of a finite complex to its (n+1)-dimensional…

2005-02-03abs ↗pdf ↗

One has believed that low energy effective theories of the Higgs branch of gauged linear sigma models correspond to supersymmetric nonlinear sigma models, which have been already investigated by many works. In this paper we discuss a explicit derivation of supersymmetric nonlinear sigma models from gauged linear sigma …

2003-05-09abs ↗pdf ↗

Recent anomaly detection benchmarks are flawed, potentially misleading progress.

problem Flawed benchmark datasets create misleading progress reports.
method Identified four flaws in benchmark datasets and introduced a new archive.
result Published comparisons may be unreliable due to flaws in benchmark datasets.

In this article we develop an explicit formula for pricing European options when the underlying stock price follows a non-linear stochastic differential delay equation (sdde). We believe that the proposed model is sufficiently flexible to fit real market data, and is yet simple enough to allow for a closed-form represe…

2006-04-28abs ↗pdf ↗

Rational loops played a central role in Uhlenbeck's construction of harmonic maps into U(n) (chiral model in physics), and they are generated by simple elements with one pole and one zero constructed from Hermitian projections. It has been believed for long time that nilpotent loops should be added to generate rational…

2018-12-03abs ↗pdf ↗

We present an arbitrage-free non-parametric yield curve prediction model which takes the full (discretized) yield curve as state variable. We believe that absence of arbitrage is an important model feature in case of highly correlated data, as it is the case for interest rates. Furthermore, the model structure allows t…

2012-03-09abs ↗pdf ↗

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently produced by classical systems, it is reasonable to postulate that quantum computers …

2016-11-28abs ↗pdf ↗

Improves deep learning interpretability through logical network construction.

problem Difficulty in understanding and explaining deep neural networks, especially convolution neural networks.
method Proposes a method to construct a logical network based on fully connected layers to improve interpretability.
result Improves the interpretability of deep learning processes and models.

Build accurate DNN models requires training on large labeled, context specific datasets, especially those matching the target scenario. We believe advances in wireless localization, working in unison with cameras, can produce automated annotation of targets on images and videos captured in the wild. Using pedestrian an…

2018-09-22abs ↗pdf ↗

Hodge theory is a beautiful synthesis of geometry, topology, and analysis, which has been developed in the setting of Riemannian manifolds. On the other hand, spaces of images, which are important in the mathematical foundations of vision and pattern recognition, do not fit this framework. This motivates us to develop …

2009-12-01abs ↗pdf ↗

In this work, we describe practical lessons we have learned from successfully using contextual bandits (CBs) to improve key business metrics of the Microsoft Virtual Agent for customer support. While our current use cases focus on single step einforcement learning (RL) and mostly in the domain of natural language proce…

2019-05-06abs ↗pdf ↗

Physicists believe, with some justification, that there should be a correspondence between familiar properties of Newtonian gravity and properties of solutions of the Einstein equations. The Positive Mass Theorem (PMT), first proved over twenty years ago \cite{SchoenYau79b,Witten81}, is a remarkable testament to this f…

2003-04-18abs ↗pdf ↗

We summarize our recent findings, where we proposed a framework for learning a Kolmogorov model, for a collection of binary random variables. More specifically, we derive conditions that link outcomes of specific random variables, and extract valuable relations from the data. We also propose an algorithm for computing …

2018-06-06abs ↗pdf ↗

Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…

2016-06-06abs ↗pdf ↗