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.
The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application portability. Among the existing deep learning compilers, TVM is well known for its efficiency in code generation and optimi…
Specialized Deep Learning (DL) acceleration stacks, designed for a specific set of frameworks, model architectures, operators, and data types, offer the allure of high performance while sacrificing flexibility. Changes in algorithms, models, operators, or numerical systems threaten the viability of specialized hardware…
Kjolstad et. al. proposed a tensor algebra compiler. It takes expressions that define a tensor element-wise, such as , and generates the corresponding compute kernel code. For machine learning, especially deep learni…
Fully Homomorphic Encryption (FHE) refers to a set of encryption schemes that allow computations to be applied directly on encrypted data without requiring a secret key. This enables novel application scenarios where a client can safely offload storage and computation to a third-party cloud provider without having to t…
A new kernel simplifies deep learning code and boosts performance.
Tracr compiles programs into transformer models for interpretability.
We introduce Compositional Imitation Learning and Execution (CompILE): a framework for learning reusable, variable-length segments of hierarchically-structured behavior from demonstration data. CompILE uses a novel unsupervised, fully-differentiable sequence segmentation module to learn latent encodings of sequential d…
LIC compiles probabilistic models to generate efficient MCMC proposals.
Stan is a probabilistic programming language that is popular in the statistics community, with a high-level syntax for expressing probabilistic models. Stan differs by nature from generative probabilistic programming languages like Church, Anglican, or Pyro. This paper presents a comprehensive compilation scheme to com…
Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have …
Chameleon optimizes neural network compilation for faster execution and shorter time.
ReLeASE uses reinforcement learning and adaptive sampling to optimize neural network compilation.
Deep RL optimizes compiler passes for better performance.
In this brief technical report we introduce the CINIC-10 dataset as a plug-in extended alternative for CIFAR-10. It was compiled by combining CIFAR-10 with images selected and downsampled from the ImageNet database. We present the approach to compiling the dataset, illustrate the example images for different classes, g…
XLA compiler extension improves memory efficiency for machine learning.
Frameworks for writing, compiling, and optimizing deep learning (DL) models have recently enabled progress in areas like computer vision and natural language processing. Extending these frameworks to accommodate the rapidly diversifying landscape of DL models and hardware platforms presents challenging tradeoffs betwee…
Google's Cloud TPUs are a promising new hardware architecture for machine learning workloads. They have powered many of Google's milestone machine learning achievements in recent years. Google has now made TPUs available for general use on their cloud platform and as of very recently has opened them up further to allow…
Conference compiles problems on foliations and diffeomorphisms.
We introduce Dimple, a fully open-source API for probabilistic modeling. Dimple allows the user to specify probabilistic models in the form of graphical models, Bayesian networks, or factor graphs, and performs inference (by automatically deriving an inference engine from a variety of algorithms) on the model. Dimple a…
Improved inference in probabilistic programs using attention mechanisms.
Efficient FPGA virtualization for deep learning reduces user isolation and overhead.
It is time-consuming and error-prone to implement inference procedures for each new probabilistic model. Probabilistic programming addresses this problem by allowing a user to specify the model and having a compiler automatically generate an inference procedure for it. For this approach to be practical, it is important…
SPoC uses search to translate pseudocode into correct programs with error localization.
MACER accelerates error repair by modularly identifying and applying fixes.
Batch-splitting (data-parallelism) is the dominant distributed Deep Neural Network (DNN) training strategy, due to its universal applicability and its amenability to Single-Program-Multiple-Data (SPMD) programming. However, batch-splitting suffers from problems including the inability to train very large models (due to…
Paper optimizes GEMM for deep learning models, improving performance.
We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficien…
The following is a compilation of some techniques in Alexandrov's geometry which are directly connected to convexity.
tsbootstrap handles time series uncertainty without assuming independence.
This survey was compiled from lectures and problem sessions at the International Conference on Geometric Topology at the Mathematical Research and Conference Center in Bedlewo, Poland in July 2005.
We study the problem of building generative models of natural source code (NSC); that is, source code written and understood by humans. Our primary contribution is to describe a family of generative models for NSC that have three key properties: First, they incorporate both sequential and hierarchical structure. Second…
MLPerf benchmark suite evaluates diverse ML applications, highlighting system bottlenecks.
This paper compiles and calculates triple point numbers for surface-links in Yoshikawa's table.
TVO tightens variational inference bounds for deep models.
PFP-BNNs offer a fast, deterministic approach to Bayesian neural networks.
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…
We introduce a method for using deep neural networks to amortize the cost of inference in models from the family induced by universal probabilistic programming languages, establishing a framework that combines the strengths of probabilistic programming and deep learning methods. We call what we do "compilation of infer…
Abstract collects open problems in billiards and symplectic geometry.
ProGraML uses graph-based machine learning to improve program optimization and analysis.
Hybrid deep learning algorithm optimizes register allocation for compiler.
This paper proposes CodeX, an end-to-end framework that facilitates encoding, bitwidth customization, fine-tuning, and implementation of neural networks on FPGA platforms. CodeX incorporates nonlinear encoding to the computation flow of neural networks to save memory. The encoded features demand significantly lower sto…
Paper proposes a faster method for evaluating DNN hardware and software designs.
Predicting the number of clock cycles a processor takes to execute a block of assembly instructions in steady state (the throughput) is important for both compiler designers and performance engineers. Building an analytical model to do so is especially complicated in modern x86-64 Complex Instruction Set Computer (CISC…
We present a large scale data set, OpenEDS: Open Eye Dataset, of eye-images captured using a virtual-reality (VR) head mounted display mounted with two synchronized eyefacing cameras at a frame rate of 200 Hz under controlled illumination. This dataset is compiled from video capture of the eye-region collected from 152…
CoCoPIE shows AI can run on regular devices without special hardware.
This paper compiles formulas involving differential operators and interior products.
Graph-based approach repairs programs from diagnostic feedback.
A framework for privacy-preserving DNN pruning and acceleration.