Search Results for author:
Found 5 papers, 4 papers with code
Minimax Bounds for Generalized Linear Models
We establish a new class of minimax prediction error bounds for generalized linear models.
Utility-based Resource Allocation and Pricing for Serverless Computing
As one of the fastest-growing cloud services, serverless computing provides an opportunity to better serve both users and providers through the incorporation of market-based strategies for pricing and resource allocation.
Distributed, Parallel, and Cluster Computing Computer Science and Game Theory
Serverless Straggler Mitigation using Local Error-Correcting Codes
Inexpensive cloud services, such as serverless computing, are often vulnerable to straggling nodes that increase end-to-end latency for distributed computation.
Distributed, Parallel, and Cluster Computing Information Theory Information Theory
OverSketched Newton: Fast Convex Optimization for Serverless Systems
Motivated by recent developments in serverless systems for large-scale computation as well as improvements in scalable randomized matrix algorithms, we develop OverSketched Newton, a randomized Hessian-based optimization algorithm to solve large-scale convex optimization problems in serverless systems.
OverSketch: Approximate Matrix Multiplication for the Cloud
We propose OverSketch, an approximate algorithm for distributed matrix multiplication in serverless computing.
Distributed, Parallel, and Cluster Computing Information Theory Information Theory
