Picture for Defeng Sun

Defeng Sun

LAMBDA: A Large Model Based Data Agent

Add code
Jul 24, 2024
Viaarxiv icon

Machine Learning Insides OptVerse AI Solver: Design Principles and Applications

Add code
Jan 17, 2024
Viaarxiv icon

Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees

Add code
Mar 29, 2023
Figure 1 for Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees
Figure 2 for Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees
Figure 3 for Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees
Figure 4 for Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees
Viaarxiv icon

Beyond ADMM: A Unified Client-variance-reduced Adaptive Federated Learning Framework

Add code
Dec 03, 2022
Viaarxiv icon

Learning Graph Laplacian with MCP

Add code
Oct 22, 2020
Figure 1 for Learning Graph Laplacian with MCP
Figure 2 for Learning Graph Laplacian with MCP
Figure 3 for Learning Graph Laplacian with MCP
Figure 4 for Learning Graph Laplacian with MCP
Viaarxiv icon

Estimation of sparse Gaussian graphical models with hidden clustering structure

Add code
Apr 17, 2020
Figure 1 for Estimation of sparse Gaussian graphical models with hidden clustering structure
Figure 2 for Estimation of sparse Gaussian graphical models with hidden clustering structure
Figure 3 for Estimation of sparse Gaussian graphical models with hidden clustering structure
Figure 4 for Estimation of sparse Gaussian graphical models with hidden clustering structure
Viaarxiv icon

Efficient algorithms for multivariate shape-constrained convex regression problems

Add code
Feb 26, 2020
Figure 1 for Efficient algorithms for multivariate shape-constrained convex regression problems
Figure 2 for Efficient algorithms for multivariate shape-constrained convex regression problems
Figure 3 for Efficient algorithms for multivariate shape-constrained convex regression problems
Figure 4 for Efficient algorithms for multivariate shape-constrained convex regression problems
Viaarxiv icon

A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems

Add code
Apr 02, 2019
Figure 1 for A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems
Figure 2 for A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems
Figure 3 for A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems
Figure 4 for A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems
Viaarxiv icon

On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models

Add code
Feb 01, 2019
Figure 1 for On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models
Figure 2 for On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models
Figure 3 for On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models
Figure 4 for On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models
Viaarxiv icon

A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters

Add code
Sep 12, 2018
Figure 1 for A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
Figure 2 for A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
Figure 3 for A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
Figure 4 for A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters
Viaarxiv icon