Oliver Hinder

Orcid: 0000-0002-5077-0359

According to our database1, Oliver Hinder authored at least 21 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Accelerated Parameter-Free Stochastic Optimization.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

The Price of Adaptivity in Stochastic Convex Optimization.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Faster first-order primal-dual methods for linear programming using restarts and sharpness.
Math. Program., 2023

Datasets and Benchmarks for Nanophotonic Structure and Parametric Design Simulations.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule.
Proceedings of the International Conference on Machine Learning, 2023

2022
Optimal Diagonal Preconditioning: Theory and Practice.
CoRR, 2022

A consistently adaptive trust-region method.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Making SGD Parameter-Free.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods.
Math. Program., 2021

Lower bounds for finding stationary points II: first-order methods.
Math. Program., 2021

Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Lower bounds for finding stationary points I.
Math. Program., 2020

Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

An efficient nonconvex reformulation of stagewise convex optimization problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond.
Proceedings of the Conference on Learning Theory, 2020

2018
Accelerated Methods for NonConvex Optimization.
SIAM J. Optim., 2018

A polynomial time log barrier method for problems with nonconvex constraints.
CoRR, 2018

Cutting plane methods can be extended into nonconvex optimization.
Proceedings of the Conference On Learning Theory, 2018

2017
A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness.
Eur. J. Oper. Res., 2017

"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Accelerated Methods for Non-Convex Optimization.
CoRR, 2016


  Loading...