ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.09704
  4. Cited By
Fair Sparse Regression with Clustering: An Invex Relaxation for a
  Combinatorial Problem
v1v2 (latest)

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem

19 February 2021
Adarsh Barik
Jean Honorio
    FaML
ArXiv (abs)PDFHTML

Papers citing "Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem"

2 / 2 papers shown
Title
Deep Learning Evidence for Global Optimality of Gerver's Sofa
Deep Learning Evidence for Global Optimality of Gerver's Sofa
Kuangdai Leng
Jia Bi
Jaehoon Cha
Samuel Pinilla
Jeyan Thiyagalingam
42
0
0
15 Jul 2024
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable
  Problem with Invex Relaxation
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation
Adarsh Barik
Jean Honorio
41
6
0
02 Jun 2022
1