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

Trend · papers per month

591418 · Sep 201919922001200920182026
48 results for Library

AITuning uses reinforcement learning to optimize communication libraries.

problem Optimizing communication libraries for better performance in parallel applications.
method Deep reinforcement learning applied to tuning communication libraries.
result Demonstrates the effectiveness of reinforcement learning for tuning communication libraries.

TrueLearn Python library for personalized educational recommendations.

problem Building educational recommendation systems with humanly-intuitive user representations.
method Online learning Bayesian models and open learner concept.
result Library includes models and representations for user control and interpretability.

IllinoisSL is a Java library for learning structured prediction models. It supports structured Support Vector Machines and structured Perceptron. The library consists of a core learning module and several applications, which can be executed from command-lines. Documentation is provided to guide users. In Comparison to …

2015-09-23abs ↗pdf ↗

Modified BFGS and LBFGS++ libraries boost performance for non-parallelizable functions.

problem Improving performance of non-parallelizable functions using SIMD and AAD.
method Modifications to BFGS and LBFGS++ libraries, utilizing SIMD and Automatic Differentiation (AAD).
result Up to 3.8 times faster for European Swaption curve calibration and 1.4 times faster for LMM model calibration.

FCL3 learns from multiple representative models to adapt to new tasks.

problem Degradation of performance in lifelong learning models for new task environments.
method Two knowledge libraries: feature learning and model knowledge. Self-selection of representative models for new tasks.
result FCL3 achieves better performance than most lifelong learning frameworks.

L2SC improves spectral clustering performance by selectively transferring knowledge across tasks.

problem L2SC tackles the challenge of incorporating new spectral clustering tasks without relearning all previous tasks.
method L2SC uses an orthogonal basis library and feature embedding library to selectively transfer knowledge from previously learned tasks to new tasks.
result L2SC outperforms state-of-the-art spectral clustering algorithms on real-world benchmark datasets.

Auto-Surprise automates recommender system selection and optimization.

problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.

Pylearn2 is a machine learning research library. This does not just mean that it is a collection of machine learning algorithms that share a common API; it means that it has been designed for flexibility and extensibility in order to facilitate research projects that involve new or unusual use cases. In this paper we g…

2013-08-20abs ↗pdf ↗

Picasso is a new library for sparse learning problems in R and Python.

problem Sparse learning problems in high-dimensional data analysis.
method Unified framework of pathwise coordinate optimization with efficient active set selection strategies.
result picasso can efficiently handle large-scale problems.

CleverHans library standardizes adversarial example construction for machine learning model robustness.

problem Inconsistent benchmarks due to varying implementations of adversarial example construction.
method Provides standardized reference implementations of adversarial example construction techniques and defenses.
result Standardized benchmarks improve comparability and model robustness evaluation.

LibAUC optimizes X-risks for AI tasks like CID, LTR, and CLR.

problem Optimizing risk functions in AI for tasks like classification, ranking, and representation learning.
method Developed a new mini-batch pipeline for deep X-risk optimization (DXO) algorithms.
result Achieved great success in solving CID, LTR, and CLR tasks with faster convergence and scalable performance.

Robots learn movement libraries by segmenting complex trajectories.

problem Segmenting complex robot movement demonstrations for library building.
method Model trajectories as Switching Linear Dynamical Systems and infer segmentation using a nonparametric Bayesian approach.
result Robots can learn movement libraries more effectively by segmenting demonstrations.

FedML aims to improve FL research by providing a library and benchmark.

problem Inconsistent FL algorithm development and performance comparison.
method FedML offers an open research library and benchmark supporting diverse computing paradigms and flexible API design.
result FedML facilitates fair algorithm comparison and development in federated learning.

UncertaintyPlayground simplifies uncertainty estimation in Python.

problem Uncertainty estimation in supervised learning tasks.
method Sparse and Variational Gaussian Process Regressions for normally distributed outcomes, Mixed Density Networks for mixed distributions.
result Fast and simplified uncertainty estimation through Python library.

PettingZoo library accelerates multi-agent reinforcement learning research.

problem Challenges in multi-agent reinforcement learning, especially conceptual models of games.
method Developed PettingZoo library with AEC games model to address multi-agent reinforcement learning challenges.
result AEC games model addresses conceptual issues in multi-agent reinforcement learning environments.

ParaMonte simplifies Monte Carlo simulations for various scientific fields.

problem Efficiently performing Monte Carlo simulations for complex models.
method Unified, high-performance, parallelized library for C, C++, Fortran.
result Automates and streamlines Monte Carlo sampling for arbitrary-dimensional functions.

Library learns Bayesian networks from mixed data without discretization.

problem Learning Bayesian networks from mixed data (discrete and continuous variables).
method Proposes an algorithm for structural and parameter learning of Bayesian networks from mixed data using a mixed MI score function and Gaussian approximation. Offers two graph structure enumeration algorithms.
result Advantages in solving approximation and gap recovery problems on synthetic and real datasets.