activity
20242026
most citedImplicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems

1 citations · 1 across the 14 of their papers we have counts for

collaborators

16 papers

math.OC2026

Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics

Yudong Wei, Liang Zhang, Bingcong Li +1

Low-rank matrix optimization is often carried out via the Burer-Monteiro (BM) formulation, but choosing the factorization rank is delicate and can substantially slow optimizati…

eess.SP2026

Explainable AI for Next-Generation Wireless Physical Layer: Basics, State-of-the-Art, and Open Challenges

Bingnan Xiao, Shuyan Hu, Xiaojing Chen +5

Next-generation wireless systems are expected to be ``AI-native," with neural networks (NNs) embedded throughout the physical (PHY) layer protocol stack to improve spectral efficie…

cs.LG2026

Muown: Row-Norm Control for Muon Optimization

Kai Lion, Florian Hübler, Bingcong Li +2

Muon has emerged as a strong competitor to AdamW for language model pre-training, yet its behavior at scale is sensitive to weight decay. Recent work has observed that, for Muon wi…

cs.LG2026

FedVSSAM: Mitigating Flatness Incompatibility in Sharpness-Aware Federated Learning

Bingnan Xiao, Yuan Gao, Bingcong Li +3

Sharpness-aware minimization (SAM) is an effective method for improving the generalization of federated learning (FL) by steering local training toward flat minima. Under data hete…

cs.LG2026

Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization

Zhiyuan Zhai, Bingcong Li, Bingnan Xiao +2

Test-time compute scaling, the practice of spending extra computation during inference via repeated sampling, search, or extended reasoning, has become a powerful lever for improvi…

cs.LG2026

Binomial Gradient-Based Meta-Learning for Enhanced Meta-Gradient Estimation

Yilang Zhang, Abraham Jaeger Mountain, Bingcong Li +1

Meta-learning offers a principled framework leveraging \emph{task-invariant} priors from related tasks, with which \emph{task-specific} models can be fine-tuned on downstream tasks…

cs.LG2026

Scalable Variational Bayesian Fine-Tuning of LLMs via Orthogonalized Low-Rank Adapters

Haotian Xiang, Bingcong Li, Qin Lu

When deploying large language models (LLMs) to safety-critical applications, uncertainty quantification (UQ) is of utmost importance to self-assess the reliability of the LLM-based…

cs.LG2026

Zeroth-Order Optimization at the Edge of Stability

Minhak Song, Liang Zhang, Bingcong Li +3

Zeroth-order (ZO) methods are widely used when gradients are unavailable or prohibitively expensive, including black-box learning and memory-efficient fine-tuning of large models,…

cs.LG2026

SALAAD: Sparse And Low-Rank Adaptation via ADMM for Large Language Model Inference

Hao Ma, Melis Ilayda Bal, Liang Zhang +4

Modern large language models are increasingly deployed under compute and memory constraints, making flexible control of model capacity a central challenge. While sparse and low-ran…

cs.LG2025

ConMeZO: Adaptive Descent-Direction Sampling for Gradient-Free Finetuning of Large Language Models

Lejs Deen Behric, Liang Zhang, Bingcong Li +1

Zeroth-order or derivative-free optimization (MeZO) is an attractive strategy for finetuning large language models (LLMs) because it eliminates the memory overhead of backpropagati…

cs.LG2025

On the Benefits of Weight Normalization for Overparameterized Matrix Sensing

Yudong Wei, Liang Zhang, Bingcong Li +1

While normalization techniques are widely used in deep learning, their theoretical understanding remains relatively limited. In this work, we establish the benefits of (generalized…

cs.LG2025

Zeroth-Order Optimization Finds Flat Minima

Liang Zhang, Bingcong Li, Kiran Koshy Thekumparampil +3

Zeroth-order methods are extensively used in machine learning applications where gradients are infeasible or expensive to compute, such as black-box attacks, reinforcement learning…

cs.LG2025

PoLAR: Polar-Decomposed Low-Rank Adapter Representation

Kai Lion, Liang Zhang, Bingcong Li +1

We show that low-rank adaptation of large-scale models suffers from a low stable rank that is well below the linear algebraic rank of the subspace, degrading fine-tuning performanc…

cs.LG2025

Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective

Jiawei Huang, Bingcong Li, Christoph Dann +1

Sample efficiency is critical for online Reinforcement Learning from Human Feedback (RLHF). While existing works investigate sample-efficient online exploration strategies, the pot…

cs.LG2024★ 1 cited

Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems

Bingcong Li, Liang Zhang, Niao He

Sharpness-aware minimization (SAM) improves generalization of various deep learning tasks. Motivated by popular architectures such as LoRA, we explore the implicit regularization o…

cs.LG2024

On the Crucial Role of Initialization for Matrix Factorization

Bingcong Li, Liang Zhang, Aryan Mokhtari +1

This work revisits the classical low-rank matrix factorization problem and unveils the critical role of initialization in shaping convergence rates for such nonconvex and nonsmooth…