[PDF][PDF] Improving the Bit Complexity of Communication for Distributed Convex Optimization
We consider the communication complexity of some fundamental convex optimization
problems in the point-to-point (coordinator) and blackboard communication models. We …
problems in the point-to-point (coordinator) and blackboard communication models. We …
Optimal bounds for sensitivity sampling via augmentation
A Munteanu, S Omlor - arXiv preprint arXiv:2406.00328, 2024 - arxiv.org
Data subsampling is one of the most natural methods to approximate a massively large data
set by a small representative proxy. In particular, sensitivity sampling received a lot of …
set by a small representative proxy. In particular, sensitivity sampling received a lot of …
Some Problems in Conic, Nonsmooth, and Online Optimization
S Padmanabhan - 2023 - search.proquest.com
Some Problems in Conic, Nonsmooth, and Online Optimization Page 1 Some Problems in
Conic, Nonsmooth, and Online Optimization Swati Padmanabhan A dissertation submitted in …
Conic, Nonsmooth, and Online Optimization Swati Padmanabhan A dissertation submitted in …