output
20122026
most citedDeep Learning Face Representation by Joint Identification-Verification

1.8k citations

Showing 2021 · math.OCShow all

10 papers · 2 filters

math.OC2021★ 14 cited

On the existence of global minima and convergence analyses for gradient descent methods in the training of deep neural networks

Arnulf Jentzen, Adrian Riekert

In this article we study fully-connected feedforward deep ReLU ANNs with an arbitrarily large number of hidden layers and we prove convergence of the risk of the GD optimization me…

math.OC2021

Optimal Partition for Multi-Type Queueing System

Shengyu Cao, Simai He, Zizhuo Wang +1

We study an optimal server partition and customer assignment problem for an uncapacitated FCFS queueing system with heterogeneous types of customers. Each type of customers is asso…

math.OC2021★ 1 cited

Optimal Gradient Tracking for Decentralized Optimization

Zhuoqing Song, Lei Shi, Shi Pu +1

In this paper, we focus on solving the decentralized optimization problem of minimizing the sum of objective functions over a multi-agent network. The agents are embedded in an…

math.OC2021★ 1 cited

Convergence of Random Reshuffling Under The Kurdyka-Łojasiewicz Inequality

Xiao Li, Andre Milzarek, Junwen Qiu

We study the random reshuffling (RR) method for smooth nonconvex optimization problems with a finite-sum structure. Though this method is widely utilized in practice such as the tr…

math.OC2021★ 2 cited

Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs

Zhuoqing Song, Lei Shi, Shi Pu +1

We consider the decentralized optimization problem, where a network of agents aims to collaboratively minimize the average of their individual smooth and convex objective funct…

math.OC2021★ 1 cited

A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization

Wenqing Ouyang, Andre Milzarek

We propose a novel trust region method for solving a class of nonsmooth, nonconvex composite-type optimization problems. The approach embeds inexact semismooth Newton steps for fin…

math.OC2021★ 28 cited

Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networks

Zhuoqing Song, Lei Shi, Shi Pu +1

In this paper, we propose two communication efficient decentralized optimization algorithms over a general directed multi-agent network. The first algorithm, termed Compressed Push…

math.OC2021★ 9 cited

A Communication-Efficient and Privacy-Aware Distributed Algorithm for Sparse PCA

Lei Wang, Xin Liu, Yin Zhang

Sparse principal component analysis (PCA) improves interpretability of the classic PCA by introducing sparsity into the dimension-reduction process. Optimization models for sparse…

math.OC2021

Approximating the Optimal Transport Plan via Particle-Evolving Method

Shu Liu, Haodong Sun, Hongyuan Zha

Optimal transport (OT) provides powerful tools for comparing probability measures in various types. The Wasserstein distance which arises naturally from the idea of OT is widely us…

math.OC2021★ 1 cited

Decentralized Non-Convex Learning with Linearly Coupled Constraints

Jiawei Zhang, Songyang Ge, Tsung-Hui Chang +1

Motivated by the need for decentralized learning, this paper aims at designing a distributed algorithm for solving nonconvex problems with general linear constraints over a multi-a…