Cover Image

Augmenting Subspace Optimization Methods with Linear Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Menickelly, Matt
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Importance Sampling in Expensive Finite-Sum Optimization via Contextual Bandit Methods
by: Menickelly, Matt
Published: (2026)

Estimating Computational Noise on Parametric Curves
by: Menickelly, Matt
Published: (2024)

Stochastic Average Model Methods
by: Menickelly, Matt, et al.
Published: (2022)

A Noise-Aware Scalable Subspace Classical Optimizer for the Quantum Approximate Optimization Algorithm
by: Dzahini, Kwassi Joseph, et al.
Published: (2025)

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms
by: Larson, Jeffrey, et al.
Published: (2024)

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms
by: Ha, Yunsoo, et al.
Published: (2024)

Modeling and solving cascading failures across interdependent infrastructure systems
by: Li, Yijiang, et al.
Published: (2024)

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
by: Kuruzov, Ilya, et al.
Published: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

Birkhoff interpolation models for optimization with some available derivatives
by: Larson, Jeffrey, et al.
Published: (2026)

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Subspace Newton's Method for $\ell_0$-Regularized Optimization Problems with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

Subspace Quasi-Newton Method with Gradient Approximation
by: Miyaishi, Taisei, et al.
Published: (2024)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)

Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
by: Liao, Feng-Yi, et al.
Published: (2024)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
by: Shi, Qiankun, et al.
Published: (2025)

Min-Max Grassmannian Optimization for Online Subspace Tracking
by: Bharadwaj, Shreyas, et al.
Published: (2026)

Proximal Projection Method for Stable Linearly Constrained Optimization
by: Heaton, Howard
Published: (2024)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
by: Zhan, Jingxin, et al.
Published: (2025)

Parameter-Efficient Subspace Optimization for LLM Fine-Tuning
by: Lou, Yuchen, et al.
Published: (2025)

Masked Subspace Clustering Methods
by: Song, Jiebo, et al.
Published: (2025)

The Safety-Privacy Tradeoff in Linear Bandits
by: Zibaie, Arghavan, et al.
Published: (2025)

Decomposition-Coordination Method for Finite Horizon Bandit Problems
by: de Lara, Michel, et al.
Published: (2021)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

Challenges with Differentiable Quantum Dynamics
by: Narayanan, Sri Hari Krishna, et al.
Published: (2024)

An Enhanced ADMM-based Interior Point Method for Linear and Conic Optimization
by: Deng, Qi, et al.
Published: (2022)

On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
by: Liang, Liyuan, et al.
Published: (2025)

Scalable Derivative-Free Optimization Algorithms with Low-Dimensional Subspace Techniques
by: Zhang, Zaikun
Published: (2025)

Random-Subspace Sequential Quadratic Programming for Constrained Zeroth-Order Optimization
by: Zhang, Runyu, et al.
Published: (2026)

Full-Low Evaluation Methods For Bound and Linearly Constrained Derivative-Free Optimization
by: Royer, Clément W., et al.
Published: (2023)

Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
by: Li, Mingze, et al.
Published: (2025)

Randomized Subspace Derivative-Free Optimization with Quadratic Models and Second-Order Convergence
by: Cartis, Coralia, et al.
Published: (2024)

Ranking In Generalized Linear Bandits
by: Shidani, Amitis, et al.
Published: (2022)

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints
by: Zhang, Kunpeng, et al.
Published: (2024)

An Augmented Lagrangian Value Function Method for Lower-level Constrained Stochastic Bilevel Optimization
by: Nie, Hantao, et al.
Published: (2025)

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization
by: Deng, Zhanwang, et al.
Published: (2023)

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?
by: Gao, Wenzhi, et al.
Published: (2024)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)