13 citations · 13 across the 3 of their papers we have counts for
4 papers
An Elementary Proof of the Near Optimality of LogSumExp Smoothing
Thabo Samakhoana, Benjamin Grimmer
We consider the design of smoothings of the (coordinate-wise) max function in in the infinity norm. The LogSumExp function provides a c…
The Optimal Smoothings of Sublinear Functions and Convex Cones
Thabo Samakhoana, Benjamin Grimmer
This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions,…
Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory
Thabo Samakhoana, Benjamin Grimmer
Recent works have developed new projection-free first-order methods based on utilizing linesearches and normal vector computations to maintain feasibility. These oracles can be che…
On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithms
Nicolas Garcia Trillos, Zachary Kaplan, Thabo Samakhoana +1
A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesi…