Concept

Conjugate gradient method

Related publications (392)

The role of PDE-based parameterization techniques in gradient-based IGA shape optimization applications

This paper proposes a shape optimization algorithm based on the principles of Isogeometric Analysis (IGA) in which the parameterization of the geometry enters the problem formulation as an additional PDE-constraint. Inspired by the isoparametric principle ...

2021

AKSEL: Fast Byzantine SGD

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Sébastien Louis Alexandre Rouault

Modern machine learning architectures distinguish servers and workers. Typically, a d-dimensional model is hosted by a server and trained by n workers, using a distributed stochastic gradient descent (SGD) optimization scheme. At each SGD step, the goal is ...

Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021

Trainable Preprocessing for Reduced Precision Neural Networks

Gabor Andras Csordas

Applications of neural networks are emerging in many fields and are frequently implemented in embedded environment, introducing power, throughput and latency constraints next to accuracy. Although practical computer vision solutions always involve some kin ...

EUROPEAN ASSOC SIGNAL SPEECH & IMAGE PROCESSING-EURASIP2021

Stock-constrained truss design exploration through combinatorial equilibrium modeling

Jan Friedrich Georg Brütting

Reusing structural components has potential to reduce environmental impacts of building structures because it reduces new material use, energy consumption, and waste. When designing structures through reuse, available element characteristics become a desig ...

2021

Differentially Private Stochastic Coordinate Descent

Rachid Guerraoui, Georgios Damaskinos

In this paper we tackle the challenge of making the stochastic coordinate descent algorithm differentially private. Compared to the classical gradient descent algorithm where updates operate on a single model vector and controlled noise addition to this ve ...

AIAA2021

Disparity Between Batches as a Signal for Early Stopping

Patrick Thiran, Mahsa Forouzesh

We propose a metric for evaluating the generalization ability of deep neural networks trained with mini-batch gradient descent. Our metric, called gradient disparity, is the l2 norm distance between the gradient vectors of two mini-batches drawn from the t ...

Springer2021

Simulation and experimental study of proton bunch self-modulation in plasma with linear density gradients

Ambrogio Fasoli, Ivo Furno, Patrick Blanchard, Yanis Andrebe, Riccardo Agnello, Falk Hans Braunmüller, Christine Stollberg, Sun Hee Kim, Alban Sublet

We present numerical simulations and experimental results of the self-modulation of a long proton bunch in a plasma with linear density gradients along the beam path. Simulation results agree with the experimental results reported [F. Braunmller, T. Nechae ...

AMER PHYSICAL SOC2021

Neural Tangent Kernel: Convergence and Generalization in Neural Networks (Invited Paper)

Clément Hongler, Franck Raymond Gabriel, Arthur Jacot

The Neural Tangent Kernel is a new way to understand the gradient descent in deep neural networks, connecting them with kernel methods. In this talk, I'll introduce this formalism and give a number of results on the Neural Tangent Kernel and explain how th ...

ASSOC COMPUTING MACHINERY2021

Tuned hybrid nonuniform subdivision surfaces with optimal convergence rates

Xiaodong Wei

This article presents an enhanced version of our previous work, hybrid nonuniform subdivision (HNUS) surfaces, to achieve optimal convergence rates in isogeometric analysis (IGA). We introduce a parameter lambda (14

WILEY2021

A unified framework for Hamiltonian deep neural networks

Giancarlo Ferrari Trecate, Clara Lucía Galimberti, Liang Xu

Training deep neural networks (DNNs) can be difficult due to the occurrence of vanishing/explod- ing gradients during weight optimization. To avoid this problem, we propose a class of DNNs stemming from the time discretization of Hamiltonian systems. The t ...

2021

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.