Python tool calculates cobordism maps in Khovanov homology.
problem Computing cobordism maps on Khovanov homology.
method Developed a Python module to calculate these maps.
result Computed cobordism maps for all incompressible Seifert surfaces of prime knots up to 10 crossings.
Automatic differentiation (AD) is an essential primitive for machine learning programming systems. Tangent is a new library that performs AD using source code transformation (SCT) in Python. It takes numeric functions written in a syntactic subset of Python and NumPy as input, and generates new Python functions which c…
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.
Typilus predicts types for Python programs using neural networks.
problem Type inference in dynamically typed languages is challenging.
method Graph neural network model that predicts types by probabilistically reasoning over program structure, names, and patterns.
result Typilus can predict types for 70% of all annotatable symbols and type checks 95% of the predicted types.
Selecting the best policy to keep the balance between what a company holds in cash and what is placed in alternative investments is by no means straightforward. We here introduce PyCaMa, a Python module for multiobjective cash management based on linear programming that allows to derive optimal policies for cash manage…
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.
Python package for functional data analysis.
problem Handling and analysis of functional data.
method Comprehensive tools for representation, preprocessing, and exploratory analysis of functional data.
result Scikit-fda package provides a comprehensive set of tools for functional data analysis.
Pyro is a probabilistic programming language built on Python as a platform for developing advanced probabilistic models in AI research. To scale to large datasets and high-dimensional models, Pyro uses stochastic variational inference algorithms and probability distributions built on top of PyTorch, a modern GPU-accele…
A personalized learning system needs a large pool of items for learners to solve. When working with a large pool of items, it is useful to measure the similarity of items. We outline a general approach to measuring the similarity of items and discuss specific measures for items used in introductory programming. Evaluat…
OGRePy simplifies tensor calculations in general relativity.
problem Complex tensor calculations in general relativity.
method Object-oriented Python package for symbolic tensor calculations.
result Reproduces functionality of Mathematica package OGRe with improvements.
RobPy offers robust statistical methods in Python.
problem Lack of robust statistical methods in Python.
method Built on NumPy, SciPy, and scikit-learn, RobPy includes robust tools for various statistical tasks.
result RobPy enables more users to perform robust data analysis in Python.
Optimal binning method for numeric targets using mathematical programming.
problem Optimizing the discretization of numeric variables for classification.
method Mathematical programming formulation for binary, continuous, and multi-class targets with constraints.
result Convex mixed-integer programming formulations for all target types.
PyTorch combines usability and speed in deep learning.
problem Combining usability and speed in deep learning frameworks.
method Imperative programming style, Pythonic interface, hardware acceleration support.
result PyTorch achieves both usability and high performance.
Python package for fast simulation-based inference.
problem Intractable likelihood functions in Bayesian inference.
method Uses neural networks as surrogate models for Bayesian inference.
result Highly efficient and user-friendly for constructing SBI estimators.
Corrects a mistake in hv-block cross-validation consistency claim.
problem Incorrectly assumed hv-block cross-validation is a BIBD. method Demonstrates hv-block is not a BIBD and reopens consistency question. result Theoretical consistency of hv-block remains unresolved. The study confirms that most positive 2-bridge knots up to 31 crossings do not have chirally cosmetic surgeries.
problem Determining which positive 2-bridge knots up to 31 crossings have chirally cosmetic surgeries.
method Using the obstruction formula from arXiv:2112.03144 and a Python program to compute classical knot invariants.
result Positive 2-bridge knots up to 31 crossings, except (2,2n+1) torus knots, do not admit chirally cosmetic surgeries. Python package for estimating intrinsic dimensionality of datasets.
problem Estimating intrinsic dimensionality for machine learning applications.
method Implementation of various intrinsic dimension estimators in Python.
result Benchmarking of ID estimation methods on real and synthetic data.
The need to efficiently calculate first- and higher-order derivatives of increasingly complex models expressed in Python has stressed or exceeded the capabilities of available tools. In this work, we explore techniques from the field of automatic differentiation (AD) that can give researchers expressive power, performa…
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.
We review the current state of automatic differentiation (AD) for array programming in machine learning (ML), including the different approaches such as operator overloading (OO) and source transformation (ST) used for AD, graph-based intermediate representations for programs, and source languages. Based on these insig…
TorchBeast simplifies RL research in PyTorch.
problem Conducting scalable RL research with minimal programming knowledge.
method Pure-Python and C++ implementation for parallel training; OpenAI Gym interface.
result Performs on-par with IMPALA on Atari.
In this paper we introduce ZhuSuan, a python probabilistic programming library for Bayesian deep learning, which conjoins the complimentary advantages of Bayesian methods and deep learning. ZhuSuan is built upon Tensorflow. Unlike existing deep learning libraries, which are mainly designed for deterministic neural netw…
Model predicts customer churn in financial institutions using neural networks.
problem Manual feature engineering in customer churn prediction.
method Developed a Multi-layer Perceptron model using Artificial Neural Network architecture.
result Artificial Neural Network model achieved comparable performance to Neuro Solution Infinity software.
Python package cegpy models processes with asymmetries.
problem Leveraging CEGs for processes with structural asymmetries.
method Developed cegpy, a Python package for CEGs with Bayesian model selection and probability propagation.
result First CEG package in any language that can model symmetric and asymmetric structures.
Regression is widely used by practioners across many disciplines. We reformulate the underlying optimisation problem as a second-order conic program providing the flexibility often needed in applications. Using examples from portfolio management and quantitative trading we solve regression problems with and without con…
Develops a GP framework for age and year-specific mortality surfaces.
problem Learning the covariance structure of age and year-specific mortality surfaces.
method Genetic programming algorithm to search for the most expressive GP kernel.
result Reveals the presence/absence of cohort effects in different populations.
Pipeline for comparing trading algorithms in finance and crypto.
problem Disconnected research and applications in algorithmic trading.
method General pipeline for designing, programming, and evaluating trading strategies.
result Systematic comparison of trading algorithms in finance and crypto.
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.
Self-taught optimizer improves code generation using language models.
problem Improving code generation using language models.
method Recursive self-improvement of a scaffolding program that generates code.
result Improved scaffolding program generates programs with significantly better performance.
Probabilistic techniques are central to data analysis, but different approaches can be difficult to apply, combine, and compare. This paper introduces composable generative population models (CGPMs), a computational abstraction that extends directed graphical models and can be used to describe and compose a broad class…
PyKale bridges interdisciplinary ML with Python, enabling accurate predictions.
problem Cross-disciplinary barriers in machine learning.
method Knowledge-aware machine learning on graphs, images, texts, and videos.
result Enables multimodal learning and transfer learning with latest deep learning models.
Paper tackles goal-directed generation of discrete structures using conditional generative models.
problem Challenges in generating structured discrete data, especially for problems like program synthesis and materials design.
method Investigates conditional generative models to directly model the distribution of discrete structures given properties of interest. Introduces a novel approach to optimize a reinforcement learning objective.
result Improvements over maximum likelihood estimation and other baselines in generating molecules and identifying short python expressions.
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.
JAXFit speeds up curve fitting on GPUs.
problem Nonlinear least squares curve fitting problems.
method Trust region method on GPU with automatic differentiation.
result Significantly faster than CPU and other GPU libraries.
BlackJAX simplifies Bayesian inference with modular, fast implementations.
problem Efficient and modular Bayesian inference methods for complex models.
method Functional approach to implementing sampling and variational inference algorithms in JAX.
result Ease of use, speed, and modularity in implementing Bayesian inference.
This paper details the techniques and algorithms implemented in Kahler, a Python library that implements discrete exterior calculus on arbitrary Hermitian manifolds. Borrowing techniques and ideas first implemented in PyDEC, Kahler provides a uniquely general framework for computation using discrete exterior calculus. …
BayesBlend blends multiple models' predictions for better insurance loss predictions.
problem Improving insurance loss predictions by combining multiple models.
method Pseudo-Bayesian model averaging, stacking, and hierarchical stacking.
result BayesBlend provides a user-friendly way to blend model predictions and estimate weights.
Simplifies efficient estimation via automatic differentiation and probabilistic programming.
problem Constructing efficient estimators for complex statistical models.
method Automatic differentiation applied to statistical functionals, avoiding the need to derive efficient influence functions.
result Users can generate efficient estimators with minimal code, simplifying the process for non-experts.
In many research fields, the sizes of the existing datasets vary widely. Hence, there is a need for machine learning techniques which are well-suited for these different datasets. One possible technique is the self-organizing map (SOM), a type of artificial neural network which is, so far, weakly represented in the fie…
This dissertation uses ILP to learn Bayesian network structures efficiently.
problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.
Differentiable layers for convex optimization problems.
problem Rigidity of existing differentiable optimization layers.
method Disciplined parametrized programming and affine-solver-affine form.
result Efficient analytical differentiation through convex programs.
There is a perceived trade-off between machine learning code that is easy to write, and machine learning code that is scalable or fast to execute. In machine learning, imperative style libraries like Autograd and PyTorch are easy to write, but suffer from high interpretive overhead and are not easily deployable in prod…
Julia accelerates machine learning in various fields with balance of efficiency and simplicity.
problem Efficiency and simplicity in machine learning algorithms.
method Developed and applied Julia language in machine learning.
result Julia balances efficiency and simplicity for machine learning.
Scikit-multiflow is a multi-output/multi-label and stream data mining framework for the Python programming language. Conceived to serve as a platform to encourage democratization of stream learning research, it provides multiple state of the art methods for stream learning, stream generators and evaluators. scikit-mult…
In this work we simulate null geodesics for the Bonnor massive dipole metric by implementing a symbolic-numerical algorithm in Sage and Python. This program is also capable of visualizing in 3D, in principle, the geodesics for any given metric. Geodesics are launched from a common point, collectively forming a cone of …
We propose an SDP relaxation for the Gromov-Wasserstein distance, providing globally optimal solutions.
problem Matching objects between incomparable spaces using the Gromov-Wasserstein distance.
method Semi-definite programming (SDP) relaxation of the GW distance.
result The SDP relaxation provides globally optimal solutions for the GW distance in some instances.
OpenML-Python API simplifies access to OpenML for Python users.
problem Limited access to OpenML for Python users.
method Developed a Python API (OpenML-Python) to integrate OpenML with Python-based tools.
result Facilitates easy access to OpenML's datasets, tasks, and experiments.
A new layer learns abstract relations from graph structure using finite-state automata.
problem Learning abstract relations from graph structure for program analysis.
method Relaxing the problem into learning finite-state automata policies on a graph-based POMDP and training these policies using implicit differentiation.
result GFSA layer finds shortcuts in grid-world graphs and reproduces simple static analyses on Python programs.