Quantum-inspired real-time optimization for 6G networks: Opportunities, challenges, and the road ahead

TQ Duong, LD Nguyen, B Narottama… - IEEE Open Journal …, 2022 - ieeexplore.ieee.org
It is envisioned that 6G, unlike its predecessor 5G, will depart from connected machines and
connected people to connected intelligence. The main goal of 6G networks is to support …

Unrolled generative adversarial networks

L Metz, B Poole, D Pfau, J Sohl-Dickstein - arXiv preprint arXiv …, 2016 - arxiv.org
We introduce a method to stabilize Generative Adversarial Networks (GANs) by defining the
generator objective with respect to an unrolled optimization of the discriminator. This allows …

Acceleration methods

A d'Aspremont, D Scieur, A Taylor - Foundations and Trends® …, 2021 - nowpublishers.com
This monograph covers some recent advances in a range of acceleration techniques
frequently used in convex optimization. We first use quadratic optimization problems to …

Convex optimization: Algorithms and complexity

S Bubeck - Foundations and Trends® in Machine Learning, 2015 - nowpublishers.com
This monograph presents the main complexity theorems in convex optimization and their
corresponding algorithms. Starting from the fundamental theory of black-box optimization …

Stochastic model-based minimization of weakly convex functions

D Davis, D Drusvyatskiy - SIAM Journal on Optimization, 2019 - SIAM
We consider a family of algorithms that successively sample and minimize simple stochastic
models of the objective function. We show that under reasonable conditions on …

Efficient algorithms for smooth minimax optimization

KK Thekumparampil, P Jain… - Advances in Neural …, 2019 - proceedings.neurips.cc
This paper studies first order methods for solving smooth minimax optimization problems
$\min_x\max_y g (x, y) $ where $ g (\cdot,\cdot) $ is smooth and $ g (x,\cdot) $ is concave for …

A universal catalyst for first-order optimization

H Lin, J Mairal, Z Harchaoui - Advances in neural …, 2015 - proceedings.neurips.cc
We introduce a generic scheme for accelerating first-order optimization methods in the
sense of Nesterov, which builds upon a new analysis of the accelerated proximal point …

Adaptive trust region policy optimization: Global convergence and faster rates for regularized mdps

L Shani, Y Efroni, S Mannor - Proceedings of the AAAI Conference on …, 2020 - ojs.aaai.org
Trust region policy optimization (TRPO) is a popular and empirically successful policy
search algorithm in Reinforcement Learning (RL) in which a surrogate problem, that restricts …

Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

S Ghadimi, G Lan, H Zhang - Mathematical Programming, 2016 - Springer
This paper considers a class of constrained stochastic composite optimization problems
whose objective function is given by the summation of a differentiable (possibly nonconvex) …

Stochastic optimization with heavy-tailed noise via accelerated gradient clipping

E Gorbunov, M Danilova… - Advances in Neural …, 2020 - proceedings.neurips.cc
In this paper, we propose a new accelerated stochastic first-order method called clipped-
SSTM for smooth convex stochastic optimization with heavy-tailed distributed noise in …