paper-with-me

Papers

Neural Conditional Gradients

2018-03-12 · Patrick Schramowski, Christian Bauckhage, Kristian Kersting

The move from hand-designed to learned optimizers in machine learning has been quite successful for gradient-based and -free optimizers. When facing a constrained problem, however, maintaining feasibility typically requires a projection step, which might be computationally expensive and not differentiable. We show how the design of projection-free convex optimization algorithms can be cast as a learning problem based on Frank-Wolfe Networks: recurrent networks implementing the Frank-Wolfe algorithm aka. conditional gradients. This allows them to learn to exploit structure when, e.g., optimizing over rank-1 matrices. Our LSTM-learned optimizers outperform hand-designed as well learned but unconstrained ones. We demonstrate this for training support vector machines and softmax classifiers.

📄 PDF Abstract BibTeX arXiv:1803.04300

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

GradCheck: Analyzing classifier guidance gradients for conditional diffusion sampling

2024-06-25 · Philipp Vaeth, Alexander M. Fruehwald, Benjamin Paassen, Magda Gregorova

To sample from an unconditionally trained Denoising Diffusion Probabilistic Model (DDPM), classifier guidance adds conditional information during sampling, but the gradients from classifiers, especially those not trained…

Denoising

Blended Conditional Gradients: the unconditioning of conditional gradients

2018-05-18 · Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen Wright

We present a blended conditional gradient approach for minimizing a smooth convex function over a polytope P, combining the Frank--Wolfe algorithm (also called conditional gradient) with gradient-based steps, different f…

Locally Accelerated Conditional Gradients

2019-06-19 · Jelena Diakonikolas, Alejandro Carderera, Sebastian Pokutta

Conditional gradients constitute a class of projection-free first-order algorithms for smooth convex optimization. As such, they are frequently used in solving smooth convex optimization problems over polytopes, for whic…

Adversarially Robust Classification by Conditional Generative Model Inversion

2022-01-12 · Mitra Alirezaei, Tolga Tasdizen

Most adversarial attack defense methods rely on obfuscating gradients. These methods are successful in defending against gradient-based attacks; however, they are easily circumvented by attacks which either do not use th…

Adversarial AttackClassificationmodelRobust classification

Rethinking the Role of Gradient-Based Attribution Methods for Model Interpretability

2020-06-16 · ICLR 2021 1 · Suraj Srinivas, Francois Fleuret

Current methods for the interpretability of discriminative deep neural networks commonly rely on the model's input-gradients, i.e., the gradients of the output logits w.r.t. the inputs. The common assumption is that thes…

Open-Ended Question Answering