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

Trend · papers per month

70140210280 · May 202619922001200920172026
48 results for Fruit Yield

For Portugal there are few or none works about the international trade of fruits between Portugal and the other countries. In this work it aims to analyze the more recent data for the Portuguese international trade of fruits. They were used data for the years from 2006 to 2010, available by the INE (Statistics Portugal…

2012-06-15abs ↗pdf ↗

A new method extracts features from time series data using iterated sums and improves classification accuracy.

problem Time series classification challenges.
method Feature extraction using iterated-sums signature (ISS) followed by a linear classifier.
result Competitive with state-of-the-art methods on UCR archive.

The paper connects disentanglement to manifold charts and commutativity.

problem Discovering local charts of the data manifold for disentanglement.
method Interpreting disentanglement as local charts of the data manifold and studying commutativity.
result Commutativity is a central property in disentanglement, as shown in manifold, group theoretic, and probabilistic frameworks.

The study examines lower and upper bounds of Wasserstein distances for affine transformations of random vectors.

problem Understanding Wasserstein distances for affine transformations of random vectors.
method Lower and upper bounds for affine transformations of random vectors in Rn\mathbb{R}^n are derived using Bures metric and compositions of affine maps.
result Concrete lower bounds and upper bounds for affine transformations are derived and applied to various distributions.

The paper derives Chen-Ricci inequalities for Riemannian submersions and maps.

problem Chen-Ricci inequalities for Riemannian submersions and maps.
method General forms of Chen-Ricci inequalities for Riemannian submersions and maps are derived, involving curvatures of subspaces.
result New, easy, and elegant techniques for Chen-Ricci inequalities are established.

Binary autoencoder with sparse hidden layer preserves information and zero reconstruction error.

problem Preserving information and zero reconstruction error in binary neural networks.
method Binary autoencoder with random binary weights, sparse hidden layer, and varying neuron thresholds.
result Zero reconstruction error for any input with a large hidden layer and varying neuron thresholds.

Submanifold theory is a very active vast research field which plays an important role in the development of modern differential geometry. This branch of differential geometry is still so far from being exhausted; only a small portion of an exceedingly fruitful field has been cultivated, much more remains to be discover…

2013-07-07abs ↗pdf ↗

Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the references therein). In the last decade, a theory of "high dimensional expanders" has …

2017-12-07abs ↗pdf ↗

The main subject of this expository paper is a connection between Gromov's filling volumes and a boundary rigidity problem of determining a Riemannian metric in a compact domain by its boundary distance function. A fruitful approach is to represent Riemannian metrics by minimal surfaces in a Banach space and to prove r…

2010-04-14abs ↗pdf ↗

BioHash improves similarity search performance using sparse high-dimensional hash codes.

problem Improving similarity search performance in high-dimensional data.
method BioHash produces sparse high-dimensional hash codes through a data-driven approach based on synaptic plasticity.
result BioHash outperforms previous hashing methods in various similarity search tasks.

This paper introduces a new metric for deep learning networks based on their classification performance.

problem The mystery and black-box nature of deep learning networks.
method Proposes a new distance measure based on the probabilistic performance of deep learning networks.
result The proposed metric space is compact and coincides with the quotient topological space.

Binary classification models get more efficient predictive probabilities.

problem Computing predictive probabilities in Bayesian probit models is computationally challenging.
method Use of expectation propagation (EP) to find a closed-form expression for predictive probabilities.
result Closed-form predictive probabilities improve over existing methods.

Adversarial examples are slight perturbations that are designed to fool artificial neural networks when fed as an input. In this work the usability of the Fisher information for the detection of such adversarial attacks is studied. We discuss various quantities whose computation scales well with the network size, study…

2019-09-12abs ↗pdf ↗

This paper is devoted to a coordinate-free approach to several classic geometries such as hyperbolic (real, complex, quaternionic), elliptic (spherical, Fubini-Study), and lorentzian (de Sitter, anti de Sitter) ones. These geometries carry a certain simple structure that is in some sense stronger than the riemannian st…

2007-02-23abs ↗pdf ↗

Consider the sum of the first NN eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for NN sufficiently large the map is an embedding. In analogy with a fruitful idea of Kähler geometry, we define (Riemannian) Bergman metrics of degree NN to be thos…

2013-10-18abs ↗pdf ↗
Free Lunchq-fin.GN

The concept of absence of opportunities for free lunches is one of the pillars in the economic theory of financial markets. This natural assumption has proved very fruitful and has lead to great mathematical, as well as economical, insights in Quantitative Finance. Formulating rigorously the exact definition of absence…

2010-02-14abs ↗pdf ↗

Twistor methods provide a powerful tool in the study of harmonic maps and harmonic morphisms. Indeed, their use has enabled us to produce a variety of examples of harmonic morphisms defined on 4-dimensional manifolds, and a complete classification in some cases. In the first part of this work, we generalize those const…

2010-03-29abs ↗pdf ↗

We consider tackling a single-agent RL problem by distributing it to nn learners. These learners, called advisors, endeavour to solve the problem from a different focus. Their advice, taking the form of action values, is then communicated to an aggregator, which is in control of the system. We show that the local plan…

2017-04-03abs ↗pdf ↗

The study examines stability of Sobolev inequalities on manifolds with Ricci bounds.

problem Stability of Sobolev inequalities on Riemannian manifolds with Ricci curvature lower bounds.
method Combines techniques from smooth and non-smooth geometry, focusing on direct strategies.
result Effective methods revealed for stability of Sobolev inequalities on manifolds with non-negative Ricci curvature and Euclidean volume growth.

We use two of the most fruitful methods for constructing isospectral manifolds, the Sunada method and the torus action method, to construct manifolds whose Dirichlet-to-Neumann operators are isospectral at all frequencies. The manifolds are also isospectral for the Robin boundary value problem for all choices of Robin …

2018-08-31abs ↗pdf ↗

Early stopping is a well known approach to reduce the time complexity for performing training and model selection of large scale learning machines. On the other hand, memory/space (rather than time) complexity is the main constraint in many applications, and randomized subsampling techniques have been proposed to tackl…

2015-10-19abs ↗pdf ↗

Most animals possess the ability to actuate a vast diversity of movements, ostensibly constrained only by morphology and physics. In practice, however, a frequent assumption in behavioral science is that most of an animal's activities can be described in terms of a small set of stereotyped motifs. Here we introduce a m…

2013-10-16abs ↗pdf ↗

This is an expository article. It discusses an approach to hypoelliptic Fredholm index theory based on noncommutative methods (groupoids, C*-algebras, K-theory). The paper starts with an explicit index theorem for scalar second order differential operators on 3-manifolds that are Fredholm but not elliptic. This low-bro…

2010-01-29abs ↗pdf ↗

Breiman discusses two statistical cultures, advocating for more research on 'before' and 'after' the black box.

problem Statistical modeling lacks exploration of processes before and after the 'black box'.
method Analyzes Breiman's visual metaphor of two statistical cultures.
result Promotes the importance of studying the 'before' and 'after' of data transformations.

Essential to each other, growth and exploration are jointly observed in populations, be it alive such as animals and cells or inanimate such as goods and money. But their ability to move, crucial to cope with uncertainty and optimize returns, is tempered by the space/time properties of the environment. We investigate h…

2017-12-04abs ↗pdf ↗

In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion of torsion generalizes the torsion of acyclic based chain complexes, and is a ch…

2006-08-18abs ↗pdf ↗

The classical theory of prolongation of G-structures was generalized by N. Tanaka to a wide class of geometric structures (Tanaka structures), which are defined on a non-holonomic distribution. Examples of Tanaka structures include subriemannian, subconformal, CR-structures, structures associated to second order differ…

2016-03-02abs ↗pdf ↗

In recent years, ideas from statistics and scientific computing have begun to interact in increasingly sophisticated and fruitful ways with ideas from computer science and the theory of algorithms to aid in the development of improved worst-case algorithms that are useful for large-scale scientific and Internet data an…

2010-10-08abs ↗pdf ↗

We present MILABOT: a deep reinforcement learning chatbot developed by the Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize competition. MILABOT is capable of conversing with humans on popular small talk topics through both speech and text. The system consists of an ensemble of natural langu…

2018-01-20abs ↗pdf ↗

The topological Tverberg conjecture was considered a central unsolved problem of topological combinatorics. The conjecture asserts that for any integers r,d>1r,d>1 and any continuous map f:ΔRdf:Δ\to\mathbb R^d of the (d+1)(r1)(d+1)(r-1)-dimensional simplex there are pairwise disjoint faces σ1,,σrΔσ_1,\ldots,σ_r\subsetΔ such that $f(σ_1)…

2016-05-17abs ↗pdf ↗