BlackRock AI Labs

Leaders in Finance and AI

The AI Labs is composed of researchers, data scientists, and engineers; we are advised by world experts in statistics, machine learning, and optimization. We collaborate with leaders and financial experts throughout the firm to develop methods to solve their hardest technical problems and advance the fields of finance and AI.

Rachel Schutt
Co-head AI Labs
Stephen Boyd
Co-head AI Labs
A head shot of Trevor Hastie

Trevor Hastie

The John a. Overdeck Professor of Statistics at Stanford University. He is known for his research in applied statistics, bioinformatics, and machine learning.
A head shot of Rob Tibshirani

Rob Tibshirani

A Professor in the Departments of Statistics and Biomedical Data Sciences at Stanford University. He has made important contributions to the analysis of complex datasets.
A head shot of Emmanuel Candes

Emmanuel Candes

The Barnum-Simons Chair in Mathematics and Statistics, and Professor of Electrical Engineering at Stanford. He is a MacArthur Fellow and a member of the U.S. Nas.
A head shot of Mykel Kochenderfer

Mykel Kochenderfer

An Associate Professor of Aeronautics and Astronautics at Stanford University. His research has focused on algorithms for the design of robust decision making systems.

Research

The AI Labs conducts research at the intersection of artificial intelligence and finance, synthesizing ideas to drive innovation in both fields. BlackRock’s unique position as a global leader in finance and fintech provides a distinctive set of problems for AI and related fields that inspire novel approaches and techniques. We currently apply our expertise in statistics, machine learning, optimization, stochastic control, and decision theory to various problems throughout the firm, including retirement, trading, alternatives, and ETFs.

We address portfolio allocation with illiquid assets using a convex optimization-based model predictive control policy, achieving performance close to fully liquid asset scenarios despite delays and uncertainties.

We describe a light-weight yet performant system for hyper-parameter optimization that approximately minimizes an overall scalar cost function that is obtained by combining multiple performance objectives using a target-priority-limit scalarizer.

The continuous nature of today's stock markets places a premium on speed, which has in turn given rise to a latency arms race. In this talk, we discuss how financial market design can potentially mitigate some of these issues.

Using a lifecycle framework with Epstein-Zin utility and a mixed-integer optimization approach, we compute the optimal age to claim Social Security benefits. We summarize the decision criteria via the ratio of wealth to the primary insurance amount.

Mean–variance portfolio optimization problems often involve separable nonconvex terms, including penalties on capital gains, integer share constraints, and minimum position and trade sizes. We propose a fast heuristic algorithm for this problem.

We formulate a tax-aware portfolio construction problem that explicitly accounts for tax liabilities from long- and short-term capital gains, while maintaining the standard objectives of return, risk, and transaction costs.

We consider an investment process that includes a number of features, each of which can be active or inactive. We argue for attribution of performance to features based on Shapley value and propose efficient computation methods.

We revisit Merton’s seminal 1970 formulation (and solution) of the consumption and investment decisions of an individual investor. We present a formulation of Merton’s problem as a deterministic convex optimal control problem.

A flexible framework for multi-objective optimization that implements a few optimization strategies.

We present PiecewiseQuadratics.jl and SeparableOptimization.jl at JuliaCon 2021 in the JuMP-dev workshop.

Many optimization problems involve minimizing a sum of univariate functions, each with a different variable, subject to coupling constraints. We present two Julia packages for solving a special class of such problems involving piecewise quadratics.

A Julia package that solves Linearly Constrained Separable Optimization Problems.

A Julia package for manipulation of univariate piecewise quadratic functions.

Our experience using a systems-programming language to do numerical computing.

Linearly Constrained Separable Optimization in Rust.

Work with us

We are always looking for researchers, data scientists, and engineers passionate about AI and finance. Help us solve hard problems and improve financial well-being.

BlackRock

©2026 BlackRock, Inc. All rights reserved.