activity
20012022
most citedApproximation and learning by greedy algorithms

323 citations · 747 across the 16 of their papers we have counts for

collaborators

16 papers

stat.ML2022

Proposal of a Score Based Approach to Sampling Using Monte Carlo Estimation of Score and Oracle Access to Target Density

Curtis McDonald, Andrew Barron

Score based approaches to sampling have shown much success as a generative algorithm to produce new samples from a target density given a pool of initial samples. In this work, we…

cs.IT2019★ 42 cited

Sparse Regression Codes

Ramji Venkataramanan, Sekhar Tatikonda, Andrew Barron

Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and codi…

stat.ML2019★ 17 cited

Complexity, Statistical Risk, and Metric Entropy of Deep Nets Using Total Path Variation

Andrew R. Barron, Jason M. Klusowski

For any ReLU network there is a representation in which the sum of the absolute values of the weights into each node is exactly , and the input layer variables are multiplied by…

stat.ML2018★ 41 cited

Approximation and Estimation for High-Dimensional Deep Learning Networks

Andrew R. Barron, Jason M. Klusowski

It has been experimentally observed in recent years that multi-layer artificial neural networks have a surprising ability to generalize, even when trained with far more parameters…

stat.ML2017★ 1 cited

Minimax Lower Bounds for Ridge Combinations Including Neural Nets

Jason M. Klusowski, Andrew R. Barron

Estimation of functions of variables is considered using ridge combinations of the form where th…

stat.ML2016★ 8 cited

Approximation by Combinations of ReLU and Squared ReLU Ridge Functions with and Controls

Jason M. Klusowski, Andrew R. Barron

We establish and error bounds for functions of many variables that are approximated by linear combinations of ReLU (rectified linear unit) and squared ReLU r…