Cover Image

optimizn: a Python Library for Developing Customized Optimization Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sathiya, Akshay, Pandey, Rohit
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
by: Tang, Wei-Ting, et al.
Published: (2026)

A Precise Characterization of SGD Stability Using Loss Surface Geometry
by: Dexter, Gregory, et al.
Published: (2024)

NeST-BO: Fast Local Bayesian Optimization via Newton-Step Targeting of Gradient and Hessian Information
by: Tang, Wei-Ting, et al.
Published: (2025)

From Learning to Optimize to Learning Optimization Algorithms
by: Castera, Camille, et al.
Published: (2024)

Towards Understanding Gradient Flow Dynamics of Homogeneous Neural Networks Beyond the Origin
by: Kumar, Akshay, et al.
Published: (2025)

Learning Neural Networks by Neuron Pursuit
by: Kumar, Akshay, et al.
Published: (2025)

Directional Convergence Near Small Initializations and Saddles in Two-Homogeneous Neural Networks
by: Kumar, Akshay, et al.
Published: (2024)

Early Directional Convergence in Deep Homogeneous Neural Networks for Small Initializations
by: Kumar, Akshay, et al.
Published: (2024)

Data-driven Multistage Distributionally Robust Linear Optimization with Nested Distance
by: Gao, Rui, et al.
Published: (2024)

tvopt: A Python Framework for Time-Varying Optimization
by: Bastianello, Nicola
Published: (2020)

Shuffling Momentum Gradient Algorithm for Convex Optimization
by: Tran, Trang H., et al.
Published: (2024)

BONSAI: Structure-exploiting robust Bayesian optimization for networked black-box systems under uncertainty
by: Kudva, Akshay, et al.
Published: (2025)

humancompatible.train: Implementing Optimization Algorithms for Stochastically-Constrained Stochastic Optimization Problems
by: Kliachkin, Andrii, et al.
Published: (2025)

Online Resource Allocation with Non-Stationary Customers
by: Zhang, Xiaoyue, et al.
Published: (2024)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
by: Mehmood, Sheheryar, et al.
Published: (2024)

Fully First-Order Algorithms for Online Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Learning Algorithm Hyperparameters for Fast Parametric Convex Optimization
by: Sambharya, Rajiv, et al.
Published: (2024)

Absolute Ranking: An Essential Normalization for Benchmarking Optimization Algorithms
by: Jinng, Yunpeng, et al.
Published: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Comparison of High-Dimensional Bayesian Optimization Algorithms on BBOB
by: Santoni, Maria Laura, et al.
Published: (2023)

Mitigating Covariate Shift in Misspecified Regression with Applications to Reinforcement Learning
by: Amortila, Philip, et al.
Published: (2024)

Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization
by: Gong, Xiaochuan, et al.
Published: (2025)

Scalable DC Optimization via Adaptive Frank-Wolfe Algorithms
by: Pokutta, Sebastian
Published: (2025)

A Trust-Region Algorithm for Noisy Equality Constrained Optimization
by: Sun, Shigeng, et al.
Published: (2024)

A Tight Theory of Error Feedback Algorithms in Distributed Optimization
by: Thomsen, Daniel Berg, et al.
Published: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
by: Soma, Tasuku, et al.
Published: (2022)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
by: Chen, Lesi, et al.
Published: (2023)

An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2024)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
by: Wu, Yuman, et al.
Published: (2026)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
by: Wang, Yi-Han, et al.
Published: (2025)

Towards Guided Descent: Optimization Algorithms for Training Neural Networks At Scale
by: Nagwekar, Ansh
Published: (2025)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
by: Wang, Lei, et al.
Published: (2025)

On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2025)

An Efficient Global Optimization Algorithm with Adaptive Estimates of the Local Lipschitz Constants
by: D'Agostino, Danny
Published: (2022)

Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling
by: Li, Junyi, et al.
Published: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
by: Chen, Lesi, et al.
Published: (2023)