Coordinate Descent Methods Beyond Separability and Smoothness
Explore advanced coordinate descent methods for complex optimization problems, covering nonseparable and nonsmooth functions, random proximal gradients, and smooth approximations.
New Perspectives for Higher-order Methods in Convex Optimization
Explore advanced techniques in convex optimization, focusing on higher-order methods and their applications in mathematical problem-solving and algorithm development.
Optimization in Theory and Practice
Explore optimization techniques and their real-world applications with insights from Stephen Wright of University of Wisconsin-Madison, blending theoretical foundations and practical implementations.
Exploiting Sparsity in Polynomial Optimization - Lecture 1
Explore sparsity exploitation techniques in polynomial optimization, focusing on advanced mathematical concepts and practical applications.
Convex Network Flows - Optimization Framework and Applications
Introducing a general framework for modeling flow problems over hyper graphs, with applications in network optimization, power flow, and wireless networks. Includes fast, parallelizable algorithm implementation in Julia.
Quantum Impurity and Quantum Embedding Theory - IPAM at UCLA
Explore quantum impurity and embedding theories, from non-interacting systems to advanced concepts like DMET and DMFT, enhancing understanding of quantum many-body problems.
A Mathematical Introduction to Quantum Embedding Theory - IPAM at UCLA
Explore quantum embedding methods for strongly-correlated materials, focusing on computational challenges at the single-particle level and recent optimization approaches.
Generalized Rényi Entropy Accumulation Theorem and Quantum Probability Estimation
Delve into advanced quantum cryptography through an exploration of the generalized Rényi entropy accumulation theorem, focusing on improved finite-size bounds and convex optimization techniques.
Optimization: Interior Point Methods - Part 2
Explore advanced interior point methods for optimization, focusing on data structures and algorithms to enhance computational efficiency in solving complex problems.
Optimization: Interior Point Methods - Part 1
Explore interior point methods for optimization with Stanford's Yinyu Ye, covering fundamental concepts and applications in data structures and fast algorithms.
Large Scale Machine Learning and Convex Optimization - Lecture 3
Explore advanced stochastic optimization techniques for large-scale machine learning, including novel Newton-based methods and combinations of batch and online algorithms for improved convergence rates.
Stochastic Gradient Descent and Machine Learning - Lecture 1
Explore optimization methods, gradient descent, Newton's method, and convexity in machine learning. Gain insights into iterative algorithms and their applications in statistical physics and data analysis.
Robust Regression by Purushottam Kar
Explore robust regression techniques for learning and estimation in algorithms and optimization, focusing on practical applications and theoretical foundations.
How to Escape Saddle Points Efficiently? by Praneeth Netrapalli
Explore efficient methods for escaping saddle points in non-convex optimization, focusing on perturbed gradient descent and its applications in various algorithmic settings.
Gradient Descent and Stochastic Gradient Descent
Explore gradient descent and stochastic gradient descent in deep neural networks, covering convergence rates, learning rate effects, and challenges in optimization algorithms.
The Ellipsoid Algorithm - Lecture 19a of CS Theory Toolkit
Explore the Ellipsoid Algorithm for solving Linear Programming and convex optimization, focusing on its polynomial-time efficiency and use of separation oracles in theoretical computer science.
Quantum Speedups of Continuous Sampling and Optimization Problems - IPAM at UCLA
Explore quantum algorithms for high-dimensional sampling and optimization, including log-concave distributions and approximately convex problems, with applications in statistics, machine learning, and physics.
Stochastic Primal Dual Splitting Algorithms for Convex and Nonconvex Composite Optimization in Imaging
Explore stochastic primal dual splitting algorithms for convex and nonconvex composite optimization in imaging, focusing on SPDFP and SVRG-PDFP methods and their applications.
On the Variance and Admissibility of Empirical Risk Minimization on Convex Classes
Explores empirical risk minimization's variance and admissibility in function estimation, proving its minimax optimal variance and admissibility using concentration of measure techniques in convex geometry.
Provably Learning a Multi-Head Attention Layer
Explore algorithmic approaches and computational challenges in learning multi-head attention layers, with insights on provable algorithms and lower bounds for transformer model learnability.
Masterclass for Optimisation - Professor Coralia Cartis, University of Oxford
Explore advanced optimization techniques for large-scale problems with Professor Coralia Cartis. Learn about algorithm development, analysis, and implementation for various problem classes in numerical optimization.