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 · Jun 202019922001200920172026
44 results for Jupyter Notebooks

Model learns code representations from comments for data analysis tasks.

problem Lack of descriptive labels for analyzing large code corpora.
method Weakly supervised transformer architecture for joint code and comment representation.
result Model achieves 38% accuracy increase over expert-supplied heuristics.

Bayesian Matrix Factorization (BMF) is a powerful technique for recommender systems because it produces good results and is relatively robust against overfitting. Yet BMF is more computationally intensive and thus more challenging to implement for large datasets. In this work we present SMURFF a high-performance featur…

2019-04-04abs ↗pdf ↗

We present MOGPTK, a Python package for multi-channel data modelling using Gaussian processes (GP). The aim of this toolkit is to make multi-output GP (MOGP) models accessible to researchers, data scientists, and practitioners alike. MOGPTK uses a Python front-end, relies on the GPflow suite and is built on a TensorFlo…

2020-02-09abs ↗pdf ↗

Object detection is a computer vision field that has applications in several contexts ranging from biomedicine and agriculture to security. In the last years, several deep learning techniques have greatly improved object detection models. Among those techniques, we can highlight the YOLO approach, that allows the const…

2018-09-06abs ↗pdf ↗

Machine Learning (ML) is one of the most exciting and dynamic areas of modern research and application. The purpose of this review is to provide an introduction to the core concepts and tools of machine learning in a manner easily understood and intuitive to physicists. The review begins by covering fundamental concept…

2018-03-23abs ↗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 ↗

This tutorial introduces quantum computing for financial portfolio optimization.

problem Combinatorial portfolio optimization in financial markets.
method Application of Quantum Approximate Optimization Algorithm (QAOA) to portfolio optimization.
result Quality of combinatorial portfolio optimization solutions using QAOA on quantum simulator.

Today, the prominence of data science within organizations has given rise to teams of data science workers collaborating on extracting insights from data, as opposed to individual data scientists working alone. However, we still lack a deep understanding of how data science workers collaborate in practice. In this work…

2020-01-18abs ↗pdf ↗

We present apricot, an open source Python package for selecting representative subsets from large data sets using submodular optimization. The package implements an efficient greedy selection algorithm that offers strong theoretical guarantees on the quality of the selected set. Two submodular set functions are impleme…

2019-06-08abs ↗pdf ↗

Conformal prediction provides distribution-free uncertainty quantification for black-box models.

problem Uncertainty quantification for high-risk machine learning applications.
method Conformal prediction creates valid uncertainty sets without distributional assumptions.
result Sets contain the ground truth with a specified probability, e.g., 90%.

This paper examines autocorrelation in major crypto markets, finding persistent correlations on short time frames.

problem Assessing the efficiency of major cryptocurrency markets through autocorrelation analysis.
method Pearson's autocorrelation coefficient, Ljung-Box test, rolling window analysis.
result Persistent autocorrelation on 5m and 1H time frames, disagreement on 1D and 1W time frames.

Building and expanding on principles of statistics, machine learning, and scientific inquiry, we propose the predictability, computability, and stability (PCS) framework for veridical data science. Our framework, comprised of both a workflow and documentation, aims to provide responsible, reliable, reproducible, and tr…

2019-01-23abs ↗pdf ↗

Classification algorithms aim to predict an unknown label (e.g., a quality class) for a new instance (e.g., a product). Therefore, training samples (instances and labels) are used to deduct classification hypotheses. Often, it is relatively easy to capture instances but the acquisition of the corresponding labels remai…

2019-01-29abs ↗pdf ↗

We propose a method to visualize class similarity in large-scale classifiers.

problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.

Data visualization and interaction with large data sets is known to be essential and critical in many businesses today, and the same applies to research and teaching, in this case, when exploring large and complex mathematical objects. GAP is a computer algebra system for computational discrete algebra with an emphasis…

2018-06-19abs ↗pdf ↗

We propose a method to classify the causal relationship between two discrete variables given only the joint distribution of the variables, acknowledging that the method is subject to an inherent baseline error. We assume that the causal system is acyclicity, but we do allow for hidden common causes. Our algorithm presu…

2016-11-04abs ↗pdf ↗

Neural Tangents is a library designed to enable research into infinite-width neural networks. It provides a high-level API for specifying complex and hierarchical neural network architectures. These networks can then be trained and evaluated either at finite-width as usual or in their infinite-width limit. Infinite-wid…

2019-12-05abs ↗pdf ↗

ALICE combines feature selection and inter-rater agreeability for ML model insights.

problem Improving interpretability of black box machine learning models.
method Integrates feature selection and inter-rater agreeability into a user-friendly Python library.
result Initial experiments on customer churn modeling show promising insights.

The challenge of assigning importance to individual neurons in a network is of interest when interpreting deep learning models. In recent work, Dhamdhere et al. proposed Total Conductance, a "natural refinement of Integrated Gradients" for attributing importance to internal neurons. Unfortunately, the authors found tha…

2018-07-26abs ↗pdf ↗

FinRL-Meta offers market environments and benchmarks for financial reinforcement learning.

problem Challenges in creating high-quality market environments and benchmarks for financial reinforcement learning.
method DataOps paradigm, automatic pipeline, community-wise competitions, Jupyter/Python demos.
result Openly accessible FinRL-Meta library for data-driven financial reinforcement learning.

This paper reviews hyperparameter optimization methods and best practices.

problem Finding optimal hyperparameters for machine learning models.
method Various hyperparameter optimization methods are reviewed, including grid search, random search, evolutionary algorithms, Bayesian optimization, Hyperband, and racing.
result Practical recommendations for conducting hyperparameter optimization are provided.

SLEM uses machine learning to improve causal inference from observational data.

problem Improving causal inference from observational data using non-linear relationships.
method Super Learner Equation Modeling integrating machine learning ensembles.
result SLEM provides consistent and unbiased estimates of causal effects.

A longstanding goal in the theory of deep learning is to characterize the conditions under which a given neural network architecture will be trainable, and if so, how well it might generalize to unseen data. In this work, we provide such a characterization in the limit of very wide and very deep networks, for which the…

2019-12-30abs ↗pdf ↗

Adversarial Robustness Toolbox (ART) is a Python library supporting developers and researchers in defending Machine Learning models (Deep Neural Networks, Gradient Boosted Decision Trees, Support Vector Machines, Random Forests, Logistic Regression, Gaussian Processes, Decision Trees, Scikit-learn Pipelines, etc.) agai…

2018-07-03abs ↗pdf ↗

Accessibility is a major challenge of machine learning (ML). Typical ML models are built by specialists and require specialized hardware/software as well as ML experience to validate. This makes it challenging for non-technical collaborators and endpoint users (e.g. physicians) to easily provide feedback on model devel…

2019-06-06abs ↗pdf ↗

The recent success of machine learning (ML) has led to an explosive growth both in terms of new systems and algorithms built in industry and academia, and new applications built by an ever-growing community of data science (DS) practitioners. This quickly shifting panorama of technologies and applications is challengin…

2019-12-19abs ↗pdf ↗

Reactmine infers chemical reactions from time series data, overcoming sparse model limitations.

problem Inferring chemical reaction networks from time series data, especially when initial conditions are not varied.
method Sequential reaction inference in a search tree, ranking and re-optimizing kinetics.
result Reactmine successfully infers preponderant regulations in real datasets, matching model-based analyses.

New data-driven Cartan connection tracks complex vascular structures.

problem Tracking complex vascular structures in multi-orientation images.
method Formulated a data-driven Cartan connection on M2\mathbb{M}_2 for geodesic tracking.
result Improved geodesic tracking of vascular trees with globally optimal curves.

Deep nets trained with MSE loss exhibit Neural Collapse, collapsing features and classifiers to class means.

problem Understanding Neural Collapse in MSE-trained deep nets.
method Developed a new MSE loss decomposition and introduced the central path concept.
result Exact dynamics of Neural Collapse along the central path can be predicted.