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

0.3%0.5%0.8%0.2% · Jan 201919922001200920172026
36 results for PyPI

metric-learn is an open source Python package implementing supervised and weakly-supervised distance metric learning algorithms. As part of scikit-learn-contrib, it provides a unified interface compatible with scikit-learn which allows to easily perform cross-validation, model selection, and pipelining with other machi…

2019-08-13abs ↗pdf ↗

Fast-vollib offers high-performance option pricing and IV computation.

problem Efficiently pricing and computing implied volatility for financial models.
method Open-source Python library with PyTorch, JAX, and CUDA backends, implementing Halley and LBR algorithms.
result High-performance option pricing and IV computation with vectorized implementations.

We introduce GraSPy, a Python library devoted to statistical inference, machine learning, and visualization of random graphs and graph populations. This package provides flexible and easy-to-use algorithms for analyzing and understanding graphs with a scikit-learn compliant API. GraSPy can be downloaded from Python Pac…

2019-03-29abs ↗pdf ↗

Interactive tool helps choose and understand classification metrics.

problem Common metrics for binary classification have limitations.
method Graphical application to visualize and explore evaluation metrics.
result Promotes careful attention to interpretation of metrics.

PyOD is an open-source Python toolbox for performing scalable outlier detection on multivariate data. Uniquely, it provides access to a wide range of outlier detection algorithms, including established outlier ensembles and more recent neural network-based approaches, under a single, well-documented API designed for us…

2019-01-06abs ↗pdf ↗

Model combination, often regarded as a key sub-field of ensemble learning, has been widely used in both academic research and industry applications. To facilitate this process, we propose and implement an easy-to-use Python toolkit, combo, to aggregate models and scores under various scenarios, including classification…

2019-09-21abs ↗pdf ↗

modAL is a modular active learning framework for Python, aimed to make active learning research and practice simpler. Its distinguishing features are (i) clear and modular object oriented design (ii) full compatibility with scikit-learn models and workflows. These features make fast prototyping and easy extensibility p…

2018-05-02abs ↗pdf ↗

Pykg2vec is an open-source Python library for learning the representations of the entities and relations in knowledge graphs. Pykg2vec's flexible and modular software architecture currently implements 16 state-of-the-art knowledge graph embedding algorithms, and is designed to easily incorporate new algorithms. The goa…

2019-06-04abs ↗pdf ↗

XDeep is an open-source Python package developed to interpret deep models for both practitioners and researchers. Overall, XDeep takes a trained deep neural network (DNN) as the input, and generates relevant interpretations as the output with the post-hoc manner. From the functionality perspective, XDeep integrates a w…

2019-11-04abs ↗pdf ↗

We introduce \texttt{pycobra}, a Python library devoted to ensemble learning (regression and classification) and visualisation. Its main assets are the implementation of several ensemble learning algorithms, a flexible and generic interface to compare and blend any existing machine learning algorithm available in Pytho…

2017-04-25abs ↗pdf ↗

PyXAB is a Python library for X-armed bandits and online optimization.

problem Efficiently solving X-armed bandit problems and online blackbox optimization.
method Implementation of 10+ X-armed bandit algorithms and synthetic objectives.
result Evaluation of different algorithms' performance on various synthetic objectives.

skscope simplifies sparsity-constrained optimization in Python.

problem Tedious mathematical deduction and programming for sparsity-constrained optimization.
method Introduces skscope, a Python library that allows users to solve sparsity-constrained optimization problems by just programming the objective function.
result skscope enables state-of-the-art solvers to quickly attain sparse solutions in high-dimensional spaces, achieving up to 80x speedup.

Supervised machine learning methods usually require a large set of labeled examples for model training. However, in many real applications, there are plentiful unlabeled data but limited labeled data; and the acquisition of labels is costly. Active learning (AL) reduces the labeling cost by iteratively selecting the mo…

2019-01-12abs ↗pdf ↗

PyCFRL helps ensure fair reinforcement learning policies from offline data.

problem Ensuring fairness in reinforcement learning policies for disadvantaged groups.
method Sequential data preprocessing to learn counterfactually fair policies.
result PyCFRL implements a novel algorithm for fair RL policy learning.

In the supervised high dimensional settings with a large number of variables and a low number of individuals, one objective is to select the relevant variables and thus to reduce the dimension. That subspace selection is often managed with supervised tools. However, some data can be missing, compromising the validity o…

2019-01-14abs ↗pdf ↗

Python package automates causal parameter estimation using Riesz regression.

problem Efficient estimation of causal and structural parameters.
method Automatic DML and generalized Riesz regression framework.
result Automatic construction of balancing link functions for generalized Riesz regression.

Applications such as weather forecasting and personalized medicine demand models that output calibrated probability estimates---those representative of the true likelihood of a prediction. Most models are not calibrated out of the box but are recalibrated by post-processing model outputs. We find in this work that popu…

2019-09-23abs ↗pdf ↗

GEMSS discovers multiple sparse solutions in high-dimensional data.

problem Identifying multiple sparse feature combinations in high-dimensional, underdetermined systems.
method GEMSS (Gaussian Ensemble for Multiple Sparse Solutions) uses a structured spike-and-slab prior, mixture of Gaussians, and Jaccard-based penalty to optimize a single objective function via stochastic gradient descent.
result GEMSS consistently outperforms five feature selection methods on 128 experiments and real-world datasets.