Alternatives and similar repositories for Coordinate-descent-algorithm-LASSO:

Users that are interested in Coordinate-descent-algorithm-LASSO are comparing it to the libraries listed below

• TheoGuyard / El0ps
  El0ps: An Exact L0-Problem Solver
  ☆9Updated last month
• minatosato / Lasso
  This is implementation Lasso with Coordinate Descent and LARS (Least Angle Regression).
  ☆69Updated last month
• hoonose / sever
  [ICML 2019] A Robust Meta-Algorithm for Stochastic Optimization
  ☆30Updated 4 years ago
• BigBayes / SMS
  Sampling via Moment Sharing
  ☆11Updated 9 years ago
• BaoWangMath / LaplacianSmoothing-GradientDescent
  The code for the paper: https://arxiv.org/abs/1806.06317
  ☆24Updated 5 years ago
• cciliber / matMTL
  Multi Task Learning Package for Matlab
  ☆21Updated 5 years ago
• rubinxin / FITBO
  Code for Fast Information-theoretic Bayesian Optimisation
  ☆16Updated 6 years ago
• timlautk / BCD-for-DNNs-PyTorch
  Code for Global Convergence of Block Coordinate Descent in Deep Learning (ICML 2019)
  ☆35Updated 5 years ago
• gerrili1996 / DRLR_NIPS2019_exp
  The MATLAB source code
  ☆16Updated 5 years ago
• gwgundersen / random-fourier-features
  Code for random Fourier features based on Rahimi and Recht's 2007 paper.
  ☆52Updated 4 years ago
• nicola-bastianello / tvopt
  tvopt is a prototyping and benchmarking Python framework for time-varying (or online) optimization.
  ☆13Updated last year
• karlnapf / ds3_kernel_testing
  Material for the practical of the DS3 course on "Representing and comparing probabilities with kernels"
  ☆26Updated 6 years ago
• superyyzg / fast_proximal_gradient_descent_l0_regularization
  Code for the paper "Fast Proximal Gradient Descent for A Class of Non-convex and Non-smooth Sparse Learning Problems"
  ☆10Updated 5 years ago
• git-xp / Non-Convex-Newton
  ☆14Updated 7 years ago
• JasonAltschuler / OptimalTransportNIPS17
  Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…
  ☆31Updated 7 years ago
• daniellevy / fast-dro
  PyTorch implementation of efficient algorithms for DRO with CVaR and Chi-Square uncertainty sets
  ☆58Updated 2 years ago
• IssamLaradji / BlockCoordinateDescent
  Code for the paper "Let’s Make Block Coordinate Descent Go Fast"
  ☆46Updated last year
• chenhongge / RobustTrees
  [ICML 2019, 20 min long talk] Robust Decision Trees Against Adversarial Examples
  ☆67Updated 2 years ago
• jshe / wasserstein-2
  ☆13Updated 5 years ago
• JoonyoungYi / MCAM-numpy
  Low-rank Matrix Completion using Alternating Minimization
  ☆23Updated 6 years ago
• Simon-Lacoste-Julien / linearFW
  Frank-Wolfe optimization variants with a linear convergence rate
  ☆20Updated 8 years ago
• XiaoouPan / adaHuber
  Tuning-Free Huber Regression
  ☆14Updated 2 years ago
• gnobitab / CertifiedMonotonicNetwork
  ☆26Updated 2 years ago
• gpeyre / 2021-NonCvxPro
  ☆11Updated 3 years ago
• HarlinLee / nonconvex-GTF-public
  Code for nonconvex graph trend filtering
  ☆10Updated 2 years ago
• hcherkaoui / carpet
  Carpet: Neural Net based solver for the 1d-TV problem
  ☆12Updated 4 years ago
• aangelopoulos / private_prediction_sets
  Wrap around any model to output differentially private prediction sets with finite sample validity on any dataset.
  ☆17Updated 11 months ago
• Chunpai / LASSO
  solve LASSO formulation with Proximal Gradient Descent, Accelerated Gradient Descent, and Coordinate Gradient Descent
  ☆21Updated 10 years ago
• ykwon0407 / wdro_local_perturbation
  Principled learning method for Wasserstein distributionally robust optimization with local perturbations (ICML 2020)
  ☆21Updated last year
• hoonose / robust-filter
  [ICML 2017] Robust estimation of mean and covariance in high dimensions
  ☆34Updated 4 years ago