JVJake VanderPlas

Jake VanderPlas

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jake VanderPlas has a total of 276 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On the XUV Luminosity Evolution of TRAPPIST-1

    by David P. Fleming, Rory Barnes, Rodrigo Luger, Jacob T. VanderPlas

    We model the long-term X-ray and ultraviolet (XUV) luminosity of TRAPPIST-1 to constrain the evolving high-energy radiation environment experienced by its planetary system. Using a Markov Chain Monte Carlo (MCMC) method, we derive probabilistic constraints for TRAPPIST-1's stellar and XUV evolution that account for observational uncertainties, degeneracies between model parameters, and empirical data of low-mass stars. We constrain TRAPPIST-1's mass to m ⋆ = 0.089 ± 0.001 M ⊙ and find that its early XUV luminosity likely saturated at . From the posterior distribution, we infer that there is a ∼40% chance that TRAPPIST-1 is still in the saturated phase today, suggesting that TRAPPIST-1 has maintained high activity and L XUV/L bol ≈ 10−3 for several gigayears. TRAPPIST-1's planetary system therefore likely experienced a persistent and extreme XUV flux environment, potentially driving significant atmospheric erosion and volatile loss. The inner planets likely received XUV fluxes ∼103–104 times that of the modern Earth during TRAPPIST-1's ∼1 Gyr long pre-main-sequence phase. Deriving these constraints via MCMC is computationally nontrivial, so scaling our methods to constrain the XUV evolution of a larger number of M dwarfs that harbor terrestrial exoplanets would incur significant computational expenses. We demonstrate that approxposterior, an open source Python machine learning package for approximate Bayesian inference using Gaussian processes, accurately and efficiently replicates our analysis using 980 times less computational time and 1330 times fewer simulations than MCMC sampling using emcee. We find that approxposterior derives constraints with mean errors on the best-fit values and 1σ uncertainties of 0.61% and 5.5%, respectively, relative to emcee.


  • Applying Information Theory to Design Optimal Filters for Photometric Redshifts

    by J. Bryce Kalmbach, Jacob T. VanderPlas, Andrew J. Connolly

    In this paper we apply ideas from information theory to create a method for the design of optimal filters for photometric redshift estimation. We show the method applied to a series of simple example filters in order to motivate an intuition for how photometric redshift estimators respond to the properties of photometric passbands. We then design a realistic set of six filters covering optical wavelengths that optimize photometric redshifts for z <= 2.3 and i < 25.3. We create a simulated catalog for these optimal filters and use our filters with a photometric redshift estimation code to show that we can improve the standard deviation of the photometric redshift error by 7.1% overall and improve outliers 9.9% over the standard filters proposed for the Large Synoptic Survey Telescope (LSST). We compare features of our optimal filters to the LSST and find that the LSST filters incorporate key features for optimal photometric redshift estimation. Finally, we describe how information theory can be applied to a range of optimization problems in astronomy.


  • Top Cited Papers
    Open Access

    Altair: Interactive Statistical Visualizations for Python

    by Jacob VanderPlas, Brian Granger, Jeffrey Heer, Dominik Moritz, Kanit Wongsuphasawat, Arvind Satyanarayan, Eitan Lees, Ilia Timofeev, Ben Welsh, Scott Sievert


  • Open Access

    approxposterior: Approximate Posterior Distributions in Python

    by David P. Fleming, Jake VanderPlas

    This package is a Python implementation of "Bayesian Active Learning for Posterior Estimation" by (Kandasamy, Schneider, & Poczos, 2015) and "Adaptive Gaussian process approximation for Bayesian inference with expensive likelihood functions" (Wang & Li, 2017). These algorithms allows the user to compute approximate posterior probability distributions using computationally expensive forward models by training a Gaussian Process (GP) surrogate for the likelihood evaluation. The algorithms leverage the inherent uncertainty in the GP's predictions to identify high-likelihood regions in parameter space where the GP is uncertain. The algorithms then run the forward model at these points to compute their likelihood and retrains the GP to maximize the GP's predictive ability while minimizing the number of forward model evaluations. Please read (Kandasamy et al., 2015) and (Wang & Li, 2017) for in-depth descriptions of the respective algorithms. approxposterior is under active development on GitHub and community participation is encouraged. The code is available on GitHub (Fleming, 2018).


  • Top Cited Papers
    Open Access

    The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package*

    by The Astropy Collaboration, A. M. Price-Whelan, B. M. Sipőcz, H. M. Günther, P. L. Lim, S. M. Crawford, S. Conseil, D. L. Shupe, M. W. Craig, N. Dencheva, et al.

    The Astropy Project supports and fosters the development of open-source and openly developed Python packages that provide commonly needed functionality to the astronomical community. A key element of the Astropy Project is the core package astropy, which serves as the foundation for more specialized projects and packages. In this article, we provide an overview of the organization of the Astropy project and summarize key features in the core package, as of the recent major release, version 2.0. We then describe the project infrastructure designed to facilitate and support development for a broader ecosystem of interoperable packages. We conclude with a future outlook of planned new features and directions for the broader Astropy Project.


  • Top Cited Papers
    Open Access

    Scikit-learn: Machine Learning in Python

    by Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Andreas Müller, Joel Nothman, Gilles Louppe, et al.

    Scikit-learn is a Python module integrating a wide range of state-of-the-art machine learning algorithms for medium-scale supervised and unsupervised problems. This package focuses on bringing machine learning to non-specialists using a general-purpose high-level language. Emphasis is put on ease of use, performance, documentation, and API consistency. It has minimal dependencies and is distributed under the simplified BSD license, encouraging its use in both academic and commercial settings. Source code, binaries, and documentation can be downloaded from http://scikit-learn.org.


  • Top Cited Papers

    Understanding the Lomb–Scargle Periodogram

    by Jacob T. VanderPlas

    The Lomb–Scargle periodogram is a well-known algorithm for detecting and characterizing periodic signals in unevenly sampled data. This paper presents a conceptual introduction to the Lomb–Scargle periodogram and important practical considerations for its use. Rather than a rigorous mathematical treatment, the goal of this paper is to build intuition about what assumptions are implicit in the use of the Lomb–Scargle periodogram and related estimators of periodicity, so as to motivate important practical considerations required in its proper application and interpretation.


  • Open Access

    A fast template periodogram

    by John Hoffman, Jake VanderPlas, Joel Hartman, Gáspár Bakos

    This proceedings contribution presents a novel, non-linear extension to the Lomb-Scargle periodogram that allows periodograms to be generated for arbitrary signal shapes. Such periodograms are already known as “template periodograms” or “periodic matched filters,” but current implementations are computationally inefficient. The “fast template periodogram” presented here improves existing techniques by a factor of ∼a few for small test cases (O(10) observations), and over three orders of magnitude for lightcurves containing O(104) observations. The fast template periodogram scales asymptotically as O(HNf log HNf + H 4 Nf ), where H denotes the number of harmonics required to adequately approximate the template and Nf is the number of trial frequencies. Existing implementations scale as O(N obs Nf ), where N obs is the number of observations in the lightcurve. An open source Python implementation is available on GitHub.


  • CLUSTER-LENSING: A PYTHON PACKAGE FOR GALAXY CLUSTERS AND MISCENTERING

    by Jes Ford, Jake VanderPlas

    We describe a new open source package for calculating properties of galaxy clusters, including Navarro, Frenk, and White halo profiles with and without the effects of cluster miscentering. This pure-Python package, cluster-lensing, provides well-documented and easy-to-use classes and functions for calculating cluster scaling relations, including mass-richness and mass-concentration relations from the literature, as well as the surface mass density and differential surface mass density profiles, probed by weak lensing magnification and shear. Galaxy cluster miscentering is especially a concern for stacked weak lensing shear studies of galaxy clusters, where offsets between the assumed and the true underlying matter distribution can lead to a significant bias in the mass estimates if not accounted for. This software has been developed and released in a public GitHub repository, and is licensed under the permissive MIT license. The cluster-lensing package is archived on Zenodo. Full documentation, source code, and installation instructions are available at http://jesford.github.io/cluster-lensing/.