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

Trend · papers per month

1234 · Sep 201819922001200920172026
48 results for qualifiers

The paper addresses fairness issues in screening classifiers, proposing within-group monotonicity to avoid unfair treatment of qualified candidates.

problem Within-group unfairness in screening classifiers using calibrated models.
method Introducing within-group monotonicity as a property to avoid unfair treatment and developing an efficient post-processing algorithm based on dynamic programming.
result Within-group monotonicity can be achieved efficiently and often at a small cost, improving fairness without significantly compromising prediction accuracy.

These are notes on seminal work of Freed, and subsequent developments, on the curvature properties of (Sobolev Lie) groups of maps from a Riemannian manifold into a compact Lie group. We are mainly interested in critical cases which are relevant to quantum field theory. For example Freed showed that, in a necessarily q…

2017-10-03abs ↗pdf ↗

This article describes and explores taxes and debt in finance. Here a situation is thought about, where tax payments would qualify to be considered as debt. Using this principle we can infer that it is possible to create and price a type of bond (Tax Normalization Guarantee) for companies, which would allow them to ent…

2015-05-14abs ↗pdf ↗

Following the programme set out in Part I of this work, we develop a conceptual higher order differential calculus. The '' local linear algebra '' defined in Part I is generalized by '' higher order local linear algebra ''. The underlying combinatorial object of such higher algebra is the natural n-dimensional hyper-cu…

2015-10-12abs ↗pdf ↗

The Tangent Works team participated in GEFCom 2017 to test its automatic model building strategy for time series known as Tangent Information Modeller (TIM). Model building using TIM combined with historical temperature shuffling resulted in winning the competition. This strategy involved one remaining degree of freedo…

2019-04-12abs ↗pdf ↗

Many (but not all) approaches self-qualifying as "meta-learning" in deep learning and reinforcement learning fit a common pattern of approximating the solution to a nested optimization problem. In this paper, we give a formalization of this shared pattern, which we call GIMLI, prove its general requirements, and derive…

2019-10-03abs ↗pdf ↗

Skin cancer is a major public health problem around the world. Its early detection is very important to increase patient prognostics. However, the lack of qualified professionals and medical instruments are significant issues in this field. In this context, over the past few years, deep learning models applied to autom…

2019-12-06abs ↗pdf ↗
Critical Crashescond-mat.stat-mech

We argue that the word ``critical'' in the title is not purely literary. Based on our and other previous work on nonlinear complex dynamical systems, we summarize present evidence, on the Oct. 1929, Oct. 1987, Oct. 1987 Hong-Kong, Aug. 1998 global market events and on the 1985 Forex event, for the hypothesis advanced f…

1999-01-06abs ↗pdf ↗

In the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654), published in 2001, we studied the linearizability problem for 3-webs on a 2-dimensional manifold. Four years after the publication of our article, V.V.Goldberg and V.V.Lychagin in the paper "On linearization of planar three-…

2006-02-23abs ↗pdf ↗

Calls to arms to build interpretable models express a well-founded discomfort with machine learning. Should a software agent that does not even know what a loan is decide who qualifies for one? Indeed, we ought to be cautious about injecting machine learning (or anything else, for that matter) into applications where t…

2017-11-20abs ↗pdf ↗

The rate at which medical questions are asked online far exceeds the capacity of qualified people to answer them, and many of these questions are not unique. Identifying same-question pairs could enable questions to be answered more effectively. While many research efforts have focused on the problem of general questio…

2019-10-09abs ↗pdf ↗

The Cheap Gradient Principle (Griewank 2008) --- the computational cost of computing the gradient of a scalar-valued function is nearly the same (often within a factor of 55) as that of simply computing the function itself --- is of central importance in optimization; it allows us to quickly obtain (high dimensional) …

2018-09-23abs ↗pdf ↗

The paper explores geometric finiteness in mapping class groups and constructs new examples of these subgroups.

problem Understanding geometric finiteness in mapping class groups and constructing new examples.
method Examined several constructions of subgroups and determined conditions for geometric finiteness.
result Provides new examples of parabolically geometrically finite and reducibly geometrically finite subgroups.

We study several aspects of the so-called low-vol and low-beta anomalies, some already documented (such as the universality of the effect over different geographical zones), others hitherto not clearly discussed in the literature. Our most significant message is that the low-vol anomaly is the result of two independent…

2015-10-06abs ↗pdf ↗

State-of-the-art learning algorithms, such as random forests or neural networks, are often qualified as "black-boxes" because of the high number and complexity of operations involved in their prediction mechanism. This lack of interpretability is a strong limitation for applications involving critical decisions, typica…

2019-08-19abs ↗pdf ↗

Machine learning qualifies computers to assimilate with data, without being solely programmed [1, 2]. Machine learning can be classified as supervised and unsupervised learning. In supervised learning, computers learn an objective that portrays an input to an output hinged on training input-output pairs [3]. Most effic…

2018-09-17abs ↗pdf ↗

This research assesses uncertainty quantification and sensitivity analysis for DTs in nuclear fuel performance.

problem Understanding the reliability and performance of advanced nuclear fuels using DTs.
method Introduces ML-based uncertainty quantification and sensitivity analysis methods applied to BISON fuel performance code.
result Demonstrates the effectiveness of DTs in multi-criteria decision-making for nuclear fuel performance.

We consider the problem of demixing a sequence of source signals from the sum of noisy bilinear measurements. It is a generalized mathematical model for blind demixing with blind deconvolution, which is prevalent across the areas of dictionary learning, image processing, and communications. However, state-of- the-art c…

2018-09-18abs ↗pdf ↗

Introduces privilege scores to measure and interpret protected attribute-related privilege in machine learning models.

problem Lack of explicit formulation of non-neutrality in fairness-aware machine learning methods.
method Privilege scores (PS) and privilege score contributions (PSCs) to measure and interpret protected attribute-related privilege.
result Demonstrates the broad applicability of PS and PSCs in gender and racial privilege in mortgage and college admissions applications.

This work shows how evaluation metrics can be seen as fair gambles.

problem The relationship and evaluation of machine learning forecasts.
method Using game-theoretic probability, the authors show evaluation metrics as fair gambles.
result Standard evaluation metrics are fair gambler outcomes, with calibration and regret metrics on two dimensions.

Optimal design portfolios improve energy efficiency and reduce risk in uncertain reservoirs.

problem Uncertain reservoir conditions lead to unstable gas recovery and low resource efficiency.
method Developed optimal portfolios of well designs based on reservoir conditions and probabilities.
result Remarkable reduction in variation and substantial increase in energy efficiency achieved.

Study binary hypothesis testing with privacy and communication constraints.

problem Binary hypothesis testing under local differential privacy and communication constraints.
method Qualifies results as minimax or instance optimal, develops instance-optimal algorithms.
result Achieves minimum possible sample complexity under both privacy and communication constraints.

Study aims to optimize financial investments by balancing risk and reward efficiently.

problem Balancing risk and reward in dynamic financial investments.
method Proposes a reinforcement learning method to maximize expected quadratic utility, focusing on first and second moments of rewards.
result The proposed method yields MV-efficient policies that maximize expected reward without increasing variance.