Rayon de convergence

Science formelle
Mathématiques
Analyse (mathématiques)
Calcul infinitésimal

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Coordinate parameterisation and spectral method optimisation for Beltrami field solver in stellarator geometry

David Pfefferlé, Aravind Kumar Chandiran, Antoine Baillod, Ajay Kumar

The numerical solution of the stepped pressure equilibrium (Hudson et al 2012 Phys. Plasmas 19 112502) requires a fast and robust solver to obtain the Beltrami field in three-dimensional geometry such as stellarators. The spectral method implemented in the ...

2020

SCAFFOLD Stochastic Controlled Averaging for Federated Learning

Sai Praneeth Reddy Karimireddy, Sebastian Urban Stich, Ananda Theertha Suresh

Federated Averaging (FEDAVG) has emerged as the algorithm of choice for federated learning due to its simplicity and low communication cost. However, in spite of recent research efforts, its performance is not fully understood. We obtain tight convergence ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features

Ali H. Sayed, Sulaiman A S A E Alghunaim, Ming Yan

This work studies multi-agent sharing optimization problems with the objective function being the sum of smooth local functions plus a convex (possibly non-smooth) function coupling all agents. This scenario arises in many machine learning and engineering ...

IEEE2020

On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Volkan Cevher, Ali Kavis, Shaul Nadav Hallak

This paper analyzes the trajectories of stochastic gradient descent (SGD) to help understand the algorithm’s convergence properties in non-convex problems. We first show that the sequence of iterates generated by SGD remains bounded and converges with prob ...

2020

Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

Fabio Nobile, Francesca Bonizzoni

We study the Darcy boundary value problem with lognormal permeability field. We adopt a perturbation approach, expanding the solution in Taylor series around the nominal value of the coefficient, and approximating the expected value of the stochastic solut ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Novel corrector problems with exponential decay of the resonance error for numerical homogenization

Edoardo Paganoni

Multiscale problems, such as modelling flows through porous media or predicting the mechanical properties of composite materials, are of great interest in many scientific areas. Analytical models describing these phenomena are rarely available, and one mus ...

EPFL2020

Convergent momentum-space OPE and bootstrap equations in conformal field theory

Marc Gillioz

General principles of quantum field theory imply that there exists an operator product expansion (OPE) for Wightman functions in Minkowski momentum space that converges for arbitrary kinematics. This convergence is guaranteed to hold in the sense of a dist ...

Springer Nature2020

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration

Assyr Abdulle, Giacomo Garegnani

A novel probabilistic numerical method for quantifying the uncertainty induced by the time integration of ordinary differential equations (ODEs) is introduced. Departing from the classical strategy to randomize ODE solvers by adding a random forcing term, ...

2020

Page 2 sur 2