Cover Image

Scalable iterative pruning of large language and vision models using block coordinate descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rosenberg, Gili, Brubaker, J. Kyle, Schuetz, Martin J. A., Zhu, Elton Yechao, Kadıoğlu, Serdar, Borujeni, Sima E., Katzgraber, Helmut G.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving QUBOs with a quantum-amenable branch and bound method
by: Häner, Thomas, et al.
Published: (2024)

A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
by: Rosenberg, Gili, et al.
Published: (2026)

Applying a Random-Key Optimizer on Mixed Integer Programs
by: Chaves, Antonio A., et al.
Published: (2026)

Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking
by: Brubaker, J. Kyle, et al.
Published: (2024)

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms
by: Simon, Emile, et al.
Published: (2011)

Quantum-Informed Recursive Optimization Algorithms
by: Finžgar, Jernej Rudi, et al.
Published: (2023)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
by: Nabou, Yassine, et al.
Published: (2025)

A monotone block coordinate descent method for solving absolute value equations
by: Luo, Tingting, et al.
Published: (2024)

Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem
by: Cai, Junyang, et al.
Published: (2024)

Parallel block coordinate descent methods with identification strategies
by: Lopes, Ronaldo, et al.
Published: (2025)

Iteration Complexity of Variational Quantum Algorithms
by: Kungurtsev, Vyacheslav, et al.
Published: (2022)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
by: Brubaker, Kyle, et al.
Published: (2025)

Modern Computational Methods in Reinsurance Optimization: From Simulated Annealing to Quantum Branch & Bound
by: Woodman, George, et al.
Published: (2025)

Designing Quantum Annealing Schedules using Bayesian Optimization
by: Finžgar, Jernej Rudi, et al.
Published: (2023)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
by: Lauga, Guillaume
Published: (2026)

Random coordinate descent methods for nonseparable composite optimization
by: Chorobura, Flavia, et al.
Published: (2022)

A Random-Key Optimizer for Combinatorial Optimization
by: Chaves, Antonio A., et al.
Published: (2024)

Riemannian coordinate descent algorithms on matrix manifolds
by: Han, Andi, et al.
Published: (2024)

Randomized block coordinate descent method for linear ill-posed problems
by: Jin, Qinian, et al.
Published: (2024)

Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization
by: Hou, Junpeng, et al.
Published: (2025)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
by: Wang, Po-Wei, et al.
Published: (2017)

Lagrangian Duality in Quantum Optimization: Overcoming QUBO Limitations for Constrained Problems
by: Gabbassov, Einar, et al.
Published: (2023)

Interpolation-based coordinate descent method for parameterized quantum circuits
by: Lai, Zhijian, et al.
Published: (2025)

Directional descent
by: Young, Andrew J.
Published: (2024)

Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
by: Ding, Zhiyan, et al.
Published: (2023)

Gradient descent in matrix factorization: Understanding large initialization
by: Chen, Hengchao, et al.
Published: (2023)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
by: Zeng, Yun, et al.
Published: (2023)

qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
by: Schuetz, Martin J. A., et al.
Published: (2025)

A parallel branch-and-bound-and-prune algorithm for irregular strip packing with discrete rotations
by: Lastra-Díaz, Juan J., et al.
Published: (2025)

Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
by: Andrist, Ruben S., et al.
Published: (2023)

Randomized coordinate gradient descent almost surely escapes strict saddle points
by: Chen, Ziang, et al.
Published: (2025)

A flexible block-coordinate forward-backward algorithm for non-smooth and non-convex optimization
by: Briceño-Arias, Luis, et al.
Published: (2025)

Open‐source AI at scale: Establishing an enterprise AI strategy through modular frameworks
by: Serdar Kadıoğlu
Published: (2025)

Scalable iterative Gramian synthesis for control-affine systems
by: Yu, Zongxi, et al.
Published: (2026)

Riemannian preconditioned coordinate descent for low multi-linear rank approximation
by: Hamed, Mohammad, et al.
Published: (2021)

Another Look at Partially Observed Optimal Stochastic Control: Existence, Ergodicity, and Approximations without Belief-Reduction
by: Yüksel, Serdar
Published: (2023)

On Borkar and Young Relaxed Control Topologies and Continuous Dependence of Invariant Measures on Control Policy
by: Yüksel, Serdar
Published: (2023)

Implicit regularization of normalized gradient descent
by: Josz, Cédric
Published: (2026)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
by: Fotedar, Sunney, et al.
Published: (2025)

Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
by: Acharya, Atithi, et al.
Published: (2024)