Skip to content
conftrace_

block coordinate descent

85 papers

BCD

Papers

Score-Based Model for Low-Rank Tensor Recovery AAAI 2026 Inverse Optimization via Learning Feasible Regions ICML 2025 Joint Metric Space Embedding by Unbalanced Optimal Transport with Gromov–Wasserstein Marginal Penalization ICML 2025 Joker: Joint Optimization Framework for Lightweight Kernel Machines ICML 2025 BAdam: A Memory Efficient Full Parameter Optimization Method for Large Language Models NeurIPS 2024 Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares ICML 2024 Convex and Bilevel Optimization for Neural-Symbolic Inference and Learning ICML 2024 Distributed Kernel-Driven Data Clustering JMLR 2024 Fitting ARMA Time Series Models without Identification: A Proximal Approach AISTATS 2024 On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport JMLR 2024 Scalable Distance-based Multi-Agent Relative State Estimation via Block Multiconvex Optimization RSS 2024 Supervised Matrix Factorization: Local Landscape Analysis and Applications ICML 2024 An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization JMLR 2023 Clustering High-dimensional Data with Ordered Weighted ℓ_1 Regularization AISTATS 2023 Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning ICML 2023 Cyclic Block Coordinate Descent With Variance Reduction for Composite Nonconvex Optimization ICML 2023 Delay-agnostic Asynchronous Coordinate Update Algorithm ICML 2023 Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates AAAI 2023 Fast Block Coordinate Descent for Non-Convex Group Regularizations AISTATS 2023 Sensitivity-Free Gradient Descent Algorithms JMLR 2023 Tensor-based Kernel Machines with Structured Inducing Points for Large and High-Dimensional Data AISTATS 2023 Balanced Self-Paced Learning for AUC Maximization AAAI 2022 Delay-Adaptive Step-sizes for Asynchronous Learning ICML 2022 Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models ICML 2022 Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence JMLR 2022