activity
20112023
most citedLower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory

20 citations · 50 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2023

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization

Sarah Sachs, Hedi Hadiji, Tim van Erven +1

Stochastic and adversarial data are two widely studied settings in online learning. But many optimization tasks are neither i.i.d. nor fully adversarial, which makes it of fundamen…

math.OC2018★ 6 cited

Lower Bounds for Parallel and Randomized Convex Optimization

Jelena Diakonikolas, Cristóbal Guzmán

We study the question of whether parallelization in the exploration of the feasible set can be used to speed up convex optimization, in the local oracle model of computation. We sh…

cs.LG2015★ 1 cited

Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization

Vitaly Feldman, Cristobal Guzman, Santosh Vempala

Stochastic convex optimization, where the objective is the expectation of a random convex function, is an important and widely used method with numerous applications in machine lea…

math.MG2015★ 18 cited

New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry

Maria Dostert, Cristóbal Guzmán, Fernando Mário de Oliveira Filho +1

In this paper we determine new upper bounds for the maximal density of translative packings of superballs in three dimensions (unit balls for the -norm) and of Platonic and…

math.OC2014★ 20 cited

Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory

Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta

We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identif…

math.OC2013★ 5 cited

On Lower Complexity Bounds for Large-Scale Smooth Convex Optimization

Cristobal Guzman, Arkadi Nemirovski

We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a giv…

cs.NI2011

Network Congestion Control with Markovian Multipath Routing

Roberto Cominetti, Cristobal Guzman

In this paper we consider an integrated model for TCP/IP protocols with multipath routing. The model combines a Network Utility Maximization for rate control based on end-to-end qu…