Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk
Explore advanced algorithms for efficient polytope analysis, including rounding, sampling, and volume computation using innovative Markov chain techniques.
Breaking of 1RSB in Random MAX-NAE-SAT
Explore the intricacies of random MAX-NAE-SAT, focusing on 1RSB breaking, solution spaces, and key concepts like garnet transition and moment bounds.
Optimization of the Sherrington-Kirkpatrick Hamiltonian
Explore the optimization of the Sherrington-Kirkpatrick Hamiltonian, covering stochastic block models, random graphs, and algorithmic insights for solving complex optimization problems.
Revisiting Tardos’s Framework for Linear Programming - Faster Exact Solutions using Approximate Solvers
Explore advanced linear programming techniques, focusing on Tardos's framework and innovative approaches for faster exact solutions using approximate solvers.
Collie - Finding Performance Anomalies in RDMA Subsystems
Discover a tool for uncovering performance anomalies in RDMA subsystems, exploring its design, implementation, and effectiveness in finding and addressing hardware-related issues.
Turtles! Hill Climbing! Hammers! Paper Bags!
Explore optimization techniques through turtle graphics, from hill climbing to simulated annealing, laying the groundwork for understanding neural networks and machine learning concepts.
Distributed Parametric Optimization with the Geneva Library
Explore Geneva, an open-source library for distributed optimization algorithms, leveraging Boost libraries to solve large-scale parametric problems on multi-core systems, clusters, and cloud environments.
From Algorithms to Agendas - A Beginner's Guide to Integer Programming
Discover how Integer Programming optimizes conference scheduling, maximizing attendee satisfaction through efficient talk allocation to time slots and rooms.
Simulated Annealing - The Most Metal Algorithm Ever
Explore simulated annealing, a metallurgy-inspired algorithm for near-optimal solutions in constrained optimization problems, and learn to implement it using the Annealing gem in Ruby.
DL4TO: A Deep Learning Library for Sample Efficient Topology Optimization
Explore deep learning techniques for efficient topology optimization using the DL4TO library, enhancing structural design processes.
Simulated Annealing: The Most Metal Algorithm Ever - Lecture
Explore simulated annealing algorithm for near-optimal solutions in constrained optimization problems, inspired by metallurgy and applicable to Ruby apps.
A New Derivative-Free Method Using an Improved Under-Determined Quadratic Interpolation Model
Explore a novel derivative-free optimization method using improved under-determined quadratic interpolation, considering trust-region iteration properties and model optimality.
Stochastic Algorithms for Constrained Continuous Optimization
Explore stochastic-gradient-based algorithms for constrained continuous optimization, focusing on interior-point and sequential-quadratic-programming methods with convergence guarantees and practical applications.
Bilevel Optimization Problems: Algorithms and Theory
Explore recent developments in bilevel optimization algorithms, their theoretical analysis, and challenges in machine learning and data science applications.
Strong Convergence of Inertial Algorithms via Tikhonov Regularization
Explore inertial algorithms with Tikhonov regularization for optimization problems, examining strong convergence to minimum norm solutions and fast convergence rates for objective function values.
Set-limited Functions and Polynomial-time Interior-point Methods
Explore polynomial-time interior-point methods and set-limited functions with Yurri Nesterov, delving into advanced optimization techniques and mathematical theory.
Multi-Precision Optimization Algorithm: Decreasing Computational Cost and Controlling Computational Error
Explore multi-precision optimization algorithms to reduce computational costs and control errors in smooth, non-convex function minimization, with applications in deep neural network training.
Global Convergence and Asymptotic Optimality of the Heavy Ball Method
Explore global convergence and asymptotic optimality of the heavy ball method, challenging complexity lower bounds for strongly convex functions with Lipschitz gradients.
EfficientML.ai - Basics of Neural Networks - Lecture 2
Explore neural network fundamentals, including architecture, training, and optimization techniques. Gain insights into efficient machine learning concepts and applications.
Basics of Neural Networks - EfficientML.ai Lecture 2
Explore neural network fundamentals, including architecture, training, and optimization techniques, in this comprehensive MIT lecture on efficient machine learning.
Surrogate Hessian Method for Geometry Optimization - QMCPACK Workshop 2023
Explore the surrogate Hessian method for efficient geometry optimization in quantum systems, presented by Jaron Krogel at the QMCPACK Workshop 2023.