3 papers
cs.LG2025
Understanding the Implicit Regularization of Gradient Descent in Over-parameterized Models
Jianhao Ma, Geyu Liang, Salar Fattahi
Implicit regularization refers to the tendency of local search algorithms to converge to low-dimensional solutions, even when such structures are not explicitly enforced. Despite i…
cs.LG2025
Enhancing Performance of Explainable AI Models with Constrained Concept Refinement
Geyu Liang, Senne Michielssen, Salar Fattahi
The trade-off between accuracy and interpretability has long been a challenge in machine learning (ML). This tension is particularly significant for emerging interpretable-by-desig…
cs.LG2025
Simple Alternating Minimization Provably Solves Complete Dictionary Learning
Geyu Liang, Gavin Zhang, Salar Fattahi +1
This paper focuses on the noiseless complete dictionary learning problem, where the goal is to represent a set of given signals as linear combinations of a small number of atoms fr…