activity
20172021
most citedA Note on the Inception Score

221 citations · 588 across the 17 of their papers we have counts for

collaborators

26 papers

q-fin.PM2021★ 1 cited

Portfolio Construction Using Stratified Models

Jonathan Tuck, Shane Barratt, Stephen Boyd

In this paper we develop models of asset return mean and covariance that depend on some observable market conditions, and use these to construct a trading policy that depends on th…

stat.ML2021

Covariance Prediction via Convex Optimization

Shane Barratt, Stephen Boyd

We consider the problem of predicting the covariance of a zero mean Gaussian vector, based on another feature vector. We describe a covariance predictor that has the form of a gene…

stat.ML2021★ 2 cited

Low Rank Forecasting

Shane Barratt, Yining Dong, Stephen Boyd

We consider the problem of forecasting multiple values of the future of a vector time series, using some past values. This problem, and related ones such as one-step-ahead predicti…

cs.LG2020

Learning Convex Optimization Models

Akshay Agrawal, Shane Barratt, Stephen Boyd

A convex optimization model predicts an output from an input by solving a convex optimization problem. The class of convex optimization models is large, and includes as special cas…

q-fin.CP2020

Multi-Period Liability Clearing via Convex Optimal Control

Shane Barratt, Stephen Boyd

We consider the problem of determining a sequence of payments among a set of entities that clear (if possible) the liabilities among them. We formulate this as an optimal control p…

stat.ML2020

Optimal Representative Sample Weighting

Shane Barratt, Guillermo Angeris, Stephen Boyd

We consider the problem of assigning weights to a set of samples or data records, with the goal of achieving a representative weighting, which happens when certain sample averages…

q-fin.CP2020

Convex Optimization Over Risk-Neutral Probabilities

Shane Barratt, Jonathan Tuck, Stephen Boyd

We consider a collection of derivatives that depend on the price of an underlying asset at expiration or maturity. The absence of arbitrage is equivalent to the existence of a risk…

math.OC2020

Automatic Repair of Convex Optimization Problems

Shane Barratt, Guillermo Angeris, Stephen Boyd

Given an infeasible, unbounded, or pathological convex optimization problem, a natural question to ask is: what is the smallest change we can make to the problem's parameters such…

math.OC2020★ 2 cited

Fitting a Linear Control Policy to Demonstrations with a Kalman Constraint

Malayandi Palan, Shane Barratt, Alex McCauley +3

We consider the problem of learning a linear control policy for a linear dynamical system, from demonstrations of an expert regulating the system. The standard approach to this pro…

math.OC2019★ 9 cited

Learning Convex Optimization Control Policies

Akshay Agrawal, Shane Barratt, Stephen Boyd +1

Many control policies used in various applications determine the input or action by solving a convex optimization problem that depends on the current state and some parameters. Com…

math.OC2019

Minimizing a Sum of Clipped Convex Functions

Shane Barratt, Guillermo Angeris, Stephen Boyd

We consider the problem of minimizing a sum of clipped convex functions; applications include clipped empirical risk minimization and clipped control. While the problem of minimizi…

cs.LG2019★ 133 cited

Differentiable Convex Optimization Layers

Akshay Agrawal, Brandon Amos, Shane Barratt +3

Recent work has shown how to embed differentiable optimization problems (that is, problems whose solutions can be backpropagated through) as layers within deep learning architectur…

math.OC2019

Fitting a Kalman Smoother to Data

Shane Barratt, Stephen Boyd

This paper considers the problem of fitting the parameters of a Kalman smoother to data. We formulate the Kalman smoothing problem with missing measurements as a constrained least…

math.OC2019

Least Squares Auto-Tuning

Shane Barratt, Stephen Boyd

Least squares is by far the simplest and most commonly applied computational method in many fields. In almost all applications, the least squares objective is rarely the true objec…

cs.LG2019★ 18 cited

A Distributed Method for Fitting Laplacian Regularized Stratified Models

Jonathan Tuck, Shane Barratt, Stephen Boyd

Stratified models are models that depend in an arbitrary way on a set of selected categorical features, and depend linearly on the other features. In a basic and traditional formul…

math.OC2019★ 2 cited

Differentiating Through a Cone Program

Akshay Agrawal, Shane Barratt, Stephen Boyd +2

We consider the problem of efficiently computing the derivative of the solution map of a convex cone program, when it exists. We do this by implicitly differentiating the residual…

math.OC2018

Stochastic Control with Affine Dynamics and Extended Quadratic Costs

Shane Barratt, Stephen Boyd

An extended quadratic function is a quadratic function plus the indicator function of an affine set, that is, a quadratic function with embedded linear equality constraints. We sho…

cs.LG2018★ 101 cited

Learning Probabilistic Trajectory Models of Aircraft in Terminal Airspace from Position Data

Shane Barratt, Mykel Kochenderfer, Stephen Boyd

Models for predicting aircraft motion are an important component of modern aeronautical systems. These models help aircraft plan collision avoidance maneuvers and help conduct offl…

cs.LG2018★ 10 cited

Improved Training with Curriculum GANs

Rishi Sharma, Shane Barratt, Stefano Ermon +1

In this paper we introduce Curriculum GANs, a curriculum learning strategy for training Generative Adversarial Networks that increases the strength of the discriminator over the co…

stat.ML2018★ 1 cited

Optimizing for Generalization in Machine Learning with Cross-Validation Gradients

Shane Barratt, Rishi Sharma

Cross-validation is the workhorse of modern applied statistics and machine learning, as it provides a principled framework for selecting the model that maximizes generalization per…

math.PR2018★ 4 cited

A Matrix Gaussian Distribution

Shane Barratt

In this note, we define a Gaussian probability distribution over matrices. We prove some useful properties of this distribution, namely, the fact that marginalization, conditioning…

math.OC2018★ 39 cited

On the Differentiability of the Solution to Convex Optimization Problems

Shane Barratt

In this paper, we provide conditions under which one can take derivatives of the solution to convex optimization problems with respect to problem data. These conditions are (roughl…

eess.SP2018★ 23 cited

Cooperative Multi-Agent Reinforcement Learning for Low-Level Wireless Communication

Colin de Vrieze, Shane Barratt, Daniel Tsai +1

Traditional radio systems are strictly co-designed on the lower levels of the OSI stack for compatibility and efficiency. Although this has enabled the success of radio communicati…

stat.ML2018★ 221 cited

A Note on the Inception Score

Shane Barratt, Rishi Sharma

Deep generative models are powerful tools that have produced impressive results in recent years. These advances have been for the most part empirically driven, making it essential…