paper-with-me

Papers

A Unified Approach to Adaptive Regularization in Online and Stochastic Optimization

2017-06-20 · Vineet Gupta, Tomer Koren, Yoram Singer

We describe a framework for deriving and analyzing online optimization algorithms that incorporate adaptive, data-dependent regularization, also termed preconditioning. Such algorithms have been proven useful in stochastic optimization by reshaping the gradients according to the geometry of the data. Our framework captures and unifies much of the existing literature on adaptive online methods, including the AdaGrad and Online Newton Step algorithms as well as their diagonal versions. As a result, we obtain new convergence proofs for these algorithms that are substantially simpler than previous analyses. Our framework also exposes the rationale for the different preconditioned updates used in common stochastic optimization methods.

📄 PDF Abstract BibTeX arXiv:1706.06569

Code (0)

등록된 구현이 없습니다.

Tasks

Stochastic Optimization

Methods 이 논문이 사용한 방법론

AdaGrad AdaGrad is a stochastic optimization method that adapts the learning rate to the parameters. It performs smaller updates for parameters associated with frequently occurring…

Similar Papers 제목 키워드 기반

Advancing Trajectory Optimization with Approximate Inference: Exploration, Covariance Control and Adaptive Risk

2021-03-10 · Joe Watson, Jan Peters

Discrete-time stochastic optimal control remains a challenging problem for general, nonlinear systems under significant uncertainty, with practical solvers typically relying on the certainty equivalence assumption, repla…

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization

2024-02-13 · Mohammad Pedramfar, Vaneet Aggarwal

In this paper, we analyze the problem of online convex optimization in different settings, including different feedback types (full-information/semi-bandit/bandit/etc) in either stochastic or non-stochastic setting and d…

Dual Averaging Method for Regularized Stochastic Learning and Online Optimization

2009-12-01 · NeurIPS 2009 12 · Lin Xiao

We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning task, and the other is a simple regulari…

Stochastic batch size for adaptive regularization in deep network optimization

2020-04-14 · Kensuke Nakamura, Stefano Soatto, Byung-Woo Hong

We propose a first-order stochastic optimization algorithm incorporating adaptive regularization applicable to machine learning problems in deep learning framework. The adaptive regularization is imposed by stochastic pr…

image-classificationImage ClassificationStochastic Optimization

Consistency analysis of bilevel data-driven learning in inverse problems

2020-07-06 · Neil K. Chada, Claudia Schillings, Xin T. Tong, Simon Weissmann

One fundamental problem when solving inverse problems is how to find regularization parameters. This article considers solving this problem using data-driven bilevel optimization, i.e. we consider the adaptive learning o…

Bilevel OptimizationDenoisingImage Denoising