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

3977116154 · Jun 202019922001200920172026
48 results for AIME

The basic financial purpose of a firm is to maximize its value. An inventory management system should also contribute to realization of this basic aim. Many current asset management models currently found in financial management literature were constructed with the assumption of book profit maximization as basic aim. H…

2013-01-16abs ↗pdf ↗

The first aim of this paper is to define the dual timelike Mannheim partner curves in Dual Lorentzian Space D3 1, the second aim of this paper is to obtain the relationships between the curvatures and the torsions of the dual timelike Mannheim partner curves with respect to each other and the final aim of this paper is…

2011-11-14abs ↗pdf ↗

The first aim of this paper is to define the dual timelike - spacelike Mannheim partner curves in Dual Lorentzian Space ID3 1, the second aim of this paper is to obtain the relationships between the curvatures and the torsions of the dual timelike - spacelike Mannheim partner curves with respect to each other and the f…

2011-11-04abs ↗pdf ↗

This survey aims to cover the motivation for and history of the study of local rigidity of group actions. There is a particularly detailed discussion of recent results, including outlines of some proofs. The article ends with a large number of conjectures and open questions and aims to point to interesting directions f…

2005-07-21abs ↗pdf ↗

An investor is estimating net present value of a firm project and performs risk analysis. Usually it is created portfolio hierarchies and make comparison of variants of project based on these hierarchies. Then one finds that portfolio which corresponds to the particular needs of individual groups within the firm. We ha…

2005-09-13abs ↗pdf ↗

New adaptive stepsize method for stochastic approximation converges to target point.

problem Finding optimal step sizes for stochastic approximation algorithms.
method Adaptive block-coordinate stepsizes using online estimates of second moment.
result New method converges almost surely to a small neighborhood of the target point.

The writhe polynomial is a fundamental invariant of an oriented virtual knot. We introduce a kind of local moves for oriented virtual knots called shell moves. The first aim of this paper is to prove that two oriented virtual knots have the same writhe polynomial if and only if they are related by a finite sequence of …

2019-05-09abs ↗pdf ↗

The paper studies binary classification and aims at estimating the underlying regression function which is the conditional expectation of the class labels given the inputs. The regression function is the key component of the Bayes optimal classifier, moreover, besides providing optimal predictions, it can also assess t…

2019-03-23abs ↗pdf ↗

MarkerMap selects key genes for cell type analysis in single-cell RNA-seq.

problem Selecting informative genes from large single-cell RNA-seq datasets is challenging and computationally intensive.
method MarkerMap is a generative model that identifies minimal gene sets explaining cell type variability.
result MarkerMap outperforms existing methods in both supervised and unsupervised marker selection.

Contextual bandits are online learners that, given an input, select an arm and receive a reward for that arm. They use the reward as a learning signal and aim to maximize the total reward over the inputs. Contextual bandits are commonly used to solve recommendation or ranking problems. This paper considers a learning s…

2019-10-11abs ↗pdf ↗

A new criterion for deep active learning selects minimal labeled data points.

problem Efficiently select minimal labeled data points for deep neural networks.
method Diffuses label information over a graph of data representations to switch between exploration and refinement.
result The diffusion-based criterion outperforms existing methods in deep active learning.

The abstract aims to generalize classical curve concepts to uniquely define complex curves.

problem Lack of sufficient information to distinguish between different curves.
method Generalizing classical concepts of curvature and torsion to higher algebraic curvatures.
result Each analytic branch of a complex curve is uniquely defined by higher algebraic curvatures.

A new causal discovery method, Structural Agnostic Modeling (SAM), is presented in this paper. Leveraging both conditional independencies and distributional asymmetries, SAM aims to find the underlying causal structure from observational data. The approach is based on a game between different players estimating each va…

2018-03-13abs ↗pdf ↗

We propose minimum regret search (MRS), a novel acquisition function for Bayesian optimization. MRS bears similarities with information-theoretic approaches such as entropy search (ES). However, while ES aims in each query at maximizing the information gain with respect to the global maximum, MRS aims at minimizing the…

2016-02-02abs ↗pdf ↗

We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pass basic sanity checks: they fail when irrelevant variables are …

2018-06-18abs ↗pdf ↗

Predicting flood for any location at times of extreme storms is a longstanding problem that has utmost importance in emergency management. Conventional methods that aim to predict water levels in streams use advanced hydrological models still lack of giving accurate forecasts everywhere. This study aims to explore arti…

2019-02-06abs ↗pdf ↗

The aim of this paper is to classify bi-Hermitian compact surfaces (M,g)(M,g) whose Ricci tensor ρρ satisfies the relation Xρ(X,X)=13Xτg(X,X)\nabla_Xρ(X,X) =\frac13Xτg(X,X).

2008-01-12abs ↗pdf ↗

Smart Close-out Netting aims to automate close-out netting processes.

problem Inefficiencies in close-out netting processes for financial institutions.
method Standardisation and automation of legal and regulatory processes using a data-driven framework and controlled natural language.
result Standardisation and automation can improve close-out netting processes for prudentially regulated financial institutions.