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.

169,051 papers · 148 categories

Trend · papers per month

0.9%1.8%2.7%3.6% · Nov 199719922001200920182026
48 results for software packages

The public package registry npm is one of the biggest software registry. With its 216 911 software packages, it forms a big network of software dependencies. In this paper we evaluate various methods for finding similar packages in the npm network, using only the structure of the graph. Namely, we want to find a way of…

2016-02-11abs ↗pdf ↗

Paper proposes algorithms for embedding directed networks with text associated nodes.

problem Learning embeddings for directed networks with text associated nodes.
method PCTADW-1 and PCTADW-2 neural network algorithms.
result Embeddings improve node classification quality on software package dependency networks.

PyTorch Geometric Signed Directed fills the gap for GNNs on signed and directed graphs.

problem Lack of unified software packages for GNNs on signed and directed networks.
method Developed a software package with GNN models, synthetic and real-world data, and evaluation metrics.
result Demonstrates the effectiveness of the implemented methods through experiments.

Software package assesses spherical data distributions and clusters.

problem Assessing and clustering spherical data distributions.
method Innovative goodness-of-fit tests and clustering algorithms using kernel-based quadratic distances.
result Efficient and mathematically sound goodness-of-fit tests for spherical data.

Learning graphical models from data is an important problem with wide applications, ranging from genomics to the social sciences. Nowadays datasets often have upwards of thousands---sometimes tens or hundreds of thousands---of variables and far fewer samples. To meet this challenge, we have developed a new R package ca…

2017-03-11abs ↗pdf ↗

In this short article I introduce the knotR package, which creates two dimensional knot diagrams optimized for visual appearance using the R programming language. The knotR package is a systematic R-centric suite of software for the creation of production-quality artwork of knot diagrams, released under GPL2.

2016-10-11abs ↗pdf ↗

This paper introduces the R package sgmcmc; which can be used for Bayesian inference on problems with large datasets using stochastic gradient Markov chain Monte Carlo (SGMCMC). Traditional Markov chain Monte Carlo (MCMC) methods, such as Metropolis-Hastings, are known to run prohibitively slowly as the dataset size in…

2017-10-02abs ↗pdf ↗

Background and objective: Stacking is an ensemble machine learning method that averages predictions from multiple other algorithms, such as generalized linear models and regression trees. An implementation of stacking, called super learning, has been developed as a general approach to supervised learning and has seen f…

2018-05-21abs ↗pdf ↗

d3p package enables efficient Bayesian inference with differential privacy.

problem Efficiently performing Bayesian inference under differential privacy constraints.
method Differentially private variational inference for flexible probabilistic models.
result Achieves significant speed-up in runtime for complex models.

Software helps finance students construct optimal portfolios using VBA.

problem Finding the best portfolio of assets considering risk and return.
method Two methods: Markowitz and El-Khatib-Hatemi-J, both optimizing risk-adjusted return.
result Software constructs all possible portfolios and helps investors choose the best one.

theft package simplifies feature extraction for time series analysis in R.

problem Lack of a unified access point and methodological pipelines for feature-based time series analysis.
method theft package provides a unified framework for computing features from six open-source time series feature sets.
result theft enables comprehensive quantification and interpretation of time series structure.

reval package selects best clustering solutions via stability-based validation.

problem Challenges in determining best clustering solutions due to lack of validation methods.
method Stability-based relative clustering validation methods.
result Determines best clustering solutions that generalize to unseen data.

Julia package for Gaussian processes offers fast, flexible, and scalable tools.

problem Modeling complex data sources in various sciences and industries.
method Utilizes Julia's computational benefits for fast, flexible, and user-friendly Gaussian processes.
result Fast, scalable, and user-friendly Gaussian processes package for Julia.

TomOpt optimizes muon detector designs using differentiable programming.

problem Designing efficient particle detectors for muon tomography.
method Differentiable programming for muon interaction modeling, inference, and optimisation.
result Demonstrated end-to-end differentiable and inference-aware optimisation of particle physics instruments.

Unified R packages for forecast reconciliation of constrained series.

problem Improving accuracy and coherence of forecasts for linearly constrained multiple time series.
method Classical and machine learning-based linear reconciliation approaches for cross-sectional, temporal, and cross-temporal frameworks.
result Unified toolbox for forecast reconciliation in R.

FuncNN package enables deep learning with functional covariates.

problem Lack of software for deep learning with functional covariates.
method Developed an R package using keras architecture, introducing functions for model building, predictions, and cross-validation.
result First package for deep learning with functional covariates.

Software tool enhances sampling efficiency in neural networks.

problem Efficiently sampling from posterior distributions in machine learning models.
method Ensemble quasi-Newton preconditioning method for Langevin dynamics.
result Significant improvement in sampling efficiency demonstrated.

Automatically explores geometric loci of curves using software networking.

problem Exploring hyperbolisms and geometric loci of plane curves.
method Parametric equations, Groebner bases, and elimination for deriving polynomial equations.
result Derives new constructions of lemniscates and other geometric loci.

Following the seminal idea of Tukey, data depth is a function that measures how close an arbitrary point of the space is located to an implicitly defined center of a data cloud. Having undergone theoretical and computational developments, it is now employed in numerous applications with classification being the most po…

2016-08-14abs ↗pdf ↗

GeometricKernels package implements kernels for uncertain data on graphs, manifolds, and meshes.

problem Defining and computing kernels for structured data on graphs, manifolds, and meshes.
method Implementation of geometric analogs of Euclidean kernels (heat and Matérn) with automatic differentiation support.
result Ability to compute Fourier-feature-type expansions on geometric spaces.