Recent advances and applications of machine learning in solid-state materials science

J Schmidt, MRG Marques, S Botti… - npj computational …, 2019 - nature.com
One of the most exciting tools that have entered the material science toolbox in recent years
is machine learning. This collection of statistical methods has already proved to be capable …

Non-convex optimization for machine learning

P Jain, P Kar - Foundations and Trends® in Machine …, 2017 - nowpublishers.com
A vast majority of machine learning algorithms train their models and perform inference by
solving optimization problems. In order to capture the learning and prediction problems …

Soft threshold weight reparameterization for learnable sparsity

A Kusupati, V Ramanujan, R Somani… - International …, 2020 - proceedings.mlr.press
Abstract Sparsity in Deep Neural Networks (DNNs) is studied extensively with the focus of
maximizing prediction accuracy given an overall parameter budget. Existing methods rely on …

Resource-efficient machine learning in 2 kb ram for the internet of things

A Kumar, S Goyal, M Varma - International conference on …, 2017 - proceedings.mlr.press
This paper develops a novel tree-based algorithm, called Bonsai, for efficient prediction on
IoT devices–such as those based on the Arduino Uno board having an 8 bit ATmega328P …

The cost of privacy: Optimal rates of convergence for parameter estimation with differential privacy

TT Cai, Y Wang, L Zhang - The Annals of Statistics, 2021 - projecteuclid.org
The cost of privacy: Optimal rates of convergence for parameter estimation with differential
privacy Page 1 The Annals of Statistics 2021, Vol. 49, No. 5, 2825–2850 https://doi.org/10.1214/21-AOS2058 …

Guarantees for greedy maximization of non-submodular functions with applications

AA Bian, JM Buhmann, A Krause… - … on machine learning, 2017 - proceedings.mlr.press
We investigate the performance of the standard Greedy algorithm for cardinality constrained
maximization of non-submodular nondecreasing set functions. While there are strong …

[KNJIGA][B] Introduction to high-dimensional statistics

C Giraud - 2021 - taylorfrancis.com
Praise for the first edition:"[This book] succeeds singularly at providing a structured
introduction to this active field of research.… it is arguably the most accessible overview yet …

Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees

Y Chen, MJ Wainwright - arxiv preprint arxiv:1509.03025, 2015 - arxiv.org
Optimization problems with rank constraints arise in many applications, including matrix
regression, structured PCA, matrix completion and matrix decomposition problems. An …

Protonn: Compressed and accurate knn for resource-scarce devices

C Gupta, AS Suggala, A Goyal… - International …, 2017 - proceedings.mlr.press
Several real-world applications require real-time prediction on resource-scarce devices
such as an Internet of Things (IoT) sensor. Such applications demand prediction models with …

Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow

TT Cai, X Li, Z Ma - 2016 - projecteuclid.org
This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal
x∈R^p from noisy quadratic measurements y_j=(a_j'x)^2+j, j=1,...,m, with independent sub …