Julia: A Fresh Approach to Numerical Computing
By Jeff Bezanson, Alan Edelman, Stefan Karpinski, Viral B. Shah. 2014
6,632 citations recorded by the source corpus.
Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing. Julia is designed to be easy and fast and questions notions generally held to be “laws of nature" by practitioners of numerical computing: \beginlist \item High-level dynamic programs have to be slow. \item One must prototype in one language and then rewrite in another language for speed or deployment. \item There are parts of a system appropriate for the programmer, and other parts that are best left untouched as they have been built by the experts. \endlist We introduce the Julia programming language and its design---a dance between specialization and abstraction. Specialization allows for custom treatment. Multiple dispatch, a technique from computer science, picks the right algorithm for the right circumstance. Abstraction, which is what good computation is really about, recognizes what remains the same after dif...
Subfields: Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture, Numerical Methods & Scientific Computing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Mohit Bansal
- Quoc V. Le
- Luke S. Zettlemoyer
- Yoshua Bengio
- Percy Liang
- Jianfeng Gao
- Sergey Levine
- Ruslan Salakhutdinov
In Computer Networks and Communications
- Miles Lubin
- Dragos Florin Ciocan
- Velibor V. Misic
- Vincent Tjeng
- Russ Tedrake
- Kai Y. Xiao
- Theodore Papamarkou
- Jarrett Revels
In Hardware and Architecture
- Ali Ayub
- Alan R. Wagner
- Miles Lubin
- Dragos Florin Ciocan
- Velibor V. Misic
- Yanping Huang
- Russ Tedrake
- Vincent Tjeng
In Numerical Methods & Scientific Computing
- Jack Dunn
- M. Innes
- Paul Breiding
- Miles Lubin
- Lester W. Mackey
- Paul Barham
- Julio H. Braslavsky
- Michael Isard
Citations in the corpus
- GSPMD: General and Scalable Parallelization for ML Computation Graphs (2021, background): “Reshape from [3, 2] to [6] (c) Reshape changes uneven padding it to Convolution , which allows the user to combine spatial”
- Array programming with NumPy (2020, background): “New generation languages, interpreters, and compilers, such as Rust [52], Julia [53], and LLVM [54], will invent and determine the viability of new concepts and data structures.”
- PyTorch: An Imperative Style, High-Performance Deep Learning Library (2019, background): “First, starting in the 1960s, the development of domain specific languages such as APL [8], MATLAB [9], R [10] and Julia [11], turned multidimensional arrays (often referred to as tensors) into first-class objects supported by a comprehensive set of mathematical primitives (or operators) to manipula”
- Verifying Neural Networks with Mixed Integer Programming (2017, neutral): “We construct the MIP models corresponding to the optimization problems in Julia [2] using JuMP [6], with the solve carried out by the commercial solver Gurobi 7.0.2 [10] on a desktop with a Intel Core i7-6700 CPU (with 4 cores) clocked at 3.40GHz.”
- Understanding the Origins of Bias in Word Embeddings (2018, neutral): “It is written principally in Julia [2].”
- openTSNE: a modular Python library for t-SNE dimensionality reduction and embedding (2019, neutral): “In Julia (Bezanson et al. 2017), the most popular implementation – TSne.jl (Jonsson 2021) – is based on a naive O ( N 2 ) implementation of the algorithm, which allows it to be used only on smaller data sets containing up to thousands of data points.”
- HomotopyContinuation.jl: A Package for Homotopy Continuation in Julia (2017, methodology): “e computations with homotopy continuation such as Bertini [3] and PHCpack [15]. We add the new and actively developed package HomotopyContinuation.jl3 to that list. The package is programmed in Julia [4], which has recently gained much popularity 3 www.JuliaHomotopyContinuation.org 2 Breiding - Timm”
- Gene Regulatory Network Inference from Single-Cell Data Using Multivariate Information Measures (2016, methodology): “A new open-source package for estimating MVI measures is implemented in the Julia programming language (Bezanson et al. 2014).”
- Learning algebraic varieties from samples (2018, methodology): “2 https://github.com/JuliaIO/JLD.jl.”
- Gen: a general-purpose probabilistic programming system with programmable inference (2019, background): “The contributions of this paper are: • Gen, a probabilistic programming system embedded in Julia [4], in which users (i) define models in embedded modeling languages and (ii) implement high-level inference programs in the host language (Section 3).”
- Robust Dynamic Operating Envelopes for DER Integration in Unbalanced Distribution Networks (2022, methodology): “Moreover, all data are originally provided in OpenDSS format [49] and are analysed through PowerModelsDistribution.jl [50] in order to build optimisation models in Julia [51].”
- Algorithms for Verifying Deep Neural Networks (2019, background): “We have found the language to be ideal for specifying in human readable form [5].”
- Interpretable Optimal Stopping (2018, methodology): “g a single instance of type r4.4xlarge (Intel Xeon E5-2686 v4 processor with 16 virtual CPUs and 122 GB memory). All methods were implemented in the Julia technical computing language, version 0.6.2 (Bezanson et al. 2017). All linear optimization problems for the pathwise optimization method were fo”
- Measuring Sample Quality with Kernels (2017, methodology): “Throughout, we will refer to the KSD with IMQ base kernel , and c = 1 as the IMQ KSD. Code reproducing all experiments can be found on the Julia (Bezanson et al., 2014) package site https://jgorham.github.io/ SteinDiscrepancy.jl/ .”
- Evaluating Robustness of Neural Networks with Mixed Integer Programming (2017, methodology): “We construct the MILP models in Julia [3] using JuMP [11], with the model solved by the commercial solver Gurobi 7.5.2 [19].”
- Large optical nonlinearity of nanoantennas coupled to an epsilon-near-zero material (2018, methodology): “We wrote the numerical beam propagation program using Julia language [44], and it allows arbitrary order nonlinear refraction and absorption to be taken into account.”