paper-with-me

홈 › Papers

Escaping Poor Local Minima in Large Scale Robust Estimation

2021-02-22 · Huu Le, Christopher Zach

Robust parameter estimation is a crucial task in several 3D computer vision pipelines such as Structure from Motion (SfM). State-of-the-art algorithms for robust estimation, however, still suffer from difficulties in converging to satisfactory solutions due to the presence of many poor local minima or flat regions in the optimization landscapes. In this paper, we introduce two novel approaches for robust parameter estimation. The first algorithm utilizes the Filter Method (FM), which is a framework for constrained optimization allowing great flexibility in algorithmic choices, to derive an adaptive kernel scaling strategy that enjoys a strong ability to escape poor minima and achieves fast convergence rates. Our second algorithm combines a generalized Majorization Minimization (GeMM) framework with the half-quadratic lifting formulation to obtain a simple yet efficient solver for robust estimation. We empirically show that both proposed approaches show encouraging capability on avoiding poor local minima and achieve competitive results compared to existing state-of-the art robust fitting algorithms.

📄 PDF Abstract BibTeX arXiv:2102.10928

Code (0)

등록된 구현이 없습니다.

Tasks

parameter estimation

Similar Papers 제목 키워드 기반

The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of Escaping from Sharp Minima and Regularization Effects

2018-03-01 · ICLR 2019 5 · Zhanxing Zhu, Jingfeng Wu, Bing Yu, Lei Wu 외

Understanding the behavior of stochastic gradient descent (SGD) in the context of deep neural networks has raised lots of concerns recently. Along this line, we study a general form of gradient based optimization dynamic…

The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of Escaping from Minima and Regularization Effects

2019-05-01 · ICLR 2019 5 · Zhanxing Zhu, Jingfeng Wu, Bing Yu, Lei Wu 외

Understanding the behavior of stochastic gradient descent (SGD) in the context of deep neural networks has raised lots of concerns recently. Along this line, we theoretically study a general form of gradient based optim…

Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learning

2020-10-12 · NeurIPS 2020 12 · Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong 외

It is not clear yet why ADAM-alike adaptive gradient algorithms suffer from worse generalization performance than SGD despite their faster training speed. This work aims to provide understandings on this generalization g…

CACTO: Continuous Actor-Critic with Trajectory Optimization -- Towards global optimality

2022-11-12 · Gianluigi Grandesso, Elisa Alboni, Gastone P. Rosati Papini, Patrick M. Wensing 외

This paper presents a novel algorithm for the continuous control of dynamical systems that combines Trajectory Optimization (TO) and Reinforcement Learning (RL) in a single framework. The motivations behind this algorith…

continuous-controlContinuous ControlReinforcement Learning (RL)

Explore the Loss space with Hill-ADAM

2025-10-04 · Meenakshi Manikandan, Leilani Gilpin arxiv

This paper introduces Hill-ADAM. Hill-ADAM is an optimizer with its focus towards escaping local minima in prescribed loss landscapes to find the global minimum. Hill-ADAM escapes minima by deterministically exploring th…