Blanchard, Moïse

1. Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal
   2023/02/09 by Blanchard, Moïse, Zhang, Junhui, Jaillet, Patrick · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC)
2. Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes
   2023/06/16 by Blanchard, Moïse, Zhang, Junhui, Jaillet, Patrick · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC)
3. Tight Bounds for Local Glivenko-Cantelli
   2023/08/03 by Blanchard, Moïse, Voráček, Václav · 1 citation
   #FOS: Mathematics #Probability (math.PR) #Statistics Theory (math.ST)