IllinoisSL is a Java library for structured prediction models.
problem Developing efficient and easy-to-use tools for structured prediction.
method Support Vector Machines and Perceptron integration, core learning module, command-line applications, documentation.
result Efficiency, generality, and ease of use compared to other libraries.
Tribuo integrates ML models with provenance in Java.
problem Tracking and ensuring ML models behave appropriately as they grow in number and complexity.
method Integrates model training, inference, type-safety, runtime checking, and automatic provenance recording into a single Java library.
result Automatic recording of full processing pipeline and training details inside the model object.
Import2vec creates embeddings for software libraries to improve learning tasks.
problem Developing semantic representations for software libraries.
method Applied word embedding techniques from NLP to library packages.
result Library vectors capture meaningful relationships among libraries.
Python library for causal discovery from observational data.
problem Revealing causal relations from observational data.
method Comprehensive collection of causal discovery methods in Python.
result Ease of use for non-specialists and modular building blocks for developers.
The paper parallelizes PGM algorithms on multi-core CPUs using Java 8.
problem Efficient parallel processing of probabilistic graphical models on multi-core CPUs.
method Development of parallel algorithms using Java 8 features, focusing on data structures and batch processing.
result Demonstrated the merits of the proposed parallel algorithms through experimental analysis.
jLDADMM offers Java tools for topic modeling on texts.
problem Topic modeling on texts, especially short texts.
method Collaborated Gibbs sampling for LDA and DMM models.
result Alternative topic modeling solutions for normal or short texts.
Improves code2vec for Java classes by obfuscating variable names.
problem Code2vec's reliance on variable names makes it vulnerable to typos and attacks.
method Obfuscate variable names during code2vec training and aggregate method embeddings for class-level predictions.
result Obfuscated variable names improve model's robustness and accuracy.
AMIDST is a Java toolkit for scalable probabilistic machine learning.
problem Scalable probabilistic machine learning for massive streaming data.
method Flexible modeling language, parallel/distributed Bayesian learning algorithms, variational message passing.
result Supports a wide range of probability distributions and interfaces with various software tools.
UniFeat is an open-source Java tool for feature selection.
problem Efficient feature selection in various research areas.
method Provides a set of advanced feature selection methods.
result Facilitates rapid development of new feature selection algorithms.
OpenML provides standardized machine learning benchmarks.
problem Objective, comparable, reproducible benchmarks for machine learning.
method Curated benchmarking suites with standardized data formats and APIs.
result OpenML-CC18 benchmark suite for classification.
We introduce a novel implementation in ANSI C of the MINE family of algorithms for computing maximal information-based measures of dependence between two variables in large datasets, with the aim of a low memory footprint and ease of integration within bioinformatics pipelines. We provide the libraries minerva (with th…
While developing their software, professional object-oriented (OO) software developers keep in their minds an image of the subtyping relation between types in their software. The goal of this paper is to present an observation about the graph of the subtyping relation in Java, namely the observation that, after the add…
Java implementation improves nearest neighbor algorithm complexity.
problem Improving efficiency of nearest neighbor descent algorithm.
method Parallel streams implementation with statistical termination criterion.
result Complexity up to O(nK2logK(n)) for K-nearest neighbors. ELKI 0.7.5 enhances data mining with R*-tree and open-source algorithms.
problem Improving data mining algorithms and performance.
method R*-tree index structures for high performance and scalability.
result Enhanced performance and scalability in cluster analysis and outlier detection.
LAGE is a systematic framework developed in Java. The motivation of LAGE is to provide a scalable and parallel solution to reconstruct Gene Regulatory Networks (GRNs) from continuous gene expression data for very large amount of genes. The basic idea of our framework is motivated by the philosophy of divideand-conquer.…
This paper automates multi-label classification using an extended AutoML tool.
problem Lack of automated solutions for multi-label classification.
method Extends ML-Plan for multi-class classification to multi-label classification using MEKA.
result The proposed approach yields superb results and performs significantly better than baselines.
Bäcklund transformations for smooth and ``space discrete'' Hashimoto surfaces are discussed and a geometric interpretation is given. It is shown that the complex curvature of a discrete space curve evolves with the discrete nonlinear Schrödinger equation (NLSE) of Ablowitz and Ladik, when the curve evolves with the Has…
SLM models code syntax as trees to generate any programming language code.
problem Generating any piece of code in a given language without restrictions.
method Structural language modeling (SLM) decomposes code into ASTs and estimates probabilities over nodes.
result SLM model generates arbitrary code in any language, outperforming previous methods.
CSLVAE generates large chemical libraries efficiently.
problem Navigating ultra-large combinatorial synthesis libraries.
method Hierarchically-organized database with molecular encoder and decoder.
result Generates valid molecular graphs without autoregression.
MILJS is a collection of state-of-the-art, platform-independent, scalable, fast JavaScript libraries for matrix calculation and machine learning. Our core library offering a matrix calculation is called Sushi, which exhibits far better performance than any other leading machine learning libraries written in JavaScript.…
Bestvina and Handel have found an effective algorithm that determines whether a given homeomorphism of an orientable, possibly punctured surface is pseudo-Anosov. We present a software package in Java that realizes this algorithm for surfaces with one puncture. Moreover, the package allows the user to define homeomorph…
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.
MRCpy implements minimax risk classifiers with performance guarantees and distribution shift adaptability.
problem Classical risk minimization approaches are not robust to distribution shifts.
method Robust risk minimization approach for minimax risk classifiers.
result MRCs provide performance guarantees and adapt to distribution shifts.
Study analyzes tweets from Northeastern libraries to understand public relations efforts.
problem Analyzing vast social media data for public relations.
method Computational methods to extract and analyze tweets.
result Libraries use Twitter to represent services and disseminate information.
LIBTwinSVM offers a free library for efficient Twin Support Vector Machines.
problem Large-scale classification problems.
method Efficient implementation of Twin Support Vector Machines.
result Effectiveness demonstrated through benchmarks.
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.
Fast and flexible library for Bayesian optimization.
problem Optimizing expensive, gradient-less functions.
method Highly flexible and fast C++11 library.
result 2 times faster than BayesOpt for similar accuracy.
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.
Automatically extracts hyperparameter schemas from AI library documentation.
problem Lack of machine-readable hyperparameter schemas for AI automation tools.
method Automatically mines Python docstrings in AI libraries to extract JSON Schemas.
result Effective at extracting machine-readable schemas from 119 AI models.
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.
Python library for conformal prediction, licensed under MIT.
problem Improving prediction accuracy with uncertainty quantification.
method Conformal prediction framework implemented in Python.
result Stable API and algorithms for conformal prediction.
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.
BayesDLL offers a PyTorch library for Bayesian deep learning with large models.
problem Bayesian inference for large-scale deep networks.
method Variational inference, MC-dropout, stochastic-gradient MCMC, Laplace approximation.
result BayesDLL can handle Vision Transformers and pre-trained model weights as priors.
This study analyzes Twitter posts from US west coast libraries.
problem Lack of automated methods to analyze thousands of library tweets.
method Used Twitter API to collect and analyze 138,000 tweets.
result Identified 20 topics in library tweets, categorized into public relations, book, event, training, and social good.
Kernelmethods library simplifies kernel-based ML in Python.
problem Lack of a well-defined Python library for kernel-based ML.
method Develops a Python library that supports various kernel types and customizations.
result Enables efficient, modular, and interoperable kernel-based operations.
SOL is a scalable library for online learning algorithms.
problem Scalable online learning for high-dimensional data.
method Family of regular and sparse online learning algorithms implemented in C++.
result High efficiency and scalability for large-scale machine learning.
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…
Captum library simplifies model interpretability for PyTorch.
problem Improving model interpretability for various PyTorch models.
method Unified, open-source library with generic attribution algorithms and metrics.
result Unified and scalable model interpretability for multimodal inputs.
Disentanglement-PyTorch library facilitates disentangled representation learning.
problem Unsupervised learning of disentangled representations.
method Modular library for variational algorithms, decoupling architectures, latent space, and training algorithms.
result Achieved 3rd rank in NeurIPS 2019 Disentanglement Challenge.
Software automates metabolomics data analysis for reproducible results.
problem Automating reproducible metabolomics data analysis.
method Object-oriented software engineering, Java, XML database, GUI, version control system.
result MeKDDaM-SAGA successfully guides metabolomics applications.
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.
Python library for boosting statistical relational models.
problem Expressing learning and inference problems in statistical relational models.
method Adapting scikit-learn interface for boosted statistical relational models.
result Provides examples for using srlearn.
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.
DLOPT simplifies deep learning hyper-parameter optimization.
problem Finding optimal network configurations in deep learning.
method Introduces a novel library for hyper-parameter optimization.
result Demonstrates effectiveness through use examples.
abess efficiently solves various machine learning problems quickly.
problem Efficiently solving diverse machine learning problems.
method Unified framework of best-subset selection, polynomial time optimal solution.
result Certifiably gets the optimal solution within polynomial times with high probability.
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.
DeepRobust is a PyTorch library for adversarial attacks and defenses.
problem Addressing adversarial attacks and defenses in deep learning.
method Contains over 20 attack and defense algorithms for various deep learning architectures.
result Fosters research in adversarial learning with comprehensive and easy-to-use platform.